Synthesis of Elementary Net Systems with Context Arcs and Localities

We investigate the synthesis problem for ENCL-systems, defined as Elementary Net Systems extended with context (inhibitor and activator) arcs and explicit event localities. Since colocated events are meant to be executed synchronously, the behaviour of such systems is captured by step transition systems, where arcs are labelled by sets of events rather than by single events. We completely characterise transition systems generated by ENCL-systems after extending the standard notion of a region - defined as a certain set of states - with explicit information about events which, in particular, are responsible for crossing its border. As a result, we are able to construct, for each such transition system, a suitable ENCL-system generating it.

[1]  Maciej Koutny,et al.  Transition Systems of Elementary Net Systems with Localities , 2006, CONCUR.

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

[3]  Glynn Winskel,et al.  Models for Concurrency , 1994 .

[4]  Jörg Desel.  Structures in Concurrency Theory , 1995, Workshops in Computing.

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

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

[7]  Maciej Koutny,et al.  Synthesis of Nets with Step Firing Policies , 2008, Fundam. Informaticae.

[8]  Christel Baier,et al.  CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings , 2006, CONCUR.

[9]  Walter Vogler.  Partial order semantics and read arcs , 2002, Theor. Comput. Sci..

[10]  Giuliana Franceschinis,et al.  Modelling and Analysis of Distributed Software Using GSPNs , 1996, Petri Nets.

[11]  Francesca Rossi,et al.  Contextual nets , 1995, Acta Informatica.

[12]  Andrzej Ehrenfeucht,et al.  Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms , 1990, Theor. Comput. Sci..

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

[14]  André Arnold,et al.  Finite transition systems - semantics of communicating systems , 1994, Prentice Hall international series in computer science.

[15]  Maciej Koutny,et al.  Synchrony and Asynchrony in Membrane Systems , 2006, Workshop on Membrane Computing.

[16]  André Arnold,et al.  Finite transition systems , 1994 .

[17]  Giorgio De Michelis,et al.  On The Synchronic Structure of Transition Systems , 1995, STRICT.

[18]  Javier Esparza,et al.  Trapping Mutual Exclusion in the Box Calculus , 1996, Theor. Comput. Sci..

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

[20]  Alexandre Yakovlev,et al.  Moving from Weakly Endochronous Systems to Delay-Insensitive Circuits , 2005, FMGALS@MEMOCODE.

[21]  Igor Prívara,et al.  Mathematical Foundations of Computer Science 1997 , 1997, Lecture Notes in Computer Science.

[22]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications , 1996, Lecture Notes in Computer Science.

[23]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets , 1996 .

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

[25]  Jonathan Billington,et al.  Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets , 1996, Petri Nets.

[26]  Gheorghe Paun,et al.  A guide to membrane computing , 2002, Theor. Comput. Sci..

[27]  Maciej Koutny,et al.  Towards a Petri Net Semantics for Membrane Systems , 2005, Workshop on Membrane Computing.

[28]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

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