This volume offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors.Expand

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

An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.Expand

This paper presents a meta-language for estimating Satisfiability over a Finite-State Program: Examples and some examples of how such a program might be implemented in a number of different programming languages.Expand

It is shown that for many expressive specifications of hardware designs the problem of synthesizing digital designs from their ltl specification can be solved in time N3, where N is the size of the state space of the design.Expand

Algorithm 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 will pave the way for the application of program synthesis techniques to the construction ofreal-time embedded systems from their specifications.Expand

The following metatheoretical results are proven: 1) an exponential decision procedure for satisfiability; 2) a finite model property; 3) the completeness of an axiomatization.Expand

An algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program and a formal proof in case the formula is valid over the program is presented.Expand

It is shown that the problem of realizing a given propositional specification over a given architecture is undecidable, and it is nonelementarily decidable for the very restricted class of hierarchical architectures.Expand