Optimizing Timed Automata Model Checking via Clock Reordering

Abstract

An essential operation in timed automata model checking is inclusion checking which decides whether a set of states, represented as a convex polyhedron, is included in another set. Several veri cation tools implement convex polyhedra as square matrixes called DBMs (short for Di erence Bound Matrix), where each row and column is associated to a clock in the system under analysis. An element in the matrix represents the bound for the value of a clock or for the di erence between two clocks. Inclusion checking can be called hundreds of millions of times during the veri cation of a medium-size model. The naïve implementation scans each matrix cell by cell and compares it against the corresponding one in the other matrix. If all the checks are successful the rst matrix is included into the second. If one of them fails, it is not. In the last case, the order in which matrixes are traversed is decisive for the inclusion checking's e ciency. In this article we present a clock reordering technique which reduces the number of comparisons needed to nd a failure. Experiments show neglectable memory overhead and time savings of up to 17%.

1 Figure or Table

Cite this paper

@inproceedings{Braberman2006OptimizingTA, title={Optimizing Timed Automata Model Checking via Clock Reordering}, author={V{\'i}ctor A. Braberman and Alfredo Olivero and Fernando Schapachnik}, year={2006} }