### Table 2: A nondeterministic truth table3

"... In PAGE 2: ...Table 2: A nondeterministic truth table3 The modi ed truth table in Table2 constitutes such a nondeterministic semantics for propositional logic. Multiple values in a cell indicate a non-deterministic choice in interpretation construction.... In PAGE 4: ... Assign u to the remaining variables. Beginning with the most deeply nested connectives, using the truth table of Table2 , choose the greatest allowable truth value (t gt; u gt; f) to assign. If no variable is assigned both t and f, then I is a 3- model for T.... ..."

### Table 1: The nondeterministic relation

"... In PAGE 6: ...1 For all s 2 Sp, fjp j (s; p; s0) 2 7?! jg = 1. The nondeterministic transition relation is given in Table1 . Note in particular, rules (ActT) and (ActI): instantaneous events preserve the world of a con guration while timed actions re-initialize it to ;.... ..."

### Table 1: The nondeterministic relation

"... In PAGE 6: ...1 For all s 2 Sp, fjp j (s; p; s0) 2 7?! jg = 1. The nondeterministic transition relation is given in Table1 . Note in particular, rules (ActT) and (ActI): instantaneous events preserve the world of a con guration while timed actions re-initialize it to ;.... ..."

### Table 1: The nondeterministic relation

"... In PAGE 6: ...1 For all s 2 Sp, fjp j (s; p; s0) 2 7?! jg = 1. The nondeterministic transition relation is given in Table1 . Note in particular, rules (ActT) and (ActI): instantaneous events preserve the world of a con guration while timed actions re-initialize it to ;.... ..."

### Table 1. The nondeterministic relation

"... In PAGE 7: ...Table1 . Note that the symmetric versions of rules (Sum) and (Par1) have been omitted.... In PAGE 7: ... Thus, by rule (Act2) we have (P; fr1; r2g) f(r1;2);(r2;3)g ?! (Q; ;), whereas (P; fr1; r2g), (P; fr1; r2g), and (P; fr1; r2g) have no transitions. Except for the appearance of worlds in con- gurations, the rules of Table1 are essentially identical to the ones for ACSR. It is worth pointing out that all processes in a parallel composition need to... ..."

### Table 4: Data structure for non-deterministic pairs of transition

1996

"... In PAGE 18: ... A pairwise comparison of all parallel transitions can assure determinism: If no two tran- sitions con ict, then the model is deterministic. Table4 and 5 outline the data structures and algorithm used for this analysis. The pairwise comparison of all transitions existing in parallel and triggered by simulta- neous events is potential costly; in the worst case (all transitions are parallel), the algorithm requires O(n2) comparisons (where n is the number of transitions in the model).... ..."

Cited by 95

### Table 4. Experiment 2, Comparison

"... In PAGE 11: ... The slope estimates were compared with a slope of 1, indicating perfect correspondence between the data and model. Table4 contains the slope estimates and the corresponding p values (df ; 192, varying ac- cording to the exact number of data recorded per subject, data that Bonferroni corrected for number of subjects; sig- nificant deviations from the model predictions with p , 0.05 marked by an asterisk; please contact authors for details).... ..."

### Table 2: Results of non-deterministic scheduling. util. mean flow-time F generations runtime (sec)

1999

"... In PAGE 14: ...1. The randomly initialized GA is called rand and its seeded counterpart is called bias in Table2 . The mean flow-times of jobs achieved for the SPT rule and both GA variants are reported.... In PAGE 14: ... The programs are run on a Pentium/200 Mhz computer. From Table2 we see that the flow-times of jobs obtained by SPT increase strongly with the utilization rate. Under high utilization rates the large workload results in long flow-times of jobs.... In PAGE 15: ... With an increasing U the problem size increases and now the biased GA dominates its rival by a few percent. Table2 also reports the average number of generations performed in the GA runs until termination occurred. Recall the flexible termination criterion used.... ..."

Cited by 21

### Table 2: Results of non-deterministic scheduling. util. mean flow-time F generations runtime (sec)

1999

"... In PAGE 14: ...1. The randomly initialized GA is called rand and its seeded counterpart is called bias in Table2 . The mean flow-times of jobs achieved for the SPT rule and both GA variants are reported.... In PAGE 14: ... The programs are run on a Pentium/200 Mhz computer. From Table2 we see that the flow-times of jobs obtained by SPT increase strongly with the utilization rate. Under high utilization rates the large workload results in long flow-times of jobs.... In PAGE 15: ... With an increasing U the problem size increases and now the biased GA dominates its rival by a few percent. Table2 also reports the average number of generations performed in the GA runs until termination occurred. Recall the flexible termination criterion used.... ..."

Cited by 21

### Table 4: Class for nondeterministic finite automata

2005

"... In PAGE 2: ... But we provide methods to test for epsilon1-transitions and to convert an epsilon1-NDFA to a NDFA. See Table4 , Appendix A, for more details. 2.... ..."

Cited by 4