| Henzinger, T., Manna, Z., Pnueli, A.: An interleaving model for real time, In Proc. of the 5th Jerusalem conf. on Information tech. pp. 717 - 730, (1990). |
....to be a sequence of sets of events, i.e. a partial ordering of events. Since this model of computation does not include the notion of state, there is no concept of an invariant holding in all states, as in most of the real time verification literature (e.g. Lamport 83] Ostroff 87] Henzinger et al. 90] Shankar Lam 87] Although this is a high price, most of the techniques which use invariance rely on transition systems as their model of computation. Transition systems may not be appropriate models for hard real time systems, because transition systems generally rely on interleaving to ....
....of general techniques such as the one described here. The various algebraic approaches on the other hand, such as Timed CSP, have sophisticated manual proof techniques, but as yet do not have any mechanical procedures ( Lastly, various temporal logic based approaches, such as [Ostroff 87] Henzinger et al. 90] and exist, and have mechanical procedures for checking satisfiability and doing model checking. However, the current work is distinguished from these approaches in that the specification language Modechart is richer in its features than many of the temporal logic based approaches, with its ....
. T. Henzinger, Z. Manna, and A. Pnueli, "An Interleaving Model for Real Time," Department of Computer Science, STAN-CS-90-1329, Stanford University (September 1990).
.... of literature that surrounds the HLA that simulation based model definition and specification formalisms e.g. DEVS (Zeigler 1976) event graphs (Schruben 1992) or other techniques that allow the specification and analysis of timing properties e.g. Petri nets (T orn 1991) temporal logics (Henzinger, Manna and Pnueli 1990) have been considered for roles within the OMT. Centrality of model objectives. Since every model is an abstraction, its quality must be judged in terms of its intended use. The intended use for the model determines the degree of faithfulness to the real system that the model must exhibit. ....
Henzinger, T. A., Z. Manna, and A. Pnueli. 1990. An interleaving model for real time, In Proceedings of the 5th Jerusalem Conference on Information Technology, IEEE Computer Society Press, 717-730.
....A Structured Proof Diagram 3 Real Time Systems The next model we consider introduces the metric aspect of time, and provides a measure for the time distance between events as well as for the duration of activities in the system. The specific model we present here was introduced and discussed in [HMP90], HMP91] HMP92] A closely related model was presented in [AL92] Many of the Process Algebra extensions to real time, such as [NSY92] MT90] and many others listed in [Sif91] are based on very similar assumptions. 3.1 Computational Model: Timed Transition System As the time domain we take ....
T. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In 5th Jerusalem Conference on Information Technology, pages 717--730, 1990.
....can easily be seen to be natural extensions of the standard proof rules for the untimed safety (invariance) and liveness (response) classes, respectively. In our model, we assume a global, discrete, and asynchronous clock, whose actions (clock ticks) are interleaved with the other system actions ( HMP90] In some other work aimed at the formal analysis of real time systems, it has been claimed that while this interleaving model of computation may be adequate for the qualitative analysis of reactive systems, it is inappropriate for the real time analysis of programs, and a more realistic model ....
T.A. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 717-- 730. IEEE Computer Society Press, 1990.
....[3; 3] fqg; 3; 3] fg; 3; 1) fg; 0; 3) fqg; 3; 3] fpg; 3; 3] fg; 3; 1) Indeed, an interleaving semantics typically abstracts further by assuming that all observation intervals are either closed or unbounded. The behavior of a system is viewed as a two phase activity [HMP90]: macro phases, during which time (i.e. macro time) advances, alternate with micro phases, during which the observable part of the system state changes finitely often. The micro phases result from the interleaving of independent instantaneous events and correspond to finite repetitions of ....
T.A. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 717-- 730. IEEE Computer Society Press, 1990.
....and liveness classes, respectively. The proof system, which consists of a small number of basic rules for either class, is shown to be (relative) complete. In our model, we assume a global, discrete, and asynchronous clock, whose actions (clock ticks) are interleaved with other system actions ([HMP90]) In some other work aimed at the formal analysis of real time systems, it has been claimed that while this interleaving model of computation may be adequate for the qualitative analysis of reactive systems, it is inappropriate for the real time analysis of programs, and a more realistic model, ....
T.A. Henzinger, Z. Manna, A. Pnueli, "An interleaving model for real time," 5th Jerusalem Conf. on Information Technology, 1990.
....time delays with the transitions. We use the real line as time domain and adapt the definition of timed transition systems that was given for a discrete time domain in [HMP91] Similar notions of transition systems with timing constraints have been defined, for integer time, in [Har88, PH88, HMP90, Ost90] A transition system S = hV; Sigma; Theta; T i consists of four components: 1. a finite set V of variables. 2. a set Sigma of states. Every state oe 2 Sigma is an interpretation of V ; that is, it assigns to every variable x 2 V a value oe(x) in its domain. 3. a subset Theta ....
T.A. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In Proceedings of the Fifth Jerusalem Conference on Information Technology, pages 717--730. IEEE Computer Society Press, 1990.
....computation model of timed transition system and identify the possible timed behaviors (computations) of any such system. Then, we show how a Timed Statecharts and Statext specification can be mapped into this generic model. The notions of timed behavior and timed transition system are based on [HMP90, HMP91] to which we have added explicit timed transitions and partitioned the set of state variables into persistent and volatile variables. As in [HMP90, HMP91] we assume a global clock. A timed transition (clock tick) advances the global clock by a positive amount. Timed transitions are ....
....and Statext specification can be mapped into this generic model. The notions of timed behavior and timed transition system are based on [HMP90, HMP91] to which we have added explicit timed transitions and partitioned the set of state variables into persistent and volatile variables. As in [HMP90, HMP91] we assume a global clock. A timed transition (clock tick) advances the global clock by a positive amount. Timed transitions are synchronous. They require the cooperation of all the concurrent processes, which have to agree on the increment by which the clock is advanced, and perform the ....
T. Henzinger, Z. Manna, and A. Pnueli. An interleaving model for real time. In 5th Jerusalem Conference on Information Technology, pages 717--730, 1990.
No context found.
Henzinger, T., Manna, Z., Pnueli, A.: An interleaving model for real time, In Proc. of the 5th Jerusalem conf. on Information tech. pp. 717 - 730, (1990).
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