Transition Systems of Elementary Net Systems with Localities

In this paper, we investigate transition systems of a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous systems. The considered model of Elementary Net Systems with Localities (ENL-systems) is basically that of Elementary Net Systems (EN-systems) equipped with an explicit notion of locality. Each locality identifies a distinct set of events which may only be executed synchronously, i.e., in a maximally concurrent manner. For this reason, the overall behaviour of an ENL-system cannot be represented by an interleaved transition system, with arcs being labelled by single events, but rather by a suitable notion of a step transition system, with arcs being labelled by sets of events executed concurrently. We completely characterise transition systems which can be generated by Elementary Net Systems with Localities under their intended concurrency semantics. In developing a suitable characterisation, we follow the standard approach in which key relationships between a Petri net and its transition system are established via the regions of the latter defined as specific sets of states of the transition system. We argue that this definition is insufficient for the class of transition systems of ENL-systems, and then augment the standard notion of a region with some additional information, leading to the notion of a region with explicit input and output events (or io-region). We define, and show consistency of, two behaviour preserving translations between ENL-systems and their transition systems. As a result, we provide a solution to the synthesis problem of Elementary Net Systems with Localities, which consists in constructing an ENL-system for a given transition system in such a way that the transition system of the former is isomorphic to the latter.

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

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

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

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

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

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

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

[8]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

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

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

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

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

[13]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

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

[15]  Gheorghe Paun,et al.  Membrane Computing , 2002, Natural Computing Series.

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

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

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