Solving games via three-valued abstraction refinement

DOI10.1016/j.ic.2009.05.007zbMath1205.68225OpenAlexW2153061979MaRDI QIDQ979079

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

reachabilitysafetymodel checkingrefinementabstractionthree valued

Mathematics Subject Classification ID

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

Related Items

An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information ⋮ Lazy Abstraction-Based Controller Synthesis ⋮ An abstraction-refinement framework for trigger querying

Uses Software

• SLAM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Timing verification by successive approximation
• An extension of Borel determinacy
• Graph-Based Algorithms for Boolean Function Manipulation
• On the synthesis of discrete controllers for timed systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Frontiers of Combining Systems
• CONCUR 2003 - Concurrency Theory
• Computer Aided Verification