Abstract
Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication mechanism is based on a powerful form of symmetric pattern unification. However, the richness of patterns and their unification entails some flexibility in the challenge-reply game that underpins bisimulation. This leads to an ordering upon patterns that is used to define the valid replies to a given challenge. Such a theory can be smoothly adapted to accomplish other, less symmetric, forms of pattern matching (e.g. those of Linda, polyadic π-calculus, and π-calculus with polyadic synchronization) without compromising the coincidence of the two equivalences.
Chapter PDF
References
Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. of POPL, pp. 104–115. ACM (2001)
Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999)
Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195(2), 291–324 (1998)
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 7(1) (2011)
Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM J. Comput. 31(3), 947–986 (2001)
Buscemi, M.G., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 254–268. Springer, Heidelberg (2008)
Busi, N., Gorrieri, R., Zavattaro, G.: A process algebraic view of linda coordination primitives. Theoretical Computer Science 192(2), 167–199 (1998)
Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nordic Journal on Computing 10(2), 70–98 (2003)
Castagna, G.: Patterns and types for querying xml documents. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 1–26. Springer, Heidelberg (2005)
Ciancarini, P., Gorrieri, R., Zavattaro, G.: Towards a calculus for generative communication. In: Proc. of FMOODS, pp. 283–297. Chapman & Hall (1996)
de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in process algebra. In: Proc. of LICS, pp. 137–147. IEEE (1992)
De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. Information and Computation 205(10), 1491–1525 (2007)
De Nicola, R., Pugliese, R.: A process algebra based on linda. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061, pp. 160–178. Springer, Heidelberg (1996)
Fournet, C., Gonthier, G.: The reflexive cham and the join-calculus. In: Proc. of POPL, pp. 372–385. ACM Press, New York (1996)
Fournet, C., Laneve, C.: Bisimulations in the join-calculus. Theoretical Computer Science 266(1-2), 569–603 (2001)
Gelernter, D.: Generative communication in LINDA. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)
Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 244–258. Springer, Heidelberg (2010)
Given-Wilson, T.: Concurrent pattern unification (2012), http://www.progsoc.org/~sanguinev/files/GivenWilson-PhD-simple.pdf
Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus (extended version), http://wwwusers.di.uniroma1.it/~gorla/papers/cpc-full.pdf
Given-Wilson, T., Gorla, D., Jay, B.: Concurrent pattern calculus. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol. 323, pp. 244–258. Springer, Heidelberg (2010)
Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 151(2), 437–486 (1995)
Hosoya, H., Pierce, B.: Regular expression pattern matching for XML. Journal of Functional Programming 13(6), 961–1004 (2003)
Jay, B., Given-Wilson, T.: A combinatory account of internal structure. Journal of Symbolic Logic 76(3), 807–826 (2011)
Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)
Milner, R.: The polyadic π-calculus: A tutorial. In: Logic and Algebra of Specification. Series F, NATO ASI, vol. 94. Springer (1993)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I/II. Information and Computation 100, 1–77 (1992)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc. of LICS, pp. 176–185. IEEE Computer Society (1998)
Sangiorgi, D.: A theory of bisimulation for the pi-calculus. Acta Informatica 33(1), 69–97 (1996)
Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. ACM Trans. Program. Lang. Syst. 33(1), 5 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 IFIP International Federation for Information Processing
About this paper
Cite this paper
Given-Wilson, T., Gorla, D. (2013). Pattern Matching and Bisimulation. In: De Nicola, R., Julien, C. (eds) Coordination Models and Languages. COORDINATION 2013. Lecture Notes in Computer Science, vol 7890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38493-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-38493-6_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38492-9
Online ISBN: 978-3-642-38493-6
eBook Packages: Computer ScienceComputer Science (R0)