Model checking games for the quantitative \(\mu \)-calculus
From MaRDI portal
Publication:1959394
DOI10.1007/s00224-009-9201-yzbMath1205.68243MaRDI 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
91A05: 2-person games
91A43: Games involving graphs
03B45: Modal logic (including the logic of norms)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
05C57: Games on graphs (graph-theoretic aspects)
Related Items
Unnamed Item, Pebble Weighted Automata and Weighted Logics, Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems, The mu-calculus and Model Checking
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