| | |
Summary: Regular Model Checking made Simple and
EÆcient
Parosh Aziz Abdulla 1 , Bengt Jonsson 1 , Marcus Nilsson 1 , and Julien d'Orso 1
Dept. of Computer Systems, P.O. Box 337, S-751 05 Uppsala, Sweden
fparosh,bengt,marcusn,juldorg@docs.uu.se
Abstract. We present a new technique for computing the transitive clo-
sure of a regular relation characterized by a nite-state transducer. The
construction starts from the original transducer, and repeatedly adds
new transitions which are compositions of currently existing transitions.
Furthermore, we de ne an equivalence relation which we use to merge
states of the transducer during the construction. The equivalence relation
can be determined by a simple local check, since it is syntactically char-
acterized in terms of \columns" that label constructed states. This makes
our algorithm both simpler to present and more eÆcient to implement,
compared to existing approaches. We have implemented a prototype and
carried out veri cation of a number of parameterized protocols.
1 Introduction
Regular model checking has been proposed as a uniform paradigm for algorith-
mic veri cation of several classes of in nite-state systems; in particular param-
eterized systems [KMM + 97,ABJN99,BJNT00,PS00]. Such systems arise natu-
|
