R. Koymans, J. Vytopil, and W.-P. de Roever, "Real-Time Programming and Asynchronous Message Passing", In Proc. 2nd Ann. Symp. on Principles of Distributed Computing, pp. 187--197. ACM Press, 1983.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... An extensive survey of notations for timing constraints in temporal logics, their comparisons and a discussion of their expressive power is found in [1] A common way of introducing real time in temporal logic is by replacing the unrestricted temporal operators by time bounded versions [14]. For example the bounded operator # [1,3] is interpreted as eventually within 1 to 3 time units . This notation can relate only adjacent temporal contexts. For example, there is no direct way of expressing the following property using time bounded operators: every stimulus p is followed by a ....

R. Koymans, J. Vytopil, and W.-P. de Roever, "Real-Time Programming and Asynchronous Message Passing", In Proc. 2nd Ann. Symp. on Principles of Distributed Computing, pp. 187--197. ACM Press, 1983.

....were made for the restoration of the past in temporal logic. The first argument is that while past temporal connectives do not add any expressive power, the price for eliminating them can be high. Many natural statements in program specification are much easier to express using past connectives [RK83] In fact, the best known procedure to eliminate past connectives may cause an exponential blow up of the considered formulas [CS01] A more important motivation for the restoration of the past is again the use of temporal logic in modular verification. In global verification one uses temporal ....

W.P. DeRoever R. Koymans, J. Vytopil. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. on Principles of Distributed Computing, pages 187--197, 1983.

....as an infinite choice and (more important) in a different way of handling recursion (by an operational semantics and bisimulation) Furthermore no upper bounds are considered, what within ProCoS is desirable. Closer to the present results are, however, the ideas around metric temporal logic as in [KVR83], KdR85] or [Hoo91] This is an extension of traditional linear time temporal logic, in which the scope of temporal operators is restricted by extending them with time bounds. In [Hoo91] a proof system is given to decide a satisfaction relation between an OCCAM like language and an assertion ....

R.Koymans, J.Vytopyl, W.P.de Roever. Real-time programming and asynchronous message-passing. Proc. of the 2nd ACM symposium on Principals of Distributed Computing, 1983, pp.187-197.

.... new model, as shown above, is that it leads to a more natural style of specification, explicitly referring to clocks, which are just another kind of system variables, instead of introducing special new constructs, such as the bounded temporal operators proposed in metric temporal logic (mtl) see [KVdR83] KdR83] and [Koy90] or the age function proposed in [MP93a] A second advantage of the cts model is that we can reuse many of the methods and tools developed for verifying untimed reactive systems (e.g. MP95] for verifying real time systems under the cts model. The move from tts to cts ....

R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187--197, 1983.

....systems include temporal logic [AL92] process algebras [DS89, Wan91, NS91] and Petri nets [CR83] Several different approaches to proving timing properties have also been proposed, many of them based on augmented temporal logics. The earliest work used bounded temporal operators [BH81, KVdR83] but scattered examples of an explicit clock approach, presented systematically by Ostroff [Ost89] also can be found. Henzinger, Manna, and Pnueli [HMP94] compare these two styles. More recently, Alur and Henzinger [AH89] presented an approach called temporal quantification, embodied by their ....

Ron Koymans, J. Vytopil, and Willem-Paul de Roever. Real-time programming and asynchronous message passing. In Proceedings of the Second Annual ACM 154 Symposium on the Principles of Distributed Computing, pages 187--197. ACM Press, August 1983.

....were made for the restoration of the past in temporal logic. The first argument is that while past temporal connectives do not add any expressive power the price for eliminating them can be high. Many natural statements in program specification are much easier to express using past connectives [87]. In fact, the best known procedure to eliminate past connectives in LTL may cause a significant blow up of the considered formulas [69] A more important motivation for the restoration of the past is again the use of temporal logic in modular verification. In global verification one uses ....

W.P. DeRoever R. Koymans, J. Vytopil. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. on Principles of Distributed Computing, pages 187--197, 1983.

....and 3 (for some future state) provide the capability of specifying invariance and eventuality and generally reason about time in a qualitative fashion. A quantitative notion of time can be introduced by allowing the specification of time bounds with the eventuality and invariance quantifiers [36, 35, 34, 3]. Another approach is to introduce a mechanism to access the value of a real time clock; in [37, 1] it is read from a state variable; in [31, 32, 21] it is denoted by a predicates; and in [5, 6] it is bound by a new quantifier called freeze. Finite state automata have been used extensively in ....

R. Koymans, J. Vytopil, and W.P. de Roever. Real-time programming and asynchronous message passing. In 2rd ACM Symposium on Principles of Distributed Computing, pages 187--197. ACM Press, 1983.

....for at least 10 seconds) We choose these two operators because they are well understood and suffice for our purposes. Note also that the operator is equivalent to a bounded version of the F operator and the Delta= operator corresponds to a bounded version of the S operator in temporal logic [9, 10]. 2.3 Network Assumptions A computer network consists of N nodes and some number of communication channels that each connect a unique pair of nodes. Channels are bidirectional: the channel directed from an arbitrary node j to an arbitrary node k is denoted hj; ki and the channel directed from ....

R. Koymans, J. Vytopil, and W. P. de Roever. Real-time programming and asynchronous message passing. In 2nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983.

....system We use the classical example of a lift system (from [Bar87, Hal89] to experiment with the PCTL logic. We want to see whether temporal specifications are clearer and closer to our intuitions 5 Structure of past Determined Non determ. Finite Infinite Cumulative Non cumul. GPSS80] KVd83] LPZ85] Bar87] Zuc86] Gab89] Var88] MP92] MMKR94] ffl ffl ffl Linear time temporal logics [PW84] Wol89] Sti89] Sti92] ffl ffl non Ockhamist past [KP95] ffl ffl [ZC93] Zan96] ffl ffl ffl Ockhamist past [HT87] BLY96] ffl ffl ffl [LPS95] KP95] ffl ffl ffl [LS95] ffl ....

R. Koymans, J. Vytopil, and W. P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Principles of Distributed Computing (PODC'83), Montreal, Canada, Aug. 1983, pages 187--197, 1983.

....in an arithmetic relation with the value of the time variable in another state. The second type of real time temporal logic, in which time is explicitly present in the model, and typically passes at a constant rate with each transition, includes RTCTL [25] the metric temporal logics of [48] [49] and [47] and CTL with bounded until [10] In temporal logics of this type, new bounded temporal quantifiers are added which define a temporal internal to which the operator applies. For example, while non real time temporal logic might include an eventually operator F such that Fp asserts that ....

Ron Koymans, Jan Vytopil, and Willem P. de Roever. Real-time programming and asynchronous message passing. Technical Report RUU-CS-83-9, Department of Computer Science, University of Utrecht, April 1984.

....were made for the restoration of the past in temporal logic. The first argument is that while past temporal connectives do not add any expressive power the price for eliminating them can be high. Many natural statements in program specification are much easier to express using past connectives [KVR83]. In fact, the best known procedure to eliminate past connectives may cause a nonelementary blow up of the considered formulas [LPZ85] A more important motivation for the restoration of the past is again the use of temporal logic in modular verification. In global verification one uses temporal ....

Koymans, R., Vytopil, J., DeRoever, W.P.: Real-time programming and asynchronous message passing. Proc. 2nd ACM Symp. on Principles of Distributed Computing, Montreal, 1983, pp. 187--197.

....the formula p=3d q, which expresses the bounded response property stating that every p should be followed by an occurrence of a q, after no more than d time units. This language for the specification of timing properties, which we refer to as metric temporal logic (mtl) has been advocated in [KVdR83], KdR85] and [Koy90] although an early proposal in [BH81] can be viewed as a precursor to this specification style. Another approach to the specification of timed properties introduces a temporal function Gamma( called the age of the formula . The age function measures the length of ....

R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187--197, 1983.

....Minimal separation: No q can occur earlier than d time units after an occurrence of p. In mtl, these two properties can be specified as follows: ffl Bounded response: p = 1 d q: ffl Minimal separation: p = 0 d :q: This approach to the specification of timing properties has been advocated in [KVdR83] KdR85] and [Koy90] although an early proposal in [BH81] can be viewed as a precursor to this specification style. 3 Using TL Gamma , the same properties can be specified by: ffl Bounded response: 0 h Gamma i ( q)S (p :q) j d i : ffl Minimal separation: q = i ( p) Gamma ....

R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187--197, 1983.

....decidability, thus making the logic amenable to automation. Moreover, the resulting logic, in keeping with the tradition in temporal logic, hides the time variable, thus preventing its improper manipulation. Our approach is not new, having been introduced into temporal logic by Koymans [51] as far back as 1983, and falls roughly into the category of bounded operator temporal logics. Indeed, the precise construct that we use is one of two suggested by Melliar Smith [64] in 1987. Our main contribution is in formalizing the syntax and semantics of the logic, and of giving a decision ....

Koymans R, Vytopil J, de Roever W-P, Real-Time Programming and Asynchronous Message-Passing, Proc. 2nd ACM PODC, 1983, pp 187-197.

....invariance and bounded responsiveness. Real time is introduced into transition systems either by associating lower and upper bounds on enabled transitions [Lam77, BH81] or by introducing explicit clocks [AD90, AL92] The first approach has led to the extensions to LTL with bounded operators [KVdR83, Koy89, AH90], and the second has advocated the use of LTL in dealing with the explicit clocks [PdR82, PH88, AL92] The relationship between the two approaches, that more or less one can be translated into another, is investigated in [HMP94] An advantage of TTS frameworks is that they are quite close to ....

R. Koymans, J. Vytopil, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd Annual Symposium on Principles of Distributed Computing, pages 187--197. ACM press, 1983.

.... model, as shown above, is that it leads to a more natural style of specification, explicitly referring to clocks, which are just another kind of system variables, instead of introducing special new constructs, 4 such as the bounded temporal operators proposed in metric temporal logic (mtl) see [KVdR83] KdR85] and [Koy90] or the age function proposed in [MP93a] A second advantage of the cts model is that we can reuse many of the methods and tools developed for verifying untimed reactive systems (e.g. MP95b] for verifying real time systems under the cts model. The move from tts to cts ....

R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187--197, 1983.

....and q s future occurrence is guaranteed, q should occur within at most 5 time units. Lower Bound: p = 2 [0;3] q. This formula states that, no q can occur within 3 time units from an occurrence of p. The use of bounded temporal operators has been advocated by Koymans, Vytopil, and de Roever ([21], 20] 19] although an early proposal by Bernstein and Harter can be viewed as a precursor [8] 7.5.2 The Timed Logic TPTL The logic TPTL (timed temporal logic) 5] extends conventional TL by adding special variables that can be viewed as recording the value of an assumed master clock at ....

R. Koymans, J. Vytopyl, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2nd ACM Symp. Princ. of Dist. Comp., pages 187--197, 1983.

....event q will happen eventually but puts no time bound on when it will happen, the formula 33 q predicts an occurrence of q within 3 time units from now. The early proposal [BH81] can be viewed as a precursor of this approach to the specification of timing properties, which has been advocated in [KVdR83, KdR85, Koy90] where the bounded operator language is called Metric Temporal Logic, and in [SPE84] Bounded operator temporal logics have been analyzed for their complexity and expressiveness in [EMSS89] and in [AH90, AFH91] An alternative approach to the specification of timing constraints of ....

R. Koymans, J. Vytopil, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proceedings of the Second Annual Symposium on Principles of Distributed Computing, pages 187--197. ACM Press, 1983.

....control systems. Methods for reasoning about such hard deadlines can be obtained by adding time to existing methods. One can add time as an explicit (virtual) variable, and use standard verification techniques [PH88, SL87, OW87] Logics that deal explicitly with time quantities have been designed [BH81, JM86, KVdR83, EMSS89]. For some systems, one is interested in the overall average performance, such as throughput, average response times, etc. Methods for analyzing such properties usually employ Markov analysis. Often the systems are described by different variants of timed or stochastic Petri nets [Mol82, ABC86, ....

....time is [BH81] in which traditional linear time temporal logic is extended to cope with quantitative time. Bernstein and Harter present inference rules in the spirit of the proof lattices of Owicki and Lamport [OL82] No attempt to look at completeness is made. A related logic is presented in [KVdR83], which is richer and includes past time operators, but there no inference system is presented. A different approach is the Real Time Logic (RTL) of Jahanian and Mok [JM86] RTL is not a modal logic, but a first order logic. In RTL, one can reason about occurrences of events and the elapsed times ....

R. Koymans, J. Vytopil, and W.P. de Roever. Real-time programming and asynchronous message passing. In Proc. 2 nd ACM Symp. on Principles of Distributed Computing, Minaki, Canada, pages 187--197, Montreal, Canada, 1983.

....time in the syntax replaces the unrestricted temporal operators by time bounded versions. For example, the bounded operator 3 [2;4] is interpreted as eventually within 2 to 4 time units. This approach to the specification of timing properties has been advocated by Koymans, Vytopil, and de Roever [KVdR83, KdR85, Koy90], although an early proposal by Bernstein and Harter can be viewed as a precursor [BH81] More applications of the boundedoperator method for expressing timing constraints can be found in [SPE84, Har88, PH88, HW89, Lew90] Bounded operators have been analyzed for their expressiveness and ....

R. Koymans, J. Vytopil, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proceedings of the Second Annual Symposium on Principles of Distributed Computing, pages 187--197. ACM Press, 1983.

....the formula is evaluated, to the beginning of the computation. This is done by the special state predicate init, which characterizes the initial point in the computation. However, if we are allowed to use past operators in our logic, we may express the same property by the more intuitive formula ([KdR83, KVdR83]) 0 (q Q p) which uses the Once in the past operator Q , to claim that every q is preceded by a p. This form, which states that there is no effect without a cause, also has the aesthetically pleasing symmetry with the formula 0 (p 1 q) stating that there is no cause without effect. ....

R. Koymans, J. Vytopyl, and W.P. de Roever, Real-time programming and asynchronous message passing, Proc. 2nd ACM Symp. Princ. of Dist. Comp., 1983.

....as U . While the formula OE U states that OE holds until becomes true and that will become true eventually, the formula OE U puts the additional constraint that becomes true within time units. This approach, to which we refer as metric temporal approach, has been advocated in [19], 18] and [16] In contrast to the first approach, time is implicit in the metric temporal one. In this section we extend MTL to allow the expression of constraints on the durations of formulae. In section 2.1 we formulate the syntax of this language. The semantics of the extended logic can be ....

R. Koymans, J. Vytopil, and W.P. de Roever, Real-Time programming and asynchronous message passing, in: Proc. of the 2nd ACM Symp. on Princ. of Dist. Comp. (1983) 187-197.

....such as TRIO [12] Albert [8, 11] They use real numbers for time, which has advantages for specification and compositionality. Several syntaxes are possible to deal with real time: freeze quantification [4, 13] explicit clocks in a firstorder temporal logic [19] and time bounded operators [15, 16] studied here. The propositional fragment of these logics (MetricTL R ) is undecidable, but becomes decidable with mild restrictions (MetricIntervalTL[3] allowing automatic reasoning, animation, and verification of programs using automata based techniques. However, when the specification is ....

R. Koymans, J. Vytopil, and W.-P. de Roever. Real-time programming and asynchronous message passing. In Proceedings of the Second Annual Symposium on Principles of Distributed Computing, pages 187--197. ACM Press, 1983.

....k. Therefore the Ld theory of the set of timed state sequences of variability k is decidable. Introduction Timed state sequences are widely accepted as a model of real time computations of finite state systems, and sets of timed state sequences are used to model the behaviour of such systems [18] [9] There are two main formalisms commonly used to define sets of timed state sequences: timed automata and variants [5] 19] 17] on the one hand, and temporal logics [6] 10] 15] on the other hand. The former are modelled on physical systems, the latter are used for specification. Timed ....

R. Koymans, J. Vytopil, and W. P. de Roever. Real-time programming and asynchronous message passing. In "Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing", pp. 187--197. ACM Press (1983).

No context found.

R. Koymans, J. Vytopil and W. P. deRoever, "Real-Time Programming and Asynchronous Message Passing," in Proc. 2nd ACM Symp. on Principles of Distributed Computing, 1983, pp. 187-197.

First 50 documents

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