{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:11:06Z","timestamp":1751429466203,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["FI"],"published-print":{"date-parts":[[2022,1,10]]},"abstract":"<jats:p>For a fixed type of Petri nets \u03c4, \u03c4-SYNTHESIS is the task of finding for a given transition system A a Petri net N of type \u03c4(\u03c4-net, for short) whose reachability graph is isomorphic to A if there is one. The decision version of this search problem is called \u03c4-SOLVABILITY. If an input A allows a positive decision, then it is called \u03c4-solvable and a sought net N \u03c4-solves A. As a well known fact, A is \u03c4-solvable if and only if it has the so-called \u03c4-event state separation property (\u03c4-ESSP, for short) and the \u03c4-state separation property (\u03c4-SSP, for short). The question whether A has the \u03c4-ESSP or the \u03c4-SSP defines also decision problems. In this paper, for all b \u2208 \u2115, we completely characterize the computational complexity of \u03c4-SOLVABILITY, \u03c4-ESSP and \u03c4-SSP for the types of pure b-bounded Place\/Transition-nets, the b-bounded Place\/Transitionnets and their corresponding \u2124b+1-extensions.<\/jats:p>","DOI":"10.3233\/fi-2021-2084","type":"journal-article","created":{"date-parts":[[2022,1,11]],"date-time":"2022-01-11T16:40:18Z","timestamp":1641919218000},"page":"125-167","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Synthesis of b-Bounded Petri Nets"],"prefix":"10.1177","volume":"183","author":[{"given":"Ronny","family":"Tredup","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Theoretische Informatik, Universit\u00e4t Rostock, Albert-Einstein-Stra\u00dfe 22, 18059, Rostock, Germany. ronny.tredup@uni-rostock.de"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2021-2084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:56:22Z","timestamp":1751367382000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-2021-2084"}},"subtitle":[],"editor":[{"given":"Susanna","family":"Donatelli","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Haar","sequence":"additional","affiliation":[]},{"given":"Slawomir","family":"Lasota","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":0,"journal-issue":{"issue":"1-2"},"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2084","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2022,1,10]]}}}