We present a tableau-based construction for obtaining an automaton from a temporal logic formula in an “on-the-fly” fashion. That is, the automaton can be constructed simultaneously with, and guided… (More)

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this… (More)

We start by proving that some properties of sequences are not expressible in Temporal Logic though they are expressible using for instance regular expressions. Then, we show how Temporal Logic can be… (More)

The problem of complementing Biichi automata arises when developing decision procedures for temporal logics of programs. Unfortunately, previously known constructions for complementing Biichi… (More)

In this paper, Propositional Temporal Logic (PTL) is applied to the specification and synthesis of the synchronization part of communicating processes. To specify a process, a PTL formula that… (More)

We present a new technique for obtaining decision procedures for modal logics of programs. The technique centers around a new class of finite automata on infinite trees for which the emptiness… (More)

We investigate extensions of temporal logic by finite automata on infinite words. There are three different types of acceptance conditions (finite, looping and repeating) that one can give for these… (More)