Greatest Bisimulations for Binary Methods

DOI10.1016/S1571-0661(04)80371-2zbMath1270.68228OpenAlexW2128729570MaRDI QIDQ2842564

Hendrik Tews

Publication date: 15 August 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80371-2

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Algebraic-coalgebraic specification in CoCASL ⋮ Behavioral abstraction is hiding information

Uses Software

• CCSL
• PVS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural induction and coinduction in a fibrational setting
• Categorical logic and type theory
• Universal coalgebra: A theory of systems
• Coalgebras for Binary Methods: Properties of Bisimulations and Invariants
• An approach to object semantics based on terminal co-algebras
• From Algebras and Coalgebras to Dialgebras

This page was built for publication: Greatest Bisimulations for Binary Methods