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.
Type de document :
Communication dans un congrès
Rocco Nicola; Christine Julien. 15th International Conference on Coordination Models and Languages (COORDINATION), Jun 2013, Florence, Italy. Springer, Lecture Notes in Computer Science, LNCS-7890, pp.60-74, 2013, Coordination Models and Languages. 〈10.1007/978-3-642-38493-6_5〉
Liste complète des métadonnées

Littérature citée [30 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01486035
Contributeur : Hal Ifip <>
Soumis le : jeudi 9 mars 2017 - 15:53:11
Dernière modification le : jeudi 9 mars 2017 - 17:00:11
Document(s) archivé(s) le : samedi 10 juin 2017 - 14:31:02

Fichier

978-3-642-38493-6_5_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Thomas Given-Wilson, Daniele Gorla. Pattern Matching and Bisimulation. Rocco Nicola; Christine Julien. 15th International Conference on Coordination Models and Languages (COORDINATION), Jun 2013, Florence, Italy. Springer, Lecture Notes in Computer Science, LNCS-7890, pp.60-74, 2013, Coordination Models and Languages. 〈10.1007/978-3-642-38493-6_5〉. 〈hal-01486035〉

Partager

Métriques

Consultations de la notice

35

Téléchargements de fichiers

23