A note on Coinduction and Weak Bisimilarity for While Programs

DOI10.1051/ita:1999125zbMath0945.68073OpenAlexW2126979663MaRDI QIDQ4943550

Jan J. M. M. Rutten

Publication date: 16 March 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222056

zbMATH Keywords

weak bisimilarity

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (10)

Monads for behaviour ⋮ Adding recursive constructs to bialgebraic semantics ⋮ Trace-Based Coinductive Operational Semantics for While ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Unguarded recursion on coinductive resumptions ⋮ Verification of the correctness of compiler optimization using co-induction ⋮ A coalgebraic approach to Kleene algebra with tests ⋮ Unnamed Item ⋮ Towards Weak Bisimulation For Coalgebras ⋮ A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras

Cites Work

• The equational logic of fixed points
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on Coinduction and Weak Bisimilarity for While Programs