An algebraic theory of fair asynchronous communicating processes

DOI10.1016/0304-3975(87)90004-1zbMath0612.68026OpenAlexW2048399275MaRDI QIDQ1088403

Matthew C. B. Hennessy

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90004-1

zbMATH Keywords

denotational semanticsfair asynchronous communicating processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

A fixpoint approach to finite delay and fairness, Fairness and communication-based semantics for session-typed languages, Semantics for finite delay, Unnamed Item, Divergence and fair testing, Fair simulation, Strong fairness and full abstraction for communicating processes, Fair simulation, Fair Π

Cites Work

• Proof rules and transformations dealing with fairness
• A calculus of communicating systems
• Testing equivalences for processes
• Synchronous and asynchronous experiments on processes
• Acceptance trees
• Unnamed Item
• Unnamed Item
• Unnamed Item