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. © 2013 IFIP International Federation for Information Processing.
Pattern matching and bisimulation / Thomas Given, Wilson; Gorla, Daniele. - STAMPA. - 7890 LNCS:(2013), pp. 60-74. (Intervento presentato al convegno 15th International Conference on Coordination Models and Languages, COORDINATION 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013 tenutosi a Florence nel 3 June 2013 through 5 June 2013) [10.1007/978-3-642-38493-6_5].
Pattern matching and bisimulation
GORLA, DANIELE
2013
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. © 2013 IFIP International Federation for Information Processing.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
