{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:10:35Z","timestamp":1773943835072,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80535-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"85-106","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Monotonic Extensions of Petri Nets"],"prefix":"10.1016","volume":"68","author":[{"given":"A.","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-F.","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Samuelides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Van Begin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB1","doi-asserted-by":"crossref","unstructured":"P. Abdulla, L. Boasson, A. Bouajjani. Effective Lossy Queue Languages. In Proc. ICALP'01, LNCS 2076, 2001.","DOI":"10.1007\/3-540-48224-5_53"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB2","series-title":"Series in Parallel Computing","article-title":"Modelling with Generalized Stochastic Petri Nets","author":"Ajmone Marsan","year":"1995"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB3","doi-asserted-by":"crossref","unstructured":"P. A. Abdulla, K. Cer\u0101ns, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In Proc. LICS'96, pages 313\u2013321, 1996.","DOI":"10.1109\/LICS.1996.561359"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB4","doi-asserted-by":"crossref","unstructured":"K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S Systems to Verify Prameterized Networks. In Proc. TACAS 2000, LNCS 1785, pages 188\u2013203, 2000.","DOI":"10.1007\/3-540-46419-0_14"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB5","doi-asserted-by":"crossref","unstructured":"B. B\u00e9rard and L. Fribourg. Reachability analysis of (timed) Petri nets using real arithmeti In Proc. CONCUR'99, LNCS 1664, pages 178\u2013193, 1999.","DOI":"10.1007\/3-540-48320-9_14"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB6","doi-asserted-by":"crossref","unstructured":"A. Bouajjani and R. Mayr. Model Checking Lossy Vector Addition Systems. In Proc. of STACS'99, LNCS 1563, pages 323\u2013333. Springer, 1999.","DOI":"10.1007\/3-540-49116-3_30"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB7","doi-asserted-by":"crossref","unstructured":"G. Ciardo, A.S. Miner. Storage Alternatives for Large Structured State Space. In Proc. Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pages, 44\u201357, 1997.","DOI":"10.1007\/BFb0022196"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB8","doi-asserted-by":"crossref","unstructured":"C. Dufourd, A. Finkel, Ph. Schnoebelen. Reset Nets Between Decidability and Undecidability. In Proc. ICALP'98, LNCS 1443, pages 103\u2013115, 1998.","DOI":"10.1007\/BFb0055044"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB9","doi-asserted-by":"crossref","unstructured":"G. Delzanno, and J. F. Raskin. Symbolic Representation of Upward-closed Sets. In Proc. TACAS 2000, LNCS 1785, pages 426\u2013440, 2000.","DOI":"10.1007\/3-540-46419-0_29"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB10","doi-asserted-by":"crossref","unstructured":"G. Delzanno, J.-F. Raskin, and L. Van Begin. Attacking Symbolic State Explosion. In Proc. CAV'01, LNCS 2102, pages 298\u2013310, 2001.","DOI":"10.1007\/3-540-44585-4_28"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB11","unstructured":"G. Delzanno, J.-F. Raskin and L. Van Begin. Covering Sharing Trees: Efficient Data Structures for the Automated Verification of Parameterized Systems. http:\/\/www.ulb.ac.be\/di\/ssd\/ifr\/CST.ps, 2002."},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB12","doi-asserted-by":"crossref","unstructured":"G. Delzanno, J-F. Raskin and L. Van Begin. Towards the Automated Verification of Multithreaded Java Programs. In Proc. TACAS 2002, LNCS 2280, pages 173\u2013187, 2002.","DOI":"10.1007\/3-540-46002-0_13"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB13","doi-asserted-by":"crossref","unstructured":"J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. LICS'99, pages 352\u2013359, 1999.","DOI":"10.1109\/LICS.1999.782630"},{"issue":"2","key":"10.1016\/S1571-0661(04)80535-8_NEWBIB14","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","article-title":"Reduction and covering of infinite reachability trees","volume":"89","author":"Finkel","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB15","first-page":"210","article-title":"The minimal coverability graph for Petri nets","author":"Finkel","year":"1993","journal-title":"Advances in Petri Nets '93, LNCS 674"},{"issue":"1\u20132","key":"10.1016\/S1571-0661(04)80535-8_NEWBIB16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","article-title":"Well-structured transition systems everywhere!","volume":"256","author":"Finkel","year":"2001","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"10.1016\/S1571-0661(04)80535-8_NEWBIB17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1145\/146637.146681","article-title":"Reasoning about Systems with Many Processes","volume":"39","author":"German","year":"1992","journal-title":"JACM"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB18","series-title":"The Cache Memory Book","author":"Handy","year":"1993"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB19","series-title":"Handbook of Theoretical Computer Science, Volume A, Algorithm and Complexity","article-title":"A Catalog of Complexity Classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel Program Schemata","volume":"3","author":"Karp","year":"1969","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB21","unstructured":"P. Marenzoni, S. Caselli, G. Conte. Analysis of Large GSPN Models: A Distributed Solution Tool. In Proc. Int. Work. on Petri Nets and Performance, 1997."},{"issue":"223","key":"10.1016\/S1571-0661(04)80535-8_NEWBIB22","article-title":"The Covering and Boundness Problem for Vector Addition Systems","volume":"6","author":"Rackoff","year":"1978","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"10.1016\/S1571-0661(04)80535-8_NEWBIB23","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","article-title":"Verifying Lossy Channel Systems Has Nonprimitive Recursive Complexity","volume":"83","author":"Schnoebelen","year":"2002","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB24","first-page":"308","article-title":"Linear Algebraic and Linear Programming Techniques for Analysis of Place\/Transition Net Systems","author":"Silva","year":"1998","journal-title":"Lectures on Petri Nets I: Basic Models, LNCS 1491"},{"key":"10.1016\/S1571-0661(04)80535-8_NEWBIB25","unstructured":"D. Zampuni\u00e9ris, and B. Le Charlier. Efficient Handling of Large Sets of Tuples with Sharing Trees. In Proc. DCC'95, 1995."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805358?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805358?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:56Z","timestamp":1761609956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805358"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80535-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Monotonic Extensions of Petri Nets","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80535-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}