Games for Active XML Revisited

The article studies the rewriting mechanisms for intensional documents in the Active XML framework, abstracted in the form of active context-free games. The safe rewriting problem studied in this article is to decide whether the first player, JULIET, has a winning strategy for a given game and (nested) word; this corresponds to a successful rewriting strategy for a given intensional document. The article examines several extensions of active context-free games. The primary extension allows for more expressive schemas (namely XML schemas and regular nested word languages) for both target and replacement languages and has the effect that games are played on nested words instead of (flat) words as in previous studies. Other extensions consider validation of input parameters of web services, and an alternative semantics based on insertion of values returned by the services. In general, the complexity of the safe rewriting problem is highly intractable (doubly exponential time), but the article identifies relevant tractable cases.

[1]  Laura Bozzelli.  Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages , 2007, CONCUR.

[2]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[3]  Serge Abiteboul,et al.  Regular rewriting of active XML and unambiguity , 2005, PODS '05.

[4]  BenjellounOmar,et al.  Exchanging intensional XML data , 2005 .

[5]  Thomas Schwentick,et al.  Expressiveness and complexity of XML Schema , 2006, TODS.

[6]  Serge Abiteboul,et al.  Exchanging intensional XML data , 2003, TODS.

[7]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[8]  Johan van Benthem,et al.  Logic Games are Complete for Game Logics , 2003, Stud Logica.

[9]  Serge Abiteboul,et al.  The Active XML project: an overview , 2008, The VLDB Journal.

[10]  Thomas Schwentick,et al.  Games for Active XML Revisited , 2014, Theory of Computing Systems.

[11]  Thomas Schwentick,et al.  On optimum left-to-right strategies for active context-free games , 2013, ICDT '13.

[12]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

[13]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[14]  Lukasz Kaiser,et al.  Synthesis for Structure Rewriting Systems , 2009, MFCS.

[15]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[16]  Rohit Parikh,et al.  Game Logic - An Overview , 2003, Stud Logica.

[17]  Thomas Schwentick,et al.  Active Context-Free Games , 2004, STACS.

[18]  Murali Mani,et al.  Taxonomy of XML schema languages using formal language theory , 2005, TOIT.

[19]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, STOC '74.

[20]  Johannes Waldmann,et al.  Rewrite Games , 2002, RTA.

[21]  Derick Wood,et al.  Deterministic Regular Languages , 1991, STACS.

[22]  Thomas Schwentick,et al.  Complexity of Decision Problems for XML Schemas and Chain Regular Expressions , 2009, SIAM J. Comput..