Symbolic computation of maximal probabilistic reachability

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

Volumn 2154, Issue , 2001, Pages 169-183

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Sproston, Jeremy ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; PROBABILITY; SPACE RESEARCH;

AUTOMATIC VERIFICATION; INFINITE STATE SYSTEMS; INTERSECTION OPERATION; PROBABILISTIC SYSTEMS; PROBABILISTIC TIMED AUTOMATA; STATE SPACE EXPLORATION; SYMBOLIC TRANSITION SYSTEMS; SYMBOLIC-PROBABILISTIC SYSTEMS;

COMPUTATION THEORY;

EID: 84944060052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44685-0_12     Document Type: Conference Paper

References (22)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay. General decidability theorems for infinite-state systems. In Proc. LICS’96, pages 313–321. IEEE Computer Society Press, 1996.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3–34, 1995.
3. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, 1994.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc. CAV 2000, volume 1855 of LNCS, pages 358–372. Springer, 2000.
5. C. Baier and M. Z. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125–155, 1998.
6. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FSTTCS’95, volume 1026 of LNCS, pages 499–513. Springer, 1995.
7. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. In Proc. LICS 2000, pages 95–106. IEEE Computer Society Press, 2000.
8. B. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley and Sons, 1998.
9. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In Proc. FOCS’95, pages 453–462. IEEE Computer Society Press, 1995.
10. T. A. Henzinger, R. Majumdar, and J.-F. Raskin. A classification of symbolic transition systems, 2001. Preliminary version appeared in Proc. STACS 2000, volume 1770 of LNCS, pages 13–34, Springer, 2000.
11. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.
12. P. Iyer and M. Narasimha. Probabilistic lossy channel systems. In Proc. TAPSOFT’ 97, volume 1214 of LNCS, pages 667–681. Springer, 1997.
13. J. G. Kemeny, J. L. Snell, and A. W. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
14. M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In Proc. CONCUR 2000, volume 1877 of LNCS, pages 123–137. Springer, 2000.
15. M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 2001. Special issue on ARTS’99. To appear.
16. M. Z. Kwiatkowska, G. Norman, and J. Sproston. Symbolic computation of maximal probabilistic reachability. Technical Report CSR-01-5, School of Computer Science, University of Birmingham, 2001.
17. P. Pettersson and K. G. Larsen. Uppaal2k. Bulletin of the European Association for Theoretical Computer Science, 70:40–44, 2000.
18. J. Sproston. Decidable model checking of probabilistic hybrid automata. In Proc. FTRTFT 2000, volume 1926 of LNCS, pages 31–45. Springer, 2000.
19. J. Sproston. Model Checking of Probabilistic Timed and Hybrid Systems. PhD thesis, University of Birmingham, 2001.
20. M. I. A. Stoelinga and F. Vaandrager. Root contention in IEEE 1394. In Proc. ARTS’99, volume 1601 of LNCS, pages 53–74. Springer, 1999.
21. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS’85, pages 327–338. IEEE Computer Society Press, 1985.
22. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proc. POPL’86, pages 184–193. ACM, 1986.