Tree Pattern Rewriting Systems

Blaise Genest (1) , Anca Muscholl (2) , Olivier Serre (3) , Marc Zeitoun (2)

1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

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). The guarded transition rules are described by means of tree patterns. Our main result is that given a TPRS system (T, 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 satisfying P is reachable from T.

Domaines: Autre [cs.OH]

Blaise Genest, Anca Muscholl, Olivier Serre, Marc Zeitoun. Tree Pattern Rewriting Systems. Automated Technology for Verification and Analysis, 2008, Séoul, South Korea. pp.332-346, ⟨10.1007/978-3-540-88387-6_29⟩. ⟨hal-00344551⟩