SAT-based Unbounded Model Checking of Timed Automata

Abstract

Symbolic model checking, based mostly on BDD graphs, is a standard technology nowadays. In the last decade, very efficient implementations of SAT solvers have been provided. Thanks to that SAT-based bounded model checking (BMC) and unbounded model checking (UMC) became feasible. The idea of UMC consists in encoding the states of a model, where a temporal formula holds, by propositional formulas in conjunctive normal form (called blocking clauses). Unfortunately, the number of these clauses can be exponential. There are several methods aiming at improving the above deficiency by using generalized blocking clauses, or for instance circuit cofactoring. In this paper we define and use timed generalized blocking clauses in UMC of timed automata for untimed temporal properties expressed in CTL-X.