Origins of bisimulation and coinduction
From MaRDI portal
Publication:5411640
DOI10.1017/CBO9780511792588.002zbMath1285.68112MaRDI QIDQ5411640
Publication date: 24 April 2014
Published in: Advanced Topics in Bisimulation and Coinduction (Search for Journal in Brave)
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) History of computer science (68-03)
Related Items (10)
Deciding the Bisimilarity Relation between Datalog Goals ⋮ Unnamed Item ⋮ Coalgebras in functional programming and type theory ⋮ Weighted modal transition systems ⋮ The \(C_\pi\)-calculus: a model for confidential name passing ⋮ The fixed-point theory of strictly causal functions ⋮ ``Backward coinduction, Nash equilibrium and the rationality of escalation ⋮ Weak models of distributed computing, with connections to modal logic ⋮ On Characterization, Definability and ω-Saturated Models ⋮ Refinement in hybridised institutions
This page was built for publication: Origins of bisimulation and coinduction
