A Verified and Compositional Translation of LTL to Deterministic Rabin Automata

  title={A Verified and Compositional Translation of LTL to Deterministic Rabin Automata},
  author={Julian Brunner and Benedikt Seidl and Salomon Sickert},
We present a formalisation of the unified translation approach from linear temporal logic (LTL) to ω-automata from [19]. This approach decomposes LTL formulas into “simple” languages and allows a clear separation of concerns: first, we formalise the purely logical result yielding this decomposition; second, we develop a generic, executable, and expressive automata library providing necessary operations on automata to re-combine the “simple” languages; third, we instantiate this generic theory… 

Figures from this paper

An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata

This work presents a direct and purely syntactic normalisation procedure for LTL yielding a normal form, comparable to the one by Chang, Manna, and Pnueli, that has only a single exponential blow-up.

Certifying Emptiness of Timed Büchi Automata

An approach for extracting certificates for the emptiness of timed Buchi automata from model checking runs and can be double checked by a certifier that is formally verify in Isabelle/HOL.

A Unified Translation of Linear Temporal Logic to ω-Automata

Evidence is given that this theoretical clean and compositional approach does not lead to large automata per se and in fact in the case of DRAs yields significantly smaller automata compared to the previously known approach using determinisation of NBAs.



Verifying the LTL to Büchi Automata Translation via Very Weak Alternating Automata

This work presents a formalization of a translation from LTL formulae to generalized Buchi automata in the HOL4 theorem prover, and uses the CakeML compiler to generate fully verified machine code implementing the translation.

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.

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

Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL

The correctness and termination of the implementation of a translation of LTL formulae into Buchi automata are proven in Isabelle/HOL, and executable code is generated using the Isabelle /HOL code generator.

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

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.

The CAVA Automata Library

The formalization techniques presented here allow an extension of the graph and automata library in the CAVA model checker to a wider scope, and are not limited to graph libraries, but apply to class hierarchies in general.

A Fully Verified Executable LTL Model Checker

An LTL model checker whose code has been completely verified using the Isabelle theorem prover is presented, which leads to a checker that can already be used as a trusted reference implementation against which advanced implementations can be tested.

Transition Systems and Automata

This entry provides a very abstract theory of transition systems that can be instantiated to express various types of automata, and comes with instantiations for DFAs, NFAs, and Büchi automata.

Principles of model checking

Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.

Automatic verification of probabilistic concurrent finite state programs

  • Moshe Y. Vardi
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
An automata-theoretic approach is described, whereby probabilistic quantification over sets of computations is reduced to standard quantificationover individual computations, and a new determinization construction for ω-automata is used to improve the time complexity of the algorithm by two exponentials.