Approximate probabilistic model checking

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

Volumn 2937, Issue , 2004, Pages 73-84

  Hérault, Thomas ^a   Lassaigne, Richard ^b   Magniette, Frédéric ^a   Peyronnet, Sylvain ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPROXIMATION ALGORITHMS;

APPROXIMATION METHODS; MODEL CHECKING ALGORITHM; PROBABILISTIC MODEL CHECKING; PROBABILISTIC SYSTEMS; RANDOMIZED ALGORITHMS; SUCCINCT REPRESENTATION; SYMBOLIC MODEL CHECKING; VERIFICATION OF PROBABILISTIC SYSTEMS;

MODEL CHECKING;

EID: 84944264717     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24622-0_8     Document Type: Conference Paper

References (28)

1. R. Alur and T.A. Henzinger. Reactive modules. in Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pp. 207–218, 1996.
2. APMC homepage. http://www.lri.fr/˜syp/APMC
3. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. Proc. FST&TCS, Lectures Notes in Computer Science, 1026:499–513, 1995.
4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDD’s. Proc. of 5th TACAS, Lectures Notes in Computer Science, 1573:193–207, 1999.
5. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857–907, 1995.
6. P. D’Argenio, B. Jeannet, H. Jensen and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. Proc. of the joint PAPM/PROBMIV, 2001.
7. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the kronecker representation. In Proc. of 6th TACAS, Lectures Notes in Computer Science, 1785, 2000.
8. V. Hartonas-Garmhausen, S. Campos, and E. Clarke. Probverus: Probabilistic symbolic model checking. In 5th International AMAST Workshop, ARTS’99, May 1999, Lecture Notes in Computer Science 1601, 1999.
9. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512–535, 1994.
10. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser and M. Siegle. A Markov chain model checker. Proc. of 6th TACAS, Lectures Notes in Computer Science, 1785:347–362, 2000.
11. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13–30, 1963.
12. B. Jeannet, P. R. D’Argenio and K. G. Larsen RAPTURE: A tool for verifying Markov Decision Processes. In Proc. of CONCUR’02. 2002.
13. R.M. Karp, M. Luby and N. Madras. Monte-Carlo algorithms for enumeration and reliability problems. Journal of Algorithms, 10:429–448, 1989.
14. J. Kemeny, J. Snell and A. Knapp. Denumerable markov chains. Springer-Verlag, 1976.
15. M. Kwiatkowska, G. Norman and D. Parker. Probabilistic symbolic model checking with PRISM: a hybrid approach. In Proc. of 8th TACAS, Lecture Notes in Computer Science 2280, 2002.
16. R. Lassaigne and S. Peyronnet. Approximate Verification of Probabilistic Systems. In Proc. of the 2nd joint PAPM-PROBMIV, Lecture Notes in Computer Science 2399, 213–214, 2002.
17. L. Lovasz and P. Winkler. Exact mixing time in an unknown markov chain. Electronic journal of combinatorics, 1995.
18. D. Monniaux An abstract Monte-Carlo method for the analysis of probabilistic programs (extended abstract). In 28th Symposium on Principles of Programming Languages (POPL’01), pages 93–101. Association for Computer Machinery, 2001.
19. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
20. C.H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
21. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, pages 1:53–72, 1986.
22. A. Pnueli and L. Zuck. Probabilistic verification. Information and Computation, 103(1):1–29, 1993.
23. PRISM homepage. http://www.cs.bham.ac.uk/˜dxp/prism/.
24. A. Rabinovich. Quantitative analysis of probabilistic channel systems. proc. of 30th ICALP, Lecture Notes in Computer Science 2719, 2003.
25. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. Journal of the ACM, 32(3):733–749, 1985.
26. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. Proc. 26th Annual Symposium on Foundations of Computer Science, pages 327–338, 1985.
27. Moshe Y. Vardi, Pierre Wolper. An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report). In Proceedings of the first IEEE Symposium on Logic in Computer Science, pages 332–344, 1986.
28. H. L. S. Younes and R. G. Simmons. Probabilistic Verication of Discrete Event Systems using Acceptance Sampling. In Proc. of the 14th International Conference on Computer Aided Verification, Lecture Notes in Computer Science 2404, 223–235. 2002.