Fixpoint semantics and simulation

DOI10.1016/S0304-3975(98)00176-5zbMath0944.68192MaRDI QIDQ1575253

A. Thijs, Wim H. Hesselink

Publication date: 21 August 2000

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

zbMATH Keywords

simulationrecursionmodelfixpoint semantics

Mathematics Subject Classification ID

Related Items (14)

Identifying all preorders on the subdistribution monad ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Relation lifting, a survey ⋮ Bisimulation as a logical relation ⋮ Streams of approximations, equivalence of recursive effectful programs ⋮ Runners for interleaving algebraic effects ⋮ Unifying wp and wlp ⋮ Codensity Lifting of Monads and its Dual ⋮ A general account of coinduction up-to ⋮ Transitivity and Difunctionality of Bisimulations ⋮ Simulations in coalgebra ⋮ A coalgebraic presentation of structured transition systems ⋮ A modular approach to defining and characterising notions of simulation ⋮ Fixpoint semantics and simulation

Cites Work

• Deadlock and fairness in morphisms of transition systems
• Fixpoint semantics and simulation
• Category theory and computer science. Manchester, UK, September 5--8, 1989. Proceedings
• Programs, Recursion and Unbounded Choice
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fixpoint semantics and simulation