{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:34:47Z","timestamp":1794357287110,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"value":"9780387096797","type":"print"},{"value":"9780387096803","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-0-387-09680-3_32","type":"book-chapter","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T07:37:14Z","timestamp":1216625834000},"page":"477-489","source":"Crossref","is-referenced-by-count":16,"title":["On Boundedness in Depth in the \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Roland","family":"Meyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1\u20132","key":"32_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"P. A. Abdulla, K. \u0106erans, B. Jonsson, and Y.-K. Tsay. Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation, 160(1\u20132):109\u2013127, 2000.","journal-title":"Information and Computation"},{"issue":"1","key":"32_CR2","first-page":"70","volume":"9","author":"R.M. Amadio","year":"2002","unstructured":"R. M. Amadio and C. Meyssonnier. On decidability of the control reachability problit in the asynchronous $\u03c0$-calculus. Nordic Journal of Computing, 9(1):70\u2013101, 2002.","journal-title":"Nordic Journal of Computing"},{"key":"32_CR3","first-page":"72","volume":"2987","author":"L. Caires","year":"2004","unstructured":"L. Caires. Behavioural and spatial observations in a logic for the \u03c0Calculus. In FOSSACS 2004, volume 2987 of LNCS, pages 72\u201389. Springer-Verlag, 2004.","journal-title":"In FOSSACS 2004"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"M. Dam. Model checking mobile processes. Information and Computation, 129(1):35\u201351, 1996.","journal-title":"Information and Computation"},{"issue":"7","key":"32_CR5","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y. Deng","year":"2006","unstructured":"Y. Deng and D. Sangiorgi. Ensuring termination by typability. Information and Computation, 204(7):1045\u20131082, 2006.","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"32_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(97)00179-5","volume":"211","author":"J. Engelfriet","year":"1999","unstructured":"J. Engelfriet and T. Gelsita. Multisets and structural congruence of the pi-calculus with replication. Theoretical Computer Science, 211(1\u20132):311\u2013337, 1999.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"32_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(99)00330-8","volume":"258","author":"J. Engelfriet","year":"2001","unstructured":"J. Engelfriet and T. Gelsita. Structural inclusion in the pi-calculus with replication. Theoretical Computer Science, 258(1\u20132):131\u2013168, 2001.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"32_CR8","first-page":"385","volume":"40","author":"J. Engelfriet","year":"2004","unstructured":"J. Engelfriet and T. Gelsita. A new natural structural congruence in the pi-calculus with replication. Acta Informatica, 40(6):385\u2013430, 2004.","journal-title":"Acta Informatica"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1145\/990010.990013","volume":"12","author":"G.-L. Ferrari","year":"2003","unstructured":"G.-L. Ferrari, S. Gnesi, U. Montanari, and M. Pistore. A model-checking verification environment for mobile processes. ACM Transactions on Software Engineering and Methodology, 12(4):440\u2013473, 2003.","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144\u2013179, 1990.","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"32_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"A. Finkel and Ph. Schnoebelen. Well-structured transition systits everywhere! Theoretical Computer Science, 256(1\u20132):63\u201392, 2001.","journal-title":"Theoretical Computer Science"},{"key":"32_CR12","unstructured":"A. Habel. Hyperedge Replacitent: Grammars and Languages, volume 643 of LNCS. Springer-Verlag, 1992."},{"issue":"7","key":"32_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3), 2(7):326\u2013336, 1952.","journal-title":"Proc. London Math. Soc. (3)"},{"key":"32_CR14","unstructured":"R. Meyer. A theory of structural stationarity in the \u03c0-calculus. Under revision, 2008."},{"issue":"2","key":"32_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/322123.322134","volume":"26","author":"G. Milne","year":"1979","unstructured":"G. Milne and R. Milner. Concurrent processes and their syntax. JACM, 26(2):302\u2013321, 1979.","journal-title":"JACM"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R. Milner","year":"1979","unstructured":"R. Milner. Flowgraphs and flow algebras. JACM, 26(4):794\u2013818, 1979.","journal-title":"JACM"},{"key":"32_CR17","unstructured":"R. Milner. Communicating and Mobile Systits: the \u03c0-Calculus. Cambridge University Press, 1999."},{"key":"32_CR18","unstructured":"D. Sangiorgi and D. Walker. The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001."},{"issue":"2","key":"32_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N. Yoshida","year":"2004","unstructured":"N. Yoshida, M. Berger, and K. Honda. Strong normalisation in the \u03c0calculus. Information and Computation, 191(2):145\u2013202, 2004.","journal-title":"Information and Computation"}],"container-title":["IFIP International Federation for Information Processing","Fifth Ifip International Conference On Theoretical Computer Science \u2013 Tcs 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09680-3_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:44:38Z","timestamp":1619559878000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-09680-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387096797","9780387096803"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3_32","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-09680-3","asserted-by":"object"}]},"ISSN":["1571-5736"],"issn-type":[{"value":"1571-5736","type":"print"}],"subject":[]}}