A calculus of branching processes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2019

A calculus of branching processes

Résumé

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.
Fichier principal
Vignette du fichier
cbp.pdf (4.39 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02357975 , version 1 (25-08-2020)

Identifiants

Citer

Thomas Ehrhard, Jean Krivine, Ying Jiang. A calculus of branching processes. Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2019.06.028⟩. ⟨hal-02357975⟩
48 Consultations
27 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More