Automatic verification of the IEEE-1394 root contention protocol with KRONOS and PRISM

Electronic Notes in Theoretical Computer Science

Volumn 66, Issue 2, 2002, Pages 104-119

  Daws, Conrado ^a   Kwiatkowska, Marta ^b   Norman, Gethin ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

IEEE 1394; Model checking; Probabilistic timed automata; Root contention protocol; Soft deadlines

Indexed keywords

AUTOMATA THEORY; AUTOMATIC TESTING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; ENCODING (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; PROBABILITY; REAL TIME SYSTEMS;

IEEE 1394; MODEL CHECKING; PROBABILISTIC TIMED AUTOMATA; ROOT CONTENTION PROTOCOLS; SOFT DEADLINES;

COMPUTER AIDED ANALYSIS;

EID: 18944387681     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80406-7     Document Type: Conference Paper

References (22)

1. Alur R., Courcoubetis C., Dill D. Model-checking in dense real-time. Information and Computation. 104:(1):1993;2-34
2. Alur R., Dill D.L. A theory of timed automata. Theoretical Computer Science. 126:(2):1994;183-235
3. Alur R., Henzinger T.A. Reactive modules. Formal Methods in System Design. 15:(1):1999;7-48
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc. CAV'00, LNCS, 2000.
5. Baier C., Kwiatkowska M.Z. Model checking for a probabilistic branching time logic with fairness. Distributed Computing. 11:(3):1998;125-155
6. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proceedings of FSTTCS'95, volume 1026 of LNCS, pages 499-513. Springer-Verlag, 1995.
7. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool Kronos. In R. Alur, T. A. Henzinger, and E. D. Sontag, editors, Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science, pages 208-219. Springer-Verlag, 1996.
8. C. Daws and S. Tripakis. Model - checking of real - time reachability properties using abstractions. In B. Steffen, editor, Proc. TACAS'98, volume 1384 of LNCS, pages 313-329. Springer-Verlag, 1998.
9. L. de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In J. Baeten and S. Mauw, editors, Proceedings of CONCUR'99, volume 1664 of LNCS, pages 66-81. Springer Verlag, 1999.
10. Henzinger T.A., Ho P.-H., Wong-Toi H. HYTECH: a model checker for hybrid systems. Software Tools for Technology Transfer. 1:(1+2):1997;110-122
11. Kemeny J.G., Snell J.L., Knapp A.W. Denumerable Markov Chains. Graduate Texts in Mathematics. 2nd edition:1976;Springer
12. KRONOS web page. http://www-verimag.imag.fr/TEMPORISE/kronos/.
13. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In J. B. T. Field, P. Harrison and U. Harder, editors, Proc. TOOLS 2002, volume 2324 of LNCS, pages 200-204. Springer, 2002.
14. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In J.-P. Katoen and P. Stevens, editors, Proc. TACAS 2002, volume 2280 of LNCS, pages 52-66. Springer, 2002.
15. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of deadline properties in the IEEE 1394 firewire root contention protocol. In Proc. Int. Workshop on Application of Formal Methods to IEEE 1394 Standard, 2001.
16. Kwiatkowska M.Z., Norman G., Segala R., Sproston J. Automatic verification of real-time systems with discrete probability distributions. volume 1601 of LNCS. 1999;75-95 Springer-Verlag
17. Kwiatkowska M.Z., Norman G., Segala R., Sproston J. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science. 286:2002;. To appear
18. Larsen K.G., Pettersson P., Yi W. UPPAAL in a nutshell. Software Tools for Technology Transfer. 1:(1+2):1997;134-152
19. PRISM web page. http://www.cs.bham.ac.uk/~dxp/prism/.
20. D. Simons and M. Stoelinga. Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k. Springer International Journal of Software Tools for Technology Transfer, 2001. To appear.
21. M. Stoelinga. Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, Univerisity of Nijmegen, 2002.
22. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings FOCS'85. IEEE Computer Society Press, 1985.