Y. Ortega-Mallen, Operational semantics for timed observations, pp 507--528, LNCS 571, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to the transitions that may be performed will be interval finite, and so these transition systems will be trajectoried. These include one of the versions of timed LOTOS [BoL92] the Temporal Process Language of [HeR91] the Algebra of Timed Processes ATP [NiS90] the process algebra described in [Ort92], and the algebra for time and probabilities [Han91] Also, the transition systems discussed in [ClZ92] are required to be image finite, which is enough to ensure that they are trajectoried. The majority of timed transition systems which the authors are familiar with are image finite: only ....

Y. Ortega-Mallen, Operational semantics for timed observations, pp 507--528, LNCS 571, 1992.

....to the transitions that may be performed will be interval finite, and so these transition systems will be trajectoried. These include one of the versions of timed lotos [BoL92] the Temporal Process Language of [HeR91] the Algebra of Timed Processes ATP [NiS90] the process algebra described in [Ort92], and the algebra for time and probabilities [Han91] Also, the transition systems discussed in [ClZ92] are required to be image finite, which is enough to ensure that they are trajectoried. The majority of timed transition systems which the authors are familiar with are imagefinite: only finitely ....

Y. Ortega-Mall'en, Operational semantics for timed observations, pp 507--528, LNCS 571, 1992.

....untimed process algebras. Milner s CCS[11] has several extensions[4, 6, 12, 16] Hoare s CSP[8] has been extended to Timed CSP[15] and the ProCoS programming language PL time [10] and Baeten and Weijland s ACP[3] has a timed extension[2] Timed CSP has recently been given operational semantics[14], although these semantics do not correspond exactly with the original Timed CSP. Each of these extensions has significant limitations. PARTY is a real time process algebra which addresses these limitations, while still having a small set of simple process constructors and an elegant and general ....

....action a. That is, there is no order on simultaneous events. Another way of thinking of this intuition is that over a bounded period of time, a real time process can be observed to engage in some bag (a finite multiset) of time stamped actions. This assumption is also used explicitly in Timed CSP[15, 14]. If the action a occurs at times 1.23 and 2.3, we have two distinct events for the action, ordered in time. If both action a and action b occur at time 4, then no order can be given by an observer for these two events. This is in contrast with a proposal by Moller and Tofts[12] for handling dense ....

[Article contains additional citation context not shown here]

Yolanda Ortega-Mall'en. Operational semantics for timed observations. In Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 571 of Lecture Notes in Computer Science, pages 507--527. Springer-Verlag, 1992.

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