Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol

Formal Aspects of Computing

Volumn 14, Issue 3, 2003, Pages 295-318

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Sproston, Jeremy ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

FireWire; IEEE standard; Probabilistic model checking; Timed automata

Indexed keywords

CODES (STANDARDS); FINITE AUTOMATA; INTEGER PROGRAMMING; PROBABILITY; SEMANTICS; TREES (MATHEMATICS);

FIREWIRES;

NETWORK PROTOCOLS;

EID: 0038413979     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001650300007     Document Type: Conference Paper

References (48)

1. [ACD91] Alur, R., Courcoubetis, C., and Dill, D. L,: Model-checking for probabilistic real-time systems. In J. Leach Albert, B. Monien and M. Artalejo Rodríguez, editors, Proceedings of the 18th International Conference on Automata, Languages and Programming (ICALP'91), volume 510 of LNCS, pages 115-136. Springer-Verlag, 1991.
2. [AlD94] Alur, R. and Dill, D. L.: A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
3. [AIK95] Alur, R., Itai, A., Kurshan, R. and Yannakakis, M.: Timing verification by successive approximation. Information and Computation, 18(1):142-157, 1995.
4. [AMP98] Asarin, E., Maler, O. and Pnueli, A.: On discretization of delays in timed automata and digital circuits. In Sangiorgi and de Simone [Sad98], pages 470-484.
5. [BaK98] Baier, C. and Kwiatkowska, M. Z.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
6. [Bey01] Beyer, D.: Improvements in BDD-based reachability analysis of timed automata. In J. N. Oliveira and P. Zave, editors, Proceedings of the 10th International Symposium of Formal Methods Europe (FME 2001), volume 2021 of LNCS, pages 318-343. Springer-Verlag, 2001.
7. [BKH99] Baier, C., Katoen, J.-P. and Hermanns, H.: Approximate symbolic model checking of continuous-time Markov chains. In J. Baeten and S. Mauw, editors, Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of LNCS, pages 142-162. Springer-Verlag, 1999.
8. [Bid95] Bianco, A. and de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proceedings of the International Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer-Verlag, 1995.
9. [BMT99] Bozga, M., Maler, O. and Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In L. Pierre and T. Kropf, editors, Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'99), volume 1703 of LNCS, pages 125-141. Springer-Verlag, 1999.
10. [BST00] Bandini, G., Spelberg, R. L. and Toetenel, W. J.: Parametric verification of the IEEE 1394a root contention protocol using LPMC. In Proceedings of the 7th International Conference on Real-Time Computing Systems and Applications (RTCSA 2000), pages 207-214. IEEE Computer Society Press, 2000.
11. [ClE81] Clarke, E. M. and Emerson, E. A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, volume 131 of LNCS, pages 52-71. Springer-Verlag, 1981.
12. [CFM93] Clarke, E. M., Fujita, M., McGeer, P., McMillan, K., Yang, J. and Zhao, X.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In Proceedings of the International Workshop on Logic Synthesis (IWLS'93), pages 6a:1-15, 1993. Also available in Formal Methods in System Design, 10(2/3):149-169, 1997.
13. [CFM93] Clarke, E. M., Fujita, M., McGeer, P., McMillan, K., Yang, J. and Zhao, X.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. In Proceedings of the International Workshop on Logic Synthesis (IWLS'93), pages 6a:1-15, 1993. Also available in Formal Methods in System Design, 10(2/3):149-169, 1997.
14. [CoS01] Collomb-Annichini, A. and Sighireanu, M.: Parameterized reachability analysis of the IEEE 1394 root contention protocol using TReX. In P. Pettersson and S. Yovine, editors. Proceedings of the Workshop on Real-Time Tools (RT-TOOLS 2001), 2001.
15. [deA97] de Alfaro, L.: Formal Verification of Probabilistic Systems, PhD thesis, Stanford University, 1997.
16. [deA98] de Alfaro, L.: Stochastic transition systems. In Sangiorgi and de Simone [Sad98], pages 423-438.
17. [DAr99] D'Argenio, P. R.: Algebras and Automata for Timed and Stochastic Systems. PhD thesis, Department of Computer Science, University of Twente, 1999.
18. [dKN00] de Alfaro, L., Kwiatkowska, M. Z., Norman, G., Parker, D. and Segala, R.: Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In S. Graf and M. Schwartzbach, editors, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000), volume 1785 of LNCS, pages 395-410. Springer-Verlag, 2000.
19. [Der70] Derman, C.: Finite-State Markovian Decision Processes. Academic Press, 1970.
20. [DJJ01] D'Argenio, P. R., Jeannet, B., Jensen, H. E. and Larsen, K. G.: Reachability analysis of probabilistic systems by successive refinements. In L. de Alfaro and S. Gilmore, editors, Proceedings of the Joint PAPM-PROBMIV 2001 Workshop, volume 2165 of LNCS, pages 39-56. Springer-Verlag, 2001.
21. [DKN02] Daws, C., Kwiatkowska, M. Z. and Norman, G.: Automatic verification of IEEE 1394 root contention protocol with KRONOS and PRISM. In R. Cleaveland and H. Garavel, editors, Proceedings of the 7th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2002), pages 107-122, 2002. To appear in Electronic Notes in Theoretical Computer Science.
22. [DOT96] Daws, C., Olivero, A., Tripakis, S. and Yovine, S.: The tool KRONOS. In R. Alur, T. A. Henzinger and E. D. Sontag, editors, Hybrid Systems III: Verification and Control, volume 1066 of LNCS, pages 208-219. Springer-Verlag, 1996.
23. [DaT98] Daws, C. and Tripakis, S.: Model-checking of real-time reachability properties using abstractions. In Steffen [Ste98], pages 313-329.
24. [DaY95] Daws, C. and Yovine, S.: Two examples of verification of multirate timed automata with KRONOS. In A. Burns, Y.-H. Lee and K. Ramamritham, editors, Proceedings of the 16th IEEE Real-Time Systems Symposium (RTSS'95), pages 66-75. IEEE Computer Society Press, 1995.
25. [FiS01] Fidge, C. and Shankland, C.: But what if I don't want to wait forever? In S. Maharaj, J. Romijn and C. Shankland, editors, Proceedings of the International Workshop on Application of Formal Methods to IEEE 1394 Standard, 2001.
26. [HaJ94] Hansson, H. and Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
27. [HHW95] Henzinger, T. A., Ho, P.-H. and Wong-Toi, H.: A user guide to HYTECH. In E. Brinksma, W. R. Cleaveland, K. G. Larsen, T. Margaria and B. Steffen, editors, Proceedings of the 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'95), volume 1019 of LNCS, pages 41-71. Springer-Verlag, 1995.
28. [HHW97] Henzinger, T. A., Ho, P.-H. and Wong-Toi, H.: HYTECH: a model checker for hybrid systems. Software Tools for Technology Transfer, 1(1+2):110-122, 1997.
29. [HMP92] Henzinger, T. A., Manna, Z. and Pnueli, A.: What good are digital clocks? In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (ICALP'92), volume 623 of LNCS, pages 545-558. Springer-Verlag, 1992.
30. [HRS01] Hune, T. S., Romijn, J. M. T., Stoelinga, M. I. A. and Vaandrager, F. W.: Linear parametric model checking of timed automata. In T. Margaria and W. Yi, editors, Proceedings of the 7th Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), volume 2031 of LNCS, pages 189-203. Springer-Verlag, 2001.
31. [HSP83] Hart, S., Sharir, M. and Pnueli, A.: Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380, 1983.
32. [Kat99] Katoen, J.-P., editor: Proceedings of the 5th International AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), volume 1601 of LNCS. Springer-Verlag, 1999.
33. [KNP02] Kwiatkowska, M. Z., Norman, G. and Parker, D.: PRISM: probabilistic symbolic model checker. In T. Field, P. G. Harrison, J. Bradley and U. Harder, editors, Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools (TOOLS 2002), volume 2324 of LNCS, pages 200-204. Springer-Verlag, 2002.
34. [KNS02a] Kwiatkowska, M. Z., Norman, G. and Sproston, J.: Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In H. Hermanns and R. Segala, editors, Proceedings of the Joint PAPM-PROBMIV 2002 Workshop, volume 2399 of LNCS, pages 169-187. Springer-Verlag, 2002.
35. [KNS02b] Kwiatkowska, M. Z., Norman, G., Segala, R. and Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282(1):101-150, 2002. A preliminary version of this paper appeared in Katoen [Kat99], pages 75-95.
36. [Koz81] Kozen, D.: Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-350, 1981.
37. [KSK76] Kemeny, J. G., Snell, J. L. and Knapp, A. W: Denumerable Markov Chains, 2nd edition, Graduate Texts in Mathematics. Springer, 1976.
38. [LPY97] Larsen, K. G., Pettersson, P. and Yi, W.: UPPAAL in a nutshell. Software Tools for Technology Transfer, 1(1+2):134-152, 1997.
39. [LPY98] Lindahl, M., Pettersson, P. and Yi, W.: Formal design and analysis of a gear-box controller. In Steffen [Ste98], pages 281-297.
40. [Pri] PRISM: Web page: http://www.cs.bham.ac.uk/̃dxp/prism/
41. [Sad98] Sangiorgi, D. and de Simone, R., editors: Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), volume 1466 of LNCS. Springer-Verlag, 1998.
42. [Seg95] Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Department of Electrical Engineering and Computer Science, 1995.
43. [SeL95] Segala, R. and Lynch, N. A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
44. [SiS01] Simons, D. P. L. and Stoelinga, M. I. A.: Mechanical verification of the IEEE 1394a root contention protocol using UPPAAL2k. Software Tools for Technology Transfer, 3(4):469-485, 2001.
45. [Ste98] Steffen, B., editor: Proceedings of the 4th Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), volume 1384 of LNCS. Springer-Verlag, 1998.
46. [StV99] Stoelinga, M. I. A. and Vaandrager, F. W.: Root contention in IEEE 1394. In Katoen [Kat99], pages 53-74.
47. [Var85] Vardi, M. Y.: Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.
48. [YPD94] Yi, W., Pettersson, P. and Daniels, M.: Automatic verification of real-time communicating systems by constraint-solving. In D. Hogrefe and S. Leue, editors, Proceedings of the 7th International Conference on Formal Description Techniques (FORTE'94), pages 223-238. North-Holland, 1994.