Bisimulation proof methods in a path-based specification language for polynomial coalgebras

DOI10.1017/S0960129513000030MaRDI QIDQ5740639zbMATH OpenFDO

Authors Xiaocong Zhou, Yong-Ji Li, Wen-Jun Li, Haiyan Qiao, Zhongmei Shu

Publication date 27 July 2016

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0960129513000030

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• An effective coalgebraic bisimulation proof method
• Enhanced coalgebraic bisimulation
• Coalgebraic bisimulation-up-to
• scientific article; zbMATH DE number 2196590
• On path-based coalgebras and weak notions of bisimulation

Cites work

• A modal proof theory for final polynomial coalgebras
• A relationship between equilogical spaces and type two effectivity
• Bisimulations generated from corecursive equations
• Coalgebraic logic
• Coalgebraic modal logic: soundness, completeness and decidability of local consequence
• Coalgebraic semantics of modal logics: an overview
• Coalgebras in functional programming and type theory
• From modal logic to terminal coalgebras
• Generalised coinduction
• Many-sorted coalgebraic modal logic: A model-theoretic study
• Observational ultraproducts of polynomial coalgebras.
• On the bisimulation proof method
• Simulations in coalgebra
• Specifying coalgebras with modal logic
• Universal coalgebra: A theory of systems

This page was built for publication: Bisimulation proof methods in a path-based specification language for polynomial coalgebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740639)