{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:42Z","timestamp":1774987902117,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642120312","type":"print"},{"value":"9783642120329","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_8","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"94-108","source":"Crossref","is-referenced-by-count":25,"title":["Forward Analysis of Depth-Bounded Processes"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Wies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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","key":"8_CR2","first-page":"70","volume":"9","author":"R.M. Amadio","year":"2002","unstructured":"Amadio, R.M., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous pi-calculus. Nord. J. Comput.\u00a09(1), 70\u2013101 (2002)","journal-title":"Nord. J. Comput."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, J., Wilhelm, R.: Static analysis of dynamic communication systems by partner abstraction. In: SAS, pp. 249\u2013264 (2007)","DOI":"10.1007\/978-3-540-74061-2_16"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45061-0_12","volume-title":"Automata, Languages and Programming","author":"N. Busi","year":"2003","unstructured":"Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. recursive definitions in channel based calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 133\u2013144. Springer, Heidelberg (2003)"},{"key":"8_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2008), http:\/\/tata.gforge.inria.fr\/ (release November 18, 2008)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-57208-2_3","volume-title":"CONCUR\u201993","author":"M. Dam","year":"1993","unstructured":"Dam, M.: Model checking mobile processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 22\u201336. Springer, Heidelberg (1993)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"8_CR9","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. Inf. Comput.\u00a089(2), 144\u2013179 (1990)","journal-title":"Inf. Comput."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: STACS. Dagstuhl Sem. Proc., vol.\u00a009001, pp. 433\u2013444 (2009)","DOI":"10.1007\/978-3-642-02930-1_16"},{"key":"8_CR11","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 II: 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)"},{"issue":"1-2","key":"8_CR12","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! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR13","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. Comput. Syst. Sci.\u00a072(1), 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0022-0000(93)90049-3","volume":"46","author":"D. Janssens","year":"1993","unstructured":"Janssens, D., Lens, M., Rozenberg, G.: Computation graphs for actor grammars. J. Comput. Syst. Sci.\u00a046(1), 60\u201390 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR15","doi-asserted-by":"crossref","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. Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"89","DOI":"10.2307\/1970754","volume":"93","author":"R. Laver","year":"1971","unstructured":"Laver, R.: On Fra\u00efss\u00e9\u2019s Order Type Conjecture. Ann. of Math.\u00a093(1), 89\u2013111 (1971)","journal-title":"Ann. of Math."},{"key":"8_CR17","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical Report\u00a062, Yale University (1976)"},{"key":"8_CR18","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-642-04081-8_31","volume-title":"CONCUR 2009 - Concurrency Theory","author":"Roland Meyer","year":"2009","unstructured":"Meyer, R., Gorrieri, R.: On the relationship between pi-calculus and finite place\/transition petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 463\u2013480. Springer, Heidelberg (2009)"},{"issue":"4","key":"8_CR20","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R. Milner","year":"1979","unstructured":"Milner, R.: Flowgraphs and flow algebras. J. ACM\u00a026(4), 794\u2013818 (1979)","journal-title":"J. ACM"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Inf. Comput.\u00a0100(1), 1\u201340 (1992)","journal-title":"Inf. Comput."},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, II. Inf. Comput.\u00a0100(1), 41\u201377 (1992)","journal-title":"Inf. Comput."},{"key":"8_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1017\/S030500410004281X","volume":"64","author":"C.S.J.A. Nash-Williams","year":"1968","unstructured":"Nash-Williams, C.S.J.A.: On better-quasi-ordering transfinite sequences. Proc. Camb. Phil. Soc.\u00a064, 273\u2013290 (1968)","journal-title":"Proc. Camb. Phil. Soc."},{"issue":"6","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ejc.2005.01.010","volume":"27","author":"J. Ne\u0161et\u0159il","year":"2006","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Tree-depth, subgraph coloring and homomorphism bounds. Eur. J. Comb.\u00a027(6), 1022\u20131041 (2006)","journal-title":"Eur. J. Comb."},{"key":"8_CR25","unstructured":"Ostrovsk\u00fd, K.: On Modelling and Analysing Concurrent Systems. PhD thesis, Chalmers University of Technology and Goteb\u00f6rg University (2005)"},{"issue":"1&2","key":"8_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","volume":"167","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: pi-calculus, internal mobility, and agent-passing calculi. Theor. Comput. Sci.\u00a0167(1&2), 235\u2013274 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T01:38:45Z","timestamp":1739929125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}