No abstract

No abstract

n iv-m rs .fr * Supported by the European Community Project IST-2001-35304 (AMETIST), h t tp : // a m e t i s t.c s .u t w e n te .n l. ** Peter Niebert suggested the method for efficient computation of canonical represen tatives at an AMETIST project meeting, and was therefore invited to join the list of authors after acceptance of the paper.

Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems.

In this paper we show how to translate bounded-length verification problems for timed automata into formulae in difference logic, a propositional logic enriched with timing constraints. We describe the principles of a satisfiability checker specialized for this logic that we have implemented and report some preliminary experimental results.