Tableau-based automata construction for dynamic linear time temporal logic* (original) (raw)

On-the-fly automata construction for dynamic linear time temporal logic

Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004., 2004

We present a tableau-based algorithm for obtaining a Büchi automaton from a formula in Dynamic Linear Time Temporal Logic (DLT L), a logic which extends LTL by indexing the until operator with regular programs. The construction of the states of the automaton is similar to the standard construction for LT L, but a different technique must be used to verify the fulfillment of until formulas. The resulting automaton is a Büchi automaton rather than a generalized one. The construction can be done on-the-fly, while checking for the emptiness of the automaton.

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

… Testing and Verification, 1995

We present a tableau-based algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "on-the-fly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model. In particular, it is possible to detect that a property does not hold by only constructing part of the model and of the automaton. The algorithm can also be used to check the validity of a temporal logic assertion. Although the general problem is PSPACE-complete, experiments show that our algorithm performs quite well on the temporal formulas typically encountered in verification. While basing linear-time temporal logic model-checking upon a transformation to automata is not new, the details of how to do this efficiently, and in "on-the-fly" fashion have never been given.

Constructing Automata from Temporal Logic Formulas: A Tutorial⋆

2001

This paper presents a tutorial introduction to the construction of finite-automata on infinite words from linear-time temporal logic formulas. After defining the source and target formalisms, it describes a first construction whose correctness is quite direct to establish, but whose behavior is always equal to the worst-case upper bound. It then turns to the techniques that can be used to improve this algorithm in order to obtain the quite effective algorithms that are now in use.

Improved Automata Generation for Linear Temporal Logic

Lecture Notes in Computer Science, 1999

We improve the state-of-the-art algorithm for obtaining an automaton from a linear temporal logic formula. The automaton is intended to be used for model checking, as well as for satisfiability checking. Therefore, the algorithm is mainly concerned with keeping the automaton as small as possible. The experimental results show that our algorithm outperforms the previous one, with respect to both the size of the generated automata and computation time. The testing is performed following a newly developed methodology based on the use of randomly generated formulas.

An automata-theoretic approach to linear temporal logic

Logics for concurrency, 1996

The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs and specifications are in essence descriptions of computations. These computations can be viewed as words over some alphabet. Thus, programs and specifications can be viewed as descriptions of languages over some alphabet. The automata-theoretic perspective considers the relationships between programs and their specifications as relationships between languages. By translating programs and specifications to automata, questions about programs and their specifications can be reduced to questions about automata. More specifically, questions such as satisfiability of specifications and correctness of programs with respect to their specifications can be reduced to questions such as nonemptiness and containment of automata. Unlike classical automata theory, which focused on automata on finite words, the applications to program specification, verification, and synthesis, use automata on infinite words, since the computations in which we are interested are typically infinite. This paper provides an introduction to the theory of automata on infinite words and demonstrates its applications to program specification, verification, and synthesis.

Final report:‘Analysis and Mechanisation of Decidable First-Order Temporal Logics’

First-order temporal logic (FOTL) has long been regarded by many as a perfect formalism for program specification and verification, temporal databases, synthesis of programs, model checking, temporal knowledge representation and reasoning, etc. The fatal problem was that mechanisation seemed out of the question, because only 'negative' results (undecidability, non-recursive enumerability) were known. The starting point of this project was the discovery in [HWZ00] of decidable and yet rather expressive 'monodic' fragments of FOTL, which opened new and exciting opportunities for using FOTL in various areas of computer science and artificial intelligence.

A Tableau Calculus for Temporal Description Logic: The Constant Domain Case

2001

We show how to combine the standard tableau system for the basic description logic ALC with Wolper's tableau calculus for propositional temporal logic PTL in order to design a terminating sound and complete tableau-based satis abilitychecking algorithm for the temporal description logic PTL ALC of 19] interpreted in models with constant domains. We use the method of quasimodels 16, 14] to represent models with in nite domains, and the technique of minimal types 9] to maintain these domains constant. The combination is exible and can be extended to more expressive description logics or even to decidable fragments of rst-order temporal logics.

Alternating automata: Unifying truth and validity checking for temporal logics

1997

We describe an automata-theoretic approach to the automated checking of truth and validity for temporal logics. The basic idea underlying this approach is that for any formula we can construct an alternating automaton that accepts precisely the models of the formula. For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton runs on infinite trees.

A Tableau Calculus for Temporal Description Logic: the Expanding Domain Case

Journal of Logic and Computation, 2002

A Better Translation From LTL to Transition-Based Generalized Büchi Automata

IEEE Access, 2017

Translating linear temporal logic (LTL) formulas into Büchi automata is one of the most important aspects of LTL model checking. Certain successful algorithms, such as LTL2BA and SPOT, first translate an LTL formula into a transition-based generalized Büchi automaton (TGBA) and then degeneralize it into a Büchi automaton. This paper focuses on achieving a better translation from LTL to TGBA and analyzing the performance of every step of the algorithm. We decompose the translation into three steps to give a step-wise description and improve all three steps. The first step is the basic translation without acceptance conditions and simplifications, which combines the advantages of both LTL2BA and SPOT. Second, we introduce a new definition of acceptance conditions. Our proofs and experiments have shown that our technique is more efficient and improves the degeneralization ability. Finally, we introduce the simplifications of our algorithm. We focus on not only producing better final Büchi automata but also minimizing intermediate automata, which can reduce the execution time. INDEX TERMS Büchi Automata, model checking, LTL, TGBA.

Tableau-based automata construction for dynamic linear time temporal logic* (original) (raw)

Related papers