### Table V. Process State Transitions

1987

Cited by 18

### Table 3: Child Process State

1996

Cited by 5

### Table 1: Interpretation of the Six Process States.

1997

"... In PAGE 4: ... 3.2 Process State As we argue below, six di#0Berent process states are necessary to uniquely capture the current status of each process executing the considered consensus algorithm #28see Table1 #29. Each process participating in the consen- sus algorithm must be in one of these states at any time.... ..."

Cited by 5

### Table 2: Probabilities of Process State Transitions.

1997

"... In PAGE 4: ...3 State Transitions and Probabilities In this section, we use the six process states intro- duced in the previous section and enumerate all valid process-state transitions. Tables 2 and 3 enumerate the probabilities #28 Table2 #29 and the logical conditions that must hold #28Table 3#29 for all valid process-state transi- tions during each round. Transitions shown with a zero probability of occurrence and those not shown are not allowable according to the protocol description and our assumed fault model.... In PAGE 4: ... Transitions shown with a zero probability of occurrence and those not shown are not allowable according to the protocol description and our assumed fault model. Table2 gives the probabilities of transitions origi- nating from states I through V. The #0Crst row in this table indicates the probabilities for possible next states originating from the current state I #28crashed#29.... ..."

Cited by 5

### Table 4: Process State Transition Probabilities

1997

"... In PAGE 5: ... Erlangian mes- sage delay distribution was chosen to study the e#0Bect of changes in variance on the behavior of the protocol. We will assume the notation given in Table4 . There are three events whose probabilities are direct functions of the stochastic model assumed: process crash, omis- sion failure and performance failure.... In PAGE 7: ... In fact, #5B11#5D and others have analyzed how consensus can be achieved with non- negligible probabilityeven when the number of crashes exceeds the resiliency of the protocol. In Table4 , we present the results for a case where ignoring resiliency constraints leads to the target consensus probability #280.999999#29 being achieved, but where enforcing them would have led to unacceptable behavior.... ..."

Cited by 5

### Table 2: Migration cost vs Process state size

1999

"... In PAGE 11: ...Figure 6: Migration cost vs Process state size Table2 summarizes the average of the best 10 observations for each test con guration. The result is an important factor for the decision whether a suggested process migration will improve the overall execution time of the application.... ..."

Cited by 4

### Table 1: Algebra of Communicating Processes and state operator axioms

"... In PAGE 6: ... The action function action calculates which action has to be performed as a result of executing X in state s on machine m, while the e ect function e ect calculates the new state. Table1 shows the relevant axioms of the state operator. 3.... ..."