A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reactive systems: a survey of current trends. In J. W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....does not intend to be a general method. It was thought to be applied, for example, to systems that have a short description for states; systems for which control is more important than data as hardware, or concurrent protocols, process control systems or, more generally, reactive systems (see [Pnu86] Reactive systems are de ned as those system which interacts along the time with their environment. Many times these systems do not terminate but runs forever, thus a reactive systems cannot be modelled by its input output behavior since there is no a nal result. It is also possible to ....

A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reactive systems: A survey of current trends. In J. W. de Bakker, W.-P de Roever, and G. Rozenberg, editors, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, Berlin, Germany, 1986.

....and reasoning, and attract the attention of the temporal community to a number of interesting open problems. 1 Introduction Temporal logic has found numerous applications in computer science, ranging from the traditional and well developed elds of program speci cation and veri cation [45, 42, 43], temporal databases [20, 21, 3, 50, 30] and distributed and multi agent systems [27] to more recent uses in knowledge representation and reasoning [6, 7, 10, 49, 60] This is true of both propositional and rst order temporal logic. However, the mainstream of theoretical studies in the ....

A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reacrive systems, a survey of current trends. In Current Trends in Concurrency, Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1986.

....In the late nineteen seventies and early nineteen eighties, this behavior of systems received much attention in the formal speci cation and veri cation of concurrent processes (see Milner [11, 12] The term reactive systems was introduced to refer to systems with this kind of behavior. Pnueli [14] (p. 511) writes: Reactivity characterizes the nature of interaction between the system and its environment. It states that this interaction is not restricted to accepting inputs on initiation and producing outputs on termination. In particular, it allows some of the inputs to depend on ....

A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reactive systems: a survey of current trends, in: J.W. de Bakker, W.-P. de Roever and G. Rozenberg, Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, Berlin, 1986, pp. 510-585.

.... This work was supported partially by an EPSRC PhD Studentship and partially by EPSRC Research Grant GR K57282 C. Dixon A Search Algorithm for Temporal Resolution 2 carried out into the speci cation and veri cation of properties of concurrent systems using temporal logics, see for example [3, 5, 23, 29, 31, 35, 38, 39, 41]. Important computational properties such as liveness, deadlock and mutual exclusion can be expressed easily and simply in temporal logic making it useful for speci cation. Verifying that such properties hold for a program speci ed in temporal logic involves proofs within the logic itself. To ....

A. Pnueli. Applications of Temporal Logic to the Specication and Verication of Reactive Systems: A Survey of Current Trends. In J.W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science. Springer-Verlag, August 1986.

....Theorem 11. The supervisory control problems for CTL and CTL are 2EXPTIMEhard and 3EXPTIME hard in the size of the speci cation, respectively. 5 Discussion Our results shed an additional light on the discussion regarding the relative merits of linear versus branching temporal logics, cf. [Lam80,Pnu85]. We mainly refer here to the linear temporal logic LTL and the branching temporal logic CTL. One of the beliefs dominating this discussion has been while specifying is easier in LTL, model checking is easier for CTL . As is argued in [KV96,KV97a,KV99b] the computational advantage of CTL over ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems: A survey of current trends. In Proc. Advanced School on Current Trends in Concurrency, pages 510-584, Berlin, 1985. Volume 224, LNCS, Springer-Verlag.

....and reasoning, and attract the attention of the temporal community to a number of interesting open problems. 1 Introduction Temporal logic has found numerous applications in computer science, ranging from the traditional and well developed elds of program speci cation and veri cation [45, 42, 43], temporal databases [20, 21, 3, 50, 30] and distributed and multi agent systems [27] to more recent uses in knowledge representation and reasoning [6, 7, 10, 49, 60] This is true of both propositional and rst order temporal logic. However, the mainstream of theoretical studies in the ....

A. Pnueli. Applications of temporal logic to the specication and verication of reacrive systems, a survey of current trends. In Current Trends in Concurrency, Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1986.

....for this is simple [C, CN] the veri cation of a past temporal formula at a state s depends only on the database history since its creation until s. As we soon restrict our study to a particular class of temporal formulae, we do not give the formal semantics of general temporal formulae. See [RU, Pn] for such a presentation. The temporal language is built upon the following alphabet and symbols. Let R = f R 1 , R 2 , R n g be a database schema, where for each i, R i has arity n i . Each relation schema R i is a predicate symbol of arity n i . We also consider the equality predicate = ....

Pnueli, A. Applications of Temporal Logic to the Specication and Verication of Reactive systems: A Survey of current Trends. L.N.C.S. 224, pp 510-584.

....there is some a 0 2 A such that a a 0 and c 0 a 0 . The temporal logic L 8 whose abstract syntax is : tt j ff j Z j 1 2 j 1 2 j (8 ) j Z: 1) with 2 Act, variables Z 2 Var for the greatest xed point Z: and usual semantics, expresses universal properties [29]. We assume here the semantics of (closed) formulas over LTSs is de ned as sets of states. For instance, the semantics of (8 ) is: j (8 ) j] def = fs 2 K j for all s 0 2 K , s s 0 implies s 0 2 [j j]g: A simulation relation c a ensures that a 2 [j j] read a satis es ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems: a survey of current trends. In J. W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.

....propositions into action labels. winning active acceptCoin loseCoin inactive reset ; fwonCoing fhasCoing winCoin Fig. 2. Slot machine implementation as a doubly labeled transition system Consider the following modal logic, L pos , which expresses liveness or possibility properties [33], where p 2 AP and a 2 Act: j p j 1 2 j 1 2 j hai (1) The diamond modality denotes the possibility of an a transition. For a DLTS, K, we de ne [j j] K by induction on the grammar for : j j] def = K , j p j] def = fs 2 K j p 2 L(s)g, j 1 2 j] def = ....

....properties of C. Safe simulations. The dual of a live simulation is a safe one: a simulation, Q C A , is safe if Q(s; t) implies L(s) L(t) for all s 2 C and t 2 A . There is a greatest safe simulation, safe , on C A . The logic L nec expresses safety or necessarily properties [33], where p 2 AP and a 2 Act: j p j 1 2 j 1 2 j [a] 2) We de ne [j j] K for the rst four clauses in the same manner as for the logic L pos , and we de ne [j [a] j] def = fs 2 K j for all s 0 , s a s 0 implies s 0 2 [j j]g as the meaning of the box ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems: a survey of current trends. In J.W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.

....accommodate interaction and in nite computations. Neither of the two features by itself is new in computer science. Notions of interaction and of interactive computing have already received considerable attention, for example, in the theory of concurrent processes (cf. Milner [21,22] and Pnueli [28,29]) and in the design of programming systems for parallel processes (cf. 10] Interaction is also fundamental in the many studies of communication protocols and distributed algorithms in which the building blocks act as (restricted) interactive Turing machines (cf. 4] 20] and [40] ....

A. Pnueli. Applications of temporal logic to the specication and veri- cation of reactive systems: a survey of current trends, in: J.W. de Bakker, W.-P. de Roever and G. Rozenberg, Current Trends in Concurrency, Lecture Notes in Computer Science, Vol. 224, Springer-Verlag, Berlin, 1986, pp. 510-585.

.... s 0 2Xs (pr 2 s a s 0 ) s 0 j= nec ) 29) sj= poss AX fag ) 1 X s 0 2Xs (pr 3 s a s 0 ) s 0 j= poss ) 30) One can now reformulate and reprove Theorem 3 for modal Markov chains in a suitable fragment of ActMu typically linear time temporal logic, LTL [34, 35]. For concrete modal Markov chains, this recovers established probabilistic semantics [44] 5 Modal relations The semantics of ActCTL and ActMu for LTSs can be written out symbolically, using a relational calculus [6, 7] In that way, systems and their intended behavioral properties are ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems: a survey of current trends. In J.W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.

....environments such as the POLIS system from Berkeley [6] are publicly available and can be used for the above task. The second issues of representation of F and D is extremely important to the component matching problem. The system components for embedded systems are, in general, reactive systems [16, 40] in the sense that they are in continuous interaction with their environment, repeatedly reacting to external signals with certain response signals or actions on the internal 4 registers, etc. A well known formalism for modelling reactive systems is Milner s calculus of communicating systems ....

A. Pnueli. Application of temporal logic to the specication and verication of reactive systems : a survey of current trends, volume Lecture Notes in Computer Science, Vol.224, chapter pp.510-584. Springer Verlag, 1986. 40

....carry out instructions until such an interference point or a rescheduling point (a point where processes should be given the opportunity to interleave) is reached. This implements the technique described in [58(Section 7. 1) and amounts to the virtual coarsening of atomic actions suggested in [46]. 5.4.2 The composition of the instruction set Table 5.8 shows the eight most frequently executed instructions for each of three models. The table indicates how many times each instruction is executed compared to other instructions. For example, during the analysis of DP9, 31.69 of executed ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems: a survey of current trends. In Current Trends in Concurrency: Overview and Tutorials, Lecture Notes in Computer Science #224, pages 510-584. Springer-Verlag, 1986.

....structures with natural numbers time, and by a composition method that builds a model from pieces in nitely many steps. 1 Introduction Temporal logic has found numerous applications in computer science, ranging from the traditional and well developed elds of program speci cation and veri cation [34, 30, 31], temporal databases [12, 13, 3, 42, 17] and distributed and multi agent systems [15] to more recent uses in knowledge representation and reasoning [6, 7, 8, 40, 46] This is true of both propositional and rst order temporal logic. However, the mainstream of theoretical studies in the ....

A. Pnueli. Applications of temporal logic to the specication and verication of reactive systems, a survey of current trends. In Current trends in Concurrency, Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1986. 44

....12 may be given a priority order according to which, say, e 2 OE e 1 OE e 0 . Then in the initial state only e 2 may occur, and the only event sequence goes along the leftmost route of the lattice in the gure. A restricted form of the priority method is the virtual coarsening of atomic actions [15] in which events local to a process are recognised and made to occur immediately when they have become enabled. For instance, in gure 13 Figure 13: Events marked with a star (plus) may occur atomically. there can be thought to be three processes. The process in the middle sends a ....

Pnueli, A.: Applications of Temporal Logic to the Specication and Veri- cation of Reactive Systems: Survey of Current Trends. Current Trends in Concurrency, Overviews and Tutorials, Lecture Notes in Computer Science 224, Springer-Verlag, Berlin 1986, pp 510584.

No context found.

A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reactive systems: a survey of current trends. In J. W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.

No context found.

A. Pnueli. Applications of temporal logic to the speci cation and veri cation of reactive systems: a survey of current trends. In J.W. de Bakker, editor, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer-Verlag, 1985.

No context found.

A. Pnueli. Application of temporal logic to the speci cation and veri cation of reactive systems: A survey of current trends. In J.W. de Bakker, W. P. de Roever, and G. Rozenburg, editors, Current Trends in Concurrency, volume 224 of Lecture Notes in Computer Science, pages 510-584. Springer, 1986.

No context found.

A. Pnueli. Applications of Temporal Logic to the Speci cation and Veri cation of Reactive Systems: A Survey of Current Trends. Springer-Verlag, New York, 1985.

No context found.

A. Pnueli. Applications of temporal logic to the speci - cation and veri cation of reactive systems: A survey of current trends. In J. B. et al, editor, Current Trends in Concurrency, LNCS 224, 1986.

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