Target-oriented Petri Net Synthesis

Issue title: A Mosaic of Computational Topics: from Classical to Novel, Special Issue Dedicated to Jetty Kleijn on the Occasion of Her 65th Birthday

Guest editors: Maurice ter Beek, Maciej Koutny and Grzegorz Rozenberg

Article type: Research Article

Authors: Best, Eike^{a; *; †} | Devillers, Raymond^b | Erofeev, Evgeny^{c; *} | Wimmel, Harro^{d; *}

Affiliations: [a] Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. eike.best@informatik.uni-oldenburg.de | [b] Département d’Informatique, Université Libre de Bruxelles, Boulevard du Triomphe, C.P. 212, B-1050 Bruxelles, Belgium, rdevil@ulb.ac.be | [c] Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. evgeny.erofeev@informatik.uni-oldenburg.de | [d] Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany. harro.wimmel@informatik.uni-oldenburg.de

Correspondence: [†] Address for correspondence: Parallel Systems, Department of Computing Science, Carl von Ossietzky Universität Oldenburg, D-26111 Oldenburg, Germany

Note: [*] This work has been supported by DFG projects Be 1267/15-1 ARS (Algorithms for Reengineering and Synthesis) and Be 1267/16-1 ASYST (Algorithms for Synthesis and Pre-Synthesis Based on Petri Net Structure Theory).

Abstract: When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

Keywords: Choice-freeness, Persistence, Petri Nets, Synthesis

DOI: 10.3233/FI-2020-1949

Journal: Fundamenta Informaticae, vol. 175, no. 1-4, pp. 97-122, 2020