Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. J. Wiley, Chichester (1995)
Best, E., Darondeau, P., Wimmel, H.: Making Petri nets safe and free of internal transitions. Fundamenta Informaticae 80(1-3), 75–90 (2007)
Desel, J., Juhás, G.: What is a Petri net? Informal answers for the informed reader. In: Ehrig, H., Juhás, G., Padberg, J., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2128, pp. 1–27. Springer, Heidelberg (2001)
Eshuis, R.: Reconciling statechart semantics. Science of Computer Programming 74(3), 65–99 (2009)
Eshuis, R.: Translating safe Petri nets to statecharts in a structure-preserving way. Beta Working Paper Series, WP 282, Eindhoven University of Technology (2009)
Grahlmann, B.: The PEP tool. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 440–443. Springer, Heidelberg (1997)
Grumberg, O., Katz, S.: Veritech: a framework for translating among model description notations. STTT 9(2), 119–132 (2007)
Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3), 231–274 (1987)
Harel, D., Kahana, C.-A.: On statecharts with overlapping. ACM Transactions on Software Engineering and Methodology 1(4), 399–421 (1992)
Harel, D., Naamad, A.: The STATEMATE semantics of statecharts. ACM Transactions on Software Engineering and Methodology 5(4), 293–333 (1996)
Huszerl, G., Majzik, I., Pataricza, A., Kosmidis, K., Dal Cin, M.: Quantitative analysis of UML statechart models of dependable systems. Computer Journal 45(3), 260–277 (2002)
IBM Rational Software. Rose (2009), http://www.ibm.com/software/rational
Kishinevsky, M., Cortadella, J., Kondratyev, A., Lavagno, L., Taubin, A., Yakovlev, A.: Coupling asynchrony and interrupts: Place chart nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 328–347. Springer, Heidelberg (1997)
The Mathworks. Stateflow user’s guide (2009), http://www.mathworks.com
Murata, T.: Petri nets: Properties, analysis, and applications. Proc. of the IEEE 77(4), 541–580 (1989)
Object Management Group. UML specification (2009), http://www.uml.org
Rausch, M., Krogh, B.: Transformations between different model forms in discrete event systems. In: Proc. IEEE SMC 1997, vol. 3, pp. 2841–2846 (1997)
Saldhana, J.A., Shatz, S.M., Hu, Z.: Formalization of object behavior and interactions from UML models. International Journal of Software Engineering and Knowledge Engineering 11(6), 643–673 (2001)
Schnabel, M., Nenninger, G., Krebs, V.: Konvertierung sicherer Petri-netze in statecharts (in German). Automatisierungstechnik 47(12), 571–580 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eshuis, R. (2009). Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way. In: Cavalcanti, A., Dams, D.R. (eds) FM 2009: Formal Methods. FM 2009. Lecture Notes in Computer Science, vol 5850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-05089-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05088-6
Online ISBN: 978-3-642-05089-3
eBook Packages: Computer ScienceComputer Science (R0)