{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:29Z","timestamp":1759637969572,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642384929"},{"type":"electronic","value":"9783642384936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38493-6_5","type":"book-chapter","created":{"date-parts":[[2013,5,10]],"date-time":"2013-05-10T00:45:06Z","timestamp":1368146706000},"page":"60-74","source":"Crossref","is-referenced-by-count":6,"title":["Pattern Matching and Bisimulation"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Given-Wilson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Gorla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. of POPL, pp. 104\u2013115. ACM (2001)","key":"5_CR1","DOI":"10.1145\/373243.360213"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: a framework for mobile processes with nominal data and logic. Logical Methods in Computer Science\u00a07(1) (2011)","key":"5_CR4","DOI":"10.2168\/LMCS-7(1:11)2011"},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M. Boreale","year":"2001","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput.\u00a031(3), 947\u2013986 (2001)","journal-title":"SIAM J. Comput."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-78739-6_20","volume-title":"Programming Languages and Systems","author":"M.G. Buscemi","year":"2008","unstructured":"Buscemi, M.G., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 254\u2013268. Springer, Heidelberg (2008)"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(97)00149-7","volume":"192","author":"N. Busi","year":"1998","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: A process algebraic view of linda coordination primitives. Theoretical Computer Science\u00a0192(2), 167\u2013199 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR8","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nordic Journal on Computing\u00a010(2), 70\u201398 (2003)","journal-title":"Nordic Journal on Computing"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11601524_1","volume-title":"Database Programming Languages","author":"G. Castagna","year":"2005","unstructured":"Castagna, G.: Patterns and types for querying xml documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol.\u00a03774, pp. 1\u201326. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ciancarini, P., Gorrieri, R., Zavattaro, G.: Towards a calculus for generative communication. In: Proc. of FMOODS, pp. 283\u2013297. Chapman & Hall (1996)","key":"5_CR10","DOI":"10.1007\/978-0-387-35082-0_21"},{"doi-asserted-by":"crossref","unstructured":"de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in process algebra. In: Proc. of LICS, pp. 137\u2013147. IEEE (1992)","key":"5_CR11","DOI":"10.1109\/LICS.1992.185528"},{"issue":"10","key":"5_CR12","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1016\/j.ic.2007.03.004","volume":"205","author":"R. Nicola De","year":"2007","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. Information and Computation\u00a0205(10), 1491\u20131525 (2007)","journal-title":"Information and Computation"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-61052-9_45","volume-title":"Coordination Languages and Models","author":"R. De Nicola","year":"1996","unstructured":"De Nicola, R., Pugliese, R.: A process algebra based on linda. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol.\u00a01061, pp. 160\u2013178. Springer, Heidelberg (1996)"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/237721.237805","volume-title":"Proc. of POPL","author":"C. Fournet","year":"1996","unstructured":"Fournet, C., Gonthier, G.: The reflexive cham and the join-calculus. In: Proc. of POPL, pp. 372\u2013385. ACM Press, New York (1996)"},{"issue":"1-2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/S0304-3975(00)00283-8","volume":"266","author":"C. Fournet","year":"2001","unstructured":"Fournet, C., Laneve, C.: Bisimulations in the join-calculus. Theoretical Computer Science\u00a0266(1-2), 569\u2013603 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D. Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative communication in LINDA. ACM Transactions on Programming Languages and Systems\u00a07(1), 80\u2013112 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR17","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15240-5_18","volume-title":"Theoretical Computer Science","author":"T. Given-Wilson","year":"2010","unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 244\u2013258. Springer, Heidelberg (2010)"},{"unstructured":"Given-Wilson, T.: Concurrent pattern unification (2012), http:\/\/www.progsoc.org\/~sanguinev\/files\/GivenWilson-PhD-simple.pdf","key":"5_CR18"},{"unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus (extended version), http:\/\/wwwusers.di.uniroma1.it\/~gorla\/papers\/cpc-full.pdf","key":"5_CR19"},{"key":"5_CR20","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-15240-5_18","volume-title":"Theoretical Computer Science","author":"T. Given-Wilson","year":"2010","unstructured":"Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 244\u2013258. Springer, Heidelberg (2010)"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K. Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science\u00a0151(2), 437\u2013486 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"5_CR22","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1017\/S0956796802004410","volume":"13","author":"H. Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.: Regular expression pattern matching for XML. Journal of Functional Programming\u00a013(6), 961\u20131004 (2003)","journal-title":"Journal of Functional Programming"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"807","DOI":"10.2178\/jsl\/1309952521","volume":"76","author":"B. Jay","year":"2011","unstructured":"Jay, B., Given-Wilson, T.: A combinatory account of internal structure. Journal of Symbolic Logic\u00a076(3), 807\u2013826 (2011)","journal-title":"Journal of Symbolic Logic"},{"issue":"2","key":"5_CR24","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1006\/inco.1994.1037","volume":"110","author":"D. Kozen","year":"1994","unstructured":"Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Information and Computation\u00a0110(2), 366\u2013390 (1994)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Logic and Algebra of Specification. Series F, NATO ASI, vol.\u00a094. Springer (1993)","key":"5_CR25","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"5_CR26","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, part I\/II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"doi-asserted-by":"crossref","unstructured":"Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. of LICS, pp. 176\u2013185. IEEE Computer Society (1998)","key":"5_CR28","DOI":"10.1109\/LICS.1998.705654"},{"issue":"1","key":"5_CR29","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1889997.1890002","volume":"33","author":"D. Sangiorgi","year":"2011","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst.\u00a033(1), 5 (2011)","journal-title":"ACM Trans. Program. Lang. Syst."}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38493-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:25:41Z","timestamp":1746005141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38493-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642384929","9783642384936"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38493-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}