### Table 4: Check-In Actions.

1998

Cited by 1

### Table 3. Stated Use of Real-time Paratransit by Disabled

1997

"... In PAGE 10: ... Real-time paratransit was described as a service similar to paratransit except that it allows users to make reservations a minimum of one day in advance. Table3 shows that if real-time paratransit were available, 77 percent of the disabled would make trips by the real-time paratransit service. Table 3.... ..."

### Table 2: New constructs introduced to real-time LOTOS

2002

"... In PAGE 4: ... In real-time LOTOS, some new constructs of E-LOTOS can be used in addition to operators of the standard LOTOS such as choice, parallel, multi-way synchronization and disabling. In Table2 , we show the new constructs of E-LOTOS which we have adopted in real-time LOTOS, where we can specify the time at which each event may be executed, explicit iterations of some behavior [7], write-many variables, and variable assignments. Here, a28a55a67a39a54a42a68 captures the time duration (called elapsed time) until the event is... ..."

Cited by 1

### Table 1: Comparison of linear propositional real-time logics

1992

"... In PAGE 34: ...ver time (e.g. all times with an even time di erence from the initial state). Thus, RTTL( lt;,s) is interpreted over a discrete time domain, and can be used to specify constant lower and upper time bounds on the time distance between events. The various logics are compared in Table1 for satis ability, model checking and expressiveness over discrete and dense time domains relative to RTTL. For any real-time logic that is closed under boolean operations, and... ..."

Cited by 28

### Table 1. Specs of a real-time system

2000

"... In PAGE 4: ... In section 4, we present a new scheduling algorithm with a improved controller that can satisfy the specs. Table1 illustrates the specs for a real-time system to be designed. The miss-ratio window of interest is MW = 2.... In PAGE 4: ... It was shown that FC-EDF rendered satisfactory performance in term of the classical (steady state) metrics such as the average deadline miss-ratio (Ma) [17]. However, a FC-EDF may fail to meet the specs in Table1 , due to control saturation or system modeling errors, as shown by experiment results (see Section 3.3).... In PAGE 7: ...2, a real-time system is stable if it can always settle down to a steady state in finite time. According to the specs of Table1 , the system is in steady-state if MR(t)=0%. A system unstable if there exists a run in which the system fails to enter and stay in the steady state.... In PAGE 9: ...ontrol gains, (0.25, 0.1), (0.5, 0.1), and (0.25, 0.5), can satisfy the specs in Table1 when SP=2.4 sec.... ..."

Cited by 53

### Table 1: Objects and members for real-time tracking.

1995

"... In PAGE 5: ....7 seconds. This is admittedly slow real-time perfor- mance, but is adequate for our purposes, and quite reasonable, considering the computational resources used. Table1 shows the feature membership for each object found by the Cluster Agent. A few observa- tions can be made about the clustering: The system detected three objects during tracking, mainly because the motion model is too simple.... ..."

Cited by 3

### Table 1: Comparison of linear propositional real-time logics

"... In PAGE 34: ...ver time #28e.g. all times with an even time di#0Berence from the initial state#29. Thus, RTTL#28#3C,s#29 is interpreted over a discrete time domain, and can be used to specify constantlower and upper time bounds on the time distance between events. The various logics are compared in Table1 for satis#0Cability, model checking and expressiveness over discrete and dense time domains relativetoRTTL. For any real-time logic that is closed under boolean operations, and... ..."

### Table 1. Specs of a real-time system

in Gang Tao ΒΆ

"... In PAGE 4: ... In section 4, we present a new scheduling algorithm with a improved controller that can satisfy the specs. Table1 illustrates the specs for a real-time system to be designed. The miss-ratio window of interest is MW = 2.... In PAGE 4: ... It was shown that FC-EDF rendered satisfactory performance in term of the classical (steady state) metrics such as the average deadline miss-ratio (Ma) [17]. However, a FC-EDF may fail to meet the specs in Table1 , due to control saturation or system modeling errors, as shown by experiment results (see Section 3.3).... In PAGE 7: ...2, a real-time system is stable if it can always settle down to a steady state in finite time. According to the specs of Table1 , the system is in steady-state if MR(t)=0%. A system unstable if there exists a run in which the system fails to enter and stay in the steady state.... In PAGE 9: ...ontrol gains, (0.25, 0.1), (0.5, 0.1), and (0.25, 0.5), can satisfy the specs in Table1 when SP=2.4 sec.... ..."

### Table 1: Timing Characteristics of the Real-Time Workload and its Recovery

15

"... In PAGE 1: ... S1(12) = 31, S2(12) = 31, S3(12) = 17. It is possible to observe in Table 4 that if Recovery Blocks are used to handle faults, due to the fact that the computation time of the secondary block of task 2 is equal to Cs 2 = 11 (see Table1 ), it can recover under any level of responsiveness.CL GL GE FA 31 31 17 17 Table 4: RTAB Table for Example 3 4 Conclusion A scheme was presented to provide scheduling guar- antees for a variety of fault tolerant techniques.... In PAGE 2: ... The breakdown utilization UBD of a task set with uti- lization UW = Pn i=1 Ci=Ti, including fault-induced re- quirements is given by UBD = UW maxf1 i ngminft2SigfWF i (t)=tg (6) If UW UBD then the task set is schedulable, otherwise the task set is unschedulable. Table 2 shows the fault tolerant recovery bound Uf, and the breakdown utilization UBD, for the task set used in Table1 . It can be observed that under all the recovery schemes UW gt; Uf.... In PAGE 2: ... The largest recovery time with priority i which arrives dt=TF i e in the interval [0; t] may be calculated by, LRi = maxft S i g Wi(t)=dt=TF i e (9) It follows that the largest recovery time which may be added to a set of n tasks without disturbing their schedulability is given by, LTi = minfi k ngmaxft S kg Wk(t)=dt=TF i e (10) Example 1. Considering the fault-free workload pre- sented in Table1 , the analysis for calculating the largest recovery time is given in Table 3. Table 3 shows that there is enough spare time in the schedule to satisfy the timing requirements of the fault tolerant recovery workload, except for the checkpointing model.... In PAGE 3: ... As stated in equation (2), we can compute the schedu- lability test for the fault tolerant real-time task set as, maxf1 i ngminft2SigfWF i (t)=tg 1 (4) Equation (4) gives us an schedulability condition for fault tolerant real-time task sets. Table1 shows a task set consisting of 3 periodic tasks, and its associated timing characteristics for each fault tolerant mechanism. From this requirements, in Table 2 we show the schedulability analysis for the fault tolerant models previously discussed.... ..."

### Table 1. Temporal OCL Extensions and Real-Time Specification

2003

"... In PAGE 4: ... This is especially important for modeling of safety-critical systems. Table1 lists once more the mentioned approaches and com- pares them w.... ..."

Cited by 3