Precongruences and parametrized coinduction for logics for behavioral equivalence

DOI10.4230/LIPICS.CALCO.2017.23MaRDI QIDQ4580219zbMATH OpenFDO

Authors David Sprunger, Lawrence S. Moss

Publication date 13 August 2018

zbMATH Keywords

coalgebrabehavioural equivalenceprecongruencefinitary functorkernel bisimulation

Mathematics Subject Classification ID

Logic in computer science (03B70) Categorical logic, topoi (03G30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Special properties of functors (faithful, full, etc.) (18A22)

Recommendations

• A Complete Logic for Behavioural Equivalence in Coalgebras of Finitary Set Functors
• A complete logic for behavioural equivalence in coalgebras of finitary set functors
• Coequational logic for finitary functors
• Characterising behavioural equivalence: Three sides of one coin
• Expressive logics for coalgebras via terminal sequence induction

Cited in

(3)

• Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
• scientific article; zbMATH DE number 7559481 (Why is no real title available?)
• Proving behavioural apartness

This page was built for publication: Precongruences and parametrized coinduction for logics for behavioral equivalence

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