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}
}
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

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

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

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

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 \

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

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

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

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

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 \

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

References

SHOWING 1-10 OF 19 REFERENCES

Probabilistic Büchi Automata for LTL\GU

This work construction is a new, improved EXPTIME model checking algorithm for Markov Decision Processes and LTL\GU formulae that is exponential in the size of the formula.

Deterministic Automata for the (F,G)-fragment of LTL

This work presents a direct translation of the ( F, G )-fragment of LTL into deterministic ω-automata with no determinization procedure involved and investigates the complexity of this translation and provides experimental results and compare them to the traditional method.

Rabinizer 2: Small Deterministic Automata for LTL ∖ GU

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 Deterministic Automata: A Safraless Compositional Approach

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

From LTL to Symbolically Represented Deterministic Automata

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

This paper presents constructions of finite-state probabilistic monitors FPM for safety properties expressed in LTL and shows that these constructions are optimal.

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

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

Efficient Büchi Automata from LTL Formulae

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,

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment

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

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.