{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:28:51Z","timestamp":1761971331934,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311307"},{"type":"electronic","value":"9783642311314"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31131-4_2","type":"book-chapter","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:36:12Z","timestamp":1338921372000},"page":"3-31","source":"Crossref","is-referenced-by-count":4,"title":["The Theory of WSTS: The Case of Complete WSTS"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Goubault-Larrecq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","first-page":"327","volume-title":"Automata, Languages, and Programming","author":"P.A. Abdulla","year":"1994","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable Verification Problems for Programs with Unreliable Channels. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 327\u2013346. Springer, Heidelberg (1994)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0028754","volume-title":"Computer Aided Verification","author":"P. Abdulla","year":"1998","unstructured":"Abdulla, P., Bouajjani, A., Jonsson, B.: On-The-Fly Analysis of Systems With Unbounded, Lossy Fifo Channels. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-74915-8_11","volume-title":"Computer Science Logic","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the Expressive Power of Well-Structured Transition Systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 99\u2013114. Springer, Heidelberg (2007)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P., Nyl\u00e9n, A.: Better is Better than Well: On Efficient Verification of Infinite-State Systems. In: 14th LICS, pp. 132\u2013140 (2000)","DOI":"10.1109\/LICS.2000.855762"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/B:FORM.0000033962.51898.1a","volume":"25","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design\u00a025(1), 39\u201365 (2004)","journal-title":"Formal Methods in System Design"},{"issue":"1-2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-30206-3_24","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P., Nyl\u00e9n, A.: Forward Reachability Analysis of Timed Petri Nets. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS\/FTRTFT 2004. LNCS, vol.\u00a03253, pp. 343\u2013362. Springer, Heidelberg (2004)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013168. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"2_CR9","unstructured":"Bonnet, R., Finkel, A.: Forward Analysis for WSTS: Beyond Regular Accelerations (February 2012) (submitted)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/11562948_35","volume-title":"Automated Technology for Verification and Analysis","author":"S. Bardin","year":"2005","unstructured":"Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat Acceleration in Symbolic Model Checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 474\u2013488. Springer, Heidelberg (2005)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-19805-2_11","volume-title":"Foundations of Software Science and Computational Structures","author":"R. Bonnet","year":"2011","unstructured":"Bonnet, R., Finkel, A., Haddad, S., Rosa-Velardo, F.: Ordinal Theory for Expressiveness of Well Structured Transition Systems. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 153\u2013167. Springer, Heidelberg (2011)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-24288-5_10","volume-title":"Reachability Problems","author":"L. Bozzelli","year":"2011","unstructured":"Bozzelli, L., Ganty, P.: Complexity Analysis of the Backward Coverability Algorithm for VASS. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol.\u00a06945, pp. 96\u2013109. Springer, Heidelberg (2011)"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/inco.1996.0003","volume":"124","author":"G. C\u00e9c\u00e9","year":"1996","unstructured":"C\u00e9c\u00e9, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Information and Computation\u00a0124(1), 20\u201331 (1996)","journal-title":"Information and Computation"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-21834-7_4","volume-title":"Applications and Theory of Petri Nets","author":"P. Chambart","year":"2011","unstructured":"Chambart, P., Finkel, A., Schmitz, S.: Forward Analysis and Model Checking for Trace Bounded WSTS. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol.\u00a06709, pp. 49\u201368. Springer, Heidelberg (2011)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-21834-7_4","volume-title":"Applications and Theory of Petri Nets","author":"P. Chambart","year":"2011","unstructured":"Chambart, P., Finkel, A., Schmitz, S.: Forward Analysis and Model Checking for Trace Bounded WSTS. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol.\u00a06709, pp. 49\u201368. Springer, Heidelberg (2011)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11901914_36","volume-title":"Automated Technology for Verification and Analysis","author":"S. Demri","year":"2006","unstructured":"Demri, S., Finkel, A., Goranko, V., van Drimmelen, G.: Towards a Model-Checker for Counter Systems. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 493\u2013507. Springer, Heidelberg (2006)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 103\u2013115. Springer, Heidelberg (1998)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: 14th LICS, pp. 352\u2013359 (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Allen Emerson, E., Namjoshi, K.S.: On model-checking for non-deterministic infinite-state systems. In: 13th LICS, pp. 70\u201380 (1998)","DOI":"10.1109\/LICS.1998.705644"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermannian and Primitive-Recursive Bounds with Dickson\u2019s Lemma. In: LICS, pp. 269\u2013278 (2011)","DOI":"10.1109\/LICS.2011.39"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-18088-5_43","volume-title":"Automata, Languages and Programming","author":"A. Finkel","year":"1987","unstructured":"Finkel, A.: A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 499\u2013508. Springer, Heidelberg (1987)"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"Finkel, A.: Reduction and covering of infinite reachability trees. Information and Computation\u00a089(2), 144\u2013179 (1990)","journal-title":"Information and Computation"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/3-540-56689-9_45","volume-title":"Advances in Petri Nets 1993","author":"A. Finkel","year":"1993","unstructured":"Finkel, A.: The Minimal Coverability Graph for Petri Nets. In: Rozenberg, G. (ed.) APN 1993. LNCS, vol.\u00a0674, pp. 210\u2013243. Springer, Heidelberg (1993)"},{"issue":"1-2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A. Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Information and Computation\u00a0195(1-2), 1\u201329 (2004)","journal-title":"Information and Computation"},{"issue":"1-2","key":"2_CR25","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theoretical Computer Science\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"2_CR26","series-title":"Leibniz International Proceedings in Informatics","first-page":"433","volume-title":"Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2009)","author":"A. Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for\u00a0WSTS, part\u00a0I: Completions. In: Albers, S., Marion, J.-Y. (eds.) Proceedings of the 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2009). Leibniz International Proceedings in Informatics, vol.\u00a03, pp. 433\u2013444. Leibniz-Zentrum f\u00fcr Informatik, Freiburg (2009)"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-02930-1_16","volume-title":"Automata, Languages and Programming","author":"A. Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part\u00a0II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for\u00a0WSTS, part\u00a0I: Completions (in preparation, 2012); Journal version of [FG09a]","DOI":"10.2168\/LMCS-8(3:28)2012"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, Part II: Complete WSTS (in preparation, 2012); Journal version of [FG09b]","DOI":"10.2168\/LMCS-8(3:28)2012"},{"issue":"3-4","key":"2_CR30","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00236-007-0050-3","volume":"44","author":"G. Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Well-structured languages. Acta Inf.\u00a044(3-4), 249\u2013288 (2007)","journal-title":"Acta Inf."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., Scott, D.S.: Continuous lattices and domains. In: Encyclopedia of Mathematics and its Applications, vol.\u00a093. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511542725"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/11609773_4","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P. Ganty","year":"2005","unstructured":"Ganty, P., Raskin, J.-F., Van Begin, L.: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. In: Allen Emerson, E., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"1","key":"2_CR33","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G. Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., van Begin, L.: Expand, enlarge and check: New algorithms for the coverability problem of WSTS. J. Comp. and System Sciences\u00a072(1), 180\u2013203 (2006)","journal-title":"J. Comp. and System Sciences"},{"key":"2_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-75596-8_9","volume-title":"Automated Technology for Verification and Analysis","author":"G. Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the Efficient Computation of the Minimal Coverability Set for Petri Nets. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol.\u00a04762, pp. 98\u2013113. Springer, Heidelberg (2007)"},{"issue":"2","key":"2_CR35","first-page":"333","volume":"113","author":"S. Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded Algol-like languages. Trans. American Mathematical Society\u00a0113(2), 333\u2013368 (1964)","journal-title":"Trans. American Mathematical Society"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science\u00a08, 135\u2013159 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"5-6","key":"2_CR37","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P. Jan\u010dar","year":"1999","unstructured":"Jan\u010dar, P.: A note on well quasi-orderings for powersets. Information Processing Letters\u00a072(5-6), 155\u2013160 (1999)","journal-title":"Information Processing Letters"},{"issue":"2","key":"2_CR38","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comp. and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comp. and System Sciences"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/S1571-0661(05)82512-5","volume":"5","author":"O. Kouchnarenko","year":"1996","unstructured":"Kouchnarenko, O., Schnoebelen, P.: A model for recursive-parallel programs. Electr. Notes Theor. Comput. Sci.\u00a05, 30 pages (1996)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-73094-1_19","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"R.S. Lazi\u0107","year":"2007","unstructured":"Lazi\u0107, R.S., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.B.: Nets with Tokens Which Carry Data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 301\u2013320. Springer, Heidelberg (2007)"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"641","DOI":"10.2307\/2154991","volume":"345","author":"A. Marcone","year":"1994","unstructured":"Marcone, A.: Foundations of BQO theory. Trans. Amer. Math. Soc.\u00a0345(2), 641\u2013660 (1994)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1-3","key":"2_CR42","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theor. Comput. Sci.\u00a0297(1-3), 337\u2013354 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1-3","key":"2_CR43","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science\u00a0297(1-3), 337\u2013354 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"2_CR44","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W., Meyer, A.R.: The complexity of the finite containment problem for petri nets. J. ACM\u00a028(3), 561\u2013576 (1981)","journal-title":"J. ACM"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C. Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci.\u00a06, 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"issue":"3-4","key":"2_CR46","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FI-2011-611","volume":"113","author":"F. Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., Martos-Salgado, M., de Frutos-Escrig, D.: Accelerations for the Coverability Set of Petri Nets with Names. Fundam. Inform.\u00a0113(3-4), 313\u2013341 (2011)","journal-title":"Fundam. Inform."},{"issue":"2","key":"2_CR47","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N. Robertson","year":"2004","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner\u2019s conjecture. Journal of Combinatorial Theory, Series B\u00a092(2), 325\u2013357 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45500-0_19","volume-title":"Theoretical Aspects of Computer Software","author":"P. Schnoebelen","year":"2001","unstructured":"Schnoebelen, P.: Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 385\u2013399. Springer, Heidelberg (2001)"},{"key":"2_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-22012-8_35","volume-title":"Automata, Languages and Programming","author":"S. Schmitz","year":"2011","unstructured":"Schmitz, S., Schnoebelen, P.: Multiply-Recursive Upper Bounds with Higman\u2019s Lemma. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 441\u2013452. Springer, Heidelberg (2011)"},{"key":"2_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/3-540-08860-1_35","volume-title":"Automata, Languages and Programming","author":"R. Valk","year":"1978","unstructured":"Valk, R.: Self-Modidying Nets, a Natural Extension of Petri Nets. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 464\u2013476. Springer, Heidelberg (1978)"},{"key":"2_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-73094-1_24","volume-title":"Petri Nets and Other Models of Concurrency \u2013 ICATPN 2007","author":"F. Rosa-Velardo","year":"2007","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Name Creation vs. Replication in Petri Net Systems. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol.\u00a04546, pp. 402\u2013422. Springer, Heidelberg (2007)"},{"issue":"1","key":"2_CR52","first-page":"217","volume":"7","author":"K.N. Verma","year":"2005","unstructured":"Verma, K.N., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of\u00a0VASS. Discrete Mathematics & Theoretical Computer Science\u00a07(1), 217\u2013230 (2005)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward Analysis of Depth-Bounded Processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"key":"2_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-27940-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Zufferey","year":"2012","unstructured":"Zufferey, D., Wies, T., Henzinger, T.A.: Ideal Abstractions for Well-Structured Transition Systems. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol.\u00a07148, pp. 445\u2013460. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31131-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T10:34:10Z","timestamp":1743244450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31131-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311307","9783642311314"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31131-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}