cient On - the - y Algorithm for Real - Time Model Checking

In temporal-logic model checking, we verify the correctness of a program with respect to a desired behavior by checking whether a structure that models the program satis es a temporal-logic formula that speci es the behavior. The main practical limitation of model checking is caused by the size of the state space of the program, which grows exponentially with the number of concurrent components. This problem, known as the state-explosion problem, becomes more di cult when we consider real-time model checking, where the program and the speci cation involve quantitative references to time. In particular, when use timed automata to describe real-time programs and we specify timed behaviors in the logic TCTL, a real-time extension of the temporal logic CTL with clock variables, then the state space under consideration grows exponentially not only with the number of concurrent components, but also with the number of clocks and the length of the clock constraints used in the program and the speci cation. Two powerful methods for coping with the state-explosion problem are on-they and space-e cient model checking. In on-they model checking, we explore only the portion of the state space of the program whose exploration is essential for determining the satisfaction of the speci cation. In space-e cient model checking, we store in memory the minimal information required, preferring to spend time on reconstructing information rather than spend space on storing it. In this work we develop an automata-theoretic approach to TCTL model checking that combines both methods. We suggest, for the rst time, a PSPACE on-they model-checking algorithm for TCTL.