Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas

DOI10.1007/978-3-030-57201-3_8MaRDI QIDQ2229232zbMATHOpenAlexFDO

Authors Barbara König, Christina Mika-Michalski, Lutz Schröder

Publication date 22 February 2021

Full work available at URL https://arxiv.org/abs/2002.11459

zbMATH Keywords

coalgebrabisimulation gamesdistinguishing formulasgeneric partition refinement

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• (Metric) bisimulation games and real-valued modal logics for coalgebras
• Deciding all behavioral equivalences at once: a game for linear-time-branching-time spectroscopy
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• A game for linear-time-branching-time spectroscopy
• Simulations and bisimulations for coalgebraic modal logics

Cited in

(5)

• A game for linear-time-branching-time spectroscopy
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
• scientific article; zbMATH DE number 7577583 (Why is no real title available?)
• Explainability of probabilistic bisimilarity distances for labelled Markov chains
• Proving behavioural apartness

This page was built for publication: Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas

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