{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:20:15Z","timestamp":1777645215869,"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>In this paper we tackle the problem of verifying whether a scenario is executable in a Petri net. In contrast to sequentially ordered runs, a scenario includes both information about dependencies and independencies of events. Consequently, a scenario allows a precise and intuitive specification of a run of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place\/transition-nets (p\/t-nets) and p\/t-nets with inhibitor arcs (pti-nets). A scenario of a p\/t-net is a labelled partial order (lpo). A scenario of a pti-net is a labelled stratified order structure (lso). Accordingly, the question is either whether a given lpo is in the language of a given p\/t-net or whether an lso is in the language of a given pti-net. Different approaches exist to define the partial language of a Petri net. Each definition yields a different verification algorithm, but existing algorithms perform quite poorly in terms of runtime for most examples. We introduce a new compact characterization of the partial language of a Petri net. This characterization is optimized with respect to the verification problem. The paper is a revised and extended version of the conference paper [10].<\/jats:p>","DOI":"10.3233\/fi-2015-1172","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:28:20Z","timestamp":1575336500000},"page":"117-142","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":6,"title":["Verification of Scenarios in Petri Nets Using Compact Tokenflows"],"prefix":"10.1177","volume":"137","author":[{"given":"Robin","family":"Bergenthum","sequence":"first","affiliation":[{"name":"Department of Software Engineering and Theory of Programming, FernUniversit\u00e4t in Hagen, Germany. robin.bergenthum@fernuni-hagen.de"}]},{"given":"Robert","family":"Lorenz","sequence":"additional","affiliation":[{"name":"Department of Software Engineering and Theory of Programming, FernUniversit\u00e4t in Hagen, Germany. robin.bergenthum@fernuni-hagen.de"}]}],"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-1172","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2015-1172","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-1172"}},"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-1172"],"URL":"https:\/\/doi.org\/10.3233\/fi-2015-1172","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4]]}}}