Verification of Real-Time Probabilistic Systems

Modeling and Verification of Real-Time Systems: Formalisms and Software Tools

Volumn , Issue , 2010, Pages 249-288

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Communication protocols; Probabilistic algorithms; Probabilistic characteristics; Unpredictable behavior; Verification techniques

Indexed keywords

EID: 58049099700     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470611012.ch8     Document Type: Chapter

References (36)

1. DE ALFARO L., "Formal verification of probabilistic systems", PhD thesis, Stanford University, 1997.
2. DE ALFARO L., "Computing minimum and maximum reachability times in probabilistic systems", BAETEN J., MAUW S., Eds., Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), vol. 1664 of Lecture Notes in Computer Science, Springer Verlag, p. 66-81, 1999.
3. ALUR R., DILL D., "A theory of timed automata", Theoretical Computer Science, vol. 126, num. 2, p. 183-235, 1994.
4. ALUR R., LA TORRE S., PAPPAS G., "Optimal paths in weighted timed automata", Theoretical Computer Science, vol. 318, num. 3, p. 297-322, 2004.
5. BEHRMANN G., FEHNKER A., HUNE T., LARSEN K., PETTERSSON P., ROMIJN J., VAANDRAGER F., "Minimum-cost reachability for linearly priced timed automata", BENEDETTO M. D., SANGIOVANNI-VINCENTELLI A., Eds., Proc. 4th Int. Workshop on Hybrid Systems: Computation and Control (HSCC'01), vol. 2034 of Lecture Notes in Computer Science, Springer Verlag, p. 147-162, 2001.
6. BEHRMANN G., DAVID A., LARSEN K. G., "A tutorial on UPPAAL", BERNARDO M., CORRADINI F., Eds., Formal Methods for the Design of Real-Time Systems: 4th Int. School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-RT 2004, vol. 3185 of Lecture Notes in Computer Science, Springer Verlag, p. 200-236, 2004.
7. BERTSEKAS D., TSITSIKLIS J., "An analysis of stochastic shortest path problems", Mathematics of Operations Research, vol. 16, num. 3, p. 580-595, 1991.
8. BEYER D., "Improvements in BDD-based reachability analysis of timed automata", OLIVEIRA J., ZAVE P., Eds., Proc. Symp. Formal Methods Europe (FME'01), vol. 2021 of Lecture Notes in Computer Science, Springer Verlag, p. 318-343, 2001.
9. BIANCO A., DE ALFARO L., "Model checking of probabilistic and nondeterministic systems", THIAGARAJAN P., Ed., Proc. 15th Conf. Foundations of Software Technology and Theoretical Computer Science, vol. 1026 of Lecture Notes in Computer Science, Springer Verlag, p. 499-513, 1995.
10. COURCOUBETIS C., YANNAKAKIS M., "Markov decision processes and regular events", IEEE Transactions on Automatic Control, vol. 43, num. 10, p. 1399-1418, 1998.
11. DAWS C., OLIVERO A., TRIPAKIS S., YOVINE S., "The tool KRONOS", ALUR R., HENZINGER T., SONTAG E., Eds., Hybrid Systems III, Verification and Control, vol. 1066 of Lecture Notes in Computer Science, Springer Verlag, p. 208-219, 1996.
12. DAWS C., TRIPAKIS S., "Model checking of real-time reachability properties using abstractions", STEFFEN B., Ed., Proc. 4th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems (TACAS'98), vol. 1384 of Lecture Notes in Computer Science, Springer Verlag, p. 313-329, 1998.
13. DAWS C., KWIATKOWSKA M., NORMAN G., "Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM", Int. Journal on Software Tools for Technology Transfer, vol. 5, num. 2-3, p. 221-236, 2004.
14. DILL D., "Timing assumptions and verification of finite-state concurrent system", SIFAKIS J., Ed., Proc. Int. Workshop Automatic Verification Methods for Finite State Systems, vol. 407 of Lecture Notes in Computer Science, Springer Verlag, p. 197-212, 1989.
15. DUFLOT M., KWIATKOWSKA M., NORMAN G., PARKER D., "A formal analysis of Bluetooth device discovery", Int. Journal on Software Tools for Technology Transfer, vol. 8, num. 6, p. 621-632, 2006.
16. FRUTH M., "Probabilistic model checking of contention resolution in the IEEE 802.15.4 low-rate wireless personal area network protocol", Proc. 2nd Int. Symp. Leveraging Applications of Formal Methods, Verification and Validation (ISOLA'06), 2006.
17. HENZINGER T., MANNA Z., PNUELI A., "What good are digital clocks?", KUICH W., Ed., Proc. 19th Int. Colloquium on Automata, Languages and Programming (ICALP'92), vol. 623 of Lecture Notes in Computer Science, Springer Verlag, p. 545-558, 1992.
18. HENZINGER T., NICOLLIN X., SIFAKIS J., YOVINE S., "Symbolic model checking for real-time systems", Information and Computation, vol. 111, num. 2, p. 193-244, 1994.
19. HINTON A., KWIATKOWSKA M., NORMAN G., PARKER D., "PRISM: A tool for automatic verification of probabilistic systems", HERMANNS H., PALSBERG J., Eds., Proc. 12th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), vol. 3920 of Lecture Notes in Computer Science, Springer Verlag, p. 441-444, 2006.
20. IEEE 1394-1995, High Performance Serial Bus Standard, 1995
21. JENSEN H., "Model checking probabilistic real time systems", BJERNER B., LARSSON M., NORDSTRÖM B., Eds., Proc. 7th Nordic Workshop on Programming Theory, Report 86, Chalmers University of Technology, p. 247-261, 1996.
22. KEMENY J., SNELL J., KNAPP A., Denumerable Markov Chains, Springer Verlag, 2nd edition, 1976.
23. KWIATKOWSKA M., NORMAN G., SPROSTON J., "Symbolic computation of maximal probabilistic reachability", LARSEN K., NIELSEN M., Eds., Proc. 13th Int. Conf. Concurrency Theory (CONCUR'01), vol. 2154 of Lecture Notes in Computer Science, Springer Verlag, p. 169-183, 2001.
24. KWIATKOWSKA M., NORMAN G., SEGALA R., SPROSTON J., "Automatic verification of real-time systems with discrete probability distributions", Theoretical Computer Science, vol. 282, p. 101-150, 2002.
25. KWIATKOWSKA M., NORMAN G., SPROSTON J., "Probabilistic model checking of the IEEE 802.11 wireless local area network protocol", HERMANNS H., SEGALA R., Eds., Proc. 2nd Joint Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02), vol. 2399 of LNCS, Springer, p. 169-187, 2002.
26. KWIATKOWSKA M., NORMAN G., SPROSTON J., "Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol", Formal Aspects of Computing, vol. 14, p. 295-318, 2003.
27. KWIATKOWSKA M., NORMAN G., PARKER D., SPROSTON J., "Performance analysis of probabilistic timed automata using digital clocks", Formal Methods in System Design, vol. 29, p. 33-78, 2006.
28. KWIATKOWSKA M., NORMAN G., SPROSTON J., WANG F., "Symbolic model checking for probabilistic timed automata", Information and Computation, vol. 205, num. 7, 2007.
29. LARSEN K., PETTERSSON P., YI W., "UPPAAL in a nutshell", Int. Journal on Software Tools for Technology Transfer, vol. 1, num. 1-2, p. 134-152, 1997.
30. RUTTEN J., KWIATKOWSKA M., NORMAN G., PARKER D., Mathematical techniques for analyzing concurrent and probabilistic systems, P. Panangaden and F. van Breugel (eds.), vol. 23 of CRM Monograph Series, American Mathematical Society, 2004.
31. SEGALA R., "Modeling and verification of randomized distributed real-time systems", PhD thesis, Massachusetts Institute of Technology, 1995.
32. SEGALA R., LYNCH N. A., "Probabilistic simulations for probabilistic processes", Nordic Journal of Computing, vol. 2, num. 2, p. 250-273, 1995.
33. SIMONS D., STOELINGA M. I. A., "Mechanical verification of the IEEE 1394a root contention protocol using UPPAAL2k", Int. Journal on Software Tools for Technology Transfer, vol. 3, num. 4, p. 469-485, Springer Verlag, 2001.
34. STOELINGA M., "Alea jacta est: verification of probabilistic, real-time and parametric systems", PhD thesis, University of Nijmegen, The Netherlands, 2002.
35. TRIPAKIS S., "The formal analysis of timed systems in practice", PhD thesis, Joseph Fourier University, 1998.
36. TRIPAKIS S., YOVINE S., BOUAJJANI A., "Checking timed Büchi automata emptiness efficently", Formal Methods in System Design, vol. 26, num. 3, p. 267-292, 2005.