Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs. Springer-Verlag, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Reasoning about Meta Level Activities in Open Distributed.. - Venkatasubramanian (1995) (7 citations) (Correct)
....requirements allow us to reason about composition of migration and reachability snapshot services. 1.3 Other Related Work A number of language independent formalisms have been developed for specifying and reasoning about concurrent systems. These include formalisms based on temporal logic [21, 18, 19], behavior histories [22] and I O automata [20] These formalisms provide a general framework for specifying safety and liveness properties and a means of organizing proofs. They have been used to specify and verify a variety of protocols. One difficulty with existing formalisms is that ....
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Programs. Springer-Verlag, New York, 1992.
An Adaptive Resource Management Architecture For Global.. - Venkatasubramanian (1998) (1 citation) (Correct)
....computing framework is the HP Information Utility [80] 2. 6 Formal Reasoning about Distributed Systems A number of formalisms have been developed for specifying and reasoning about concurrent systems [1, 30, 112, 113] These include language independent formalisms based on temporal logic [108, 96, 98], behavior histories [122] and I O automata [105] These formalisms provide a general framework for specifying safety and liveness properties and a means of organizing proofs. The Unity language [39] is a notation for describing systems. The focus of this work has been the development of methods ....
....and reasoning about applications, system level services, and their interactions in a common framework. 4.1.1 Other Related Work A number of language independent formalisms have been developed for specifying and reasoning about concurrent systems. These include formalisms based on temporal logic [108, 96, 97], behavior histories [122] and I O automata [105] These formalisms provide a general framework for specifying safety and liveness properties and a means of organizing proofs. They have been used to specify and verify a variety of protocols. One difficulty with existing formalisms is that ....
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Programs. Springer-Verlag, New York, 1992. 302
On the Synthesis of Strategies in Infinite Games - Thomas (1995) (59 citations) (Correct)
.... (E 1 ; F 1 ; Em ; Fm ) C(fl) j W m k=1 (9 fl(i) 2 E k 9 i fl(i) 2 F k ) Rabin condition) These B( Sigma 0 2 ) conditions are of special interest because they allow the specification of many properties which are relevant in concurrent systems (e.g. fairness properties, cf. [MP92]) Moreover, if games are considered as automata, and games defining the same language are regarded as equivalent, it is possible for finite state games to reduce arbitrary S1S definable winning conditions to the Rabin condition and to the Muller condition (see, for example, Th90] 2.3 ....
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berin, Heidelberg, New York 1992.
Languages, Automata, and Logic - Thomas (1996) (5 citations) (Correct)
....(introduced in [SW74] it captures the general case of condition where the set of visited states in a run determines whether the input is accepted. In the classification of execution sequence properties of nonterminating programs, this case is described by the term obligation property , cf. [MP92]. A still more flexible framework is obtained in a logical setting: Here we consider acceptance components which are boolean combinations of formulas 9i ae(i) 2 F and 9 i ae(i) 2 F for state sets F of a given automaton. All conditions mentioned above can be formulated in this way. A ....
....of PTL formulas with propositional variables p 1 ; p n concisely by associating with them certain first order formulas 0 (X 1 ; X n ; x) to be interpreted in words over f0; 1g n from position x onwards . For a more detailed and standard introduction see e.g. Em90] or [MP92]. For = p i we have 0 (x) X i (x) and the boolean connectives are handled as usual. Given PTL formulas , we set ffl (X ) 0 (x) 9y(S(x; y) 0 (y) ffl (F ) 0 (x) 9y(x y 0 (y) ffl (G ) 0 (x) 8y(x y 0 (y) ffl ( U ) 0 (x) 9z(x z 0 (z) 8y(x y ....
[Article contains additional citation context not shown here]
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs, Springer-Verlag, Berlin, Heidelberg, New York 1992.
Figure 4.9: Trajectories in the - Gamma Plane In (Correct)
No context found.
Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Programs. Springer-Verlag, 1992.
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