Lamport, L. 1983. What good is temporal logic? In Information Processing 83: Proceedings of the IFIP 9th World Congress, R. E. A. Mason, Ed. North-Holland, Amsterdam, 657--668.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....than state labelled B uchi automata. Deterministic testing automata accept strictly more stuttering insensitive languages than B uchi automata. Many veri cation researchers nd limiting oneself to stuttering insensitive languages not a serious disadvantage. It may even be seen as a bene t [5,10]. For example, the results in [13] would have been easier to derive, if the authors did not have to bother with the fact that even when the language accepted by a B uchi automaton is stuttering insensitive, individual local states may be sensitive to stuttering. Con ning to stuttering insensitive ....

Lamport, L.: \What good is temporal logic.". Proc. IFIP 9th World Congress, R.E.A. Mason (editor), North-Holland, pp 657 - 668, 1983.

....of our temporal logic we realized that a similar logic has been proposed in [SLL93] However, it is closer to Manna Pnueli s logic, whereas we are inspired by TLA. the proof of live implementation relations. This aim is motivated by the general insight of the scientific community [GPSS80, Lam83] that for safety proofs automata appear to be most appropriate, whereas for liveness proofs temporal logic is most adequate. Combination of Theorem Proving and Model Checking. In recent years, abstraction techniques have been proposed in order to integrate theorem proving and model checking in ....

....that supports liveness proofs. Even for the restricted notion of fairness, refinement proofs do not follow a common scheme, but are often performed in an ad hoc fashion (see e.g. Rom96, Lyn96] Temporal logic, however, has been proven to be an adequate methodology for liveness proofs [GPSS80, Lam83] 2. Temporal logic can serve as a property specification language for I O automata. Thus, property verification may also be applied as opposed to the usual techniques dealing with implementation relations. This is especially advantageous for model checking, which will be treated together with ....

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

....only the behaviours of the sender and the receivers, since these are the visible elements of the protocol. So we consider properties of the form = 8 8 , where is a tuple of message variables, is a tuple of receiver variables, and is a stuttering invariant LTL temporal logic formula [Lam83] The atomic propositions of can be indexed by the variables of , Example. Informally, the main property that the PGM protocol should satisfy is for every receiver r and for every message m sent by the sender, eventually one of the following two holds: r receives m, or r knows that m is ....

Lamport, L. What good is temporal logic? In: Proc. IFIP 9th World Computer Congress. 1983.

....#### # ### # to be the graph formed by removing all of the leaf neighbours of ####### from ## and # #### # ### # the corresponding model. Let ## be the set of atomic propositions of ## . It can be shown that every path in which ####### is the first to reach child handshake is stuttering equivalent [25], with respect to a reduced set of atomic propositions ## # ## to a path in ###### # ### ##.Theset## does not include propositions relating to the channels between ####### and its leaf neighbours or to variables associated with the leaf neighbours of #######. This is an important point, and ....

L. Lamport, "What good is temporal logic?" Information Processing, vol. 83, pp. 657--668, 1983.

....clip j (N ) to be the graph formed by removing all of the leaf neighbours of Node[j] from N and M clip j (N ) the corresponding model. Let AP be the set of atomic propositions of MN . It can be shown that every path in which Node[j] is the first to reach child handshake is stuttering equivalent [25], with respect to a reduced set of atomic propositions AP AP to a path in M(clip j (N ) The set AP does not include propositions relating to the channels between Node[j] and its leaf neighbours or to variables associated with the leaf neighbours of Node[j] This is an important point, ....

L. Lamport, "What good is temporal logic?" Information Processing, vol. 83, pp. 657--668, 1983.

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 64,40,7] The expressive power of shared action and shared variable communication is similar, and translations between special cases of these two types of models have been developed [39,18]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983. 64

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 64,40,7] The expressive power of shared action and shared variable commu nication is similar, and translations between special cases of these two types of models have been developed [39,18]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983. 64

....exist acceptance cycles in the synchronous product of a Bchi Automaton and a concurrent system, the reduced search algorithm will detect at least one of these cycles. Proof by the Lemma and the fact that the set of sequences satisfying a next time free LTL formula is closed under stuttering [L83]. The reduced search generates at least one M equivalent sequence for each complete sequence that satisfies the LTL formula. All sequences that satisfy the LTL formula are detected in the non reduced depth first search as acceptance cycles in the synchronous product of the corresponding Bchi ....

L. Lamport, "What good is temporal logic?," Information Processing 83: Proc. of the 9th IFIP World Computer Congress. Ed. R.E.A. Mason, Elsevier Publ., pp. 657-668.

....essence of that property to be made explicit. Formulas of temporal logic can be interpreted as predicates on sequences of states, and various formulations of such temporal logics have been used for specifying properties called temporal properties of interest to designers of concurrent programs [15, 16, 21, 35]. While there is not general 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 ....

LAMPORT, L. What good is temporal logic. In Information Processing '83, R. E. A. Mason, Ed. North-Holland, Amsterdam, 1983, pp. 657-668.

....depending upon the model, the requirement to be verified, and especially the insight of the modeller. Of course, verification of such properties only works if the property does not refer to an item that is abstracted from. 10.7 Related work Restricted temporal logic. In a seminal paper, Lamport [113] argues not to use the next time X operator in temporal logic specifications, because this operator makes it possible to distinguish between a high level specification and a lower 10.7 Related work 181 level implementation. Lamport does not, however, restrict usage of the until U operator, ....

....thus increasing user friendliness of the tool. In particular, feedback of the model checker is translated in terms of the activity diagram. Our tool is the first verification tool for UML activity diagrams. A restriction on CTL # is defined that extends the restriction proposed by Lamport [113]. The restriction can be used in other approaches in which at the concrete lower level variables do not change instantaneously, but can have an inconsistent intermediate value that should not be observed. Several reduction rules for activity diagrams have been defined. The reduction rules ....

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Proc. of the IFIP Congress on Information Processing, pages 657--667. NorthHolland, 1983.

....not require the user to provide a suitable abstract domain and does not produce false negative results as one often found with badly chosen abstract domains. It can be used for the verification of deadlock freedom, error and invariant checking, and stuttering invariant CTL model checking (c.f. [11]) Supported by Semiconductor Research Corporation under contract 95DJ 389. Sun Micro systems provided computers. 33nd Design Automation Conference, 1996 Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that ....

L. Lamport. What good is temporal logic. Information Processing 83, pages 657--668, 1983.

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 61, a , 5] The expressive power of shared action and shared variable communication is similar, and translations between special cases of these two types of models have been developed [36, 16]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983.

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 61, 37, 5] The expressive power of shared action and shared variable communication is similar, and translations between special cases of these two types of models have been developed [36, 16]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983.

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 59, 36, 5] The expressive power of shared action and shared variable communication is similar, and translations between special cases of these two types of models have been developed [35, 15]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983.

....A full practical and complete solution to the problem has not been given. Another equivalence that is useful in studying concurrent systems is stutter equivalence: a pair of sequences are considered to be equivalent if they differ in at most the number of times a state may adjacently repeat [9]. Although next time operator free linear time temporal logic formulas are naturally stutter closed, i.e. cannot distinguish between stutter equivalent sequences, the use of a nexttime operator does not preclude stutter closure and can be convenient. Finally, projective equivalence [12] is an ....

Lamport, L.: What good is temporal logic? In Proc. IFIP Congr. on Information Processing, Elsevier (1983) 657--668.

.... The shared variable approach is used, for example, in the temporal logic and model checking communities (e.g. 59, 36, 5] The expressive power of shared action and shared variable communication is similar, and translations between special cases of these two types of models have been developed [35, 15]. Choosing between these two forms of communication seems to be generally a matter of custom and convenience. One advantage of the shared action approach is that it leads to simple mathematical notions of external behavior of state machines, based on sequences of actions (which are usually called ....

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983.

....number of times; however, there is no obligation to execute it at all. Therefore, each segment of the execution in which the same state is repeated due to execution of skip is finite in length. Such a finite segment will be called a stuttering sequence. The notion of stuttering is due to Lamport[6]. Interaction with an Environment An environment that interacts with FairNatural will, typically, call fi to receive the next value of x. The programming model in this paper does not support procedure calls. A more general model, such as Seuss[10] would allow fi to be called as a procedure. ....

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, Sep 1983. IFIP, North-Holland.

....even though it cannot be defined in terms of the other operators. It is usually defined as follows. Next (X) i, s[i] Xq s[i 1] q) We have two reasons to reject the use of the next operator. The precise meaning of the operator is unclear in the context of concurrent systems, cf. [L83]. A run of a concurrent system is typically given as an interleaving sequence of the runs of a number of participating processes. Whereas a step in the run of a sequentially executing single process reflects the progression of a computation in a meaningful way, the same is not necessarily true ....

L. Lamport, What good is temporal logic, in: R.E.A. Mason, ed., Information Processing 1983: Proc. of the IFIP 9th World Computer Congress, Paris, France, North-Holland Pub., Amsterdam, 1983, pp. 657-668.

....a characteristic predicate on event sequences rather than by their enumeration. The two most popular kinds of mathematical machinery used for property speci cation are temporal logics [17] and nite automata. A number of various forms of temporal logics have been proposed for specifying properties [15, 16, 21]. B uchi automata [20] are the most popular kind of nite automata used for specifying properties [2, 5, 6, 12] B uchi automata are known to be quite expressive, demonstrably more expressive than linear time and branching time rst order temporal logics [8, 21] One convenient mechanical way for ....

Leslie Lamport. What good is temporal logic? In Proceedings of the IFIP Congress on Information Processing, pages 657-667, 1983.

....Event i at point t2 changes (s; x) into (1; 2) At point t3 , the event e changes s into 2 and at point t4 , the event i doesn t change s or x. The use of real numbers as domain for the event and state function handles the stutter problem in refinement. This problem, first observed by Lamport [Lam83], is as follows. Given two behaviours of a system, let the first behaviour contain only consecutive snap shots of the system that differ from each other whereas the second behaviour, besides containing these same snapshots, contains additional consecutive duplicates of these. This is called ....

L. Lamport. What good is temporal logic. In R.E.A. Manson, editor, Information Processing 83: Proc. of the IFIP 9th World Congress, pages 657--668. Elsevier Science Publishers, North Holland, 1983.

....temporal models. This move is really more general. As one increases expressive power of temporal languages, the natural bisimulations move away from the computer science paradigm of single state links, and start relating pairs, triples, and in general, nite tuples of temporal points, cf. [16]. Such simulations are a bit harder to visualise ( 19] has concrete examples for processes) But in the limit, they move closer to potential isomorphisms , i.e. non empty sets of nite partial isomorphisms satisfying the usual back and forth conditions which are natural model links for model ....

....k, which is closed under taking restrictions, and which satis es the following back and forth property. If the size of a partial isomorphism F in PI is smaller than k, and we pick any object d in one model, then there is an object e in the other model such that F [ f(d; e)g is in PI . Van Benthem [16] proves that any rstorder formula is invariant for potential k isomorphism i it is de nable by a rst order formula with at most k variables in all, free or bound. Barwise and van Benthem [9] give a new technique extending this type of result to in nitary languages. On the other hand, we know ....

[Article contains additional citation context not shown here]

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83, pages 657-668. IFIP, Elsevier Science Publishers B.V. (North-Holland), 1983. 4. CONCLUSION 75

....event occurrences, but only occurrences of the uninteresting stuttering event . So the state does not change until the next interesting event e2 occurs. A salient feature of the temporal logic is the immediately after state operator 0 , in a version which Lamport approves of according to [5]. In Section 2.5 machines and their allowed computations are related to cor3 rect development steps. The relation is expressed by veri cation conditions. In Section 2.6 we illustrate some of the notions of the previous sections with Lamport s soda machine example [7] In Section 2.7 Stark s ....

L. Lamport. What good is temporal logic. In R.E.A. Manson, editor, Information Processing 83: Proc. of the IFIP 9th World Congress, pages 657-668. Elsevier Science Publishers, North Holland, 1983.

....an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added. 1 Background Temporal logics are routinely used for the specification and analysis of reactive systems. However, Lamport [10] has identified a shortcoming of standard linear time temporal logic (LTL) because it is based on a global notion of next state , it does not allow to relate specifications written at different levels of abstraction. He has therefore maintained that specifications should be invariant under ....

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

....2 . 4. A j= X i A(1; j= 5. A j= U( 1 ; 2 ) i 9 i 0 A(i; j= 2 and 8 0 j i A(j; j= 1 . In this section we focus 1 on LTL(U) While the Next operator provides the power to precisely count individual states in a sequence, the Until operator alone allows 1 See [16] for a plea against the Next operator from the point of view of speci cation of systems. 2. FLAT LINEAR TIME TEMPORAL LOGIC: EXPRESSIVITY 57 to count certain patterns. The following lemma states that every pattern counted requires an additional Until: it is not possible to distinguish numbers of ....

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83, pages 657-668. IFIP, Elsevier Science Publishers B.V. (North-Holland), 1983. 4. CONCLUSION 75

No context found.

Lamport, L. 1983. What good is temporal logic? In Information Processing 83: Proceedings of the IFIP 9th World Congress, R. E. A. Mason, Ed. North-Holland, Amsterdam, 657--668.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, IFIP, North Holland, Paris, September 1983.

No context found.

L. Lamport. What Good Is Temporal Logic? Information Processing 83, R. E. Mason (ed.), Elsevier Science Publishers, North Holland (1983), 657-668.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

No context found.

Lamport, L. What good is temporal logic? In Information Processing 83: Proceedings of the IFIP 9th World Congress (Paris, Sept. 1983), R. E. A. Mason, Ed., IFIP, North Holland, pp. 657--668.

No context found.

Leslie Lamport. What Good is Temporal Logic? Information Processing 83, R. E. Mason (ed.), Elsevier Science Publishers (North-Holland), 1983, 657-668.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, Paris, September 1983. IFIP, North Holland.

No context found.

Lamport, L. What good is temporal logic? In: Proc. IFIP 9th World Computer Congress. 1983.

No context found.

L. Lamport. What Good Is Temporal Logic? In R. E. A. Mason, editor, Information Processing, volume 83, pages 657--668. Elsevier Sciene Publishers, 1983.

No context found.

Lamport L. What good is temporal logic? In: Mason REA (ed). Proceedings of the IFIP congress on information processing. North-Holland, Amsterdam, 1983, pp 657--667

No context found.

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83, pages 657--668. IFIP, North-Holland, 1983.

No context found.

L. Lamport. What good is temporal logic? In R.E. Mason, editor, Information Processing 83, pages 657-668. North-Holland, 1983.

No context found.

Leslie Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668. IFIP, North-Holland, September 1983.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 657--668, Paris, September 1983. IFIP, North-Holland.

No context found.

Leslie Lamport. What Good Is Temporal Logic? In R. E. A. Mason, editor, Information Processing 83, pages 657--668. Elsevier Publishers, 1983.

No context found.

Leslie Lamport. What good is temporal logic? In R. E. A. Mason, editor, Proceedings of the IFIP Congress on Information Processing, pages 657--667, Amsterdam, 1983. North-Holland.

No context found.

L. Lamport. What good is temporal logic? In Information Processing'83. Proc. IFIP 9th World Computer Congress, pages 657-668. North-Holland, 1983.

No context found.

L. Lamport. What good is temporal logic? In Proc. of Information Processing 83: IFIP World Computer Congress, pages 657--668. Elsevier Science Publishers, 1983.

No context found.

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Information Processing 83: Proceedings of the Ninth IFIP World Computer Congress, pages 657--668. Elsevier Science Publishers, 1983.

No context found.

L. Lamport. What good is temporal logic? In R. E. A. Mason, editor, Proc. IFIP 9th World Congress, pages 657668. North Holland, 1983.

No context found.

L. Lamport, "What good is temporal logic?," in Proc. 9th IFIP Congress -- Information Processing '83, pp. 657-668.

No context found.

L. Lamport. What good is temporal logic. In R. E. A. Manson editor Information Processing 83, Proceedings of IFIP 9th World Congress, Paris pp. 657-668. IFIP, North Holland.

No context found.

L. Lamport. What good is temporal logic? In Proceedings of IFIP Congress on Information Processing, pages 657--667, 1983.

No context found.

L. Lamport. What good is temporal logic? In R.E.A. Mason, editor, Proc. IFIP 9th World Congress, pages 657--668. Elsevier Science Publishers (North-Holland), 1983.

First 50 documents  Next 50

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