The bounded retransmission protocol must be on time!

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1217, Issue , 1997, Pages 417-431

  D'argenio, P R ^a   Katoen, J P ^b   Ruys, T C ^a   Tretmans, J ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FILE TRANSFERS; REAL TIME ASPECTS; RETRANSMISSIONS;

MODEL CHECKING;

EID: 84958770017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0035403     Document Type: Conference Paper

References (15)

1. R. Alur and D. L. Dill. A theory of timed automata. Th. Comp. Sc., 126:183-235, 1994.
2. R. Alur, T. Henzinger and E. D. Sontag, editors. Hybrid Systems III, LNCS 1066, Springer-Verlag, 1996.
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.
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.
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.
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.
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.
8. C. Daws, A. Olivero, S. Tripakis and S. Yovine. The Tool Kronos. In [2], pages 208-219.
9. J. F. Groote and J. van de Poi. 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.
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.
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.
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.
13. G. J. Holzmann. Design and validation of computer protocols. Prentice Hall, Englewood ClifFs, 1991.
14. R. Mateescu. Formal description and analysis of a bounded retransmission protocol. In [5], pages 98-114.
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.