A game-based framework for CTL counterexamples and 3-valued abstraction-refinement

Sharon Shoham*, Orna Grumberg

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationComputer Aided Verification
Subtitle of host publication15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings
EditorsWarren A. Hunt, Fabio Somenzi
Place of Publication978-3-540-40524-5
PublisherSpringer Berlin Heidelberg
Number of pages13
ISBN (Electronic)978-3-540-45069-6
StatePublished - 2003
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Verlag
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Dive into the research topics of 'A game-based framework for CTL counterexamples and 3-valued abstraction-refinement'. Together they form a unique fingerprint.

Cite this