Fly-Automata, Their Properties and Applications
We address the concrete problem of implementing huge bottom-up term automata. Such automata arise from the verification of Monadic Second Order propositions on graphs of bounded tree-width or clique-width. This applies to graphs of bounded tree-width because bounded tree-width implies bounded clique-width. An automaton which has so many transitions that they cannot be stored in a transition table is represented be a fly-automaton in which the transition function is represented by a finite set of meta-rules.
Fly-automata have been implemented inside the Autowrite software and experiments have been run in the domain of graph model checking.
KeywordsTransition Function Graph Property Tree Automaton Direct Construction Transition Table
Unable to display preview. Download preview PDF.
- 1.Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, draft (2002), http://tata.gforge.inria.fr
- 2.Courcelle, B., Durand, I.: Verifying monadic second order graph properties with tree automata. In: Proceedings of the 3rd European Lisp Symposium, pp. 7–21 (May 2010)Google Scholar
- 3.Courcelle, B., Durand, I.: Automata for the verification of monadic second-order graph properties (2011) (in preparation)Google Scholar
- 4.Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic, a language theoretic approach. Cambridge University Press, Cambridge (2011),http://www.labri.fr/perso/courcell/Book/CourGGBook.pdf
- 6.Durand, I.: Implementing huge term automata. In: Proceedings of the 4th European Lisp Symposium, pp. 17–27 (March 2011)Google Scholar