Simulation-based iteration of tree transducers

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 30-44

  Abdulla, Parosh Aziz ^a   Legay, Axel ^b   D'Orso, Julien ^c   Rezine, Ahmed ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF LIÈGE   (Belgium)

^c INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; EQUIVALENCE CLASSES; FINITE AUTOMATA; MATHEMATICAL MODELS; PROBLEM SOLVING; TRANSDUCERS; TREES (MATHEMATICS);

FINITE STATE TRANSDUCERS; MODEL CHECKING; TREE TRANSDUCERS; TREE-LIKE ARCHITECTURE;

ITERATIVE METHODS;

EID: 24644493429     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_3     Document Type: Conference Paper

References (14)

1. th Int. Conf. on Computer Aided Verification, volume 1254, pages 340-351, Haifa, Israel, 1997. Springer Verlag.
2. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
3. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 236-248, 2003.
4. [BHV04] A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract regular model checking. In CAV04, Lecture Notes in Computer Science, Boston, July 2004. Springer-Verlag.
5. th Int. Conf. on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer Verlag, 2000.
6. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 223-235, 2003.
7. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, 2004.
8. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
9. [BT03] A. Bouajjani and T. Touili. Reachability analysis of process rewrite systems. In Proc. Int. Conf. on Foundations of Software Technology and Theoritical Computer Science (FSTTCS'03), Lecture Notes in Computer Science, 2003.
10. +99] H. Common, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications, not yet published, October 1999.
11. [DLS01] D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, 2001.
12. th Annual Symp. Foundations of Computer Science, pages 453-463, 1995.
13. +01] Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256:93-112, 2001.
14. [Tho90] W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 133192, 1990.