Browse by author
Lookup NU author(s): Professor Maciej KoutnyORCiD,
Dr Marta Koutny
This is the authors' accepted manuscript of an article that has been published in its final definitive form by Alexandru Ioan Cuza University of Iasi, Romania, 2017.
For re-use rights please refer to the publisher's terms and conditions.
Assuming that the behavioural specication of a concurrent systemis given in the form of a step transition system, where the arcs betweenstates are labelled by steps (multisets of executed actions), we focuson the problem of synthesising a Petri net generating a reachabilitygraph isomorphic to a given step transition system. To deal with steptransition systems more complicated than those generated by standardPlace/Transition nets, we consider in this paper Petri nets with whole-place operations, localities, and a/sync places. We adapt and extendthe general approach developed within the framework of tau-nets and thetheory of regions of step transition systems. Building on the resultspresented in , emphasis here is on the role of a/sync places withtheir potential for an instantaneous transfer of tokens within a step.In a series of results we demonstrate the robustness of the notion ofregion for Petri net synthesis.
Author(s): Kleijn J, Koutny M, Pietkiewicz-Koutny M
Publication type: Article
Publication status: Published
Journal: Scientific Annals of Computer Science
Online publication date: 20/12/2017
Acceptance date: 27/11/2017
Date deposited: 07/12/2017
ISSN (print): 1843-8121
Publisher: Alexandru Ioan Cuza University of Iasi, Romania
Altmetrics provided by Altmetric