Solving Games Via Three-Valued Abstraction Refinement

DOI10.1007/978-3-540-74407-8_6MaRDI QIDQ3525630zbMATH OpenOpenAlexFDO

Authors Luca De Alfaro, Pritam Roy

Publication date 18 September 2008

Published in CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74407-8_6

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)

Recommendations

• Solving games via three-valued abstraction refinement
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• scientific article; zbMATH DE number 1617325
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
• A game-based abstraction-refinement framework for Markov decision processes

Cited in

(12)

• An abstraction-refinement methodology for reasoning about network games
• When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
• scientific article; zbMATH DE number 1617325 (Why is no real title available?)
• Symbolic computational techniques for solving games
• Abstraction refinement for games with incomplete information
• scientific article; zbMATH DE number 1948171 (Why is no real title available?)
• Falsifying safety properties through games on over-approximating models
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
• A game-based framework for CTL counterexamples and 3-valued abstraction-refinement.
• Software Verification of Hyperproperties Beyond k-Safety
• Predicate abstraction for hyperliveness verification
• Solving games via three-valued abstraction refinement

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 Q3525630)