A proof rule for fair termination of guarded commands
Open Access
- 31 August 1985
- journal article
- Published by Elsevier in Information and Control
- Vol. 66 (1-2) , 83-102
- https://doi.org/10.1016/s0019-9958(85)80014-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Fair termination revisited—with delayTheoretical Computer Science, 1984
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Communicating sequential processesCommunications of the ACM, 1978
- A proof method for cyclic programsActa Informatica, 1978
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977