Skip to main content
SpringerLink
Log in

Model Checking for Probabilistic Timed Systems

  • Chapter
Validation of Stochastic Systems

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2925))

Abstract

Application areas such as multimedia equipment, communication protocols and networks often feature systems which exhibit both probabilistic and timed behaviour. In this paper, we consider analysis of such probabilistic timed systems using the technique of model checking, in which it is verified automatically whether a system satisfies a certain desired property. In order to describe formally probabilistic timed systems, we consider probabilistic extensions of timed automata, such as real-time probabilistic processes, probabilistic timed automata and continuous probabilistic timed automata, the underlying semantics of each of which is an infinite-state structure. For each formalism, we consider how the well-known region equivalence relation can be used to reduce the infinite state-space model into a finite-state system, which can then be used for model checking.

Supported in part by the EU within the DepAuDE project IST-2001-25434.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for probabilistic realtime systems. In: Leach Albert, J., Monien, B., Artalejo Rodríguez, M. (eds.) ICALP 1991. LNCS, vol. 510, pp. 115–136. Springer, Heidelberg (1991)

    Google Scholar 

  3. Alur, R., Courcoubetis, C., Dill, D.L.: Verifying automata specifications of probabilistic real-time systems. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 28–44. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  4. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Information and Computation 104(1), 2–34 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Amnell, T., Behrmann, G., Bengtsson, J., D’Argenio, P.R., David, A., Fehnker, A., Hune, T., Jeannet, B., Larsen, K.G., Möller, M.O., Pettersson, P., Weise, C., Yi, W.: UPPAAL - Now, next, and future. In: Cassez, F., Jard, C., Rozoy, B., Ryan, M. (eds.) Proceedings of the Summer School on Modelling and Verification of Parallel Processes (MOVEP 2000). LNCS, vol. 2067, pp. 100–125. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Asarin, E., Maler, O., Pnueli, A.: On discretization of delays in timed automata and digital circuits. In: de Simone, R., Sangiorgi, D. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 470–484. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering 29(6), 524–541 (2003)

    Article  Google Scholar 

  9. Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11(3), 125–155 (1998)

    Article  Google Scholar 

  10. Beauquier, D.: On probabilistic timed automata. Theoretical Computer Science 292(1), 65–84 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 1995. LNCS, vol. 1026, pp. 499–513. Springer, Heidelberg (1995)

    Google Scholar 

  12. Bouajjani, A., Tripakis, S., Yovine, S.: On-the-fly symbolic model checking for real-time systems. In: Lin, K.-J., Son, S.H. (eds.) Proceedings of the 18th IEEE Real-Time Systems Symposium, RTSS 1997. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  13. Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 125–141. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Bryans, J., Bowman, H., Derrick, J.: Model checking stochastic automata. To appear in ACM Transactions on Computational Logic (2003)

    Google Scholar 

  15. Clarke, E.M., Emerson, E.A.: The design and synthesis of synchronization skeletons using temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  16. Clarke, E.M., Grümberg, O., Peled, D.: Model checking. MIT Press, Cambridge (1999)

    Google Scholar 

  17. Courcoubetis, C., Tripakis, S.: Probabilistic model checking: formalisms and algorithms for discrete and real-time systems. In: Inan, M.K., Kurshan, R.P. (eds.) Verification of Digital and Hybrid Systems, pp. 183–219. Springer, Heidelberg (2000)

    Google Scholar 

  18. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  19. D’Argenio, P.R.: A compositional translation of stochastic automata into timed automata. Technical Report CTIT 00-08, University of Twente (2000)

    Google Scholar 

  20. D’Argenio, P.R., Katoen, J.-P., Brinksma, E.: An algebraic approach to the specification of stochastic systems (extended abstract). In: Gries, D., de Roever, W.-P. (eds.) Proceedings of the IFIP Working conference on Programming Concepts and Methods (PROCOMET 1998). IFIP, pp. 126–147. Chapman & Hall, Boca Raton (1998)

    Google Scholar 

  21. Daws, C., Kwiatkowska, M., Norman, G.: Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In: Cleaveland, R., Garavel, H. (eds.) Proceedings of the 7th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2002). Electronic Notes in Theoretical Computer Science, vol. 66(2) (2002)

    Google Scholar 

  22. de Alfaro, L.: Formal verification of probabilistic systems. PhD thesis, Stanford University, Department of Computer Science (1997)

    Google Scholar 

  23. Derman, C.: Finite-State Markovian Decision Processes. Academic Press, London (1970)

    MATH  Google Scholar 

  24. Glynn, P.W.: A GSMP formalism for discrete-event systems. Proceedings of the IEEE 77, 14–23 (1989)

    Article  Google Scholar 

  25. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6(5), 512–535 (1994)

    Article  MATH  Google Scholar 

  26. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111(2), 193–244 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  27. Henzinger, T.A., Manna, Z., Pnueli, A.: What good are digital clocks? In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 545–558. Springer, Heidelberg (1992)

    Google Scholar 

  28. Hermanns, H., Katoen, J.-P., Meyer-Kayser, J., Siegle, M.: Markov chain model checker. Software Tools for Technology Transfer 4(2), 153–172 (2003)

    Article  Google Scholar 

  29. Jeannet, B., D’Argenio, P.R., Larsen, K.G.: RAPTURE: A tool for verifying Markov Decision Processes. In: Cerna, I. (ed.) Tools Day 2002, Brno, Czech Republic, Technical Report. Faculty of Informatics, Masaryk University Brno (2002)

    Google Scholar 

  30. Jensen, H.E.: Model checking probabilistic real time systems. In: Bjerner, B., Larsson, M., Nordström, B. (eds.) Proceedings of the 7th Nordic Workshop on Programming Theory, vol. 86, pp. 247–261. Chalmers Institute of Technology (1996)

    Google Scholar 

  31. Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov Chains. Graduate Texts in Mathematics, 2nd edn. Springer, Heidelberg (1976)

    Google Scholar 

  32. Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200–204. Springer, Heidelberg (2002)

    Google Scholar 

  33. Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. In: Larsen, K.G., Niebert, P. (eds.) Proceedings of the 1st International Workshop on Formal Modeling and Analysis of Timed Systems (FORMATS 2003). LNCS. Springer, Heidelberg (2003)

    Google Scholar 

  34. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Verifying quantitative properties of continuous probabilistic timed automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 123–137. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  35. Kwiatkowska, M., Norman, G., Segala, R., Sproston, J.: Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 286, 101–150 (2002)

    Article  MathSciNet  Google Scholar 

  36. Kwiatkowska, M., Norman, G., Sproston, J.: Symbolic computation of maximal probabilistic reachability. In: Larsen, K., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  37. Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, pp. 169–187. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  38. Kwiatkowska, M., Norman, G., Sproston, J.: Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Formal Aspects of Computing 14(3), 295–318 (2003)

    Article  Google Scholar 

  39. Larsen, K.G., Pettersson, P., Yi, W.: Compositional and symbolic model-checking of real-time systems. In: Burns, A., Lee, Y.-H., Ramamritham, K. (eds.) Proceedings of the 16th IEEE Real-Time Systems Symposium (RTSS 1995), pp. 76–87. IEEE Computer Society Press, Los Alamitos (1995)

    Chapter  Google Scholar 

  40. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  41. López, G.G.I., Hermanns, H., Katoen, J.-P.: Beyond memoryless distributions: Model checking semi-markov chains. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 57–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  42. Moura, A.V., Pinto, G.A.: A note on the verification of automata specifications of probabilistic real-time systems. Information Processing Letters 82(5), 223–228 (2002)

    Article  MathSciNet  Google Scholar 

  43. Puterman, M.L.: Markov Decision Processes. J. Wiley & Sons, Chichester (1994)

    Book  MATH  Google Scholar 

  44. Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)

    Google Scholar 

  45. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)

    Google Scholar 

  46. Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250–273 (1995)

    MATH  MathSciNet  Google Scholar 

  47. Tripakis, S.: Verifying progress in timed systems. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 299–314. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  48. Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science (FOCS 1985), pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)

    Chapter  Google Scholar 

  49. Whitt, W.: Continuity of generalized semi-Markov processes. Mathematics of Operations Research 5, 494–501 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  50. Yi, W., Pettersson, P., Daniels, M.: Automatic verification of real-time communicating systems by constraint-solving. In: Hogrefe, D., Leue, S. (eds.) Proceedings of the 7th International Conference on Formal Description Techniques, pp. 223–238. North-Holland, Amsterdam (1994)

    Google Scholar 

  51. Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinskma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 223–235. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  52. Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer 1(1/2), 123–133 (1997)

    Article  MATH  Google Scholar 

  53. Yovine, S.: Model checking timed automata. In: Rozenberg, G., Vaandrager, F. (eds.) EEF School 1996. LNCS, vol. 1494, pp. 114–152. Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, 10149, Torino, Italy

    Jeremy Sproston

Authors
  1. Jeremy Sproston
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science, Technical University Dresden, Germany

    Christel Baier

  2. Centre for Telematics and Information Technology, Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500, AE, Netherlands

    Boudewijn R. Haverkort

  3. VASY, INRIA, Grenoble Rhône-Alpes, France

    Holger Hermanns

  4. Software Modeling and Verification, RWTH Aachen University, Germany

    Joost-Pieter Katoen

  5. Institut für Technische Informatik, Universität der Bundeswehr München,  

    Markus Siegle

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Sproston, J. (2004). Model Checking for Probabilistic Timed Systems . In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, JP., Siegle, M. (eds) Validation of Stochastic Systems. Lecture Notes in Computer Science, vol 2925. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24611-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24611-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22265-1

  • Online ISBN: 978-3-540-24611-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation