Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program....
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 specifications of hardware designs the problem can be solved in time N 3. We describe the context of the problem, as part of the Prosyd European Project which… (More)
This paper provides a brief overview of the STATEMATE system, constructed over the past three years by i-Logix Inc., and Ad Cad Ltd. STATEMATE is a graphical working environment, intended for the specification, analysis, design and documentation of large and complex reactive systems, such as real-time embedded systems, control and communication systems, and… (More)
This paper presents algorithms for the automatic synthesis of real-time controllers by nding a winning strategy for certain games deened by the timed-automata of Alur and Dill. In such games, the outcome depends on the players' actions as well as on their timing. W e believe that these results will pave t h e w ay for the application of program synthesis… (More)
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>, <italic>y</italic>). We show that there exists a program satisfying @@@@ iff the branching time formula (∀<italic>x</italic>) (∃<italic>y</italic>)… (More)
A temporal language and system are presented which are based on branching time structure. By the introduction of symmetrically dual sets of temporal operators, it is possible to discuss properties which hold either along one path or along all paths. Consequently it is possible to express in this system all the properties that were previously expressible in… (More)
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 formula but linear in the size of the checked program. The algorithm yields also a formal proof in case the formula is valid over the program. The algorithm… (More)