Least upper bounds for probability measures and their applications to abstractions

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

Volumn 5201 LNCS, Issue , 2008, Pages 264-278

  Chadha, Rohit ^a   Viswanathan, Mahesh ^a   Viswanathan, Ramesh ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ABSTRACT MODELS; ABSTRACTION TECHNIQUES; AUTOMATIC ANALYSIS; CONTINUOUS TIME MARKOV CHAINS; DISCRETE TIME MARKOV CHAINS; KEY TECHNIQUES; MARKOV DECISION PROCESSES; PROBABILISTIC PROGRAMS; PROBABILISTIC SYSTEMS; PROBABILITY MEASURES; STATE SPACES; TECHNICAL TOOLS; UPPER BOUNDS;

ABSTRACTING; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; PROBABILITY; PROGRAM INTERPRETERS; RISK ASSESSMENT; STATE SPACE METHODS;

MODEL CHECKING;

EID: 54249122162     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_23     Document Type: Conference Paper

References (23)

1. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model checking continuous-time Markov chains. ACM TOCL 1, 162-170 (2000)
2. Baier, C., Haverkrot, B., Hermanns, H., Katoen, J.-P.: Effcient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 61-76. Springer, Heidelberg (2004)
3. Baier, C., Hermanns, H., Katoen, J.-P., Wolf, V.: Comparative branching-time semantics for Markov chains. Inf. and Comp. 200, 149-214 (2005)
4. Chadha, R., Viswanathan, M., Viswanathan, R.: Least upper bounds for probability measures and their applications to abstractions. Technical Report UIUCDCSR-2008-2973, UIUC (2008)
5. D'Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001. LNCS, vol. 2165, pp. 39-56. Springer, Heidelberg (2001)
6. D'Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and refinement strategies for probabilistic analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002. LNCS, vol. 2399, pp. 57-76. Springer, Heidelberg (2002)
7. Desharnais, J.: Labelled Markov Processes. PhD thesis, McGill University (1999)
8. Fecher, H., Leucker, M., Wolf, V.: Don't know in probabilistic systems. In: Proc. of SPIN, pp. 71-88 (2006)
9. Huth, M.: An abstraction framework for mixed non-deterministic and probabilistic systems. In: Validation of Stochastic Systems: A Guide to Current Research, pp. 419-444 (2004)
10. Huth, M.: On finite-state approximants for probabilistic computation tree logic. TCS 346, 113-134 (2005) 11. Jones, C.: Probabilistic Non-determinism. PhD thesis, University of Edinburgh (1990)
11. Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proc. of LICS, pp. 266-277 (1991)
12. Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 311-324. Springer, Heidelberg (2007)
13. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: Proc. of QEST, pp. 157-166 (2006)
14. McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Springer, Heidelberg (2004)
15. Monniaux, D.: Abstract interpretation of programs as Markov decision processes. Science of Computer Programming 58, 179-205 (2005)
16. Norman, G.: Analyzing randomized distributed algorithms. In: Validation of Stochastic Systems: A Guide to Current Research, pp. 384-418 (2004)
17. Rutten, J.M., Kwiatkowska, M., Norman, G., Parker, D.: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems. AMS (2004)
18. Saheb-Djahromi, N.: Probabilistic LCF. In: Winkowski, J. (ed.) MFCS 1978. LNCS, vol. 64, pp. 442-451. Springer, Heidelberg (1978)
19. Segala, R.: Probability and nondeterminism in operational models of concurrency. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 64-78. Springer, Heidelberg (2006)
20. Sen, K., Viswanathan, M., Agha, G.: Model checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 394-410. Springer, Heidelberg (2006)
21. Wachter, B., Zhang, L., Hermanns, H.: Probabilistic model checking modulo theories. In: Proc. of QEST (2007)
22. Younes, H., Kwiatkowska, M., Norman, G., Parker, D.: Numerical vs. statistical probabilistic model checking: An empirical study. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 46-60. Springer, Heidelberg (2004)
23. Younes, H., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 223-235. Springer, Heidelberg (2002)