{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:08Z","timestamp":1760202668787,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_2","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"13-25","source":"Crossref","is-referenced-by-count":5,"title":["Handling Infinitely Branching WSTS"],"prefix":"10.1007","author":[{"given":"Michael","family":"Blondin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"McKenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313\u2013321 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1-2","key":"2_CR2","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., Cerans, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Handbook of Logic in Comp. Sci., vol.\u00a03, pp. 1\u2013168. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"2_CR4","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA, pp. 101\u2013116 (2012)"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10703-012-0168-y","volume":"43","author":"N. Bertrand","year":"2013","unstructured":"Bertrand, N., Schnoebelen, P.: Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design\u00a043(2), 233\u2013267 (2013)","journal-title":"Formal Methods in System Design"},{"issue":"4-6","key":"2_CR6","first-page":"595","volume":"24","author":"P. Bouyer","year":"2012","unstructured":"Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, P., Worrell, J.: On termination and invariance for faulty channel systems. FAC\u00a024(4-6), 595\u2013607 (2012)","journal-title":"FAC"},{"issue":"1","key":"2_CR7","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., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput.\u00a0124(1), 20\u201331 (1996)","journal-title":"Inf. Comput."},{"key":"2_CR8","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_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P., Schnoebelen, P.: Boundedness of reset P\/T nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 301\u2013310. Springer, Heidelberg (1999)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS, pp. 352\u2013359 (1999)","DOI":"10.1109\/LICS.1999.782630"},{"issue":"1\u20132","key":"2_CR11","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! Theoret. Comput. Sci.\u00a0256(1\u20132), 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"2_CR12","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_CR13","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part I: Completions. In: STACS, pp. 433\u2013444 (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"2_CR14","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, Part II. LNCS, vol.\u00a05556, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"2_CR15","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"},{"key":"2_CR16","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":"2006","unstructured":"Ganty, P., Raskin, J.-F., Van Begin, L.: A complete abstract interpretation framework for coverability properties of WSTS. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 49\u201364. Springer, Heidelberg (2006)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Geeraerts, G., Heu\u00dfner, A., Praveen, M., Raskin, J.F.: \u03c9-Petri nets. In: Petri Nets, pp. 49\u201369 (2013)","DOI":"10.1007\/978-3-642-38697-8_4"},{"issue":"1","key":"2_CR18","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., Begin, L.V.: Expand, enlarge and check: New algorithms for the coverability problem of WSTS. JCSS\u00a072(1), 180\u2013203 (2006)","journal-title":"JCSS"},{"key":"2_CR19","unstructured":"Goubault-Larrecq, J., Schnoebelen, P.: Personal communication (October 2013)"},{"issue":"5-6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P. Jancar","year":"1999","unstructured":"Jancar, P.: A note on well quasi-orderings for powersets. Inf. Process. Lett.\u00a072(5-6), 155\u2013160 (1999)","journal-title":"Inf. Process. Lett."},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-32940-1_35","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A. Kaiser","year":"2012","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Efficient coverability analysis by proof minimization. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 500\u2013515. Springer, Heidelberg (2012)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-33654-6_6","volume-title":"Graph Transformations","author":"B. K\u00f6nig","year":"2012","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: Well-structured graph transformation systems with negative application conditions. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol.\u00a07562, pp. 81\u201395. Springer, Heidelberg (2012)"},{"key":"2_CR23","unstructured":"Pachl, J.K.: Reachability problems for communicating finite state machines. Technical Report CS-82-12, University of Waterloo (1982)"},{"key":"2_CR24","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_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-40184-8_2","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"S. Schmitz","year":"2013","unstructured":"Schmitz, S., Schnoebelen, P.: The power of well-structured systems. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol.\u00a08052, pp. 5\u201324. Springer, Heidelberg (2013)"},{"key":"2_CR26","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_CR27","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","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:35Z","timestamp":1746264215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}