 |
Coordination Models and Languages 15th International Conference, COORDINATION 2013 Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013, Florence, Italy, June 3-5, 2013 |
 |
Conference papers
Pattern Matching and Bisimulation
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.
Cited literature [30 references]
https://hal.inria.fr/hal-01486035
Contributor : Hal Ifip <>
Submitted on : Thursday, March 9, 2017 - 3:53:11 PM
Last modification on : Thursday, March 9, 2017 - 5:00:11 PM
Document(s) archivé(s) le : Saturday, June 10, 2017 - 2:31:02 PM
Contributor : Hal Ifip <>
Submitted on : Thursday, March 9, 2017 - 3:53:11 PM
Last modification on : Thursday, March 9, 2017 - 5:00:11 PM
Document(s) archivé(s) le : Saturday, June 10, 2017 - 2:31:02 PM
File
978-3-642-38493-6_5_Chapter.pd...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License
