# Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic

@inproceedings{Klein2005ExperimentsWD, title={Experiments with Deterministic $\omega$-Automata for Formulas of Linear Temporal Logic}, author={Joachim Klein and Christel Baier}, year={2005} }

This paper addresses the problem of generating deterministic ω-automata for formulas of linear temporal logic, which can be solved by applying wellknown algorithms to construct a nondeterministic Büchi automaton for the given formula on which we then apply a determinization algorithm. We study here in detail Safra’s determinization algorithm, present several heuristics that attempt to decrease the size of the resulting automata and report on experimental results.

## 71 Citations

### Markov Chains and Unambiguous Büchi Automata

- Computer ScienceCAV
- 2016

A polynomially time-bounded algorithm for probabilistic model checking of discrete-time Markov chains against unambiguous Buchi automata specifications is provided and an implementation and experiments are reported on.

### Are Good-for-Games Automata Good for Probabilistic Model Checking?

- Computer ScienceLATA
- 2014

It is shown how good-for-games automata can be used for the quantitative analysis of systems modeled by Markov decision processes against ω-regular specifications and evaluated by a series of experiments.

### Mechanizing the Minimization of Deterministic Generalized Büchi Automata

- Computer ScienceFORTE
- 2014

This work surveys techniques used to obtain and minimize DBAs for different classes of properties and presents benchmarks using a framework that implements all these techniques.

### Rabinizer: Small Deterministic Automata for LTL(F, G)

- Computer ScienceATVA
- 2012

We present Rabinizer, a tool for translating formulae of the fragment of linear temporal logic with the operators F (eventually) and G (globally) into deterministic Rabin automata. Contrary to tools…

### From LTL to Deterministic Automata: A Safraless Compositional Approach

- Computer ScienceCAV
- 2014

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula i¾?. The automaton is the product of a master automaton and an array of slave automata, one…

### On-the-Fly Stuttering in the Construction of Deterministic ω-Automata

- Linguistics, Computer Science
- 2007

The notion of partial stutter insensitiveness is introduced and the construction of potentially smaller deterministic ω-automata for such a property, e.g. using Safra’s determinization construction, is proposed.

### Limit Deterministic and Probabilistic Automata for LTL ∖ GU

- Computer Science, MathematicsTACAS
- 2015

LTL i¾? GU is a fragment of linear temporal logic LTL, where negations appear only on propositions, and formulas are built using the temporal operators X next, F eventually, G always, and U until,…

### Limit-Deterministic Büchi Automata for Linear Temporal Logic

- Computer ScienceCAV
- 2016

This work presents a direct construction from an LTL formula \(\varphi \) to a limit-deterministic Buchi automaton, which yields much smaller automata for formulas with deep nesting of modal operators and performs at least as well as the existing approaches on general formulas.

### LTL to Deterministic Emerson-Lei Automata

- Computer ScienceGandALF
- 2017

A new translation from linear temporal logic to deterministic Emerson-Lei automata with a Muller acceptance condition symbolically expressed as a Boolean formula is introduced, which is an enhanced product construction that exploits knowledge of its components to reduce the number of states.

### Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis

- Computer ScienceGANDALF
- 2010

This paper exploits the temporal logic hierarchy that corresponds to the well-known automata hierarchy as well as the non-confluence property of w-automata that result from certain translations of LTL formulas, and presents convincing experimental results that demonstrate the practical applicability of the new synthesis procedure.

## References

SHOWING 1-10 OF 35 REFERENCES

### Efficient minimization of deterministic weak omega-automata

- Computer ScienceInf. Process. Lett.
- 2001

### Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach

- Computer ScienceARTS
- 1999

The automata-theoretic approach to the algorithmic verification of probabilistic finite-state systems with respect to linear-time properties is described, which enables the reduction of Probabilistic model checking to ergodic analysis of Markov chains.

### Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra

- Computer ScienceTheor. Comput. Sci.
- 1995

### Language containment of non-deterministic omega-automata

- Computer ScienceCHARME
- 1995

Algorithms and techniques to determinize and complement Ω-automata with various forms of fairness constraints are investigated and implemented. A tool-box is constructed by supplementing these…

### Constructing Büchi Automata from Linear Temporal Logic Using Simulation Relations for Alternating Büchi Automata

- Computer ScienceCIAA
- 2003

This procedure computes simulation relations for alternating Buchi automata in an early stage and uses them in an on the-fly fashion to decrease the time and space consumption without sacrificing the potential of simulation relations.

### Efficient Büchi Automata from LTL Formulae

- Computer ScienceCAV
- 2000

We present an algorithm to generate small Buchi automata for LTL formulae. We describe a heuristic approach consisting of three phases: rewriting of the formula, an optimized translation procedure,…

### Simple on-the-fly automatic verification of linear temporal logic

- Computer SciencePSTV
- 1995

A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.

### Optimizing Büchi Automata

- Computer ScienceCONCUR
- 2000

A family of optimizations implemented in a translation from a linear temporal logic to Buchi automata can enhance the efficiency of model checking, as practiced in tools such as SPIN.

### Model checking for a probabilistic branching time logic with fairness

- Computer ScienceDistributed Computing
- 1998

A model checking algorithm for verifying whether a concurrent probabilistic process satisfies a PBTL formula assuming fairness constraints is presented and adaptations of existing model checking algorithms for pCTL to obtain procedures for PBTL under fairness constraints are proposed.