Model-checking Markov chains in the presence of uncertainties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3920 LNCS, Issue , 2006, Pages 394-410

  Sen, Koushik ^a   Viswanathan, Mahesh ^a   Agha, Gul ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERVAL MARKOV DECISION PROCESS (IMDP); INTERVAL-VALUED DISCRETE-TIME MARKOV CHAINS (IDTMC); MARKOV CHAIN; TRANSITION PROBABILITIES; UNCERTAIN MARKOV CHAINS (UMC);

CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SEMANTICS;

MARKOV PROCESSES;

EID: 33745801332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_26     Document Type: Conference Paper

References (26)

1. A. Aziz, V. Singhal, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Proc. of Computer Aided Verification, volume 939, pages 155-165, 1995.
2. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation Thesis. Fakultät für Mathematik and Informatik, Universität Mannheim, 1998.
3. C. Baier and M. Z. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
4. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proceedings of 15th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS.
5. L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21:1-46, 1989.
6. J. Canny. Some algebraic and geometric computations in PSPACE. In 20th ACM Symposium on Theory of Computing (STOC'88), pages 460-467, 1988.
7. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In Proceedings of the seventeenth international colloquium on Automata, languages and programming, pages 336-349, 1990.
8. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of ACM, 42(4):857-907, 1995.
9. M. Fukuda and M. Kojima. Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem. Comput. Optim. Appl., 19(1):79-105, 2001.
10. K. C. Goh, M. G. Safonov, and G. P. Papavassilopoulos. Global optimization for the biaffine matrix inequality problem. Journal of Global Optimization, 7:365-380, 1995.
11. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
12. B. Jonsson and K. G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the IEEE Symposium on Logic in Computer Science, pages 266-277, 1991.
13. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov chains. Springer, 1976.
14. I. O. Kozine and L. V. Utkin. Interval-valued finite markov chains. Reliable Computing, 8(2):97-113, 2002.
15. V. P. Kuznetsov. Interval statistical models. Radio and Communication, 1991.
16. PENbmi. http://www.penopt.com/.
17. M. Puterman. Markov decision processes: discrete stochastic dynamic programming. Wiley, New York, 1994.
18. J. Renegar. A faster pspace algorithm for deciding the existential theory of the reals. In 29th Annual IEEE Symposium on Foundations of Computer Science, pages 291-295, 1988.
19. J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, volume 23 of CRM Monograph Series. American Mathematical Society, 2004.
20. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995.
21. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. In International Conference on Concurrency Theory, pages 481-496, 1994.
22. K. Sen, M. Viswanathan, and G. Agha. Statistical model checking of black-box probabilistic systems. In 16th conference on Computer Aided Verification (CAV'04), volume 3114 of LNCS, pages 202-215, 2004.
23. K. Sen, M. Viswanathan, and G. Agha. Model-checking markov chains in the presence of uncertainties. Technical Report UIUCDCS-R-2006-2677, UIUC, 2006.
24. O. Toker and H. Özbay. On the NP-hardness of solving bilinear matrix in equalities and simultaneous stabilization with static output feedback. In Proc. of American Control Conference, 1995.
25. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In 26th Annual Symposium on Foundations of Computer Science, pages 327-338. IEEE, 1985.
26. P. Walley. Measures of uncertainty in expert systems. Artificial Intelligence, 83:1-58, 1996.