A concurrent pattern calculus

DOI10.2168/LMCS-10(3:10)2014MaRDI QIDQ2878758zbMATH OpenFDO

Authors Thomas Given-Wilson, Daniele Gorla, Barry Jay

Publication date 5 September 2014

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.1546

zbMATH Keywords

behavioural theoryencodingspattern matchingprocess calculi

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Concurrent Pattern Calculus
• Programming Languages and Systems
• Confluence of Pattern-Based Calculi
• Algebraic Pattern Matching in Join Calculus
• CONCUR 2004 - Concurrency Theory

Cited in

(7)

• A typed pattern calculus
• Expressiveness of concurrent intensionality
• Replacement freeness: a criterion for separating process calculi
• Concurrent Pattern Calculus
• On the expressiveness of symmetric communication
• Observability for Pair Pattern Calculi
• A calculus of coroutines

This page was built for publication: A concurrent pattern calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878758)