A concurrent pattern calculus

Publication Type:
Journal Article
Logical Methods in Computer Science, 2014, 10 (3)
Issue Date:
Full metadata record
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.
Please use this identifier to cite or link to this item: