# Limit Deterministic and Probabilistic Automata for LTL ∖ GU

@inproceedings{Kini2015LimitDA,
title={Limit Deterministic and Probabilistic Automata for LTL ∖ GU},
author={Dileep Kini and Mahesh Viswanathan},
booktitle={TACAS},
year={2015}
}
• Published in TACAS 11 April 2015
• Computer Science, Mathematics
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, with the restriction that no until operator occurs in the scope of an always operator. Our main result is the construction of Limit Deterministic Buchi automata for this logic that are exponential in the size of the formula. One consequence of our construction is a new, improved EXPTIME model checking…
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
• Computer Science
ATVA
• 2016
This work presents an extension of PRISM for LTL model checking of MDP using LDBA, a special subclass of limit-deterministic Buchi automata that can replace deterministic Rabin automata in quantitative probabilistic model checking algorithms.
From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
• Computer Science
TACAS
• 2017
This paper describes a single exponential translation from limit-deterministic Buchi automata (LDBA) to DPA, and shows that it can be concatenated with a recent efficient translation from LTL to LDBA to yield a double exponential, “Safraless” LTL-to-DPA construction.
Rabinizer 4: From LTL to Your Favourite Deterministic Automaton
• Computer Science
CAV
• 2018
Rabinizer 4 is presented, a tool set for translating formulae of linear temporal logic to different types of deterministic $$\omega$$-automata and enhancements both in terms of the size of the automata and the computational time are shown, due to algorithmic as well as implementation improvements.
Controller Synthesis for MDPs and Frequency LTL\GU
• Computer Science, Mathematics
LPAR
• 2015
Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of
Controller synthesis for MDPs and Frequency LTL$\setminus$GU
• Computer Science, Mathematics
ArXiv
• 2015
This work shows that the problem is decidable for the fragment fLTL$\setminus$GU, where U does not occur in the scope of G (but still F can) and based on a novel translation of such quantitative formulae into equivalent deterministic automata.
Limit-Deterministic Büchi Automata for Linear Temporal Logic
• Computer Science
CAV
• 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.
A Unified Translation of Linear Temporal Logic to ω-Automata
• Computer Science
• 2020
A unified translation of LTL formulas into nondeterministic Buchi automata, limit-deterministic LTL automata (LDBA), and deterministic Rabin Automata (DRA) is presented.
One Theorem to Rule Them All: A Unified Translation of LTL into ω-Automata
• Computer Science
LICS
• 2018
A unified translation of LTL formulas into deterministic Rabin automata, limit-deterministic Büchi Automata, and nondeterministicBüchi automata derived from one single Master Theorem of purely logical nature is presented.
L O ] 1 4 Se p 20 15 Controller synthesis for MDPs and Frequency LTL \
• Computer Science, Mathematics
• 2020
Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of
Optimal Translation of LTL to Limit Deterministic Automata
• Computer Science
TACAS
• 2017
This paper shows how to construct limit deterministic automata for full LTL and shows experimental results demonstrating that the construction yields smaller automata when compared to state of the art techniques that translate LTL to deterministic and limit deter determinant automata.

## References

SHOWING 1-10 OF 19 REFERENCES
Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
• Computer Science
ATVA
• 2013
A tool that generates automata for LTL(X,F,G,U) where U does not occur in any G-formula (but F still can) where DGRA have been recently shown to be as useful in probabilistic model checking as DRA.
From LTL to Symbolically Represented Deterministic Automata
• Computer Science
VMCAI
• 2008
This paper generates symbolic descriptions of equivalent deterministic parity automata which was so far not possible for full LTL, using a new determinization procedure for ω-automata that stem from LTL formulas.
Probabilistic Automata for Safety LTL Specifications
• Computer Science
VMCAI
• 2014
This paper presents constructions of finite-state probabilistic monitors FPM for safety properties expressed in LTL and shows that these constructions are optimal.
Efficient Büchi Automata from LTL Formulae
• Computer Science
CAV
• 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,
Deterministic generators and games for Ltl fragments
• Computer Science, Mathematics
TOCL
• 2004
This paper identifies LTL fragments of lower complexity and shows tightness of the double-exponential bound on the size as well as the longest distance for deterministic generators for LTL, even in the absence of "next" and "until" modalities.
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment
• Computer Science
ATVA
• 2013
This work presents a new translation to deterministic Rabin automata via alternating automata and deterministic transition-based generalized RabinAutomata that can produce significantly smaller automata compared to Rabinizer and ltl2dstar.
Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic
• Computer Science
• 2005
Safra’s determinization algorithm is studied in detail, several heuristics that attempt to decrease the size of the resulting automata are presented and experimental results are reported on.
The complexity of probabilistic verification
• Computer Science, Mathematics
JACM
• 1995
This work determines the complexity of testing whether a finite state, sequential or concurrent probabilistic program satisfies its specification expressed in linear-time temporal logic and addresses questions for specifications described by ω-automata or formulas in extended temporal logic.
On the Merits of Temporal Testers
• Computer Science
25 Years of Model Checking
• 2008
The paper discusses the merits of temporal testers, which can serve as a compositional basis for automata construction corresponding to temporal formulas in the context of ltl, psl, and mitl logics, and presents a general overview of the tester methodology.