Pnueli, A. The temporal logic of programs. Proc. of the 18th Symposium on the Foundations of Computer Sci- ence, Providence R.I., Nov. 1977, IEEE, 46-57.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....agreement on the details of such a specification language, there is agreement that temporal logic provides a good basis for such a language and it, or something close to it, is sufficiently expressive. Temporal logic has also been used in proving temporal properties of concurrent programs [Pnueli 77] Manna Pnueli 8lb] Manna Pnueli 84] Owicki Lainport 82] Here, a program is regarded as defining a collection of temporal logic axioms. The programmer proves that a program satisfies some property of interest by using these axioms along with program independent axioms and inference rules ....

Pnueli, A. The temporal logic of programs. Proc. of the 18th Symposium on the Foundations of Computer Sci- ence, Providence R.I., Nov. 1977, IEEE, 46-57.

....are p btt hard for EXP have p 2 measure 0. This last result was improved for complete sets by Ambos Spies et al. in [1] We have thus obtained a natural example of a nonweakly complete set for EXP that is not in P , answering an open question of Lutz (verbal communication) Juedes and Lutz [10] note the existence of sets in E whose upper and lower p m spans are both small. We extend this result by showing that R t is also a set for which both the lower and upper p btt spans have measure 0 in EXP , which in the lattice induced by p btt reductions means that R t lives in a ....

....(R l ) has p measure 0. Proof: Use Theorems 12, 13, 21 and 22. 2 This leaves us with a somewhat strange situation. The sets below R t with respect to Turing reductions and the sets above R t with respect to p btt reductions are few and far apart. The small span theorem of Juedes and Lutz [10] says that at least one of the lower and upper spans must have measure 0; formally, for every A 2 EXP , either Pm (A) has measure 0 in EXP , or Pm Gamma1 (A) has p 2 measure 0. In fact what they prove is that for every A 2 EXP , if Pm (A) does not have measure 0 in EXP , then Pm Gamma1 (A) ....

[Article contains additional citation context not shown here]

D.W. Juedes and J.H. Lutz. The Complexity and Distribution of Hard Problems. Proc. 34th Symposium on Foundations of Computer Science, pages 177--185, 1993. To appear in SIAM J. on Computing.

....semantics in which a single execution of the system is considered to be a totally ordered sequence of events. The (linear) semantics of the system is, then, a set of total order executions that the system can possibly generate. The specifications are written in the linear temporal logic LTL [13]. The model checker checks if every execution of the system satisfies the LTL specification 1 . In contrast to the interleaving semantics, the partial order semantics considers a single execution as a partially ordered set of events. The partial order semantics does not distinguish among ....

A. Pnueli. The temporal logic of programs. 18th Symposium on Foundations of Computer Science, 46--77, 1977.

....via interleavings fails to describe a parallel execution. Theory of concurrency contains many relevant results, 2 advocating different time models that can be applied to parallel execution of programs [1] In particular, Pratt in [21] constructs a mixed term of partial orders and temporal logic ([20]) to model parallel processes. This work also contains motivations for true concurrency execution, and a short survey of relevant results. The system proposed here can be best represented through the formalism developed by Gaifman [7] Unlike Gaifman s formalism which is more general, this ....

A. Pnueli, The Temporal Logic of Programs, Proc. of the 18th Symposium on the Foundations of Computer Science, ACM Nov. (1977).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC