Selected papers of the Second Workshop on Concurrency and compositionality
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Handbook of logic in computer science (vol. 4)
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science
The synthesis problem for elementary net systems with inhibitor arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Formal verification of parallel programs
Communications of the ACM
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Synthesising elementary net systems with inhibitor arcs from step transition systems
Fundamenta Informaticae - Application of concurrency to system design
Synthesis of Nets with Inhibitor Arcs
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Moving from Weakly Endochronous Systems to Delay-Insensitive Circuits
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a petri net semantics for membrane systems
WMC'05 Proceedings of the 6th international conference on Membrane Computing
Synthesis of Nets with Step Firing Policies
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Desynchronisation Technique Using Petri Nets
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesis of Nets with Step Firing Policies
Fundamenta Informaticae - Petri Nets 2008
Synthesis of elementary net systems with context arcs and localities
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Minimal Regions of ENL-Transition Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Synchrony and asynchrony in membrane systems
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Synthesis problem for petri nets with localities
Transactions on Petri Nets and Other Models of Concurrency V
Synthesis of Nets with Step Firing Policies
Fundamenta Informaticae - Petri Nets 2008
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Hi-index | 0.00 |
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.