Computing minimum and maximum reachability times in probabilistic systems

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

Volumn 1664 LNCS, Issue , 1999, Pages 66-81

  De Alfaro, Luca ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; GRAPH THEORY; LEARNING ALGORITHMS; MARKOV PROCESSES; RELIABILITY ANALYSIS; STOCHASTIC SYSTEMS;

CONTROL STRATEGIES; EXPECTED COSTS; EXPECTED TIME; MARKOV DECISION PROCESSES; NON NEGATIVES; NONDETERMINISTIC CHOICE; PROBABILISTIC SYSTEMS; STOCHASTIC SHORTEST PATH PROBLEM;

COMPUTATION THEORY;

EID: 84888230117     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48320-9_7     Document Type: Conference Paper

References (27)

1. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Found. of Software Tech. and Theor. Comp. Sci., volume 1026 of Lect. Notes in Comp. Sci., pages 499-513. Springer-Verlag, 1995.
2. R.E. Bellman. Dynamic Programming. Princeton University Press, 1957.
3. D.P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995. Volumes I and II.
4. D.P. Bertsekas and J.N. Tsitsiklis. An analysis of stochastic shortest path problems. Math. of Op. Res., 16(3):580-595, 1991.
5. D.P. Bertsekas and J.N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.
6. C. Courcoubetis andM. Yannakakis. Markov decision processes and regular events. In Proc. 17th Int. Colloq. Aut. Lang. Prog., volume 443 of Lect. Notes in Comp. Sci., pages 336-349. Springer-Verlag, 1990.
7. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. J. ACM, 42(4):857-907, 1995.
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997
9. Technical Report STAN-CS-TR-98-1601.
10. L. de Alfaro. Stochastic transition systems. In CONCUR'98: Concurrency Theory. 9th Int. Conf., Lect. Notes in Comp. Sci. Springer-Verlag, 1998.
11. L. de Alfaro, T.A. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symp. Found. of Comp. Sci., 1998.
12. C. Derman. Finite State MarkovianDecision Processes. Academic Press, 1970. cut?
13. J.H. Eaton and L.A. Zadeh. Optimal pursuit strategies in discrete-state probabilistic systems. J. of Basic Engineering, pages 23-29, 1962.
14. H. Hansson. Time and Probabilities in Formal Design of Distributed Systems. Real-Time Safety Critical Systems Series. Elsevier, 1994.
15. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes. In Proc. 6th IEEE Symp. Logic in Comp. Sci., pages 266-277, 1991.
16. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, vol. 11, May 1998.
17. M.Z. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic systems using MTBDDS and simplex. Technical Report CSR-99-1, University of Birmingham, 1999.
18. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D.VanNostrand Company, 1966.
19. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing (preliminary report). In Proc. 16th ACM Symp. Princ. of Prog. Lang., pages 344-352, 1989.
20. A. Pnueli and L. Zuck. Probabilistic verification by tableaux. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 322-331, 1986.
21. M.O. Rabin. Probabilistic automata. Information and Computation, 6:230-245, 1963.
22. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995
23. Technical Report MIT/LCS/TR-676.
24. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR' 94: ConcurrencyTheory. 5th Int. Conf., volume 836 of Lect. Notes in Comp. Sci., pages 481-496. Springer-Verlag, 1994.
25. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. 26th IEEE Symp. Found. of Comp. Sci., pages 327-338, 1985.
26. M. Vardi. Infinite games against nature. Unpublished manuscript, 1995.
27. S.-H. Wu, S.A. Smolka, and E.W. Stark. Composition and behaviors of probabilistic I/O automata. In Springer-Verlag, editor, CONCUR'94: Concurrency Theory. 5th Int. Conf., Lect. Notes in Comp. Sci., pages 511-528, 1994.