Semantics for finite delay

DOI10.1016/S0304-3975(96)00095-3zbMath0903.68119MaRDI QIDQ1392281

Chrysafis Hartonas

Publication date: 23 July 1998

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

zbMATH Keywords

fair bisimilarity

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (2)

Duality for modal \(\mu\)-logics ⋮ A fixpoint approach to finite delay and fairness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculi for synchrony and asynchrony
• Axiomatising finite delay operators
• An algebraic theory of fair asynchronous communicating processes
• Synchronization trees
• Testing equivalences for processes
• Terminal coalgebras in well-founded set theory
• Algebraic laws for nondeterminism and concurrency
• Acceptance trees
• A term model for synchronous processes
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• A coinductive calculus of streams
• A final coalgebra theorem
• Final universes of processes
• Nonwellfounded sets and programming language semantics

This page was built for publication: Semantics for finite delay