Weak and strong fairness in CCS

DOI10.1016/0890-5401(87)90013-7zbMath0618.68026OpenAlexW2079457432MaRDI QIDQ1822489

Gerardo Costa, Colin Stirling

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90013-7

zbMATH Keywords

parallel systemscommunicating systemsMilner's CCScalculiadmissible execution sequences

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, Event fairness and non-interleaving concurrency, Unnamed Item, Unnamed Item, Divergence and fair testing, Strong fairness and ultra metrics, Compiling and verifying SC-SystemJ programs for safety-critical reactive systems, Ensuring liveness properties of distributed systems: open problems, Fairness of components in system computations, A type system for lock-free processes, Time and Fairness in a Process Algebra with Non-blocking Reading, Fairness of actions in system computations, Liveness of a mutex algorithm in a fair process algebra, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Strong fairness and full abstraction for communicating processes, Fair Π

Cites Work

• Proof rules and transformations dealing with fairness
• Axiomatising finite delay operators
• A calculus of communicating systems
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Algebraic laws for nondeterminism and concurrency
• Proving Liveness Properties of Concurrent Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item