| | |
Summary: Regular Tree Model Checking
Parosh Aziz Abdulla Bengt Jonsson Pritha Mahata
Julien d'Orso
Dept. of Computer Systems
P.O. Box 325
S-751 05 Uppsala, Sweden
fparosh,bengt,pritha,juldorg@docs.uu.se
Abstract
In this paper, we present an approach for algorithmic veri cation of in nite-state systems
with a parameterized tree topology. Our work is a generalization of regular model checking,
where we extend the work done with strings toward trees. States are represented by trees
over a nite alphabet, and transition relations by regular, structure preserving relations on
trees. We use an automata theoretic method to compute the transitive closure of such a
transition relation. Although the method is incomplete, we present suÆcient conditions to
ensure termination.
We have implemented a prototype for our algorithm and show the result of its application on
a number of examples.
Appendix A { Proofs of Lemmas
Appendix B { Experimental Data
|
