| | |
Summary: Simulation-Based Iteration of Tree Transducers
Parosh Aziz Abdulla 1 , Axel Legay 2? , Julien d'Orso 3 , and Ahmed Rezine 1
1 Dept. of Information Technology
Uppsala University
P.O. Box 337
SE-751 05 Uppsala, Sweden
fparosh,rahmedg@it.uu.se
2 Universite de Liege
Institut Monte ore, B28
4000 Liege, Belgium
legay@montefiore.ulg.ac.be
3 IRCCyN - UMR CNRS 6597
BP 92 101
44321 Nantes CEDEX 03, France
julien.dorso@irccyn.ec-nantes.fr
Abstract. Regular model checking is the name of a family of techniques
for analyzing in nite-state systems in which states are represented by
words, sets of states by nite automata, and transitions by nite-state
transducers. The central problem is to compute the transitive closure
of a transducer. A main obstacle is that the set of reachable states is
|
