Antichain-based universality and inclusion testing over nondeterministic finite tree automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5148 LNCS, Issue , 2008, Pages 57-67

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a,b   Holík, Lukáš ^c   Touili, Tayssir ^a   Vojnar, Tomáš ^c  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b INRIA   (France)

^c BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA STRUCTURES; EXPERIMENTS; FILE ORGANIZATION; FINITE AUTOMATA; MODEL CHECKING; ROBOTS; TRANSLATION (LANGUAGES);

ANTICHAIN; FINITE TREE AUTOMATON; INTERNATIONAL CONFERENCES; LINKED TREE; PROTOTYPE TOOLS; REGULAR TREES; TREE AUTOMATON;

TREES (MATHEMATICS);

EID: 50249095153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70844-5_7     Document Type: Conference Paper

References (12)

1. Abdulla, P.A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata: Efficient Techniques for Reducing TA. In: TACAS 2008. LNCS, vol. 4963. Springer, Heidelberg (2008)
2. Abdulla, P.A., Legay, A., d'Orso, J., Rezine, A.: Simulation-Based Iteration of Tree Transducers. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 30-44. Springer, Heidelberg (2005)
3. Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. Technical Report FITTR-2008-1, FIT, Brno University of technology, Czech Republic (2008)
4. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking. ENTCS 149, 37-48 (2006)
5. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, pp. 52-70. Springer, Heidelberg (2006)
6. Bouajjani, A., Touili, T.: Extrapolating Tree Transformations. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404. Springer, Heidelberg (2002)
7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
8. Doyen, L., Raskin, J.-F.: Improved Algorithms for the Automata-based Approach to Model Checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 451-465. Springer, Heidelberg (2007)
9. Genet, T.: Timbuk: A Tree Automata Library, http://www.irisa.fr/lande/ genet/timbuk
10. Klarlund, N., Møller, A.: MONA Version 1.4 User Manual, BRICS, Department of Computer Science, University of Aarhus, Denmark (2001)
11. Shahar, E.: Tools and Techniques for Verifying Parameterized Systems. PhD thesis, Faculty of Mathematics and Computer Science, The Weizmann Inst. of Science, Rehovot, Israel (2001)
12. De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg (2006)