Solving games via three-valued abstraction refinement

DOI10.1016/J.IC.2009.05.007MaRDI QIDQ979079zbMATHOpenAlexFDO

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

zbMATH Keywords

model checkingreachabilityabstractionrefinementsafetythree valued

Mathematics Subject Classification ID

2-person games (91A05) Specification and verification (program logics, model checking, etc.) (68Q60)

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

Cites work

• scientific article; zbMATH DE number 1617325 (Why is no real title available?)
• scientific article; zbMATH DE number 1670775 (Why is no real title available?)
• scientific article; zbMATH DE number 2038762 (Why is no real title available?)
• scientific article; zbMATH DE number 1863183 (Why is no real title available?)
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• An extension of Borel determinacy
• Frontiers of Combining Systems
• Graph-Based Algorithms for Boolean Function Manipulation
• On the synthesis of discrete controllers for timed systems
• The element of surprise in timed games.
• Timing verification by successive approximation
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(14)

• scientific article; zbMATH DE number 1948171 (Why is no real title available?)
• Lazy abstraction-based controller synthesis
• Causality-based game solving
• Solving Games Via Three-Valued Abstraction Refinement
• An abstraction-refinement methodology for reasoning about network games
• Falsifying safety properties through games on over-approximating models
• Abstraction refinement for games with incomplete information
• An abstraction-refinement framework for trigger querying
• Automated Technology for Verification and Analysis
• Timed automata verification and synthesis via finite automata learning
• scientific article; zbMATH DE number 1617325 (Why is no real title available?)
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• Relay reachability algorithm for exploring huge state space
• An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information

Describes a project that uses

Uses Software

• SLAM

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)