Skip to main content

Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5215))

Abstract

This paper presents a stochastic variant of Hennessy-Milner logic that is interpreted over (state-labeled) inhomogeneous continuous-time Markov chains (ICTMCs), i.e., Markov chains in which transition rates are functions over time t. For piecewise constant rate functions, the model-checking problem is shown to be reducible to finding the zeros of an exponential polynomial. Using Sturm sequences and Newton’s method, we obtain an approximative model-checking algorithm which is linear in the size of the ICTMC, logarithmic in the number of bits precision, and exponential in the nesting depth of the formula.

This research has taken place as part of the Research Training Group 1298 ALGOSYN funded by the German Research Council.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for real-time systems. In: Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 414–425 (1990)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model checking continuous time Markov chains. ACM Trans. on Comp. Logic 1(1), 162–170 (2000)

    Article  MathSciNet  Google Scholar 

  5. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. on Softw. Eng. 29(6), 524–541 (2003)

    Article  Google Scholar 

  6. Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. J. of Applied Probability 31, 59–75 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  7. Clark, G., Gilmore, S., Hillston, J., Ribaudo, M.: Exploiting modal logic to express performance measures. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds.) TOOLS 2000. LNCS, vol. 1786, pp. 247–261. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  8. Desharnais, J., Panangaden, P.: Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Algebr. Program 56(1-2), 99–115 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hamming, R.W.: Numerical Methods for Scientists and Engineers. McGraw-Hill, New York (1973)

    MATH  Google Scholar 

  10. Han, T., Katoen, J.-P., Mereacre, A.: Compositional modeling and minimization of time-inhomogeneous Markov chains. In: Hybrid Systems: Computation and Control. LNCS, vol. 4981, pp. 244–258. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137–161 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  12. Henrici, P., Kenan, W.R.: Applied & Computational Complex Analysis: Power Series Integration Conformal Mapping Location of Zero. John Wiley & Sons, Chichester (1988)

    MATH  Google Scholar 

  13. Hermanns, H.: Interactive Markov Chains: The Quest for Quantified Quality. LNCS, vol. 2428. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  14. Hillston, J.: A Compositional Approach to Performance Modeling. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  15. Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: Quantitative Evaluation of Systems (QEST), pp. 243–245. IEEE CS Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  16. Kwiatkowska, M.Z., Norman, G., Parker, D.A.: Probabilistic symbolic model checking using PRISM: a hybrid approach. J. on Software Tools for Technology Transfer 6(2), 128–142 (2004)

    Google Scholar 

  17. Laguerre, E.: Sur la théorie des équations numériques. J. Math. Pures Appl. 9, 99–146 (1883); (3e série)

    Google Scholar 

  18. Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1–28 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  19. Parma, A., Segala, R.: Logical characterizations of bisimulations for discrete probabilistic systems. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 287–301. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  20. Reif, J.H.: An \(\mathcal{O}\left(n\log^3n\right)\) algorithm for the real root and symmetric tridiagonal eigenvalue problems. In: 34th Annual IEEE Conference on Foundations of Computer Science (FOCS 1993), pp. 626-635 (1993)

    Google Scholar 

  21. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dept. of Electrical Eng. and Computer Sci. (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Franck Cassez Claude Jard

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katoen, JP., Mereacre, A. (2008). Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains. In: Cassez, F., Jard, C. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2008. Lecture Notes in Computer Science, vol 5215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85778-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85778-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85777-8

  • Online ISBN: 978-3-540-85778-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics