Using stochastic comparison for efficient model checking of uncertain Markov Chains

QEST - 6th International Conference on the Quantitative Evaluation of Systems

Volumn , Issue , 2009, Pages 177-186

  Haddad, Serge ^a   Pekergin, Nihal ^b  

^a CNRS   (France)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE TIME MARKOV CHAINS; EXACT ALGORITHMS; EXTENDED VERSIONS; INTERVAL-VALUED; LINEAR-TIME ALGORITHMS; LOWER BOUNDS; MARKOV CHAIN; NP-HARD; PARTIAL INFORMATION; PROBABILISTIC COMPUTATION; STATE SPACE; STOCHASTIC COMPARISONS; TRANSITION PROBABILITIES;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL EFFICIENCY; MARKOV PROCESSES; PROBABILISTIC LOGICS; SEMICONDUCTING INTERMETALLICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

MODEL CHECKING;

EID: 74049119477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2009.42     Document Type: Conference Paper

References (25)

1. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model Checking Continuous Time Markov Chains. ACM Trans. on Comp. Logic, 1(1), pages 162-170, 2000.
2. C. Baier, L. Cloth, B. R. Haverkort, M. Kuntz, M. Siegle. Model Checking Action- and State-Labelled Markov Chains. In DSN 2004:, pages 701-710, 2004.
3. C. Baier, B. Haverkort, H. Hermanns, and J.P. Katoen. Model-Checking Algorithms for Continuous-Time Markov Chains. In IEEE Trans. Software Eng. 29(6), pages 524-541, 2003.
4. M. Ben Mamoun, N. Pekergin and S. Younès. Model checking of continous-time Markov chains by closed-form bounding distributions. In QEST2006, pages 199-211, 2006.
5. A. Bianco, L. de Alfaro. Model Checking of Probabilistic and Nondeterministic Systems. In FST TSC95, LNCS 1026, pages 499-513, Springer 1995.
6. P. Buchholz. An improved method for bounding stationary measures of finite Markov Processes. Performance Evaluation, 62(1-4) pages 349-365, 2005
7. K. Chatterjee, K. Sen and T. A. Henzinger. Model-Checking omega-Regular Properties of Interval Markov Chains. In Proc. FoSSaCS08, LNCS 4962, pages 302-317, Springer 2008.
8. R. Chadha, M. Viswanthan and R. Viswanthan. Least upper bounds for probability measures and their applications to abstractions. In CONCUR 2008 - 19th International Conference on Concurrency Theory, LNCS5201, pages 264-278. Springer, 2008.
9. P.J. Courtois and P. Semal. Computable bounds on conditional steadystate probabilities in large Markov chains and queueing models. IEEE Journal on Selected Areas in Communications, 4(6), pages 926-937, 1986.
10. S. Donatelli, S. Haddad, J. Sproston. CSLTA: an Expressive Logic for Continuous-Time Markov Chains. In QEST 2007, pages 31-40, 2007.
11. H. Fecher, M. Leucker, and V. Wolf. Don't know in probabilistic systems. In Proceedings of 13th International SPIN Workshop on Model Checking of Software (SPIN'06) LNCS 3925, pages 71 - 88, Springer 2006.
12. J.M. Fourneau and N. Pekergin. An algorithmic approach to stochastic bounds. In LNCS 2459, Performance evaluation of complex systems: Techniques and Tools, pages 64-88, 2002.
13. S. Haddad and P. Moreaux. Sub-stochastic matrix analysis for bounds computation Theoretical results. European Journal of Operational Research, 176(0), pages 999-1015, 2007.
14. S. Haddad and P. Moreaux. Sub-stochastic matrix analysis and performance bounds. Research Reprt RAP-CReSTIC-1, CReSTIC, Universit de Reims Champagne-Ardenne, France, 2004.
15. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing 6, pages 512-535, 1994.
16. B. Jonnson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proceedings of the IEEE Symp. on Logic in Computer Science, pages 266-277, 1991.
17. J. P. Katoen, D. Klink, M. Leucker, and V. Wolf. Three-valued abstraction for continuous-time Markov chains. In Proc. CAV07, LNCS 4590). pages 311-324, Springer 2007.
18. I.O. Kozine and L.V. Utkin. Interval-valued finite Markov chains. Reliable Computing, 8(2) pages 97-113, 2002.
19. F. Laroussinie, J. Sproston. Model Checking Durational Probabilistic Systems. In FOSSACS'05, LNCS 3441, pages 140-154, Springer 2005.
20. A. Muller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, Wiley, New York, 2002.
21. N. Pekergin, S. Younès. Stochastic Model Checking with Stochastic Comparison. In Proc. EPEW 2005, LNCS 3670, pages 109-123, Springer 2005.
22. N. Pekergin, T. Dayar and D. Alparslan. Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering. European Journal of Operational Research, 165, pages 810-825, 2005.
23. K. Sen, M. Viswanathan, G. Agha. Model-Checking Markov chains in the presence of uncertainties. In Proc. Tacas06, LNCS 3920, pages 394-410, Springer 2006.
24. K. Trivedi. Probability and Statistics with Reliability, Queuing and Computer Science Applications Wiley, New York 2002.
25. L. Truffet. Near Complete Decomposability: Bounding the error by Stochastic Comparison Method. Advances in Applied Probability, pages 830-855, 1997.