{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:20:14Z","timestamp":1777645214819,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2015,4,1]],"date-time":"2015-04-01T00:00:00Z","timestamp":1427846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2015,4]]},"abstract":"<jats:p>We introduce \u03c9-Petri nets (\u03c9PN), an extension of plain Petri nets with \u03c9-labeled input and output arcs, that is well-suited to analyse parametric concurrent systems with dynamic thread creation. Most techniques (such as the Karp and Miller tree or the Rackoff technique) that have been proposed in the setting of plain Petri nets do not apply directly to \u03c9PN because \u03c9PN define transition systems that have infinite branching. This motivates a thorough analysis of the computational aspects of \u03c9PN. We show that an \u03c9PN can be turned into a plain Petri net that allows us to recover the reachability set of the \u03c9PN, but that does not preserve termination (an \u03c9PN terminates iff it admits no infinitely long execution). This yields complexity bounds for the reachability, boundedness, place boundedness and coverability problems on \u03c9PN. We provide a practical algorithm to compute a coverability set of the \u03c9PN and to decide termination by adapting the classical Karp and Miller tree construction. We also adapt the Rackoff technique to \u03c9PN, to obtain the exact complexity of the termination problem. Finally, we consider the extension of \u03c9PN with reset and transfer arcs, and show how this extension impacts the decidability and complexity of the aforementioned problems.<\/jats:p>","DOI":"10.3233\/fi-2015-1169","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:27:40Z","timestamp":1575336460000},"page":"29-60","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["\u03c9-Petri Nets: Algorithms and Complexity"],"prefix":"10.1177","volume":"137","author":[{"given":"Gilles","family":"Geeraerts","sequence":"first","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, D\u00e9partement d'informatique, Bruxelles, Belgium. gigeerae@ulb.ac.be"}]},{"given":"Alexander","family":"Heu\u00dfner","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, D\u00e9partement d'informatique, Bruxelles, Belgium. gigeerae@ulb.ac.be"}]},{"given":"M.","family":"Praveen","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, D\u00e9partement d'informatique, Bruxelles, Belgium. gigeerae@ulb.ac.be"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, D\u00e9partement d'informatique, Bruxelles, Belgium. gigeerae@ulb.ac.be"}]}],"member":"179","published-online":{"date-parts":[[2015,4]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1169","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:31:39Z","timestamp":1777444299000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2015-1169"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["10.3233\/FI-2015-1169"],"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1169","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}