The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs

Authors:
Marta Pietkiewicz-Koutny
Affiliations:
(Correspd.) Department of Computing Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, U.K. Marta.Koutny@ncl.ac.uk
Venue:
Fundamenta Informaticae
Year:
1999

Citing 20
Cited 0

Partial (set) 2-structures. Part I: basic notions and the representation problem

Acta Informatica
Diamond properties of elementary net systems

Fundamenta Informaticae
Elementary transition systems

Selected papers of the Second Workshop on Concurrency and compositionality
Finite transition systems: semantics of communicating systems

Finite transition systems: semantics of communicating systems
Models for concurrency

Handbook of logic in computer science (vol. 4)
Semantics of inhibitor nets

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
Formal verification of parallel programs

Communications of the ACM
Specification and Analysis of Concurrent Systems: The COSY Approach

Specification and Analysis of Concurrent Systems: The COSY Approach
Extensions to Coloured Petri Nets

PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
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
Theory of Regions

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
Coloured Petri Nets Extended with Place Capacities, Test Arcs and Inhibitor Arcs

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Synthesis of Net Systems

Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Categories of asynchronous systems

Categories of asynchronous systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the synthesis problem for the Elementary Net Systems with Inhibitor Arcs (ENI-systems) executed according to the a-priori semantics. We characterise transition systems generated by ENI-systems, called TSENI transition systems, by adapting the notion of a step transition system whose arcs are labelled by sets of concurrently executed events. The relationship between the ENI-systems and TSENI 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 also discuss how to optimise the synthesis procedure by using only minimal regions and selected inhibitor arcs.