Translating safe Petri nets to statecharts in a structure-preserving way

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationProceedings of the 2nd World Congress on Formal Methods (FM 2009) 2 - 6 November 2009, Eindhoven
EditorsA. Cavalcanti, D. Dams
Place of PublicationBerlin
ISBN (Print)978-3-642-05088-6
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science


Dive into the research topics of 'Translating safe Petri nets to statecharts in a structure-preserving way'. Together they form a unique fingerprint.

Cite this