Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy

@inproceedings{Schneider2001ImprovingAG,
  title={Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy},
  author={Klaus Schneider},
  booktitle={LPAR},
  year={2001}
}
  • K. Schneider
  • Published in LPAR 3 December 2001
  • Computer Science
We present newalgorithms to translate linear time temporal logic (LTL) formulas with past operators to equivalent ω-automata. The resulting automata are given in a symbolic representation that directly supports symbolic model checking. Furthermore, this has the advantage that the translations run in linear time wrt. the length of the input formula. To increase the efficiency of the model checking, our translations avoid as far as possible the introduction of computationally expensive fairness… 
Bounded model checking of infinite state systems: exploiting the automata hierarchy
  • T. Schüle, K. Schneider
  • Computer Science
    Proceedings. Second ACM and IEEE International Conference on Formal Methods and Models for Co-Design, 2004. MEMOCODE '04.
  • 2004
TLDR
This work presents a new approach to bounded model checking that extends current methods in two ways: firstly, instead of a reduction to propositional logic, this work chooses a more powerful, yet decidable target logic, namely Presburger arithmetic, and secondly, it employs a special technique for translating safety and liveness properties to /spl omega/-automata with corresponding acceptance conditions.
Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking
TLDR
A new explicit-state translation of Linear Temporal Logic to automata for the class of LTL specifications that describe safety properties is devised, which can build deterministic Promela never claims that accept only the bad prefixes of the safety specification.
A Unified Translation of Linear Temporal Logic to ω-Automata
TLDR
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.
From LTL to Symbolically Represented Deterministic Automata
TLDR
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.
Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis
TLDR
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.
Relating Hierarchy of Linear Temporal Properties to Model Checking
TLDR
The hierarchy of properties as overviewed by Manna and Pnueli relates language, topology, ω-automata, and linear temporal logic classifications of properties to identify those linear time temporal properties which the model checking problem can be solved more efficiently than in the general case.
Automata-theoretic and bounded model checking for linear temporal logic
TLDR
An efficient algorithm for generating small finite state automata for so called non-pathological safety properties and an efficient on-the-fly algorithm, the first complete solution to tester verification problem, based on generalised nested depth-first search are presented.
Relating Hierarchy of Temporal Properties to Model Checking
TLDR
The hierarchy of properties as overviewed by Manna and Pnueli relates language, topology, ω-automata, and linear temporal logic classifications of properties to identify those linear time temporal properties for which the model checking problem can be solved more efficiently than in the general case.
Temporal logic encodings for SAT-based bounded model checking
TLDR
The normal form conversion early on in the encoding process is introduced and the simplifications that it brings to the generation of propositional logic are examined and compared to the popular automata-based methods for model checking and BMC.
From PSL to LTL: A Formal Validation in HOL
TLDR
Using the HOL theorem prover, the correctness of a translation from a subset of Accellera's property specification language PSL to linear temporal logic LTL is proved, which generates liveness or safety automata for corresponding PSL fragments, which is important for several applications like bounded model checking.
...
...

References

SHOWING 1-10 OF 59 REFERENCES
A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata
TLDR
An embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent ω-automata that enables HOL users to directly verify temporal properties by means of HOL's induction rules.
A HOL Conversion for Translating Linear Time Temporal Logic to ω-Automata ?
TLDR
An embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent ω-automata that enables HOL users to directly verify temporal properties by means of HOL’s induction rules.
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,
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
TLDR
The preliminary experimental results suggest that the new algorithm for LTL model checking is quite efficient, and for properties that can be expressed in both CTL and LTL, the algorithm is competitive with the CTL modelchecking algorithm.
Improved Automata Generation for Linear Temporal Logic
TLDR
The experimental results show that the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula outperforms the previous one, with respect to both the size of the generated automata and computation time.
Simple on-the-fly automatic verification of linear temporal logic
TLDR
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
TLDR
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.
Symbolic Model Checking: 10^20 States and Beyond
Fast LTL to Büchi Automata Translation
TLDR
An algorithm to generate Buchi automata from LTL formulae is presented and compared with Spin: the experiments show that the algorithm is much more efficient than Spin.
Optimizing B Uchi Automata
TLDR
A family of optimizations implemented in a translation from a linear temporal logic to B uchi automata can enhance the eeciency of explicit state model checking, as practiced in tools such as Spin.
...
...