Computable processes and bisimulation equivalence

DOI10.1007/BF01213493zbMath0862.68052MaRDI QIDQ2365394

Alban Ponse

Publication date: 1996

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

transition systemfinite branching

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computable processes and bisimulation equivalence