© 2002 by Oxford University Press
Original Article |
Model Checking Games for Branching Time Logics
1 LFCS, Division of Informatics, The University of Edinburgh, Scotland. E-mail: cps{at}dcs.ed.ac.ukmartin{at}dcs.ed.ac.uk
This paper defines and examines model checking games for the branching time temporal logic CTL*. The games employ a technique called focus which enriches sets by picking out one distinguished element. This is necessary to avoid ambiguities in the regeneration of temporal operators. The correctness of these games is proved, and optimizations are considered to obtain model checking games for important fragments of CTL*. A game based model checking algorithm that matches the known lower and upper complexity bounds is sketched.
Keywords: Model checking; games; temporal logics; branching time; CTL*; CTL; CTL+
Received 3 January 2001.