Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Languages of Nested Trees Rajeev Alur1

Summary: Languages of Nested Trees
Rajeev Alur1
, Swarat Chaudhuri1
, and P. Madhusudan2
University of Pennsylvania, USA
University of Illinois at Urbana-Champaign, USA
Abstract. We study languages of nested trees--structures obtained by
augmenting trees with sets of nested jump-edges. These graphs can nat-
urally 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 va-
riety of branching-time, "context-free" requirements. We also show that
monadic second order logic (MSO) cannot exploit the structure: MSO on


Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Chauduri, Swarat - Department of Computer Science and Engineering, Pennsylvania State University
Parthasarathy, Madhusudan - Department of Computer Science, University of Illinois at Urbana-Champaign


Collections: Computer Technologies and Information Sciences