TY - GEN
T1 - A game-based framework for CTL counterexamples and 3-valued abstraction-refinement
AU - Shoham, Sharon
AU - Grumberg, Orna
PY - 2003
Y1 - 2003
N2 - This work exploits and extends the game-based framework of CTL model checking for counterexample and incremental abstraction-refinement We define a game-based CTL model checking for abstract models over the 3-valued semantics, which can be used for verification as well as refutation. The model checking may end with an indefinite result, in which case we suggest a new notion of refinement, which eliminates indefinite results of the model checking. This provides an iterative abstraction-refinement framework. It is enhanced by an incremental algorithm, where refinement is applied only where indefinite results exist and definite results from prior iterations are used within the model checking algorithm. We also define the notion of annotated counterexamples, which are sufficient and minimal counterexamples for full CTL. We present an algorithm that uses the game board of the model checking game to derive an annotated counterexample in case the examined system model refutes the checked formula.
AB - This work exploits and extends the game-based framework of CTL model checking for counterexample and incremental abstraction-refinement We define a game-based CTL model checking for abstract models over the 3-valued semantics, which can be used for verification as well as refutation. The model checking may end with an indefinite result, in which case we suggest a new notion of refinement, which eliminates indefinite results of the model checking. This provides an iterative abstraction-refinement framework. It is enhanced by an incremental algorithm, where refinement is applied only where indefinite results exist and definite results from prior iterations are used within the model checking algorithm. We also define the notion of annotated counterexamples, which are sufficient and minimal counterexamples for full CTL. We present an algorithm that uses the game board of the model checking game to derive an annotated counterexample in case the examined system model refutes the checked formula.
UR - http://www.scopus.com/inward/record.url?scp=35248892961&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-45069-6_28
DO - 10.1007/978-3-540-45069-6_28
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:35248892961
VL - 2725
T3 - Lecture Notes in Computer Science
SP - 275
EP - 287
BT - Computer Aided Verification
A2 - Hunt, Warren A.
A2 - Somenzi, Fabio
PB - Springer Berlin Heidelberg
CY - 978-3-540-40524-5
ER -