The bounded retransmission protocol must be on time!

  • P. R. D'Argenio
  • J. -P. Katoen
  • T. C. Ruys
  • J. Tretmans
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1217)

Abstract

This paper concerns the transfer of files via a lossy communication channel. It formally specifies this file transfer service in a property-oriented way and investigates—using two different techniques—whether a given bounded retransmission protocol conforms to this service. This protocol is based on the well-known alternating bit protocol but allows for a bounded number of retransmissions of a chunk, i.e., part of a file, only. So, eventual delivery is not guaranteed and the protocol may abort the file transfer. We investigate to what extent real-time aspects are important to guarantee the protocol's correctness and use Spin and Uppaal model checking for our purpose.

References

  1. 1.
    R. Alur and D.L. Dill. A theory of timed automata. Th. Comp. Sc., 126:183–235, 1994.Google Scholar
  2. 2.
    R. Alur, T. Henzinger and E.D. Sontag, editors. Hybrid Systems III, LNCS 1066, Springer-Verlag, 1996.Google Scholar
  3. 3.
    J. Bengtsson, D. Griffioen, K. Kristoffersen, K.G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Verification of an audio protocol with bus collision using Uppaal. In R. Alur and T.A. Henzinger, editors, Proc. of CAV'96, LNCS 1102, pages 244–256. Springer-Verlag, 1996.Google Scholar
  4. 4.
    J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and W. Yi. Uppaal — a tool suite for the automatic verification of real-time systems. In [2], pages 232–243.Google Scholar
  5. 5.
    Z. Brezocnik and T. Kapus, editors. Proceedings of COST 247 Int. Workshop on Applied Formal Methods in System Design. University of Maribor Press, 1996.Google Scholar
  6. 6.
    P.R. D'Argenio, J-P. Katoen, T. Ruys, and J. Tretmans. Modeling and Verifying a Bounded Retransmission Protocol. In [5], pages 114–128.Google Scholar
  7. 7.
    P.R. D'Argenio, J-P. Katoen, T. Ruys, and J. Tretmans. The Bounded Retransmission Protocol must be on time!. Report CTIT 97-03, University of Twente, 1997.Google Scholar
  8. 8.
    C. Daws, A. Olivero, S. Tripakis and S. Yovine. The Tool Kronos. In [2], pages 208–219.Google Scholar
  9. 9.
    J.F. Groote and J. van de Pol. A bounded retransmission protocol for large data packets. In M. Wirsing and M. Nivat, editors, Algebraic Methodology and Software Technology, LNCS 1101, pages 536–550. Springer-Verlag, 1996.Google Scholar
  10. 10.
    K. Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In M-C. Glaudel and J. Woodcock, editors, Proc. of FME'96, LNCS 1051, pages 662–681. Springer-Verlag, 1996.Google Scholar
  11. 11.
    L. Helmink, M.P.A. Sellink, and F.W. Vaandrager. Proof checking a data link protocol. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs, LNCS 806, pages 127–165. Springer-Verlag, 1994.Google Scholar
  12. 12.
    T.H. Henzinger, P.-H. Ho, and H. Wong-Toi. A user guide to HyTech. In E. Brinksma et. al, editors, Proc. of TACAS'95, LNCS 1019, pages 41–71. Springer-Verlag, 1995.Google Scholar
  13. 13.
    G.J. Holzmann. Design and validation of computer protocols. Prentice Hall, Englewood Cliffs, 1991.Google Scholar
  14. 14.
    R. Mateescu. Formal description and analysis of a bounded retransmission protocol. In [5], pages 98–114.Google Scholar
  15. 15.
    S. Tripakis and C. Courcoubetis. Extending Promela and Spin for real time. In T. Margaria and B. Steffen, editors, Proc. of TACAS'96, LNCS 1055, pages 329–348. Springer-Verlag, 1996.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • P. R. D'Argenio
    • 1
  • J. -P. Katoen
    • 2
  • T. C. Ruys
    • 1
  • J. Tretmans
    • 1
  1. 1.Faculty of Computing ScienceUniversity of TwenteAE EnschedeThe Netherlands
  2. 2.Lehrstuhl für Informatik VIIUniversity of ErlangenErlangenGermany

Personalised recommendations