Pattern Matching and Bisimulation - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Pattern Matching and Bisimulation

(1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
978-3-642-38493-6_5_Chapter.pdf (143.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01486035 , version 1 (09-03-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Thomas Given-Wilson, Daniele Gorla. Pattern Matching and Bisimulation. 15th International Conference on Coordination Models and Languages (COORDINATION), Jun 2013, Florence, Italy. pp.60-74, ⟨10.1007/978-3-642-38493-6_5⟩. ⟨hal-01486035⟩
29 View
51 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More