From LTL to deterministic automata

@article{Esparza2016FromLT,
  title={From LTL to deterministic automata},
  author={J. Esparza and Jan Kret{\'i}nsk{\'y} and Salomon Sickert},
  journal={Formal Methods in System Design},
  year={2016},
  volume={49},
  pages={219-271}
}
We present a new algorithm to construct a (generalized) deterministic Rabin automaton for an LTL formula $$\varphi $$φ. The automaton is the product of a co-Büchi automaton for $$\varphi $$φ and an array of Rabin automata, one for each $${\mathbf {G}}$$G-subformula of $$\varphi $$φ. The Rabin automaton for $${\mathbf {G}}\psi $$Gψ is in charge of recognizing whether $${\mathbf {F}}{\mathbf {G}}\psi $$FGψ holds. This information is passed to the co-Büchi automaton that decides on acceptance. As… Expand
14 Citations
Model checking with generalized Rabin and Fin-less automata
  • 2
  • PDF
Explicit state model checking with generalized Büchi and Rabin automata
  • 1
  • PDF
Inherent Size Blowup in ω-Automata
A Weakness Measure for GR(1) Formulae
  • 1
  • PDF
...
1
2
...

References

SHOWING 1-10 OF 48 REFERENCES
Tighter Bounds for the Determinisation of Büchi Automata
  • 79
  • PDF
On the complexity of omega -automata
  • S. Safra
  • Mathematics, Computer Science
  • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
  • 467
  • PDF
Converting Linear Temporal Logic to Deterministic (Generalised) Rabin Automata
  • 3
  • PDF
Safraless decision procedures
  • O. Kupferman, Moshe Y. Vardi
  • Mathematics, Computer Science
  • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
  • 221
  • PDF
Efficient Büchi Automata from LTL Formulae
  • 356
Deterministic Automata for the (F,G)-fragment of LTL
  • 50
  • PDF
Fast LTL to Büchi Automata Translation
  • 681
  • PDF
...
1
2
3
4
5
...