An Automaton over Data Words That Captures EMSO Logic

We develop a general framework for the specification and implementation of systems whose executions are words, or partial orders, over an infinite alphabet. As a model of an implementation, we introduce class register automata, a one-way automata model over words with multiple data values. Our model combines register automata and class memory automata. It has natural interpretations. In particular, it captures communicating automata with an unbounded number of processes, whose semantics can be described as a set of (dynamic) message sequence charts. On the specification side, we provide a local existential monadic second-order logic that does not impose any restriction on the number of variables. We study the realizability problem and show that every formula from that logic can be effectively, and in elementary time, translated into an equivalent class register automaton.

[1]  Thomas Schwentick,et al.  Local Normal Forms for First-Order Logic with Applications to Games and Automata , 1998, Discret. Math. Theor. Comput. Sci..

[2]  Wolfgang Thomas,et al.  Elements of an automata theory over partial orders , 1997, Partial Order Methods in Verification.

[3]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[4]  Claire David,et al.  On the Satisfiability of Two-Variable Logic over Data Words , 2010, LPAR.

[5]  Kousha Etessami,et al.  Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.

[6]  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).

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

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

[9]  Benedikt Bollig,et al.  An optimal construction of Hanf sentences , 2011, J. Appl. Log..

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

[11]  Luc Segoufin.  Automata and Logics for Words and Trees over an Infinite Alphabet , 2006, CSL.

[12]  Shlomo Vinner.  A generalization of Ehrenfeucht’s game and some applications , 1972 .

[13]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

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

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

[16]  Manindra Agrawal,et al.  FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science , 2002, Lecture Notes in Computer Science.

[17]  Thomas Schwentick,et al.  Temporal Logics on Words with Multiple Data Values , 2010, FSTTCS.

[18]  Nikos Tzevelekos.  Fresh-register automata , 2011, POPL '11.

[19]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[20]  Alexander Artikis,et al.  Specifying norm-governed computational societies , 2009, TOCL.

[21]  Michael Kaminski,et al.  Finite-Memory Automata with Non-Deterministic Reassignment , 2010, Int. J. Found. Comput. Sci..

[22]  Supratik Mukhopadhyay,et al.  Dynamic Message Sequence Charts , 2002, FSTTCS.

[23]  Benedikt Bollig,et al.  Realizability of Dynamic MSC Languages , 2010, CSR.

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

[25]  Benedikt Bollig,et al.  Muller message-passing automata and logics , 2008, Inf. Comput..

[26]  Diego Figueira,et al.  Forward-XPath and extended register automata on data-trees , 2010, ICDT '10.

[27]  Slawomir Lasota,et al.  An Extension of Data Automata that Captures XPath , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

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