Statecharting Petri nets
Rik Eshuis · TU/e Research Portal · 2005
A polynomial algorithm that translates a Petri net into an equivalent (bisimilar) statechart is presented. The translation preserves the structure of the Petri net. Key property of the algorithm is that it is structural and does not use any Petri net analysis technique. The algorithm is formally proven correct. Though not every statechart equivalent to a net is constructible by the algorithm, the set of constructible statecharts is fairly large.