Solving games via three-valued abstraction refinement
From MaRDI portal
Publication:979079
DOI10.1016/J.IC.2009.05.007zbMATH Open1205.68225OpenAlexW2153061979MaRDI QIDQ979079FDOQ979079
Authors: Luca De Alfaro, Pritam Roy 
Publication date: 25 June 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.05.007
Recommendations
- Solving Games Via Three-Valued Abstraction Refinement
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- A game-based abstraction-refinement framework for Markov decision processes
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
- Symbolic computational techniques for solving games
2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Title not available (Why is that?)
- A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
- On the synthesis of discrete controllers for timed systems
- The element of surprise in timed games.
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extension of Borel determinacy
- Frontiers of Combining Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Title not available (Why is that?)
- Timing verification by successive approximation
Cited In (13)
- Title not available (Why is that?)
- An abstraction-refinement methodology for reasoning about network games
- An abstraction-refinement framework for trigger querying
- Solving Games Via Three-Valued Abstraction Refinement
- An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Falsifying safety properties through games on over-approximating models
- Automated Technology for Verification and Analysis
- Relay reachability algorithm for exploring huge state space
- Title not available (Why is that?)
- Abstraction refinement for games with incomplete information
- Timed automata verification and synthesis via finite automata learning
- Lazy abstraction-based controller synthesis
Uses Software
This page was built for publication: Solving games via three-valued abstraction refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979079)
