Share This Author
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.
An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report)
An automata-theoretic approach to branching-time model checking
It is shown that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics, and can be used to obtain optimal decision procedures and make it possible to derive optimal model-checking algorithms.
Reasoning About Infinite Computations
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
Temporal logic can be more expressive
- P. Wolper
- Philosophy22nd Annual Symposium on Foundations of Computer…
- 28 October 1981
Memory-efficient algorithms for the verification of temporal properties
- C. Courcoubetis, Moshe Y. Vardi, P. Wolper, M. Yannakakis
- Computer ScienceFormal Methods Syst. Des.
- 18 June 1990
Algorithms are presented that solve the emptiness problem without explicitly constructing the strongly connected components of the graph representing the product automaton by allowing the algorithms to err with some probability.
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic
Automata-Theoretic Techniques for Modal Logics of Programs
The tableau method for temporal logic: an overview
- P. Wolper
An overview of the tableau decision method for propositional temporal logic and how it can be applied to other variants of temporal logic like branching time temporal Logic and extensions o f linear time temporal logic are presented.