Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams1 1This work was carried out while the authors were at the Department of Information Technology, Technical University of Denmark, and was finnancially supported by a grant from the Danish Technical Research Council.

Møller, Jesper B.; Lichtenberg, Jakob; Andersen, Henrik Reif; Hulgaard, Henrik

doi:10.1016/s1571-0661(04)80671-6

Cited by 10 publications

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Bounded Model Checking for Timed Systems

Audemard

Cimatti

Korniłowicz

et al. 2002

Formal Techniques for Networked and Distributed Sytems — FORTE 2002

View full text Add to dashboard Cite

Abstract. Enormous progress has been achieved in the last decade in the verification of timed systems, making it possible to analyze significant real-world protocols. An open challenge is the identification of fully symbolic verification techniques, able to deal effectively with the finite state component as well as with the timing aspects. In this paper we propose a new, symbolic verification technique that extends the Bounded Model Checking (BMC) approach for the verification of timed systems. The approach is based on the following ingredients. First, a BMC problem for timed systems is reduced to the satisfiability of a math-formula, i.e., a boolean combination of propositional variables and linear mathematical relations over real variables (used to represent clocks). Then, an appropriate solver, called MathSAT, is used to check the satisfiability of the math-formula. The solver is based on the integration of SAT techniques with some specialized decision procedures for linear mathematical constraints, and requires polynomial memory. Our methods allow for handling expressive properties in a fully-symbolic way. A preliminary experimental evaluation confirms the potential of the approach.

show abstract