Deadlock and fairness in morphisms of transition systems
- 31 August 1988
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 59 (3) , 235-257
- https://doi.org/10.1016/0304-3975(88)90143-0
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Interpretations of recursion under unbounded nondeterminacyTheoretical Computer Science, 1988
- A mathematical approach to nondeterminism in data typesACM Transactions on Programming Languages and Systems, 1988
- Fair termination revisited—with delayTheoretical Computer Science, 1984
- Proof rules and transformations dealing with fairnessScience of Computer Programming, 1983
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Formal verification of parallel programsCommunications of the ACM, 1976