Fairness and hyperfairness in multi-party interactions
From MaRDI portal
Publication:1261113
DOI10.1007/BF02242712zbMath0797.68100OpenAlexW2067860865MaRDI QIDQ1261113
Nissim Francez, Orna Grumberg, Paul C. Attie
Publication date: 16 September 1993
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242712
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Distributed algorithms (68W15)
Related Items (8)
Generating non-conspiratorial executions ⋮ Appraising fairness in languages for distributed programming ⋮ Model checking with fairness assumptions using PAT ⋮ A distributed synchronization scheme for fair multi-process handshakes ⋮ Fairness and hyperfairness ⋮ Action systems in incremental and aspect-oriented modeling ⋮ On equivalence-completions of fairness assumptions ⋮ On fairness notions in distributed systems. I: A characterization of implementability
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof rules and transformations dealing with fairness
- Script: A communication abstraction mechanism and its verification
- Two normal form theorems for CSP programs
- Appraising fairness in languages for distributed programming
- The multiway rendezvous
- Distributed cooperation with action systems
- Communicating sequential processes
- A Methodology for Developing Distributed Programs
This page was built for publication: Fairness and hyperfairness in multi-party interactions