Formal Aspects of Computing

, Volume 25, Issue 5, pp 659–681

Statechartable Petri nets

Open Access
Original Article

DOI: 10.1007/s00165-011-0204-5

Cite this article as:
Eshuis, R. Form Asp Comp (2013) 25: 659. doi:10.1007/s00165-011-0204-5


Petri nets and statecharts can model concurrent systems in a succinct way. While translations from statecharts to Petri nets exist, a well-defined translation from Petri nets to statecharts is lacking. Such a translation should map an input net to a corresponding statechart, having a structure and behaviour similar to that of the input net. Since statecharts can only model a restricted form of concurrency, not every Petri net has a corresponding statechart. We identify a class of Petri nets, called statechartable nets, that can be translated to corresponding statecharts. Statechartable Petri nets are structurally defined using the novel notion of an area. We also define a structural translation that maps each statechartable Petri net to a corresponding statechart. The translation is proven sound and complete for statechartable Petri nets.


Petri nets Statecharts Formal translation 
Download to read the full article text

Copyright information

© The Author(s) 2011

Authors and Affiliations

  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations