A complete rule for equifair termination
From MaRDI portal
Publication:1088401
DOI10.1016/0022-0000(86)90056-5zbMath0612.68021OpenAlexW2024930796MaRDI QIDQ1088401
Orna Grumberg, Nissim Francez, Shmuel Katz
Publication date: 1986
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(86)90056-5
Related Items (2)
Infinite trees, markings, and well-foundedness ⋮ Appraising fairness in languages for distributed programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair termination revisited - with delay
- Proof rules and transformations dealing with fairness
- Ten years of Hoare's logic: A survey. II: Nondeterminism
- A proof rule for fair termination of guarded commands
- Countable nondeterminism and random assignment
- Guarded commands, nondeterminacy and formal derivation of programs
- Communicating sequential processes
- Programming as a Discipline of Mathematical Nature
This page was built for publication: A complete rule for equifair termination