Languages of Nested Trees

Simple item page
dc.contributor.authorAlur, Rajeev
dc.contributor.authorChaudhuri, Swarat
dc.contributor.authorMadhusudan, P.
dc.date2023-05-17T00:13:40.000
dc.date.accessioned2023-05-22T12:47:11Z
dc.date.available2023-05-22T12:47:11Z
dc.date.issued2006-08-06
dc.date.submitted2006-12-08T05:57:45-08:00
dc.description.abstractWe study languages of nested trees—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-μ.
dc.description.commentsFrom the 18th International Conference, CAV 2006, Seattle, WA, USA, August 17-20, 2006.
dc.identifier.urihttps://repository.upenn.edu/handle/20.500.14332/6313
dc.legacy.articleid1290
dc.legacy.fields10.1007/11817963_31
dc.legacy.fulltexturlhttps://repository.upenn.edu/cgi/viewcontent.cgi?article=1290&context=cis_papers&unstamped=1
dc.rightsThe original publication is available at www.springerlink.com
dc.source.beginpage329
dc.source.endpage342
dc.source.issue274
dc.source.journalDepartmental Papers (CIS)
dc.source.journaltitleLecture Notes in Computer Science: Computer Aided Verification
dc.source.peerreviewedtrue
dc.source.statuspublished
dc.source.volume4144
dc.subject.otherCPS Theory
dc.titleLanguages of Nested Trees
dc.typeBook Chapter
digcom.contributor.authorisAuthorOfPublication|email:alur@cis.upenn.edu|institution:University of Pennsylvania|Alur, Rajeev
digcom.contributor.authorChaudhuri, Swarat
digcom.contributor.authorMadhusudan, P.
digcom.identifiercis_papers/274
digcom.identifier.contextkey230796
digcom.identifier.submissionpathcis_papers/274
digcom.typechapter
dspace.entity.typePublication
relation.isAuthorOfPublication0277bab3-1be2-4f99-9964-92e0ea36014e
relation.isAuthorOfPublication.latestForDiscovery0277bab3-1be2-4f99-9964-92e0ea36014e
upenn.schoolDepartmentCenterDepartmental Papers (CIS)
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
cav06.pdf
Size:
201.61 KB
Format:
Adobe Portable Document Format
Download
Collection
Book Chapters