The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs

Article type: Research Article

Authors: Pietkiewicz-Koutny, Marta

Affiliations: Department of Computing Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, U.K. [email protected]

Note: [] Address for correspondence: Department of Computing Science, University of Newcastle, Newcastle upon Tyne NE1 7RU, U.K.

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.

Keywords: concurrency, synthesis of Petri nets, theory of regions, morphisms

DOI: 10.3233/FI-1999-402307

Journal: Fundamenta Informaticae, vol. 40, no. 2-3, pp. 251-283, 1999