Models from Scenarios

Synthesis of Petri nets from behavioral descriptions has important applications in the design of systems in different application areas. In this paper we present a survey on the technique of region based synthesis of Petri nets from languages. Each word in a given language specifies one run of the searched Petri net, i.e. represents one observable scenario of the system.

[1]  Robin Bergenthum,et al.  Construction of Process Models from Example Runs , 2009, Trans. Petri Nets Other Model. Concurr..

[2]  Pascal Weil,et al.  Series-Parallel Posets: Algebra, Automata and Languages , 1998, STACS.

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

[4]  Sebastian Mauser,et al.  Complete Process Semantics of Petri Nets , 2008, Fundam. Informaticae.

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

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

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

[8]  Pascal Weil,et al.  Series-parallel languages and the bounded-width property , 2000, Theor. Comput. Sci..

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

[10]  Boudewijn F. van Dongen,et al.  Process Discovery using Integer Linear Programming , 2009, Fundam. Informaticae.

[11]  Maciej Koutny,et al.  Semantics of Inhibitor Nets , 1995, Inf. Comput..

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

[13]  Wil M. P. van der Aalst,et al.  Transactions on Petri Nets and Other Models of Concurrency II, Special Issue on Concurrency in Process-Aware Information Systems , 2009, Trans. Petri Nets and Other Models of Concurrency.

[14]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

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

[16]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

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

[18]  Robert de Simone,et al.  CONCUR'98 Concurrency Theory , 1998, Lecture Notes in Computer Science.

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

[20]  Robin Bergenthum,et al.  Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages , 2009, Fundam. Informaticae.

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

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

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

[24]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[25]  Grzegorz Rozenberg,et al.  Concurrency and Hardware Design , 2002, Lecture Notes in Computer Science.

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

[27]  Sebastian Mauser,et al.  How to synthesize nets from languages - a survey , 2007, 2007 Winter Simulation Conference.

[28]  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).

[29]  Robin Bergenthum,et al.  Executability of scenarios in Petri nets , 2009, Theor. Comput. Sci..

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

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

[32]  Wolfgang Reisig,et al.  Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.

[33]  Maciej Koutny,et al.  Process semantics of general inhibitor nets , 2004, Inf. Comput..

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

[35]  Jörg Desel,et al.  From Human Knowledge to Process Models , 2008, UNISCON.

[36]  Mogens Nielsen,et al.  Application and Theory of Petri Nets 2000: 21st International Conference, ICATPN 2000 Aarhus, Denmark, June 26–30, 2000 Proceedings , 2000, ICATPN.

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

[38]  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).