A Concurrent Pattern Calculus

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Logical methods in computer science Ročník 10, Issue 3; číslo 3; s. 1 - 46
Hlavní autoři: Given-Wilson, Thomas, Gorla, Daniele, Jay, Barry
Médium: Journal Article
Jazyk:angličtina
Vydáno: Logical Methods in Computer Science Association 01.01.2014
Logical Methods in Computer Science e.V
Témata:
Computer Science
computer science - formal languages and automata theory
computer science - logic in computer science
Formal Languages and Automata Theory
Logic in Computer Science
Pattern unification
Trade
Expressiveness
Pattern Matching
Concurrency
Process Calculi
ISSN:1860-5974, 1860-5974
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-10(3:10)2014