On the Complexity of Parity Word Automata

@inproceedings{King2001OnTC,
  title={On the Complexity of Parity Word Automata},
  author={Valerie King and Orna Kupferman and Moshe Y. Vardi},
  booktitle={FoSSaCS},
  year={2001}
}
Different types of nondeterministic automata on infinite words differ in their succinctness and in the complexity for their nonemptiness problem. A simple translation of a parity automaton to an equivalent Buchi automaton is quadratic: a parity automaton with n states, m transitions, and index k may result in a Buchi automaton of size O((n + m)k). The best known algorithm for the nonemptiness problem of parity automata goes through Buchi automata, leading to a complexity of O((n + m)k). In this… 

On the complexity of ω-pushdown automata

TLDR
Novel algorithms for the emptiness problem of ω-PDAs are proposed based on the observations of the structure of accepting runs and it is shown that these algorithms yield a better solution for the pushdown model checking problem against linear temporal logic with fairness.

A Survey on Satisfiability Checking for the μ-Calculus through Tree Automata

TLDR
This work views the non-emptiness checking of alternating tree automata by a reduction to solving parity games of a certain structure, so-called emptiness games, and shows how the construction of the emptiness games combines a (fixed) structural part with (history-)determinization of parity word automata.

Generalized simulation relations with applications in automata theory

TLDR
The central topic of this thesis is the design of GFQ equivalences for Buchi automata, and how simulation relations have recently been applied to significantly optimize exact (exponential) language inclusion algorithms, thus extending their practical applicability.

Mechanizing the Powerset Construction for Restricted Classes of ω-Automata ⋆

TLDR
This paper shows how and when the standard powerset construction for automata over finite words can be used to determinize Automata over infinite words, and presents applications of this new determinization construction to improve the automata-based approach for the mixed firstorder linear arithmetic over the reals and the integers.

Permutation Games for the Weakly Aconjunctive mu-Calculus

TLDR
By showing that limit-deterministic parity automata can be used to recognize unsuccessful branches in pre-tableaux for the weakly aconjunctive $\mu$-calculus, satisfiability games of size $n$ with $\mathcal{O}(nk)$ priorities with alternation-depth $k$ are obtained.

Why These Automata Types?

TLDR
This work shows that unifying or intersecting deterministic automata of the classic ω-regularcomplete types, namely parity, Rabin, Streett, and Muller, involves an exponential size blowup, and argues that there are good reasons for the classic types, mainly in the case of nondeterministic and alternating automata.

Converting A Subset of LTL Formula to Buchi Automata

  • B. KansoAli Kansou
  • Computer Science
    International Journal of Software Engineering & Applications
  • 2019
TLDR
A subset of LTL formula is proposed which can be converted to Buchi automata whose the size is polynomial, making verification methods hard or even impossible to be implemented in practice.

Parityizing Rabin and Streett

TLDR
This paper uses the construction of the parity condition in the deterministic case in order to solve the problem of deciding whether a given Rabin or Streett automaton has an equivalent parity automaton on the same structure, and shows that it is PTIME-complete in the Deterministic setting and is PSPACE- complete in the nondeterministic setting.

EFFICIENT ALGORITHM TO TRANSFORM MINIMALIST SUBSET OF LTL FORMULA INTO FINITE STATE MODELS

TLDR
A subset of LTL formula is proposed which can be converted to Büchi automata whose the size is polynomial, which makes verification methods hard or even impossible to be implemented in practice.

From a Subset of LTL Formula to Büchi Automata

TLDR
A fragment of Linear Temporal Logic (LTL) is presented together with an polynomial translation of formula from this LTL fragment into equivalent Büchi automata based on Java Pluging Framework in GOAL Tool as a plugin.

References

SHOWING 1-10 OF 20 REFERENCES

The complexity of tree automata and logics of programs

  • E. EmersonC. Jutla
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
It is shown that for tree automata with m states and n pairs nonemptiness can be tested in time O((mn)/sup 3n/), even though the problem is in general NP-complete, and it follows that satisfiability for propositional dynamic logic with a repetition construct and for the propositional mu-calculus can be tests in deterministic single exponential time.

Regular expressions for infinite trees and a standard form of automata

  • A. Mostowski
  • Computer Science, Mathematics
    Symposium on Computation Theory
  • 1984
For Rabin pair automata [R1] a standard form is defined /def. 2/ i.e. such that an ordered subset {s1,...,s2I-1} of states is distinguished in such a way that a path of a run is accepting /rejecting

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

TLDR
The algorithm can be used to decide emptiness of Büchi automata with the same complexity bound, improving Emerson and Lei's quadratic bound, and emptiness of Streett automata, with a similar bound in terms of nodes.

Tree automata, mu-calculus and determinacy

  • E. EmersonC. Jutla
  • Mathematics, Computer Science
    [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
TLDR
It is shown that the propositional mu-calculus is equivalent in expressive power to finite automata on infinite trees, which provides a radically simplified, alternative proof of M.O. Rabin's (1989) complementation lemma for tree automata, which is the heart of one of the deepest decidability results.

Decidability of second-order theories and automata on infinite trees

Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves

Reasoning About Infinite Computations

TLDR
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.

Automata for the mu-calculus and Related Results

TLDR
It is shown that every formula is semantically equivalent to a disjunctive formula and this kind of formula gives rise to a new notion of finite automaton which characterizes the expressive power of the mu-calculus over all transition systems.

Automata for the Modal mu-Calculus and related Results

TLDR
It is shown that every formula is semantically equivalent to a disjunctive formula and this kind of formula gives rise to a new notion of finite automaton which characterizes the expressive power of the Μ-calculus over all transition systems.

On a Decision Method in Restricted Second Order Arithmetic

Let SC be the interpreted formalism which makes use of individual variables t, x, y, z,... ranging over natural numbers, monadic predicate variables q( ), r( ), s( ), i( ),... ranging over arbitrary