scientific article; zbMATH DE number 7649943

DOI10.4230/LIPIcs.CONCUR.2019.35MaRDI QIDQ5875397

Lutz Schröder, Daniel Hausmann

Publication date: 3 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\mu\)-calculusparity gamesmodel checkingcoalgebraic logicprobabilistic \(\mu\)-calculusgraded \(\mu\)-calculus

Mathematics Subject Classification ID

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

Related Items (1)

Quasipolynomial computation of nested fixpoints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Local model checking in the modal mu-calculus
• Finality regained: A coalgebraic study of Scott-sets and multisets
• Universal coalgebra: A theory of systems
• Parity games and automata for game logic
• Automata, logics, and infinite games. A guide to current research
• Optimal satisfiability checking for arithmetic \(\mu\)-calculi
• Lattice-theoretic progress measures and coalgebraic model checking
• EXPTIME Tableaux for the Coalgebraic mu-Calculus
• Alternating-time temporal logic
• Enriched MU-Calculi Module Checking
• Flat Coalgebraic Fixed Point Logics
• EXPTIME Tableaux for the Coalgebraic μ-Calculus
• Concurrent dynamic logic
• A Modal Logic for Coalitional Power in Games
• Parity Automata for Quantitative Linear Time Logics
• Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras
• Deciding parity games in quasipolynomial time
• STRONG COMPLETENESS OF COALGEBRAIC MODAL LOGICS
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: