When Are Two Gossips the Same?

20  0  Download (0) ✓

Full text

Figure

Table 1: Defining indistinguishability of call sequences

Table 1:

Defining indistinguishability of call sequences p.9
Figure 2: Classification of the ∼τa relations when |Ag| > 3.

Figure 2:

Classification of the ∼τa relations when |Ag| > 3. p.11
Figure 1: Classification of the ∼τa relations when |Ag| = 3.

Figure 1:

Classification of the ∼τa relations when |Ag| = 3. p.11

References

Download (N/A - 20 Page - 426.73KB)
Related subjects : Call sequences Two structures with the same RA relation (si,mi) Reference: When are two objects the same? When are two pages the same? When Are Two Gossips the Same? Types of Communication in Epistemic Gossip Protocols