Game-based local model checking for the coalgebraic -calculus

DOI10.4230/LIPICS.CONCUR.2019.35MaRDI QIDQ5875397zbMATH OpenFDO

Authors Daniel Hausmann, Lutz Schröder

Publication date 3 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2019.35

zbMATH Keywords

\(\mu\)-calculuscoalgebraic logicgraded \(\mu\)-calculusmodel checkingparity gamesprobabilistic \(\mu\)-calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Coalgebraic satisfiability checking for arithmetic -calculi
• EXPTIME Tableaux for the Coalgebraic μ-Calculus
• EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• scientific article; zbMATH DE number 2087626

Cites work

• A Modal Logic for Coalitional Power in Games
• Alternating-time temporal logic
• Automata, logics, and infinite games. A guide to current research
• Concurrent dynamic logic
• Deciding parity games in quasipolynomial time
• Enriched MU-Calculi Module Checking
• EXPTIME tableaux for the coalgebraic \(\mu\)-calculus
• EXPTIME Tableaux for the Coalgebraic μ-Calculus
• Finality regained: A coalgebraic study of Scott-sets and multisets
• scientific article; zbMATH DE number 3880483 (Why is no real title available?)
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 2090317 (Why is no real title available?)
• scientific article; zbMATH DE number 2196601 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Lattice-theoretic progress measures and coalgebraic model checking
• Local model checking in the modal mu-calculus
• Monadic second-order logic and bisimulation invariance for coalgebras
• On model checking for the -calculus and its fragments
• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• Parity Automata for Quantitative Linear Time Logics
• Parity games and automata for game logic
• Results on the propositional \(\mu\)-calculus
• Strong completeness of coalgebraic modal logics
• The fixpoint-iteration algorithm for parity games
• Universal coalgebra: A theory of systems

Cited in

(7)

• Quasipolynomial computation of nested fixpoints
• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• Model-checking games for typed -calculi
• Coalgebraic satisfiability checking for arithmetic -calculi
• Coalgebraic CTL: fixpoint characterization and polynomial-time model checking
• The alternating-time -calculus with disjunctive explicit strategies
• Faster and smaller solutions of obliging games

This page was built for publication: Game-based local model checking for the coalgebraic \(\mu\)-calculus

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