Feasible Automata for Two-Variable Logic with Successor on Data Words

@article{Kara2011FeasibleAF,
  title={Feasible Automata for Two-Variable Logic with Successor on Data Words},
  author={Ahmet Kara and Thomas Schwentick and Tony Tan},
  journal={ArXiv},
  year={2011},
  volume={abs/1110.1221}
}
We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain. The model is (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to… 

Commutative Data Automata

It is demonstrated that the commutativity of class conditions is the genuine reason accounting for the elementary complexity of weak data automata, and it is proved that the nonemptiness of commutative BuchiData automata can be decided with elementary complexity in 4NEXPTIME.

Extending two-variable logic on data trees with order on data values and its automata

  • Tony Tan
  • Computer Science, Mathematics
    ACM Trans. Comput. Log.
  • 2014
A number of existing formalisms and models studied in the literature can be captured already by weak ODTA, and the definition of ODTA can be easily modified, to the case where the data values come from a tree-like partially ordered domain, such as strings.

An Automata Model for Trees with Ordered Data Values

  • Tony Tan
  • Computer Science
    2012 27th Annual IEEE Symposium on Logic in Computer Science
  • 2012
This paper introduces an automata model for data trees in which the data values come from a linearly ordered domain, and shows that in addition to equality test, it can test whether the data value in a node is greater than the one in another node.

Using class memory automata in algorithmic game semantics

This thesis aims to continue the classification of the fragments of the higher-order call-by-value language RML for which observational equivalence is decidable, and develops new variants of class memory automata that allow us to express and compare languages representing game semantic strategies.

Nominal Büchi Automata with Name Allocation

It is proved that, in contrast to most other nondeterministic automata models over infinite alphabets, language inclusion of Büchi RNNAs is decidable and in fact elementary, which makes B Müchi RnnAs a suitable tool for applications in model checking.

Weak and Nested Class Memory Automata

This work identifies a restriction – which is called weakness – of CMA, and shows that they are equivalent to three existing forms of automata over data languages, and that in the deterministic case they are closed under all Boolean operations, and hence have an ExpSpace-complete equivalence problem.

Formal Reasoning on Infinite Data Values: An Ongoing Quest

This chapter presents a tutorial to summarise the state of the art of formal models to reason about software systems that contain data values from an infinite domain, focusing on automata models and logics.

A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

N nominal automata that accept infinite words are investigated and it is proved decidability of complement, union, intersection, emptiness and equivalence, and determinacy by ultimately periodic words are proved.

Reasoning about Data Repetitions with Counter Systems

It is shown that allowing/disallowing atomic formulas expressing repetitions of values in the past corresponds to the reachability/coverability problem in Petri nets, which gives 2EXPSPACE upper bounds for several satisfiability problems.

Nominal deterministic omega automata ?

These automata are a generalisation of deterministic Muller automata to the setting of nominal sets, and it is proved decidability of complement, union, intersection, emptiness and equivalence is shown.

References

SHOWING 1-10 OF 26 REFERENCES

An Automaton over Data Words That Captures EMSO Logic

A general framework for the specification and implementation of systems whose executions are words, or partial orders, over an infinite alphabet is developed, and class register automata, a one-way automata model over words with multiple data values is introduced.

LTL with the Freeze Quantifier and Register Automata

It is proved that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register.

A Decidable Extension of Data Automata

A decidable model called class automata with priority class condition, which restricts class Automata but strictly extends data automata, is proposed and is applied to extend a decidability result of Alur, Cern\'y and Weinstein on the algorithmic analysis of array-accessing programs.

Safety alternating automata on data words

Safety one-way alternating automata with one register on infinite data words are considered, their nonemptiness is shown to be ExpSpace-complete, and their inclusion decidable but not primitive recursive.

Two-Variable Logic on Words with Data

It is shown that satisfiability for the two-variable first-order logic FO2(~,<,+1) is decidable over finite and over infinite data words, where ~ is a binary predicate testing the data value equality and +1,< are the usual successor and order predicates.

On the Satisfiability of Two-Variable Logic over Data Words

This work gives a much simplified proof of the decidability of two-variable logics for data words with the successor and data-equality predicates and provides several new fragments of lower complexity.

On notions of regularity for data languages

On the Use of Guards for Logics with Data

The new logic 'rigidly guarded MSO' is introduced and it is shown that the data languages definable in this logic are exactly those recognizable by orbit finite data monoids.

Context-free languages over infinite alphabets

Context-free grammars and pushdown automata over infinite alphabets are introduced and it is shown that a language is generated by a context-free grammar over an infinite alphabet if and only if it is accepted by a push down automaton over an Infinite alphabet.

Decision problems of finite automata design and related arithmetics

The problems are concerned with the problems of automatically designing an automaton from a specification of a relation which is to hold between the automaton's input sequences and determined output sequences and the formalisms for expressing "design requirements" are described.