Greatest bisimulations for binary methods

DOI10.1016/S1571-0661(04)80371-2MaRDI QIDQ2842564zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Coalgebraic description of generalised binary methods
• Coalgebraic description of generalized binary methods
• Relating coalgebraic notions of bisimulation
• Simulations in coalgebra
• Bisimulation for probabilistic transition systems: a coalgebraic approach

Cites work

• An approach to object semantics based on terminal co-algebras
• Categorical logic and type theory
• Coalgebras for binary methods: Properties of bisimulations and invariants
• From algebras and coalgebras to dialgebras
• scientific article; zbMATH DE number 1314231 (Why is no real title available?)
• scientific article; zbMATH DE number 1086721 (Why is no real title available?)
• Structural induction and coinduction in a fibrational setting
• The coalgebraic class specification language CCSL
• Universal coalgebra: A theory of systems

Cited in

(4)

• Algebraic-coalgebraic specification in CoCASL
• Coalgebraic description of generalized binary methods
• Coalgebraic description of generalised binary methods
• Behavioral abstraction is hiding information

Describes a project that uses

Uses Software

• CCSL
• PVS

This page was built for publication: Greatest bisimulations for binary methods

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