Browse by author
Lookup NU author(s): Dr Marta Koutny
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 already solved. The aim of this paper is to 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 net systems (called respectively TSENI_apost and TSENI transition systems).
Author(s): Pietkiewicz-Koutny M
Publication type: Report
Publication status: Published
Series Title: Department of Computing Science Technical Report Series
Year: 2000
Pages: 28
Print publication date: 01/01/2000
Source Publication Date: 2000
Report Number: 673
Institution: Department of Computing Science, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/673.pdf
