Name
Abstract | ||
|---|---|---|
We prove the correctness of a sliding window protocol with an arbitrary flnite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-27815-3_15 | AMAST |
Keywords | DocType | Citations |
process algebra,verification techniques,and phrases: µcrl,specification,sliding window protocols,branching bisimulation | Conference | 6 |
PageRank | References | Authors |
0.47 | 23 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wan Fokkink | 1 | 1089 | 88.64 |
| Jan Friso Groote | 2 | 1626 | 154.19 |
| Jun Pang | 3 | 521 | 30.59 |
| Bahareh Badban | 4 | 49 | 5.30 |
| Jaco Van De Pol | 5 | 1022 | 78.19 |