How to synthesize nets from languages - a survey

In this paper we present a survey on methods for the synthesis of Petri nets from behavioral descriptions given as languages. We consider place/transition Petri nets, elementary Petri nets and Petri nets with inhibitor arcs. For each net class we consider classical languages, step languages and partial languages as behavioral description. All methods are based on the notion of regions of languages. We identify two different types of regions and two different principles of computing from the set of regions of a language a finite Petri net generating this language. For finite or regular languages almost each combination of Petri net class, language type, region type and computation principle can be considered to compute such a net. Altogether, we present a framework for region-based synthesis of Petri nets from languages which integrates almost all known approaches and fills several remaining gaps in literature.

[1]  G. Michele Pinna,et al.  Synthesis of Nets with Inhibitor Arcs , 1997, CONCUR.

[2]  Philippe Darondeau,et al.  Unbounded Petri Net Synthesis , 2003, Lectures on Concurrency and Petri Nets.

[3]  Robin Bergenthum,et al.  Synthesis of Petri Nets from Infinite Partial Languages with VipTool , 2007 .

[4]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[5]  Jörg Desel,et al.  Can I Execute My Scenario in Your Net? , 2005, ICATPN.

[6]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[7]  Robin Bergenthum,et al.  Theory of Regions for the Synthesis of Inhibitor Nets from Scenarios , 2007, ICATPN.

[8]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[9]  Marta Pietkiewicz-Koutny.  Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems , 2002, Fundam. Informaticae.

[10]  Boudewijn F. van Dongen,et al.  Workflow mining: A survey of issues and approaches , 2003, Data Knowl. Eng..

[11]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[12]  Luciano Lavagno,et al.  Hardware and Petri Nets: Application to Asynchronous Circuit Design , 2000, ICATPN.

[13]  MengChu Zhou,et al.  Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.

[14]  Philippe Darondeau,et al.  Deriving Unbounded Petri Nets from Formal Languages , 1998, CONCUR.

[15]  P. S. Thiagarajan,et al.  A Trace Semantics for Petri Nets , 1995, Inf. Comput..

[16]  Mark B. Josephs,et al.  A Programming Approach to the Design of Asynchronous Logic Blocks , 2002, Concurrency and Hardware Design.

[17]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[18]  Robert Lorenz,et al.  Towards Synthesis of Petri Nets from Scenarios , 2006, ICATPN.

[19]  Wil M. P. van der Aalst,et al.  Finding Structure in Unstructured Processes: The Case for Process Mining , 2007, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[20]  Robin Bergenthum,et al.  Synthesis of Petri Nets from Finite Partial Languages , 2008, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007).

[21]  Éric Badouel,et al.  On the Synthesis of General Petri Nets , 1996 .

[22]  Robin Bergenthum,et al.  Process Mining Based on Regions of Languages , 2007, BPM.

[23]  Marta Pietkiewicz-Koutny.  The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs , 1999, Fundam. Informaticae.