A calculus of branching processes

DOI10.1016/j.tcs.2019.06.028zbMath1436.68212OpenAlexW2962648229WikidataQ127474999 ScholiaQ127474999MaRDI QIDQ2286743

Ying Jiang, Thomas Ehrhard, Jean Krivine

Publication date: 22 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.028

zbMATH Keywords

process algebraconcurrencytree automataassembly

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-conscious \(\pi\)-calculus -- a model of Pastry
• A theory of processes with localities
• Testing equivalences for processes
• Tree acceptors and some of their applications
• Multiparty Session Types Meet Communicating Automata
• A Process Algebra for Wireless Mesh Networks
• A Distributed Pi-Calculus
• OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: A calculus of branching processes