{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:14:17Z","timestamp":1743138857883,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_16","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"188-199","source":"Crossref","is-referenced-by-count":25,"title":["Forward Analysis for WSTS, Part\u00a0II: Complete WSTS"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[]},{"given":"Jean","family":"Goubault-Larrecq","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","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: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"16_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., \u010cer\u0101ns, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation\u00a0160(1\u20132), 109\u2013127 (2000)","journal-title":"Information and Computation"},{"issue":"1","key":"16_CR3","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"},{"key":"16_CR4","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":"16_CR5","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., 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"},{"key":"16_CR6","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","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, Oxford (1994)"},{"key":"16_CR7","unstructured":"Antonik, A.: Presburger monotone affine functions can be lub-accelerated. Personal communication (2009)"},{"key":"16_CR8","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)"},{"issue":"1","key":"16_CR9","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":"16_CR10","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":"16_CR11","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":"16_CR12","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., 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":"16_CR13","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":"16_CR14","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":"16_CR15","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":"16_CR16","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)"},{"key":"16_CR17","volume-title":"26th STACS","author":"A. Finkel","year":"2009","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for\u00a0WSTS, part\u00a0I: Completions. In: 26th STACS, Freiburg, Germany. Springer, Heidelberg (to appear, 2009)"},{"issue":"1-2","key":"16_CR18","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\u20132","key":"16_CR19","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\u20132), 63\u201392 (2001)","journal-title":"Theoretical Computer Science"},{"key":"16_CR20","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: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 49\u201364. Springer, Heidelberg (2005)"},{"issue":"1","key":"16_CR21","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":"16_CR22","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)"},{"key":"16_CR23","volume-title":"Encyclopedia of Mathematics and its Applications","author":"G. Gierz","year":"2003","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, Cambridge (2003)"},{"issue":"2","key":"16_CR24","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":"16_CR25","first-page":"453","volume-title":"22nd LICS","author":"J. Goubault-Larrecq","year":"2007","unstructured":"Goubault-Larrecq, J.: On Noetherian spaces. In: 22nd LICS, Wroc\u0142aw, Poland, pp. 453\u2013462. IEEE Computer Society Press, Los Alamitos (2007)"},{"issue":"5\u20136","key":"16_CR26","doi-asserted-by":"crossref","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\u20136), 155\u2013160 (1999)","journal-title":"Information Processing Letters"},{"issue":"2","key":"16_CR27","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"},{"issue":"3","key":"16_CR28","first-page":"251","volume":"88","author":"R. Lazi\u010d","year":"2008","unstructured":"Lazi\u010d, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundamenta Informaticae\u00a088(3), 251\u2013274 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1112\/S0025579300000565","volume":"1","author":"R. Rado","year":"1954","unstructured":"Rado, R.: Partial well-ordering of sets of vectors. Mathematika\u00a01, 89\u201395 (1954)","journal-title":"Mathematika"},{"key":"16_CR30","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, vol.\u00a062, pp. 464\u2013476. Springer, Heidelberg (1978)"},{"issue":"1","key":"16_CR31","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"}],"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-642-02930-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T16:44:42Z","timestamp":1739205882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}