Technical Report 2003-024

Algorithmic Improvements in Regular Model Checking

Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, and Julien d'Orso

April 2003

Regular model checking is a form of symbolic model checking for parameterized and infinite-state systems, whose states can be represented as finite strings of arbitrary length over a finite alphabet, in which regular sets of words are used to represent sets of states. In earlier papers, we have developed methods for computing the transitive closure (or the set of reachable states) of the transition relation, represented by a regular length-preserving transducer. In this paper, we present several improvements of these techniques, which reduce the size of intermediate approximations of the transitive closure: One improvement is to pre-process the transducer by bi-determinization, another is to use a more powerful equivalence relation for identifying histories (columns) of states in the transitive closure. We also present a simplified theoretical framework for showing soundness of the optimization, which is based on commuting simulations. The techniques have been implemented, and we report the speedups obtained from the respective optimizations.

Note: Extended version of paper accepted for publication in in CAV'2003

Available as compressed Postscript (85 kB, no cover) and Postscript (256 kB, no cover)

Download BibTeX entry.