{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:30Z","timestamp":1740122670871,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:00:00Z","timestamp":1605571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:00:00Z","timestamp":1605571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"ED-STIC","award":["Nan"],"award-info":[{"award-number":["Nan"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10626-020-00331-z","type":"journal-article","created":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T17:19:42Z","timestamp":1605633582000},"page":"251-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Commodification of accelerations for the Karp and Miller Construction"],"prefix":"10.1007","volume":"31","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5132-5839","authenticated-orcid":false,"given":"Igor","family":"Khmelnitsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,17]]},"reference":[{"issue":"3","key":"331_CR1","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/3105908","volume":"18","author":"M Blondin","year":"2017","unstructured":"Blondin M, Finkel A, Haase C, Haddad S (2017) The logical view on continuous Petri nets. ACM Trans Comput Logic (TOCL) 18(3):24:1\u201324:28","journal-title":"ACM Trans Comput Logic (TOCL)"},{"issue":"3","key":"331_CR2","first-page":"1","volume":"13","author":"M Blondin","year":"2017","unstructured":"Blondin M, Finkel A, McKenzie P (2017) Well behaved transition systems. LMCS 13(3):1\u201319","journal-title":"LMCS"},{"key":"331_CR3","doi-asserted-by":"crossref","unstructured":"D\u2019Osualdo E, Kochems J, Ong CHL (2013) Automatic verification of Erlang-style concurrency. In: Static Analysis, pp 454\u2013476","DOI":"10.1007\/978-3-642-38856-9_24"},{"key":"331_CR4","doi-asserted-by":"crossref","unstructured":"Esparza J, Ledesma-Garza R, Majumdar R, Meyer P, Niksic F (2014) An smt-based approach to coverability analysis. In: CAV, pp 603\u2013619","DOI":"10.1007\/978-3-319-08867-9_40"},{"issue":"2","key":"331_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"F Alain","year":"1990","unstructured":"Alain F (1990) Reduction and covering of infinite reachability trees. Inf Comput 89(2):144\u2013179","journal-title":"Inf Comput"},{"key":"331_CR6","doi-asserted-by":"crossref","unstructured":"Finkel A (1993) The minimal coverability graph for Petri nets. In: Advances in petri nets 1993, volume 674 of lecture notes in computer science,. Springer, pp 210\u2013243","DOI":"10.1007\/3-540-56689-9_45"},{"key":"331_CR7","unstructured":"Finkel A, Geeraerts G, Raskin J-F, Van Begin L (2005) A counter-example the the minimal coverability tree algorithm. Technical Reportm, 535, Universit\u00e9 Libre de Bruxelles, Belgium"},{"key":"331_CR8","doi-asserted-by":"crossref","unstructured":"Finkel A, Goubault-Larrecq J (2012) Forward analysis for WSTS, part II: Complete WSTS. LMCS, 8(4)","DOI":"10.2168\/LMCS-8(3:28)2012"},{"key":"331_CR9","doi-asserted-by":"crossref","unstructured":"Finkel A, Haddad S, Khmelnitsky I (2020) Minimal Coverability Tree Construction Made Complete and Efficient. In https:\/\/hal.inria.fr\/hal-02479879\/","DOI":"10.1007\/978-3-030-45231-5_13"},{"issue":"2","key":"331_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1142\/S0129054110007180","volume":"21","author":"G Geeraerts","year":"2010","unstructured":"Geeraerts G, Raskin J-F, Van Begin L (2010) On the efficient computation of the minimal coverability set of Petri nets. Int. J. Found Comput Sci 21 (2):135\u2013165","journal-title":"Int. J. Found Comput Sci"},{"key":"331_CR11","unstructured":"Hack M (1976) Decidability questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA USA"},{"key":"331_CR12","doi-asserted-by":"crossref","unstructured":"Kaiser A, Kroening D, Wahl T (2014) A widening approach to multithreaded program verification. ACM Trans Program Lang Syst 36(4)","DOI":"10.1145\/2629608"},{"issue":"2","key":"331_CR13","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(2):147\u2013195","journal-title":"J Comput Syst Sci"},{"key":"331_CR14","doi-asserted-by":"crossref","unstructured":"Kloos J, Majumdar R, Niksic F, Piskac R (2013) Incremental, inductive coverability. In: CAV, pp 158\u2013173","DOI":"10.1007\/978-3-642-39799-8_10"},{"key":"331_CR15","doi-asserted-by":"crossref","unstructured":"Leroux J (2019) Distance between mutually reachable petri net configurations. In: FSTTCS 2019, pp 47:1\u201347:14","DOI":"10.1007\/978-3-030-04687-3_3"},{"issue":"3\u20134","key":"331_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.3233\/FI-2016-1319","volume":"143","author":"A Piipponen","year":"2016","unstructured":"Piipponen A, Valmari A (2016) Constructing minimal coverability sets. Fundamenta Informaticae 143(3\u20134):393\u2013414","journal-title":"Fundamenta Informaticae"},{"issue":"1\u20132","key":"331_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2013-781","volume":"122","author":"P-A Reynier","year":"2013","unstructured":"Reynier P-A, Servais F (2013) Minimal coverability set for Petri nets: Karp and Miller algorithm with pruning. Fundamenta Informaticae 122(1\u20132):1\u201330","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"331_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/FI-2014-1002","volume":"131","author":"A Valmari","year":"2014","unstructured":"Valmari A, Hansen H (2014) Old and new algorithms for minimal coverability sets. Fundamenta Informaticae 131(1):1\u201325","journal-title":"Fundamenta Informaticae"},{"key":"331_CR19","doi-asserted-by":"crossref","unstructured":"Yamamoto M, Sekine S, Matsumoto S (2017) Formalization of karp-miller tree construction on petri nets. In: Proceedings of the 6th ACM SIGPLAN conference on certified programs and proofs, CPP 2017. ACM, pp 66\u201378","DOI":"10.1145\/3018610.3018626"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-020-00331-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10626-020-00331-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-020-00331-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T11:19:55Z","timestamp":1620818395000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10626-020-00331-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s10626-020-00331-z","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"type":"print","value":"0924-6703"},{"type":"electronic","value":"1573-7594"}],"subject":[],"published":{"date-parts":[[2020,11,17]]},"assertion":[{"value":"2 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}