Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Tree Pattern Rewriting Systems
verfasst von : Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun
Erschienen in: Automated Technology for Verification and Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing importance of web services. We define here
Tree Pattern Rewriting Systems
(TPRS) as an abstract model of dynamic XML-based documents. TPRS systems generate infinite transition systems, where states are unranked and unordered trees (hence possibly modeling XML documents). Their guarded transition rules are described by means of tree patterns. Our main result is that given a TPRS system
$(T,{\mathcal R})$
, a tree pattern
P
and some integer
k
such that any reachable document from
T
has depth at most
k
, it is
decidable
(albeit of non elementary complexity) whether some tree matching
P
is reachable from
T
.