Regions of Petri nets with a/sync connections

Automated synthesis from behavioural specifications, such as transition systems, is an attractive way of constructing correct concurrent systems. In this paper, we investigate the synthesis of Petri nets which use special connections between transitions and places. Along these a/sync connections tokens can be transferred instantaneously between transitions executed in a single step. We show that for Place/Transition nets with a/sync connections the synthesis problem can be treated within the general approach based on regions of step transition systems. We also show that the problem is decidable for finite transition systems, and outline a suitable construction algorithm.

[1]  Roberto Bruni,et al.  Zero-Safe Nets: Comparing the Collective and Individual Token Approaches , 2000, Inf. Comput..

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

[3]  Philippe Darondeau,et al.  On the Petri net realization of context-free graphs , 2001, Theor. Comput. Sci..

[4]  Maciej Koutny,et al.  Structured Occurrence Nets: A Formalism for Aiding System Failure Prevention and Analysis Techniques , 2009, Fundam. Informaticae.

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

[6]  Søren Christensen,et al.  Coloured Petri Nets Extended with Channels for Synchronous Communication , 1992, Application and Theory of Petri Nets.

[7]  G. Rozenberg,et al.  Elementary transition systems , 1990 .

[8]  Maciej Koutny,et al.  Synthesis of Petri Nets with Localities , 2009, Sci. Ann. Comput. Sci..

[9]  Maciej Koutny,et al.  Causality in Structured Occurrence Nets , 2011, Dependable and Historic Computing.

[10]  Patrice Quinton,et al.  Extension of Chernikova's algorithm for solving general mixed linear programming problems , 1988 .

[11]  Josep Carmona,et al.  Genet: A Tool for the Synthesis and Mining of Petri Nets , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[12]  Robin Bergenthum,et al.  Synthesis of Petri Nets from Scenarios with VipTool , 2008, Petri Nets.

[13]  Vincent Schmitt.  Flip-Flop Nets , 1996, STACS.

[14]  Philippe Darondeau,et al.  The Synthesis Problem for Elementary Net Systems is NP-Complete , 1997, Theor. Comput. Sci..

[15]  Wolfgang Reisig,et al.  The synthesis problem of Petri nets , 1993, Acta Informatica.

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

[17]  Boudewijn F. van Dongen,et al.  ProM 6: The Process Mining Toolkit , 2010, BPM.

[18]  Maciej Koutny,et al.  Synthesis of Nets with Step Firing Policies , 2008, Petri Nets.

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

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

[21]  M. P. Leonchuk,et al.  Numerical solution of a problem of optimum control of a nuclear reactor , 1965 .

[22]  Josep Carmona,et al.  Rbminer: A Tool for Discovering Petri Nets from Transition Systems , 2010, ATVA.

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

[24]  N. Chernikova.  Algorithm for finding a general formula for the non-negative solutions of a system of linear equations , 1964 .

[25]  Farhad Arbab,et al.  Reo: A Channel-based Coordination Model for Component Composition , 2005 .

[26]  Luciano Lavagno,et al.  Logic Synthesis for Asynchronous Controllers and Interfaces , 2002 .

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

[28]  Maciej Koutny,et al.  Localities in systems with a/sync communication , 2012, Theor. Comput. Sci..

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

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