Computable processes and bisimulation equivalence
From MaRDI portal
Publication:2365394
DOI10.1007/BF01213493zbMath0862.68052MaRDI QIDQ2365394
Publication date: 1996
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Related Items (4)
On the expressiveness of choice quantification ⋮ Two finite specifications of a queue ⋮ Linearization in parallel pCRL ⋮ Non-regular iterators in process algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algèbre de processus et synchronisation
- Calculi for synchrony and asynchrony
- Algebra of communicating processes with abstraction
- Higher-level synchronising devices in Meije-SCCS
- On the consistency of Koomen's fair abstraction rule
- Structured operational semantics and bisimulation as a congruence
- CONCUR '94: concurrency theory. 5th International Conference, Uppsala, Sweden, August 22--25, 1994. Proceedings
- ACP '95, international workshop on Algebra of communicating processes. Eindhoven, Netherlands, May 17--18, 1995
- Real time process algebra
- Process algebra for synchronous communication
- Laws of programming
- Process Algebra
- Algebraic Specification of Communication Protocols
This page was built for publication: Computable processes and bisimulation equivalence
