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).

References Powered by Scopus

8599Citations
1459Readers
Get full text
4458Citations
933Readers

This article is free to access.

The STATEMATE Semantics of Statecharts

721Citations
189Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers over time

‘12‘13‘14‘15‘16‘17‘20‘22‘23‘2401234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 3

43%

Professor / Associate Prof. 2

29%

Lecturer / Post doc 1

14%

Researcher 1

14%

Readers' Discipline

Tooltip

Computer Science 7

88%

Engineering 1

13%

Save time finding and organizing research with Mendeley

Sign up for free
0