A fair calculus of communicating systems

DOI10.1007/BF00271640zbMath0538.68014OpenAlexW1998502978MaRDI QIDQ793508

Colin Stirling, Gerardo Costa

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00271640

zbMATH Keywords

fairnessCCSconcurrent languagefinite and infinite execution sequences

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

About fair asynchrony, On the consistency of Koomen's fair abstraction rule, An introduction to the regular theory of fairness, A fixpoint approach to finite delay and fairness, Keep it fair: equivalence and composition, Ensuring liveness properties of distributed systems: open problems, Fairness of components in system computations, Modal logics for communicating systems, CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions, Fair Π

Cites Work

• Proof rules and transformations dealing with fairness
• Calculi for synchrony and asynchrony
• Axiomatising finite delay operators
• A calculus of communicating systems
• Proving Liveness Properties of Concurrent Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item