Pierre Wolper

TIME Conference 2001 Conference Paper

Representing Periodic Temporal Information with Automata

• Pierre Wolper

TCS Journal 1998 Journal Article

An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages

• Doron Peled
• Thomas Wilke
• Pierre Wolper

LOPSTR Conference 1990 Conference Paper

Algorithms for Synthesizing Reactive Systems: A Perspective (Abstract)

• Pierre Wolper

Abstract Starting in the early 1980s, a number of algorithmic techniques have been proposed for synthesizing the synchronization kernel of reactive systems from high-level temporal logic specifications. These techniques are based on nontrivial results in logic and automata theory and appear to be quite powerful. Nevertheless, essentially none of this work has found its way to practical use. This paper reviews the main results from this area and tries to identify the main reasons that explain their nonexploitation.

TCS Journal 1987 Journal Article

The complementation problem for Büchi automata with applications to temporal logic

• A. Prasad Sistla
• Moshe Y. Vardi
• Pierre Wolper

STOC Conference 1986 Conference Paper

Reasoning about Fair Concurrent Programs

• Costas Courcoubetis
• Moshe Y. Vardi
• Pierre Wolper

STOC Conference 1984 Conference Paper

Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract)

• Moshe Y. Vardi
• Pierre Wolper

FOCS Conference 1983 Conference Paper

Reasoning about Infinite Computation Paths (Extended Abstract)

• Pierre Wolper
• Moshe Y. Vardi
• A. Prasad Sistla

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 finite automata. This gives rise to three different logics. It turns out, however. that these logics have the same expressive power but differ in the complexity of their decision problem. We also investigate the addition of alternation and show that it does not increase the complexity of the decision problem.

FOCS Conference 1981 Conference Paper

Temporal Logic Can Be More Expressive

• Pierre Wolper

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 extended to express any such property definable by a right-linear grammar and hence a regular expression, Finally, we give a decision procedure and complete axiomatization for the extended Temporal Logic.