| ... | @@ -389,8 +389,8 @@ In particular, an event indicating the end of a contact is always processed afte |
... | @@ -389,8 +389,8 @@ In particular, an event indicating the end of a contact is always processed afte |
|
|
### Example
|
|
### Example
|
|
|
|
|
|
|
|
The following figures show how to construct a dynamic contact graph for a simple dataset with three devices: `A`, `B` and `C`.
|
|
The following figures show how to construct a dynamic contact graph for a simple dataset with three devices: `A`, `B` and `C`.
|
|
|
The dataset starts at time `t<sub>1</sub>`.
|
|
The dataset starts at time `t1`.
|
|
|
There's a contact between `A` and `B` beginning at `t<sub>2</sub>` and ending at `t<sub>3</sub>`, and there's a contact between `B` and `C` beginning at `t<sub>4</sub>` and ending at `t<sub>5</sub>`.
|
|
There's a contact between `A` and `B` beginning at `t2` and ending at `t3`, and there's a contact between `B` and `C` beginning at `t4` and ending at `t5`.
|
|
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|
|
| ... | @@ -418,8 +418,8 @@ There's a contact between `A` and `B` beginning at `t<sub>2</sub>` and ending at |
... | @@ -418,8 +418,8 @@ There's a contact between `A` and `B` beginning at `t<sub>2</sub>` and ending at |
|
|
|
|
|
|
|
---
|
|
---
|
|
|
|
|
|
|
|
In the finished graph, we can see that if we start from device `A` at time `t<sub>1</sub>` it's possible to reach `B` at `t<sub>2</sub>` and `C` at `t<sub>4</sub>`.
|
|
In the finished graph, we can see that if we start from device `A` at time `t1` it's possible to reach `B` at `t2` and `C` at `t4`.
|
|
|
On the other hand, if we start from `C` at `t<sub>1</sub>`, we reach `B` at `t<sub>4</sub>` and we can't reach `A` at all.
|
|
On the other hand, if we start from `C` at `t1`, we reach `B` at `t4` and we can't reach `A` at all.
|
|
|
|
|
|
|
|
## Dynamic Reachability Analysis
|
|
## Dynamic Reachability Analysis
|
|
|
|
|
|
| ... | |
... | |
| ... | | ... | |