Temporal Logics on Words with Multiple Data Values

The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logic which is a semantical fragment of the logic $\LTL^\downarrow_1$ of Demri and Lazic with operators for navigation into the future and the past. By reduction to the emptiness problem for data automata it is shown that this basic logic is decidable. Whereas the basic logic only allows navigation to positions where a fixed data value occurs, extensions are studied that also allow navigation to positions with different data values. Besides some undecidable results it is shown that the extension by a certain UNTIL-operator with an inequality target condition remains decidable.

[1]  Philippe Schnoebelen,et al.  A Hierarchy of Temporal Logics with Past , 1995, Theor. Comput. Sci..

[2]  Thomas A. Henzinger,et al.  A really temporal logic , 1994, JACM.

[3]  Thomas Schwentick,et al.  Two-Variable Logic on Words with Data , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[4]  Patricia Bouyer,et al.  A logical characterization of data languages , 2002, Inf. Process. Lett..

[5]  Stéphane Demri,et al.  LTL with the Freeze Quantifier and Register Automata , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[6]  Thomas Schwentick,et al.  Finite state machines for strings over infinite alphabets , 2004, TOCL.

[7]  Ahmed Bouajjani,et al.  Rewriting Systems with Data , 2007, FCT.

[8]  Thomas Schwentick,et al.  On Notions of Regularity for Data Languages , 2007, FCT.

[9]  Thomas Schwentick,et al.  Two-Variable Logic with Two Order Relations - (Extended Abstract) , 2010, CSL.

[10]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[11]  Igor Potapov,et al.  Temporal logic with predicate /spl lambda/-abstraction , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[12]  Alin Deutsch,et al.  Automatic verification of data-centric business processes , 2009, ICDT '09.

[13]  Tony Tan,et al.  On pebble automata for data languages with decidable emptiness problem , 2009, J. Comput. Syst. Sci..

[14]  Amir Pnueli,et al.  Parameterized Verification with Automatically Computed Inductive Assertions , 2001, CAV.

[15]  Deepak D'Souza,et al.  A Decidable Temporal Logic of Repeating Values , 2007, LFCS.

[16]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[17]  Patricia Bouyer,et al.  An algebraic approach to data languages and timed languages , 2003, Inf. Comput..

[18]  Stéphane Demri,et al.  On the freeze quantifier in constraint LTL: decidability and complexity , 2005, 12th International Symposium on Temporal Representation and Reasoning (TIME'05).

[19]  Stéphane Demri,et al.  LTL over integer periodicity constraints , 2006, Theor. Comput. Sci..

[20]  Diego Figueira,et al.  Future-Looking Logics on Data Words and Trees , 2009, MFCS.

[21]  Mogens Nielsen,et al.  Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.