Bisimulation, modal logic and model checking games

DOI10.1093/jigpal/7.1.103zbMath0920.03034OpenAlexW2083896385MaRDI QIDQ4238502

Colin Stirling

Publication date: 9 September 1999

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1f4abe75c97537f3853bcfe1b861d1076d64279e

zbMATH Keywords

modal logicfixed pointmodel checkingtemporal logicgamesHennessy-Milner logicmodal mu-calculusbisimulation equivalencealgebraic languageproperty checkingmodelling of concurrent systems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Combinatorial games (91A46)

Related Items

RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES, Parity game reductions, Deciding Parity Games in Quasi-polynomial Time, Entanglement and the complexity of directed graphs, ERRATUM: "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES", Undecidability of domino games and hhp-bisimilarity., Fixpoint Theory -- Upside Down, Unnamed Item, Proof and refutation in MALL as a game, First-order reasoning for higher-order concurrency, On the determinacy of concurrent games on event structures with infinite winning sets, (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras, On the computational complexity of bisimulation, redux, Unnamed Item, Unnamed Item, On Global Model Checking Trees Generated by Higher-Order Recursion Schemes, Deciding probabilistic bisimilarity distance one for probabilistic automata