On Model Checking Techniques for Randomized Distributed Systems

  • Christel Baier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6396)

Abstract

The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision process and a formalization of the desired event E by an ω-regular linear-time property, e.g., an LTL formula. The task is then to compute the greatest lower bound for the probability for E that can be guaranteed even in worst-case scenarios. Such bounds can be computed by a combination of polynomially time-bounded graph algorithm with methods for solving linear programs. In the classical approach, the “worst-case” is determined when ranging over all schedulers that decide which action to perform next. In particular, all possible interleavings and resolutions of other nondeterministic choices in the system model are taken into account. The worst-case analysis relying on this general notion of schedulers is often too pessimistic and leads to extreme probability values that can be achieved only by schedulers that are unrealistic for parallel systems. This motivates the switch to more realistic classes of schedulers that respect the fact that the individual processes only have partial information about the global system states. Such classes of partial-information schedulers yield more realistic worst-case probabilities, but computationally they are much harder. A wide range of verification problems turns out to be undecidable when the goal is to check that certain probability bounds hold under all partial-information schedulers.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andres, M., Palamidessi, C., van Rossum, P., Sokolova, A.: Information hiding in probabilistic concurrent systems. In: Proc. of the 7th International Conference on Quantitative Evaluation of SysTems (QEST 2010). IEEE Computer Society Press, Los Alamitos (to appear 2010)Google Scholar
  2. 2.
    Baier, C., Bertrand, N., Grösser, M.: On decision problems for probabilistic Büchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 287–301. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  3. 3.
    Baier, C., Grösser, M.: Recognizing ω-regular languages with probabilistic automata. In: Proc. of the 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 137–146. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  4. 4.
    Baier, C., Grösser, M., Ciesinski, F.: Partial order reduction for probabilistic systems. In: Proc. of the First International Conference on Quantitative Evaluation of SysTems (QEST), pp. 230–239. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  5. 5.
    Baier, C., Größer, M., Ciesinski, F.: Model checking linear time properties of probabilistic systems. In: Handbook of Weighted Automata, pp. 519–570 (2009)Google Scholar
  6. 6.
    Baier, C., Größer, M., Ciesinski, F.: Quantitative analysis under fairness constraints. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 135–150. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Baier, C., Kwiatkowska, M.: Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11 (1998)Google Scholar
  8. 8.
    Bianco, A., de Alfaro, L.: Model checking of probabilistic and non-deterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 499–513. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  9. 9.
    Cassandra, A.R.: A survey of POMDP applications. Presented at the AAAI Fall Symposium (1998), http://pomdp.org/pomdp/papers/applications.pdf
  10. 10.
    Chadha, R., Sistla, P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 229–243. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.
    Chatterjee, K., Doyen, L., Henzinger, T.: Qualitative analysis of partially-observable markov decision processes. In: Proc. Mathematical Foundation of Computer Science. LNCS, Springer, Heidelberg (2010)Google Scholar
  12. 12.
    Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theoretical Computer Science 365(1-2), 83–108 (2006)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42(4), 857–907 (1995)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    D’Argenio, P.R., Niebert, P.: Partial order reduction on concurrent probabilistic programs. In: Proc. of the First International Conference on Quantitative Evaluation of SysTems (QEST), pp. 240–249. IEEE Computer Society Press, Los Alamitos (2004)Google Scholar
  15. 15.
    de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, Department of Computer Science (1997)Google Scholar
  16. 16.
    de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. of the 2nd International Workshop on Probabilistic Methods in Verification (ProbMiV 1999), pp. 19–32. Birmingham University (1999), Research Report CSR-99-9Google Scholar
  17. 17.
    Giro, S., D’Argenio, P., María Ferrer Fioriti, L.: Partial order reduction for probabilistic systems: A revision for distributed schedulers. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 338–353. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  18. 18.
    Giro, S., D’Argenio, P.R.: Quantitative model checking revisited: neither decidable nor approximable. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 179–194. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  19. 19.
    Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games: A Guide to Current Research. LNCS, vol. 2500. Springer, Heidelberg (2002)MATHGoogle Scholar
  20. 20.
    Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer (STTT) 6(2), 128–142 (2004)CrossRefMATHGoogle Scholar
  21. 21.
    Littman, M.: Algorithms for Sequential Decision Making. PhD thesis, Brown University, Department of Computer Science (1996)Google Scholar
  22. 22.
    Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147(1-2), 5–34 (2003)MathSciNetCrossRefMATHGoogle Scholar
  23. 23.
    Monahan, G.: A survey of partially observable Markov decision processes: Theory, models and algorithms. Management Science 28(1), 1–16 (1982)MathSciNetCrossRefMATHGoogle Scholar
  24. 24.
    Mundhenk, M., Goldsmith, J., Lusena, C., Allender, E.: Complexity of finite-horizon Markov decision process problems. Journal of the ACM 47(4), 681–720 (2000)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Papadimitriou, C., Tsitsiklis, J.: The complexity of Markov decision processes. Mathematics of Operations Research 12(3) (1987)Google Scholar
  26. 26.
    Paz, A.: Introduction to probabilistic automata. Academic Press Inc., London (1971)MATHGoogle Scholar
  27. 27.
    Puterman, M.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, Chichester (1994)CrossRefMATHGoogle Scholar
  28. 28.
    Rabin, M.O.: Probabilistic automata. Information and Control 6(3), 230–245 (1963)MathSciNetCrossRefMATHGoogle Scholar
  29. 29.
    Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer System Sciences 29(2), 274–301 (1984)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)Google Scholar
  31. 31.
    Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, New York (1997)CrossRefGoogle Scholar
  32. 32.
    Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of the 26th Symposium on Foundations of Computer Science (FOCS), pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)Google Scholar
  33. 33.
    Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. of the 1st IEEE Symposium on Logic in Computer Science (LICS), pp. 332–345. IEEE Computer Society Press, Los Alamitos (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christel Baier
    • 1
  1. 1.Faculty of Computer ScienceTechnische Universität DresdenGermany

Personalised recommendations