{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:23:08Z","timestamp":1777645388748,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2020,9,28]]},"abstract":"<jats:p>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\u2019 and their groups\u2019 work over the past few years.<\/jats:p>","DOI":"10.3233\/fi-2020-1949","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T15:10:14Z","timestamp":1601392214000},"page":"97-122","source":"Crossref","is-referenced-by-count":4,"title":["Target-oriented Petri Net Synthesis"],"prefix":"10.1177","volume":"175","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[{"name":"Parallel Systems, Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, D-26111 Oldenburg, Germany. eike.best@informatik.uni-oldenburg.de"}]},{"given":"Raymond","family":"Devillers","sequence":"additional","affiliation":[{"name":"D\u00e9partement d\u2019Informatique, Universit\u00e9 Libre de Bruxelles, Boulevard du Triomphe, C.P. 212, B-1050 Bruxelles, Belgium, rdevil@ulb.ac.be"}]},{"given":"Evgeny","family":"Erofeev","sequence":"additional","affiliation":[{"name":"Parallel Systems, Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, D-26111 Oldenburg, Germany. evgeny.erofeev@informatik.uni-oldenburg.de"}]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[{"name":"Parallel Systems, Department of Computing Science, Carl von Ossietzky Universit\u00e4t Oldenburg, D-26111 Oldenburg, Germany. harro.wimmel@informatik.uni-oldenburg.de"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2020-1949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:06Z","timestamp":1777444326000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2020-1949"}},"subtitle":[],"editor":[{"given":"Maurice","family":"ter Beek","sequence":"additional","affiliation":[]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":0,"journal-issue":{"issue":"1-4"},"URL":"https:\/\/doi.org\/10.3233\/fi-2020-1949","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,28]]}}}