Parameterized Tree Systems
Several recent works have considered parameterized verification, i.e. automatic verification of systems consisting of an arbitrary number of finite-state processes organized in a linear array. The aim of this paper is to extend these works by giving a simple and efficient method to prove safety properties for systems with tree-like architectures. A process in the system is a finite-state automaton and a transition is performed jointly by a process and its parent and children processes. The method derives an over-approximation of the induced transition system, which allows the use of finite trees as symbolic representations of infinite sets of configurations. Compared to traditional methods for parameterized verification of systems with tree topologies, our method does not require the manipulation of tree transducers, hence its simplicity and efficiency. We have implemented a prototype which works well on several nontrivial tree-based protocols.
KeywordsTransition System Constraint System Safety Property Reachability Analysis Tree Automaton
- 1.Abdulla, P., Henda, N.B., Delzanno, G., Haziza, F., Rezine, A.: Parameterized tree systems. Technical Report 2008-010, Dept. of Information Technology, Uppsala University, Sweden (March 2008)Google Scholar
- 2.Abdulla, P.A., Čerāns, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proc. LICS 1996, 11th IEEE Int. Symp. on Logic in Computer Science, pp. 313–321 (1996)Google Scholar
- 13.Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (October 1999)Google Scholar
- 17.IEEE Computer Society. IEEE standard for a high performance serial bus. Std 1394-1995 (August 1996)Google Scholar
- 20.Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. LICS 1986, 1st IEEE Int. Symp. on Logic in Computer Science, June 1986, pp. 332–344 (1986)Google Scholar