A complete rule for equifair termination

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

zbMATH Keywords

concurrencynondeterminismequifairness

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

Infinite trees, markings, and well-foundedness ⋮ Appraising fairness in languages for distributed programming

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item