A calculus of branching processes

CCS-like calculi can be viewed as an extension of classical automata with communication primitives. We are interested here to follow this principle, applied to tree-automata. It naturally yields a calculus of branching processes (CBP), where the continuations of communications are allowed to branch...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2020-02, Vol.807, p.169-184
Main Authors: Ehrhard, Thomas, Krivine, Jean, Jiang, Ying
Format: Article
Language:English
Subjects:
Assembly
Computer Science
Concurrency
Logic in Computer Science
Process algebra
Tree automata
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:CCS-like calculi can be viewed as an extension of classical automata with communication primitives. We are interested here to follow this principle, applied to tree-automata. It naturally yields a calculus of branching processes (CBP), where the continuations of communications are allowed to branch according to the arity of the communication channel. After introducing the calculus with a reduction semantics we show that CBP can be “implemented” by a fully compositional LTS semantics. We argue that CBP offers an interesting tradeoff between calculi with a fixed communication topology à la CCS and calculi with dynamic connectivity such as the π-calculus.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2019.06.028