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)
Information and Computation
Synthesizing Petri nets from state-based models
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
The synthesis problem of Petri nets
Acta Informatica
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science
Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets
Formal Methods in System Design
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
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Synthesis of ENI-systems Using Minimal Regions
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
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
Transition Systems of Elementary Net Systems with Inhibitor Arcs
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Synthesis of Net Systems with Inhibitor Arcs from Step Transition Systems
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Analysis and Synthesis of Net Structures and Transition Graphs
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Synthesis of Elementary Net Systems with Context Arcs and Localities
Fundamenta Informaticae - PETRI NETS 2007
Regions of Petri nets with a/sync connections
Theoretical Computer Science
| Hi-index | 0.00 |
We here consider transition systems of Elementary Net Systems with Inhibitor Arcs. There are basically two different types of non-interleaving semantics of such Petri nets, the a-posteriori and a-priori semantics. The synthesis problem for Elementary Net Systems with Inhibitor Arcs executed under the a-priori semantics (ENI) was solved in [18]. In this paper we completely characterise transition systems which can be generated by Elementary Net Systems with Inhibitor Arcs executed under the a-posteriori semantics (ENI_apost). This is achieved by adapting the notion of a step transition system, i.e. one in which arcs are labelled by sets of events executed concurrently. In developing the model, we follow the standard approach in which the relationship between nets and their transition systems is established via the notion of a region. We define, and show consistency of, two behaviour preserving translations between nets and transition systems. We then compare transition systems which are generated by ENI_apost and ENI-systems (called respectively TSENI_apost and TSENI transition systems).