A calculus of branching processes

Abstract 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 a la CCS and calculi with dynamic connectivity such as the π-calculus.

[1]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[2]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[3]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

[4]  Nobuko Yoshida,et al.  Multiparty Session Types Meet Communicating Automata , 2012, ESOP.

[5]  Ugo Montanari,et al.  Network-Conscious π-calculus - A Model of Pastry , 2014, LSFA.

[6]  Ilaria Castellani,et al.  A non-interleaving semantics for CCS based on proved transitions , 1988 .

[7]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[8]  Javier Esparza,et al.  Reachability Analysis of Multithreaded Software with Asynchronous Communication , 2005, FSTTCS.

[9]  Matthew Hennessy,et al.  A theory of processes with localities , 1992 .

[10]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[11]  Frédéric Peschanski,et al.  A stackless runtime environment for a Pi-calculus , 2006, VEE '06.

[12]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[13]  Annabelle McIver,et al.  A Process Algebra for Wireless Mesh Networks , 2012, ESOP.

[14]  Matthew Hennessy,et al.  A distributed Pi-calculus , 2007 .

[15]  Cédric Fournet,et al.  The reflexive CHAM and the join-calculus , 1996, POPL '96.

[16]  Cédric Fournet,et al.  The Join Calculus: A Language for Distributed Mobile Programming , 2000, APPSEM.

[17]  Ilaria Castellani.  Observing Distribution in Processes: Static and Dynamic Localities , 1995, Int. J. Found. Comput. Sci..