A Concurrent Pattern Calculus

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.

Logical Methods in Computer Science (2014)

References in corpus (2)

• Psi-calculi: a framework for mobile processes with nominal data and logic
• Formalising the pi-calculus using nominal logic

Cited by in corpus (6)

• On the Expressiveness of Intensional Communication
• An Intensional Concurrent Faithful Encoding of Turing Machines
• On the Expressiveness of Joining
• A Formal Approach to the Engineering of Domain-Specific Distributed Systems
• Expressiveness via Intensionality and Concurrency
• Confusion in the Church-Turing Thesis