Statechartable Petri nets

4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

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. © 2011 The Author(s).

Cite

CITATION STYLE

APA

Eshuis, R. (2013). Statechartable Petri nets. Formal Aspects of Computing, 25(5), 659–681. https://doi.org/10.1007/s00165-011-0204-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free