A concurrent pattern calculus

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Concurrent pattern calculus (CPC) drives interaction between processes by comparing data structures, just as sequential pattern calculus drives computation. By generalising from pattern matching to pattern unification, interaction becomes symmetrical, with information flowing in both directions. CPC provides a natural language to express trade where information exchange is pivotal to interaction. The unification allows some patterns to be more discriminating than others; hence, the behavioural theory must take this aspect into account, so that bisimulation becomes subject to compatibility of patterns. Many popular process calculi can be encoded in CPC; this allows for a gain in expressiveness, formalised through encodings. © T. Given-Wilson, D. Gorla, and B. Jay.

Cite

CITATION STYLE

APA

Given-Wilson, T., Gorla, D., & Jay, B. (2014). A concurrent pattern calculus. Logical Methods in Computer Science, 10(3). https://doi.org/10.2168/LMCS-10(3:10)2014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free