### Table 3 Fit for dyadic dependence modelsa

2007

"... In PAGE 13: ...5)}. The first round, adding each of these terms or sets of terms, yields the model fits in Table3 . The standard Markov terms of triangle and individual star parameters again led to a non-converging model.... ..."

Cited by 6

### Table 1 Markov chain of five states

"... In PAGE 2: ... Thus, we have two parallel sequences of Bernoulli trials, which are intermittently shifted forward. The shifting process can be described as a finite Markov chain apos; with the five states shown in Table1 .... ..."

### Table 1: Markov chain based methods for PMS

1999

"... In PAGE 3: ...1 Literature survey In this section we present and compare the Markov chain-based approaches [2, 3, 5, 10, 16, 21, 22] and the one based on SAN in [4] for the dependability model- ing and analysis of PMS. The most relevant aspects of the comparison are summa- rized in Table1 .A key point that impacts most of the other aspects is represented by the sin- gle/separate modeling of the phases: it affects the reusability/flexibility of previously built models, the modeling of dependencies among phases and the complexity of the solution steps.... ..."

Cited by 11

### Table 2. Example for Deriving the States of the Markov Chains.

2004

"... In PAGE 6: ... That is, the sequence U consists of the indices of the elements in L corresponding to the job sequence. As an example, consider Table2 where the process of reducing... ..."

Cited by 8

### Table 2. Example for Deriving the States of the Markov Chains.

2004

"... In PAGE 6: ... That is, the sequence U consists of the indices of the elements in L corresponding to the job sequence. As an example, consider Table2 where the process of reducing... ..."

Cited by 8

### Table 3: Constants of the Markov chain in each

2002

Cited by 3

### Table 1: Transition probabilities of Markov chain.

1993

"... In PAGE 4: ... The medium moves to the free state when no sta- tion wants to transmit (Pi ki=0), to the success- ful state when exactly one station wants to trans- mit (Pi ki=1), and to the collision state otherwise (Pi ki gt;1). The transition probabilities pw(v) are given in Table1 . In (2) ki=0 for all i, in (3) ki=1 and kj=0 for j6 =i, and in the last case Pi ki gt;1.... ..."

Cited by 1

### TABLE I THE FIVE STATES OF THE MARKOV CHAIN

### Table 2 Markov chain of seven states

"... In PAGE 4: ... Therefore, let A be the channel and B the processor; then II,; = I and rIai = 0 for all i. The stretching factors then become: - = 1 (the channel is unaffected) To* T, The number of states increases from five to the seven shown in Table2 as we add a third processor to the case of two processors and one storage unit; however, the number of independent param- eters increases from three to eight. This means that explicit general formulas are more difficult to obtain and more cumbersome to use.... ..."