Result: Languages of nested trees

Title:
Languages of nested trees
Authors:
ALUR, Rajeev, CHAUDHURI, Swarat, MADHUSUDAN, P
Source:
Computer aided verification (18th international conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006)0CAV 2006. :329-342
Publisher Information:
Berlin; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 24 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Génie logiciel, Software engineering, Automate fini, Finite automaton, Autómata estado finito, Automate à pile, Push down automaton, Autómata a pila, Comportement programme, Program behavior, Comportamiento programa, Logique monadique, Monadic logic, Lógica monadica, Logique ordre 2, Second order logic, Lógica orden 2, Logique temporelle, Temporal logic, Lógica temporal, Machine état fini, Finite state machine, Máquina estado finito, Modèle comportement, Behavior model, Modelo comportamiento, Méthode arborescente, Tree structured method, Método arborescente, Ramification, Branching, Ramificación, Structure arborescente, Tree structure, Estructura arborescente, Théorie graphe, Graph theory, Teoría grafo, Vérification modèle, Model checking, Verificación modelo, Vérification programme, Program verification, Verificación programa
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Pennsylvania, United States
University of Illinois at Urbana-Champaign, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19150365
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150365
Database:
PASCAL Archive

Further Information

We study languages of nested tree-structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages. We define finite-state automata accepting such languages- these automata can pass states along jump-edges as well as tree edges. We find that the model-checking problem for these automata on pushdown systems is EXPTIME-complete, and that their alternating versions are expressively equivalent to NT-μ, a recently proposed temporal logic for nested trees that can express a variety of branching-time, context-free requirements. We also show that monadic second order logic (MSO) cannot exploit the structure: MSO on nested trees is too strong in the sense that it has an undecidable model checking problem, and seems too weak to capture NT-μ.