{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:44Z","timestamp":1760202764307,"version":"3.40.5"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","award":["Be 1267\/15-1 ARS","Be 1267\/16-1 ASYST"],"award-info":[{"award-number":["Be 1267\/15-1 ARS","Be 1267\/16-1 ASYST"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1016\/j.scico.2017.07.005","type":"journal-article","created":{"date-parts":[[2018,3,17]],"date-time":"2018-03-17T02:31:27Z","timestamp":1521253887000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Pre-synthesis of Petri nets based on prime cycles and distance paths"],"prefix":"10.1016","volume":"157","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4339-2708","authenticated-orcid":false,"given":"Raymond","family":"Devillers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.scico.2017.07.005_br0010","isbn-type":"print","article-title":"Petri Net Synthesis","author":"Badouel","year":"2015","ISBN":"https:\/\/id.crossref.org\/isbn\/9783662479674"},{"issue":"1\u20132","key":"10.1016\/j.scico.2017.07.005_br0020","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(96)00219-8","article-title":"The synthesis problem for elementary net systems is NP-complete","volume":"186","author":"Badouel","year":"1997","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/j.scico.2017.07.005_br0030","series-title":"Lectures on Petri Nets I: Basic Models","first-page":"529","article-title":"Theory of regions","volume":"vol. 1491","author":"Badouel","year":"1999"},{"key":"10.1016\/j.scico.2017.07.005_br0040","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s001650200022","article-title":"Distributing finite automata through Petri net synthesis","volume":"13","author":"Badouel","year":"2002","journal-title":"Form. Asp. Comput."},{"key":"10.1016\/j.scico.2017.07.005_br0050","series-title":"ATAED'2015","first-page":"1","article-title":"On binary words being Petri net solvable","author":"Barylska","year":"2015"},{"key":"10.1016\/j.scico.2017.07.005_br0060","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00236-009-0095-6","article-title":"A decomposition theorem for finite persistent transition systems","volume":"46","author":"Best","year":"2009","journal-title":"Acta Inform."},{"key":"10.1016\/j.scico.2017.07.005_br0070","series-title":"PSI'11","first-page":"1","article-title":"Petri net distributability","volume":"vol. 7162","author":"Best","year":"2011"},{"key":"10.1016\/j.scico.2017.07.005_br0080","series-title":"Proc. 26th International Conference on Concurrency Theory","first-page":"128","article-title":"Synthesis of bounded choice-free Petri nets","author":"Best","year":"2015"},{"key":"10.1016\/j.scico.2017.07.005_br0090","series-title":"Proc. ATPN'2016","first-page":"59","article-title":"The power of prime cycles","volume":"vol. 9698","author":"Best","year":"2016"},{"key":"10.1016\/j.scico.2017.07.005_br0100","doi-asserted-by":"crossref","unstructured":"E. Best, R. Devillers, U. Schlachter, Bounded choice-free Petri net synthesis \u2013 algorithmic issues. Extended and augmented version of [8], to appear in Acta Inform. (2017).","DOI":"10.1007\/s00236-017-0310-9"},{"key":"10.1016\/j.scico.2017.07.005_br0110","series-title":"Proc. 8th Interaction and Concurrency Experience","first-page":"53","article-title":"Analysis of Petri nets and transition systems","volume":"vol. 189","author":"Best","year":"2015"},{"author":"Caillaud","key":"10.1016\/j.scico.2017.07.005_br0120"},{"issue":"3","key":"10.1016\/j.scico.2017.07.005_br0130","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TC.2009.131","article-title":"New region-based algorithms for deriving bounded Petri nets","volume":"59","author":"Carmona","year":"2010","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/j.scico.2017.07.005_br0140","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","article-title":"Marked directed graphs","volume":"5","author":"Commoner","year":"1971","journal-title":"J. Comput. Syst. Sci."},{"author":"Cortadella","key":"10.1016\/j.scico.2017.07.005_br0150"},{"issue":"3","key":"10.1016\/j.scico.2017.07.005_br0160","first-page":"315","article-title":"Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers","volume":"E80-D","author":"Cortadella","year":"1997","journal-title":"IEICE Trans. Inf. Syst."},{"issue":"3","key":"10.1016\/j.scico.2017.07.005_br0170","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0020-0190(75)90020-4","article-title":"A decidability theorem for a class of vector-addition systems","volume":"3","author":"Crespi-Reghizzi","year":"1975","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.scico.2017.07.005_br0180","series-title":"Lectures on Concurrency and Petri Nets","first-page":"413","article-title":"Unbounded Petri net synthesis","volume":"vol. 3098","author":"Darondeau","year":"2004"},{"key":"10.1016\/j.scico.2017.07.005_br0190","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526558","article-title":"Free-Choice Petri Nets","author":"Desel","year":"1995"},{"issue":"4","key":"10.1016\/j.scico.2017.07.005_br0200","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00264611","article-title":"Partial 2-structures, Part I: basic notions and the representation problem, and Part II: state spaces of concurrent systems","volume":"27","author":"Ehrenfeucht","year":"1990","journal-title":"Acta Inform."},{"key":"10.1016\/j.scico.2017.07.005_br0210","series-title":"Proc. FoSSaCS 2012 (held as part of ETAPS)","first-page":"331","article-title":"On distributability of Petri nets \u2013 (extended abstract)","volume":"vol. 7213","author":"van Glabbeek","year":"2012"},{"key":"10.1016\/j.scico.2017.07.005_br0220","series-title":"Advances of Petri Nets 1991","first-page":"161","article-title":"Distributable nets. Applications and theory of Petri nets 1990","volume":"vol. 524","author":"Hopkins","year":"1991"},{"issue":"9","key":"10.1016\/j.scico.2017.07.005_br0230","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/TAC.2006.880957","article-title":"Deadlock-freeness analysis of continuous mono-T-semiflow Petri nets","volume":"51","author":"J\u00falvez","year":"2006","journal-title":"IEEE Trans. Autom. Control"},{"key":"10.1016\/j.scico.2017.07.005_br0240","series-title":"Parallel Processing","first-page":"102","article-title":"A fundamental theorem of asynchronous parallel computation","volume":"vol. 24","author":"Keller","year":"1975"},{"key":"10.1016\/j.scico.2017.07.005_br0250","series-title":"Selected Works","isbn-type":"print","author":"Khachiyan","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9785940575092"},{"key":"10.1016\/j.scico.2017.07.005_br0260","series-title":"Proc. European Design and Test Conference","first-page":"325","article-title":"Checking signal transition graph implementability by symbolic bdd traversal","author":"Kondratyev","year":"1995"},{"key":"10.1016\/j.scico.2017.07.005_br0270","article-title":"Petri Nets","volume":"vol. 4","author":"Reisig","year":"1985"},{"author":"Schlachter","key":"10.1016\/j.scico.2017.07.005_br0280"},{"key":"10.1016\/j.scico.2017.07.005_br0290","series-title":"Proc. ATPN'2016","first-page":"79","article-title":"Petri net synthesis for restricted classes of nets","author":"Schlachter","year":"2016"},{"key":"10.1016\/j.scico.2017.07.005_br0300","series-title":"Application and Theory of Petri Nets 1993","first-page":"415","article-title":"Liveness and home states in equal conflict systems","volume":"vol. 691","author":"Teruel","year":"1993"},{"issue":"1","key":"10.1016\/j.scico.2017.07.005_br0310","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/3468.553226","article-title":"Choice-free Petri nets: a model for deterministic concurrent systems with bulk services and arrivals","volume":"27","author":"Teruel","year":"1997","journal-title":"IEEE Trans. Syst. Man Cybern., Part A, Syst. Hum."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642317301454?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642317301454?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T06:33:25Z","timestamp":1654065205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642317301454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":31,"alternative-id":["S0167642317301454"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2017.07.005","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Pre-synthesis of Petri nets based on prime cycles and distance paths","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2017.07.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}