Model checking games for the quantitative \(\mu \)-calculus

DOI10.1007/s00224-009-9201-yzbMath1205.68243OpenAlexW2015011216MaRDI QIDQ1959394

Łukasz Kaiser, Diana Fischer, Erich Grädel

Publication date: 6 October 2010

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9201-y

zbMATH Keywords

model checkinglogicgamesquantitative logics

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (4)

The mu-calculus and Model Checking ⋮ Unnamed Item ⋮ Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems ⋮ Pebble Weighted Automata and Weighted Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Borel determinacy
• Quantitative solution of omega-regular games
• Model checking discounted temporal properties
• Computing Game Values for Crash Games
• Perfect Information Stochastic Priority Games
• Automata, Languages and Programming
• CONCUR 2003 - Concurrency Theory
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Model checking games for the quantitative \(\mu \)-calculus