A fixpoint approach to finite delay and fairness

DOI10.1016/S0304-3975(97)00076-5zbMath0911.68101OpenAlexW1975412146MaRDI QIDQ1129259

Chrysafis Hartonas

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00076-5

zbMATH Keywords

fairnessantifoundationfinite delaymixed fixpoints

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Duality for modal \(\mu\)-logics ⋮ A Logical Process Calculus

Cites Work

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

This page was built for publication: A fixpoint approach to finite delay and fairness