On equivalence-completions of fairness assumptions

DOI10.1007/BF01211476zbMath0782.68075OpenAlexW2039532842MaRDI QIDQ1205189

Reino Kurki-Suonio, Nissim Francez, Ralph-Johan Back

Publication date: 1 April 1993

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

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

zbMATH Keywords

fairnesspartial order semanticscompletionliveness propertiesequivalence-robustness

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (3)

Generating non-conspiratorial executions ⋮ Action systems in incremental and aspect-oriented modeling ⋮ On fairness notions in distributed systems. II: Equivalence-completions and their hierarchies

Cites Work

• Unnamed Item
• Unnamed Item
• Proof rules and transformations dealing with fairness
• Appraising fairness in languages for distributed programming
• Verification of distributed programs using representative interleaving sequences
• Fairness and hyperfairness in multi-party interactions
• Interleaving set temporal logic
• Distributed cooperation with action systems
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: On equivalence-completions of fairness assumptions