Process algebra
From ATP to timed graphs and hybrid systems
Acta Informatica
Programming Techniques: Regular expression search algorithm
Communications of the ACM
The ASF+SDF Meta-environment: A Component-Based Language Development Environment
CC '01 Proceedings of the 10th International Conference on Compiler Construction
From process algebra to visual language
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
Automatic Translation of a Timed Process Algebra into Dynamic State Graphs
APSEC '01 Proceedings of the Eighth Asia-Pacific on Software Engineering Conference
A brief history of process algebra
Theoretical Computer Science - Process algebra
UML vs. classical vs. rhapsody statecharts: not all models are created equal
MoDELS'05 Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems
Model-Driven Engineering Meets Generic Language Technology
Software Language Engineering
Using Metrics for Assessing the Quality of ASF+SDF Model Transformations
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
An exercise in iterative domain-specific language design
Proceedings of the Joint ERCIM Workshop on Software Evolution (EVOL) and International Workshop on Principles of Software Evolution (IWPSE)
Reusable and correct endogenous model transformations
ICMT'12 Proceedings of the 5th international conference on Theory and Practice of Model Transformations
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
| Hi-index | 0.00 |
There exist many formalisms for modeling the behavior of (software) systems. These formalisms serve different purposes. Process algebras are used for algebraic and axiomatic reasoning about the behavior of distributed systems. UML state machines are suitable for automatic software generation. We have developed a transformation from the process algebra ACP into UML state machines to enable automatic software generation from process algebra models. This transformation needs to preserve both behavioral and structural properties. The combination of these preservation requirements gives rise to a semantic gap. It implies that we cannot transform ACP models into UML state machines on a syntactic level only.We address this semantic gap and propose a way of bridging it. To validate our proposal, we have implemented a tool for automatic transformation of ACP process algebra models into UML state machines.