Deadlock and fairness in morphisms of transition systems
From MaRDI portal
Publication:1105379
DOI10.1016/0304-3975(88)90143-0zbMath0648.68070OpenAlexW2078259946MaRDI QIDQ1105379
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/14954983/1988ThCompSciHesselink2.pdf
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items
Interpretations of recursion under unbounded nondeterminacy, Processes and formalisms for unbounded choice, Splitting forward simulations to cope with liveness, Fixpoint semantics and simulation
Cites Work
- Fair termination revisited - with delay
- Proof rules and transformations dealing with fairness
- Interpretations of recursion under unbounded nondeterminacy
- Trace theory and VLSI design
- Proving Liveness Properties of Concurrent Programs
- Formal verification of parallel programs
- A mathematical approach to nondeterminism in data types
- Programming as a Discipline of Mathematical Nature
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
