Tree pattern rewriting systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5311 LNCS, Issue , 2008, Pages 332-346

  Genest, Blaise ^c   Muscholl, Anca ^a   Serre, Olivier ^b   Zeitoun, Marc ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

WEB SERVICES; XML;

ABSTRACT MODELING; DYNAMIC XML; INFINITE TRANSITION SYSTEMS; REWRITING SYSTEMS; TRANSITION RULE; TREE PATTERN; TREE-MATCHING; UNORDERED TREES;

FORESTRY;

EID: 56749156006     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88387-6_29     Document Type: Conference Paper

References (15)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313-321. IEEE Comp. Soc, Los Alamitos (1096)
2. Ablteboul, S., Benjelloun, O., Milo, T.: Positive Active XML, In: PODS 2004. pp. 35-45, ACM. New York (2004)
3. Abiteboul, S., Segoufin, L., Vianu. V.: Analysis of Active XML Services, In: PODS 2008, ACM Press. New York (to appear, 2008)
4. Active XML, http://wvw.activaxml.net/
5. Chambart, P., Schnoebelen, P.: The Ordinal Recursive Complexity of Lossy Channel Systems. Iu: LICS 2008, pp. 205-216. IEEE Comp. Soc., Los Alamitos (2008)
6. R. Diestel. Graph theory (2005). http://www.math.uni-hamburg.de/ home/diestel
7. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets between Decidability and Undecidability, In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1908, LNCS, vol. 1443, pp. 103-115, Springer. Heidelberg (1998)
8. Finkel. A., Schnoebelen, P.: Well-structured transition systems everywhere. Theor. Comput. Sci. 256(1-2), 63-92 (2001)
9. Genest, B., Muscholl, A., Serre, O., Zeitoun, M.: Tree Pattern Rewrite Systems. Internal report, http://www.crans.org/~genest/GMSZ08.pdf
10. Dershowitz, N., Plaisted, D.: In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch 9, vol. 1, Elsevier, Amsterdam (2001)
11. Libkin, L.: Logics over unranked trees: an overview. Logical Methods in Computer Science 2(3) (2006)
12. Lodhig, C., Spelten, A.: Transition Graphs of Rewriting Systems over Unranked Trees. In: Kučera. L., Kučera, A. (eds.) MFCS 2007, LNCS. vol. 4708, pp. 67-77. Springer, Heidelberg (2007)
13. Neven, F.: Automata, Logic, and XML. In: Bradfield. J.C. (ed.) CSL 2002 and EACSL 2002, LNCS, vol. 2471, pp. 2-26, Springer, Heidelberg (2002)
14. Schnoebelen, P.: Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity, Inf. Process. Lett, 83(5). 251-261 (2002)
15. Walukiewicz, I.: Difficult Configurations-on the Complexity of LTrL, ICALP 1998 26(1), 27-43 (2005); In: Larsen, K.G., Skyum. S., Winskel. G. (eds.) ICALP 1998, LNCS, vol. 1443, pp. 27-43, Springer, Heidelberg (1998)