### Table 1: STDMA frame size and characteristics of sample Network A for various terrain characteristics. A neighbor is a node reachable in one hop.

### Table 6.8: Second-order axioms for out-buffered agents

in Functionality, Polymorphism, and Concurrency: A Mathematical Investigation of Programming Paradigms

1997

Cited by 3

### Table 5: Reachable states

1994

"... In PAGE 7: ... As a by- product, one obtains the maximum acyclic path in that component. Table5 reports for some benckmarks the number of reached states and corresponding fault coverages when starting from different initial states. Columns m0 and FC(m0) are computed with the same circuit configura- tion that was used in Table 2, i.... ..."

Cited by 1

### Table 5: Reachable states

1994

"... In PAGE 7: ... As a by- product, one obtains the maximum acyclic path in that component. Table5 reports for some benckmarks the number of reached states and corresponding fault coverages when starting from different initial states. Columns m0 and FC(m0) are computed with the same circuit configura- tion that was used in Table 2, i.... ..."

Cited by 1

### Table 5: Reachable states

"... In PAGE 7: ... As a by- product, one obtains the maximum acyclic path in that component. Table5 reports for some benckmarks the number of reached states and corresponding fault coverages when starting from different initial states. Columns m0 and FC(m0) are computed with the same circuit configura- tion that was used in Table 2, i.... ..."

### Table 2 Reachability performance for US senders US reachability (%)

2004

"... In PAGE 13: ... In these tables, we group sender sites based on their overall reachability characteristics with re- spect to US and European receivers. As an exam- ple, the bottom row in Table2 indicates that out of 28 sender sites located in the US, 22 had good reachability with respect to US receivers, 3 had average, and 3 had poor reachability with respect to US receivers. In addition, the second column in the same table indicates that out of the 22 US senders with good reachability in US, 15 also had good reachability with respect to European receivers, 6 had average, and only one had poor reachability with respect to European receivers.... ..."

### TABLE 5. Analysis results. Parameters Reachable nodes Parameters Reachable nodes

1995

"... In PAGE 15: ... Analysis Results The reachability analysis results of the Pr/T-net model in Fig. 7 are shown in TABLE5 . For simplicity we have assumed that all movies have the same duration, which means that the place ACTIVE MOVIES obey the FIFO principle.... In PAGE 15: ...From the TABLE5 it can be seen that the number of users a ects the size of the reachability graph stronger than the number of movies or the number of channels. To be more precise, U users can be put into the FIFO in U! di erent orders.... In PAGE 15: ... Then the number of user combinations possible in the request FIFO is reduced by the factor U!. The sizes of the reachability graphs generated using black user tokens are given in TABLE5... ..."

Cited by 1

### TABLE 5. Analysis results. Parameters Reachable nodes Parameters Reachable nodes

1995

"... In PAGE 15: ... Analysis Results The reachability analysis results of the Pr/T-net model in Fig. 7 are shown in TABLE5 . For simplicity we have assumed that all movies have the same duration, which means that the place ACTIVE MOVIES obey the FIFO principle.... In PAGE 15: ...From the TABLE5 it can be seen that the number of users a ects the size of the reachability graph stronger than the number of movies or the number of channels. To be more precise, U users can be put into the FIFO in U! di erent orders.... In PAGE 15: ... Then the number of user combinations possible in the request FIFO is reduced by the factor U!. The sizes of the reachability graphs generated using black user tokens are given in TABLE5... ..."

Cited by 1

### Table 2. Decremental reachability algorithms.

2002

"... In PAGE 2: ... [1]. A sum- mary of previous decremental algorithms for maintaining the transitive closure, and for answering reachability queries is given in Table2 . (All the algorithms there, except that of Henzinger and King [10], explicitly maintain the transitive closure matrix.... ..."

Cited by 16

### Table 2. Decremental reachability algorithms.

2002

"... In PAGE 2: ... [1]. A sum- mary of previous decremental algorithms for maintaining the transitive closure, and for answering reachability queries is given in Table2 . (All the algorithms there, except that of Henzinger and King [10], explicitly maintain the transitive closure matrix.... ..."

Cited by 16