Statecharts: A visual formalism for complex systems
Science of Computer Programming
On statecharts with overlapping
ACM Transactions on Software Engineering and Methodology (TOSEM)
The STATEMATE semantics of statecharts
ACM Transactions on Software Engineering and Methodology (TOSEM)
Coupling Asynchrony and Interrupts: Place Chart Nets
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Unifying Petri Nets, Advances in Petri Nets
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
VeriTech: a framework for translating among model description notations
International Journal on Software Tools for Technology Transfer (STTT) - Special Section on Fundamental Approaches to Software Engineering
Making Petri Nets Safe and Free of Internal Transitions
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Reconciling statechart semantics
Science of Computer Programming
Transforming process models: executable rewrite rules versus a formalized java program
MODELS'10 Proceedings of the 13th international conference on Model driven engineering languages and systems: Part II
Specification translation of state machines from equational theories into rewrite theories
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Synthesizing object life cycles from business process models
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
| Hi-index | 0.00 |
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enable the automated exchange of models between Petri net and statechart tools, we present a structural, polynomial algorithm that translates safe Petri nets into statecharts. The translation algorithm preserves both the structure and the behaviour of the input net. The algorithm can fail, since not every safe net has a statechart translation that preserves both its structure and behaviour. The class of safe nets for which the algorithm succeeds is formally characterised. Some statechart translations are not constructible by the algorithm, but this does not seem to be a severe limitation in practice.