ePrints

Adding a/sync Places to the Synthesis Procedure for Whole-place Operations Nets with Localities

Lookup NU author(s): Professor Maciej KoutnyORCiD, Dr Marta Koutny

Downloads

• Accepted version [.pdf]

Licence

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.

Abstract

Assuming that the behavioural specication 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 [24], 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.

Publication metadata

Author(s): Kleijn J, Koutny M, Pietkiewicz-Koutny M

Publication type: Article

Publication status: Published

Journal: Scientific Annals of Computer Science

Year: 2017

Volume: XXVII

Issue: 2

Pages: 177-212

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

URL: http://www.info.uaic.ro/bin/Annals/Article?v=XXVII2&a=2

DOI: 10.7561/SACS.2017.2.177

Altmetrics

Share