E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Logic of Programs, Lecture Notes in Computer Science, 131:52--71, 1981.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....take the form e.g. AF . 55 Definition 32.2 (CTL) Let CTL be the sublanguage of CTL formulas of the form OE with the property that any linear time subformula (formula of the form OE 1 U OE 2 or a:OE) is immediately preceded by a path quantifier. CTL was introduced by Clarke and Emerson [9]. A number of other sublanguages of CTL have been introduced over time (c.f. 15] Here we mention only one other variant which we refer to as CTL( which relaxes CTL by allowing boolean combinations of linear time formulas before path quantifying, but not nesting. Trivially all three ....

E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Lecture Notes in Computer Science, 131, 1981.

....aspect with a modal information aspect and have shown how this can be used to successfully represent many of the core elements of KARO. This logic is essentially the branching time temporal logic, Computational Tree Logic (CTL) combined with the modal logic KD45. CTL was first described in [2] and can be distinguished from the variety of branching time temporal logics proposed in the literature, as every temporal operator, for example f (in the next moment) must be preceded immediately by a path operator, for example A (on all paths) Thus an example of a CTL formula is A f ....

E. M. Clarke and E. A. Emerson, `Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic', in Proceedings of the Workshop on the Logic of Programs, ed., D. Kozen, volume 131 of Lecture Notes in Computer Science, pp. 52--71. Springer-Verlag, (1981).

.... amenable to efficient implementation [6] It is based upon a normal form that can potentially represent a range of temporal logics, utilising a variety of model structures [11] For example, in [4] we extended the resolution method to the (comparatively simple) branching time temporal logic CTL [5]. We here consider the extension of this approach to the more powerful branchingtime logic CTL that is now being applied, for example, within the specification and verification of multi agent systems [15] The key elements of the method, namely the normal form, the concept of step resolution ....

E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic. Springer-Verlag, (LNCS 131), 1981.

.... Ockhamist semantics for branching time logics go back to the Middle ages, and its use in temporal logic was already discussed in [Pri67] see also [Zan96] the first ideas of using branching time logics in computer science are attributed to Abrahamson, Abr79] further developed by [BAPM81] CE81] EH86] etc. See the survey [Eme90] for more details and references. 4.1 Ockhamist semantics for classical temporal logic This section describes the underlying semantics of branching time from the viewpoint of classical temporal logic. It is useful for the understanding of the semantics of ....

....a first order quantification in a more expressive hybrid language with reference pointers. It has been done in [Gor00] 4.4 The computation tree logic CTL The computation tree logic CTL is a precursor of CTL # and its syntactically restricted fragment. It was introduced by Clarke and Emerson in [CE81] Although it is not as strongly expressive as CTL # , it is often a better choice for practical applications because of its lower complexity. On the other hand, CTL is an extension of the very similar branching time logic UB which does not contain U (only X and G) was proposed at about the same ....

E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs, pages 52--71. Springer, 1981.

....in [ Vieu, 1997; Casati and Varzi, 1999; Cohn and Hazarika, 2001 ] Here we consider only one, perhaps the most influential of them, which takes extended regions of space as the primitive spatial entity. Properties of regions are usually defined by first order axiomatic theories (see e.g. Clarke, 1981; Randell et al. 1992 ] the (explicit or implicit) intended models of which are topological, in particular, Euclidean spaces. 2.1 Topological spaces Definition 2 (topological space) A topological space is a pair T = hU; Ii in which U is a non empty set, the universe of the space, and I is ....

....9Z (EC(Z; X) EC(Z; Y ) NTPP(X;Y ) PP(X; Y ) 9Z (EC(Z; X) EC(Z; Y ) Table 1: Some relations between spatial regions, defined in terms of C. 2.2. 1 First order logics Often, logical formalisms for qualitative spatial representation are formulated as first order theories [ Whitehead, 1929; Clarke, 1981; Randell et al. 1992; Casati and Varzi, 1999 ] For instance, the language of RCC consists of individual variables X;Y; understood as variables over regions) the individual constant U (for the universal region) the binary predicate C(X; Y ) read as X connects with Y ) a number of ....

[Article contains additional citation context not shown here]

E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Logic of programs, volume 131 of Lecture Notes in Computer Science, pages 52--71. Springer-Verlag, 1981.

....the protocol, static analysis techniques, such as live variable analysis and program slicing, were the key to the success of this verification experiment. The results obtained give some hints concerning a methodology for the formal verification of real systems. 1 Introduction Model checking [CE81,QS82] is by now a well established method for verifying properties of reactive systems. The main reason for its success is the fact that it works fully automatically and it is able to reveal subtle defects in the design of complex concurrent systems. Different academic tools have been developed ....

E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronisation Skeletons using Branching Time Temporal Logic. In Proceedings of IBM Workshop on Logics of Programs, volume 131 of LNCS, 1981. 16

....complexity of the protocol, static analysis techniques, such as live variable analysis and program slicing, were the key to the success of this case study. The results obtained give some hints concerning a methodology for the formal verification of real systems. 1 Introduction Model checking [CE81,QS82] is by now a well established method for verifying properties of reactive systems. The main reason for its success is the fact that it works fully automatically and it is able to reveal subtle defects in the design of complex concurrent systems. Different academic tools have been developed ....

E.M. Clarke and E.A. Emerson. Design and Synthesis of Synchronisation Skeletons using Branching Time Temporal Logic. In Proceedings of IBM Workshop on Logics of Programs, volume 131 of LNCS, 1981.

....specifically, we want to check that a set of requirements is never violated under any of potentially infinitely many test cases required for a complete test. A whole generation of research went into the development of efficient model checking techniques, starting from the seminal paper by Clarke [5], who showed in 1981 that for finite state machine models a complete analysis can be carried out in finite time, due to the regularity of the model representation. Key milestones in maturing the technology involve symbolic representations of models [6] compositional methods allowing to focus ....

Ed Clarke and E. Emerson. Design and Synthesis of synchronisation skeletons using branching-time temporla logic. Proc. IBM Workshop on Logics of Programs, vol 131 of LNCS, Springer Verlag, 1981, 52-71,

....in logical investigations. Thus the decidability of the monadic secondorder theory has been established in [22] 2 for regular rooted graphs of nite degree, in [11] for regular graphs, and in [9] for prexrecognizable graphs. As shown in [18] the class of graphs described there has decidable CTL [10] and S1S [4] and the decidability of the modal calculus [21] and even of the monadic secondorder logic is conjectured. Very dioeerent motivations appear in [16] The author of that paper is interested in connections between problems on nite graphs and their innite equivalents. Since any recursive ....

E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, LNCS 131, pages 5271, Yorktown Heights, May 1981.

....modal logics, and , meaning necessity and possibility, are interpreted as always and eventually respectively in temporal logics. Different temporal logics have been developed for differing underlying orderings of events and so for example, may be linear [Pnu77, Pnu81, MP92] or branching [BAMP81, CE81, ES88] discrete or dense [BG85, BKP86] or may be based on intervals [HMM83, Mos83, SMSV83] However, here we will consider linear, discrete temporal logics, unless we state otherwise. Models of propositional temporal logic can be represented as a sequence of states indexed by the natural ....

....logic making it useful for specification. Verifying that such properties hold for a program specified in temporal logic involves proofs within the logic itself. There is an extensive body of work on automated verification mostly in the area of model checking style systems, see for example [CE81, CES86, GB88, BFG89b, Fis92a] particularly based on tableau [Gou84, Wol85] or automata [WVS83, VW86, Var87] Model checking involves the generation of a structure that captures all possible behaviours of a system followed by a phase to check that these behaviours match the desired behaviour. ....

[Article contains additional citation context not shown here]

E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on the Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52--71. Springer-Verlag, 1981.

....reasoning become more refined, so the corresponding logical tools have been extended. If a temporal model aims to represent the behavior of a complex dynamic system, for example, a complex multi process system, the ability to refer to a range of possible execution paths in a model is important (Clarke and Emerson 1981). The appropriate logical framework to reason about such systems is called branching time temporal logic. Here, the underlying model of time is of a choice of possibilities branching into the future. The first executable branching time logics were originally developed for the specification of ....

....to reason about such systems is called branching time temporal logic. Here, the underlying model of time is of a choice of possibilities branching into the future. The first executable branching time logics were originally developed for the specification of concurrent and distributed systems (Clarke and Emerson 1981). Varieties of branching time are characterised by specific syntactic restrictions, which, in turn, lead to different levels of expressiveness. Within these constraints a Computation Tree Logic (CTL) has shown to play a significant role in potential applications. It has been observed that this ....

[Article contains additional citation context not shown here]

Clarke, E. M. and Emerson, E. A. (1981) Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic. In Proceedings of the Workshop on Logic of Programs, Lecture Notes in Computer Science, 131, pages 52--71.

....have become more refined, so the corresponding logical tools have been extended. In representing the behaviour of concurrent systems, the ability to refer to a range of possible execution paths is seen as important. Thus, there is a need for methods incorporating branchingtime temporal logics [1]. Here, the underlying model of time is of a choice of possibilities branching into the future. Such branching time temporal logics have been developed and applied to the specification of concurrent and distributed systems [2] It has been observed that most correctness properties of concurrent ....

.... developed and applied to the specification of concurrent and distributed systems [2] It has been observed that most correctness properties of concurrent programs (that do not deal with fairness) can be expressed in a branching time logic called Computation Tree Logic (CTL) first proposed in [1]. There are several extensions of CTL of which CTL is commonly considered as a full branching time logic [9] However, the core logics we concentrate on, are CTL and its extension Extended CTL (ECTL) 5] which incorporates simple fairness constraints. It has been shown that CTL and ECTL can be ....

E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronisation Skeletons Using Branching Time Temporal Logic. Proceedings of the Workshop on Logic of Programs, Lecture Notes in Computer Science, 131:52--71, 1981.

....Time and PDL In linear time temporal logic one considers just one execution sequence of a process, in branching time temporal logic one looks at the several possible futures of a process that might go different ways. A logic for the study of branching time was introduced by Clarke and Emerson [15] (see also [26] The temporal languages that we have considered are certainly appropriate for linear time temporal logic. For linear time, the unary future operator hF i (at least once in the future) comes with a counterpart [F ] always in the future) Using ( S R a ) to interpret the ....

E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs, Lecture Notes in Computer Science 131, pages 52--71. Springer, Berlin, 1981.

....form e.g. AF . Definition 32.2 (CTL) Let CTL be the sublanguage of CTL consisting of all formulas of the form OE with the property that any linear time subformula (formula of the form OE 1 U OE 2 or a:OE) is immediately preceded by a path quantifier. CTL was introduced by Clarke and Emerson [9]. A number of other sublanguages of CTL have been introduced over time (c.f. 15] Here we mention only one other variant which we refer to as CTL( which relaxes CTL by allowing boolean combinations of linear time formulas before path quantifying, but not nesting. Trivially all three ....

E. M. Clarke and E. A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Lecture Notes in Computer Science, 131, 1981.

No context found.

E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Logic of Programs, Lecture Notes in Computer Science, 131:52--71, 1981.

No context found.

E. Clarke and E. Emerson, "Design and synthesis of synchronisation skeletons using branching time temporal logic," Logic of Programs, Lecture Notes in Computer Science, vol. 131, pp. 52--71, 1981.

No context found.

E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Logic of Programs, Lecture Notes in Computer Science, 131:52--71, 1981.

No context found.

E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. Logic of Programs, Lecture Notes in Computer Science, 131:52--71, 1981.

No context found.

E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs, pages 52--71. Springer, 1981.

No context found.

E.M. Clarke and E.A. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Proceedings of IBM Workshop on Logics of Programs, number 131 in Lecture Notes in Computer Science. Springer-Verlag, 1981.

No context found.

Edmund M. Clarke and Allen E. Emerson. Design and synthesis of synchronisation skeletons usin branching time temporal logic. In Logic of Programs,, volume 131, pages 52--71. Lecture Notes in Computer Science, Springer-Verlag, 1982.

No context found.

E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Workshop on Logics of Programs, number 131 in LNCS, pages 5271. Springer, 1981.

No context found.

E. Clarke and E. Emerson. Design and synthesis of synchronisation skeletons using branching time temporal logic. In Workshop on Logics of Programs, number 131 in LNCS, pages 5271. Springer, 1981.

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