Tree Process Calculus
From MaRDI portal
Publication:5415625
DOI10.1016/j.entcs.2008.04.067zbMath1286.68346OpenAlexW2037313939MaRDI QIDQ5415625
Mingren Chai, Ying Jiang, Nan Qu
Publication date: 13 May 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.067
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
- A complete inference system for a class of regular behaviours
- A complete axiomatisation for observational congruence of finite-state behaviours
- Bisimulations for a calculus of broadcasting systems
- BISIMULATION MINIMIZATION OF TREE AUTOMATA
- A Prospectus for Mobile Broadcasting Systems
This page was built for publication: Tree Process Calculus