Basic process algebra with deadlocking states
From MaRDI portal
Publication:5958771
DOI10.1016/S0304-3975(00)00290-5zbMath0992.68146MaRDI QIDQ5958771
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00290-5
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Undecidability of bisimilarity for Petri nets and some related problems
- Algebra of communicating processes with abstraction
- A short proof of the decidability of bisimulation for normed BPA- processes
- Undecidable equivalences for basic process algebra
- On deciding readiness and failure equivalences for processes
- Bisimulation equivalence is decidable for all context-free processes
- Decidability of bisimulation equivalence for process generating context-free languages
- An elementary bisimulation decision procedure for arbitrary context-free processes
- Bisimulation equivalence is decidable for one-counter processes
- Infinite results
- Bisimulation collapse and the process taxonomy