##
Pattern Matching and Bisimulation

###
Thomas Given-Wilson and Daniele Gorla

__Paper__
appeared in the *15th Intern. conference on Coordination Models and Languages*
(COORDINATION 2013), Florence (Italy), June 3rd-5th, 2013.

__Long version__.

**Abstract:**

Concurrent Pattern Calculus (CPC) is a minimal calculus whose communication
mechanism is based on a powerful form of symmetric pattern unification.
CPC's behavioural theory can be developed in the usual manner,
by defining a barbed congruence and then capturing this via a labelled bisimulation based equivalence.
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 pi-calculus,
and pi-calculus with polyadic synchronization)
without compromising the coincidence of the two equivalences.

@InProceedings{GG:COORD13,
author = {T. Given-Wilson and D. Gorla},
title = {Pattern Matching and Bisimulation},
editor = {Rocco {De Nicola} and Christine Julien},
booktitle = {Proc. of 15th International Conference on Coordination Models and Languages (COORDINATION 2013)},
series = {LNCS},
volume = {7890},
pages = {60 -- 74},
year = {2013},
publisher = {Springer},
}

Home page /
Publications