A fixpoint approach to finite delay and fairness
From MaRDI portal
Publication:1129259
DOI10.1016/S0304-3975(97)00076-5zbMath0911.68101MaRDI QIDQ1129259
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Cites Work
- A fair calculus of communicating systems
- Axiomatising finite delay operators
- An algebraic theory of fair asynchronous communicating processes
- Duality for modal \(\mu\)-logics
- Fixed point characterization of infinite behavior of finite-state systems
- Semantics for finite delay
- Weak and strong fairness in CCS
- Concurrent testing of processes
- Terminal coalgebras in well-founded set theory
- A domain equation for bisimulation
- Algebraic laws for nondeterminism and concurrency
- A final coalgebra theorem
- Final universes of processes
- Nonwellfounded sets and programming language semantics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item