State explosion in almost-sure probabilistic reachability

Information Processing Letters

Volumn 102, Issue 6, 2007, Pages 236-241

  Laroussinie, François ^a   Sproston, Jeremy ^b  

^a CNRS   (France)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Computational complexity; Formal methods; Model checking; Probabilistic systems; Timed automata

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL METHODS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; THEOREM PROVING;

PROBABILISTIC REACHABILITY; PROBABILISTIC SYSTEMS; PROBABILISTIC TIMED AUTOMATA; TIMED AUTOMATA;

SET THEORY;

EID: 34147144000     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.01.003     Document Type: Article

References (17)

1. Aceto L., and Laroussinie F. Is your model checker on time? On the complexity of model checking for timed modal logics. Journal of Logic and Algebraic Programming 52-53 (2002) 7-51
2. Alur R., and Dill D.L. A theory of timed automata. Theoretical Computer Science 126 2 (1994) 183-235
3. Chandra A.K., Kozen D., and Stockmeyer L.J. Alternation. Journal of the ACM 28 1 (1981) 114-133
4. Clarke E.M., Grumberg O., and Peled D. Model Checking (1999), MIT Press
5. Courcoubetis C., and Yannakakis M. The complexity of probabilistic verification. Journal of the ACM 42 4 (1995) 857-907
6. de Alfaro L. Computing minimum and maximum reachability times in probabilistic systems. Proc. of the 10th Int. Conf. on Concurrency Theory (CONCUR'99). Lecture Notes in Computer Science vol. 1664 (1999), Springer 66-81
7. Hart S., Sharir M., and Pnueli A. Termination of probabilistic concurrent program. ACM Trans. Program. Lang. Syst. 5 3 (1983) 356-380
8. Hinton A., Kwiatkowska M., Norman G., and Parker D. PRISM: A tool for automatic verification of probabilistic systems. Proc. of the 12th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06). Lecture Notes in Computer Science vol. 3920 (2006), Springer 441-444
9. Jensen H.E. Model checking probabilistic real time systems. Proc. of the 7th Nordic Workshop on Programming Theory, vol. 86 (1996), Chalmers Institute of Technology 247-261
10. Kemeny J.G., Snell J.L., and Knapp A.W. Denumerable Markov Chains. Graduate Texts in Mathematics. second ed. (1976), Springer
11. Kwiatkowska M., Norman G., Segala R., and Sproston J. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science 286 (2002) 101-150
12. Kwiatkowska M.Z. Model checking for probability and time: from theory to practice. Proc. of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003) (2003), IEEE Computer Society 351-360
13. Laroussinie F., and Schnoebelen Ph. The state-explosion problem from trace to bisimulation equivalence. Proc. of the 3rd Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS 2000). Lecture Notes in Computer Science vol. 1784 (2000), Springer 192-207
14. Littman M.L. Probabilistic propositional planning: Representations and complexity. Proc. of the 14th National Conf. on Artificial Intelligence and the 9th Innovative Applications of Artificial Intelligence Conf. (AAAI/IAAI'97) (1997), AAAI Press/MIT Press 748-754
15. Puterman M.L. Markov Decision Processes (1994), J. Wiley & Sons
16. Segala R., and Lynch N.A. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273
17. Vardi M.Y. Automatic verification of probabilistic concurrent finite-state programs. Proc. of the 16th Anual Symp. on Foundations of Computer Science (FOCS'85) (1985), IEEE Computer Society Press 327-338