{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T11:50:58Z","timestamp":1791287458102,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642401831","type":"print"},{"value":"9783642401848","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40184-8_14","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T01:50:56Z","timestamp":1374544256000},"page":"182-196","source":"Crossref","is-referenced-by-count":9,"title":["A Theory of Name Boundedness"],"prefix":"10.1007","author":[{"given":"Reiner","family":"H\u00fcchting","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roland","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","first-page":"70","volume":"9","author":"R. Amadio","year":"2002","unstructured":"Amadio, R., Meyssonnier, C.: On decidability of the control reachability problem in the asynchronous \u03c0-calculus. Nord. J. Comp.\u00a09(1), 70\u2013101 (2002)","journal-title":"Nord. J. Comp."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, K., Koskinen, E., Wies, T., Zufferey, D.: Structural counter abstraction. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol.\u00a07795, pp. 62\u201377. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-36742-7_5"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.jlap.2008.08.002","volume":"78","author":"N. Busi","year":"2009","unstructured":"Busi, N., Gorrieri, R.: Distributed semantics for the \u03c0-calculus based on Petri nets with inhibitor arcs. J. Log. Alg. Prog.\u00a078(1), 138\u2013162 (2009)","journal-title":"J. Log. Alg. Prog."},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1017\/S0960129509990181","volume":"19","author":"N. Busi","year":"2009","unstructured":"Busi, N., Zavattaro, G.: Deciding reachability problems in Turing-complete fragments of Mobile Ambients. Math. Struct. Comp. Sci.\u00a019(6), 1223\u20131263 (2009)","journal-title":"Math. Struct. Comp. Sci."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1006\/inco.1996.0072","volume":"129","author":"M. Dam","year":"1996","unstructured":"Dam, M.: Model checking mobile processes. Inf. Comp.\u00a0129(1), 35\u201351 (1996)","journal-title":"Inf. Comp."},{"issue":"4-5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00165-008-0079-2","volume":"20","author":"R. Devillers","year":"2008","unstructured":"Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general \u03c0-calculus terms. For. Asp. Comp.\u00a020(4-5), 429\u2013450 (2008)","journal-title":"For. Asp. Comp."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-31131-4_2","volume-title":"Application and Theory of Petri Nets","author":"A. Finkel","year":"2012","unstructured":"Finkel, A., Goubault-Larrecq, J.: The\u00a0theory of\u00a0WSTS: The\u00a0case of complete\u00a0WSTS. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol.\u00a07347, pp. 3\u201331. Springer, Heidelberg (2012)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-23217-6_25","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"C. He","year":"2011","unstructured":"He, C.: The decidability of the reachability problem for CCS! In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 373\u2013388. Springer, Heidelberg (2011)"},{"issue":"2","key":"14_CR9","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. Comput. Syst. Sci.\u00a03(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR10","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Technical report, Yale University, Department of Computer Science (1976)"},{"issue":"3","key":"14_CR11","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. JACM\u00a028(3), 561\u2013576 (1981)","journal-title":"JACM"},{"key":"14_CR12","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the \u03c0-calculus. In: IFIP TCS. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00236-009-0091-x","volume":"46","author":"R. Meyer","year":"2009","unstructured":"Meyer, R.: A theory of structural stationarity in the \u03c0-calculus. Acta Inf.\u00a046(2), 87\u2013137 (2009)","journal-title":"Acta Inf."},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-04081-8_31","volume-title":"CONCUR 2009 - Concurrency Theory","author":"R. Meyer","year":"2009","unstructured":"Meyer, R., Gorrieri, R.: On the relationship between \u03c0-calculus and finite place\/transition Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 463\u2013480. Springer, Heidelberg (2009)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-32940-1_31","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"R. Meyer","year":"2012","unstructured":"Meyer, R., Khomenko, V., H\u00fcchting, R.: A polynomial translation of \u03c0-calculus (FCP) to safe Petri nets. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 440\u2013455. Springer, Heidelberg (2012)"},{"key":"14_CR16","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. CUP (1999)"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-60218-6_4","volume-title":"CONCUR \u201995 Concurrency Theory","author":"U. Montanari","year":"1995","unstructured":"Montanari, U., Pistore, M.: Checking bisimilarity for finitary \u03c0-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 42\u201356. Springer, Heidelberg (1995)"},{"issue":"2","key":"14_CR18","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. Comp. Sci.\u00a06(2), 223\u2013231 (1978)","journal-title":"Theor. Comp. Sci."},{"key":"14_CR19","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. CUP (2001)"},{"key":"14_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2013 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40184-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T17:57:04Z","timestamp":1547834224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40184-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401831","9783642401848"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40184-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}