The Automata Theory Package omega

@inproceedings{Vge1997TheAT,
  title={The Automata Theory Package omega},
  author={Jens V{\"o}ge and S. Ulbrand and Oliver Matz and Nils Buhrke},
  booktitle={Workshop on Implementing Automata},
  year={1997}
}
In this paper we present omega, a package of algorithms from the theory of ω-automata. It is a growing collection of procedures which at the moment encompasses constructions like: inclusion tests for regular ω-languages, conversion of acceptance conditions, Safra's determinization algorithm, construction of strategies in infinite games. 

Language Containment Checking with Nondeterministic BDDs

TLDR
This work presents a symbolic procedure for language containment checking between two Buchi automata and presents a fix-point algorithm for the emptiness check of alternating automata.

Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set

  • Xavier Augros
  • Computer Science, Mathematics
    Workshop on Implementing Automata
  • 1998
TLDR
The construction of the graph of delays for a finite language L is implemented which can be view as an automaton that accept words and ω-words that are ambiguously covered by L.

Solving µ-Calculus Parity Games by Symbolic Planning

TLDR
This paper applies symbolic planning to solve parity games equivalent to μ-calculus model checking problems with at most one fixpoint operator and partitioned images in the worst case.

Reasoning about Reactive Systems

TLDR
This thesis proposes a practical framework for integrating the behavioural reasoning about distributed reactive systems with model-checking methods including standard concepts like implementation, abstraction, and proof methods for compositional reasoning and shows that trace abstractions and the proof methods can be expressed in a decidable Monadic Second-Order Logic (M2L) on words.

References

SHOWING 1-10 OF 17 REFERENCES

On the complexity of omega -automata

  • S. Safra
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
The author presents a determinisation construction that is simpler and yields a single exponent upper bound for the general case, and can be used to obtain an improved complementation construction for Buchi automata that is essentially optimal.

On The Complexity of w-Automata

  • S. Safra
  • Computer Science, Mathematics
  • 1988
TLDR
McNaughton proved that the classes of languages accepted by nondeterministic Biichi automata and by deterministic Muller automata are the same.

A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata

TLDR
The complexity of showing language containment and equivalence between a Buchi automaton and a Muller or Streett automaton is given and a six by six matrix in which each row and column is associated with one of these types of automata is given.

Automata on Infinite Objects

  • W. Thomas
  • Computer Science
    Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990

On the Synthesis of Strategies in Infinite Games

TLDR
The automata theoretic setting of infinite games (given by “game graphs”), a new construction of winning strategies in finite-state games, and some questions which arise for games over effectively presented infinite graphs are described.

Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time

Based on a detailed graph theoretical analysis, Wagner's fundamental results of 1979 are turned into efficient algorithms to compute the Wadge degree, the Lifschitz degree, and the Rabin index of a

Strategy Construction in Infinite Ganes with Streett and Rabin Chain Winning Conditions

TLDR
An algorithm is presented which solves the problem of program synthesis for finite-state games with Streett winning condition by developing an inductive strategy construction over Rabin chain automata which yields finite automata that realize winning strategies.

Minimal Separating Sets for Muller Automata

TLDR
It is shown that the problem whether in a Muller automaton a separating set of a given size exists is NP-complete and an algorithm is presented based on an analysis of the loop structure of the given automaton.

Infinite Games Played on Finite Graphs