Solving Games Via Three-Valued Abstraction Refinement

DOI10.1007/978-3-540-74407-8_6zbMATH Open1151.68559OpenAlexW1607705647MaRDI QIDQ3525630FDOQ3525630

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

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

Mathematics Subject Classification ID

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

Cited In (11)

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

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)