Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

The Temporal Logic of Reactive and Concurrent Systems

Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems and control systems. These are among the most difficult computing… Expand

The temporal logic of programs

- A. Pnueli
- Computer Science
- 18th Annual Symposium on Foundations of Computer…
- 30 September 1977

A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time… Expand

Temporal verification of reactive systems - safety

0: Preliminary Concepts.- 0.1 Fair Transition System.- 0.2 A Programming Language (SPL): Syntax.- 0.3 A Programming Language (SPL): Semantics.- 0.4 Modules.- 0.5 Temporal Logic.- 0.6 Specification of… Expand

On the synthesis of a reactive module

We consider the synthesis of a reactive module with input <italic>x</italic> and output <italic>y</italic>, which is specified by the linear temporal formula @@@@(<italic>x</italic>,… Expand

Synthesis of Reactive(1) Designs

- Nir Piterman, A. Pnueli, Yaniv Sa'ar
- Computer Science
- VMCAI
- 8 January 2006

We consider the problem of synthesizing digital designs from their ltl specification. In spite of the theoretical double exponential lower bound for the general case, we show that for many expressive… Expand

On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract)

- O. Maler, A. Pnueli, J. Sifakis
- Computer Science
- STACS
- 2 March 1995

This paper presents algorithms for the automatic synthesis of real-time controllers by finding a winning strategy for certain games defined by the timed-automata of Alur and Dill. In such games, the… Expand

The temporal logic of branching time

- M. Ben-Ari, A. Pnueli, Z. Manna
- Mathematics, Computer Science
- POPL '81
- 1 September 1983

SummaryA temporal logic is defined which contains both linear and branching operators. The underlying model is the tree of all possible computations. The following metatheoretical results are proven:… Expand

Distributed reactive systems are hard to synthesize

The problem of synthesizing a finite-state distributed reactive system is considered. Given a distributed architecture A, which comprises several processors P/sub 1/, . . ., P/sub k/ and their… Expand

STATEMATE: a working environment for the development of complex reactive systems

- D. Harel, H. Lachover, +4 authors A. Shtul-Trauring
- Computer Science
- [] Proceedings. The Third Israel Conference on…
- 6 June 1988

Provides a brief overview of the STATEMATE system. STATEMATE is a graphical working environment, intended for the specification, analysis, design and documentation of large and complex reactive… Expand

Checking that finite state concurrent programs satisfy their linear specification

- O. Lichtenstein, A. Pnueli
- Computer Science
- POPL '85
- 1985

We present an algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program. The running time of the algorithm is exponential in the size of the… Expand