Synthesis of ENI-systems using minimal regions

Pietkiewicz-Koutny, Marta

doi:10.1007/bfb0055648

Cited by 3 publications

(1 citation statement)

References 19 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This problem was solved for the class of Elementary Net Systems in [11] using the notion of a region which links nodes of transition systems (global states) with conditions in the corresponding nets (local states). The solution was later extended to the pure bounded Place Transition Nets ( [6]), general Petri Nets ( [15]), Safe Nets ( [22]) and Elementary Net Systems with Inhibitor Arcs ( [7,17,18,19]), by adopting the original definition of a region or using some extended notion of a generalised region. It also turned out that using all possible regions which can be found according to the general synthesis method leads to exponential algorithms.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of net systems with inhibitor arcs from step transition systems

Pietkiewicz-Koutny

Proceedings Second International Conference on Application of Concurrency to System Design

View full text Add to dashboard Cite

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 [17]. 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 aposteriori semantics (ENI ÔÓ×Ø ). 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 ÔÓ×Ø and ENIsystems (called respectively TSENI ÔÓ×Ø and TSENI transition systems). Keywords: causality/partial order theory of concurrency, analysis and synthesis, structure and behaviour of nets, theory of regions.

show abstract