Probabilistic verification and approximation

Electronic Notes in Theoretical Computer Science

Volumn 143, Issue SPEC. ISS., 2006, Pages 101-114

  Lassaigne, Richard ^a   Peyronnet, Sylvain ^b  

^a CNRS   (France)

^b EPITA RESEARCH AND DEVELOPMENT LABORATORY LRDE   (France)

Author keywords

Approximation Algorithm; Model Checking; Probabilistic Verification

Indexed keywords

APPROXIMATION ALGORITHM; MODEL CHECKING; PROBABILISTIC SPECIFICATIONS; PROBABILISTIC VERIFICATION;

ALGORITHMS; APPROXIMATION THEORY; MARKOV PROCESSES; MATHEMATICAL OPERATORS;

PROBABILISTIC LOGICS;

EID: 29344466683     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.05.031     Document Type: Conference Paper

References (28)

1. APMC Website. http://apmc.berbiqui.org
2. A. Bianco, and L. de Alfaro Model checking of probabilistic and nondeterministic systems Proc. FST&TCS LNCS 1026 1995 499 513
3. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu Symbolic model checking without BDD's In Proc. of 5th TACAS LNCS 1573 1999 193 207
4. R.E. Bryant Graph-based algorithms for boolean function manipulation IEEE Transactions on Computers C-35 8 1986 677 691
5. R.E. Bryant On the complexity of vlsi implementations and graph representations of boolean functions with application to integer multiplication IEEE Transactions on Computers 40 2 1991 205 213
6. E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Transactions on Programming Languages and Systems 8 2 1986 244 263
7. C. Courcoubetis, and M. Yannakakis The complexity of probabilistic verification Journal of the ACM 42 4 1995 857 907
8. P. Dagum, R. Karp, M. Luby, and S. Ross An optimal algorithm for Monte-Carlo estimation SIAM journal of computing 29 5 2000 1484 1496
9. 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 Proc. of Int. TACAS LNCS 1785 2000
10. M. Duflot, L. Fribourg, T. Herault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC Proc. of the 4th AVoCS ENTCS 2004
11. R. Grosu. Private communication. 2005
12. V. Hartonas-Garmhausen, S. Campos, and E. Clarke Probverus: Probabilistic symbolic model checking Proc. 5th International AMAST Workshop ARTS'99 LNCS 1601 1999
13. H. Hansson, and B. Jonsson A logic for reasoning about time and reliability Formal Aspects of Computing 6 1994 512 535
14. H. Hermans, J.P. Katoen, J. Meyer-Kayser, and M. Siegle A Markov chain model checker Proc. of Int. TACAS LNCS 1785 2000
15. T. Herault, R. Lassaigne, F. Magniette, and S. Peyronnet Approximate Probabilistic Model Checking Proceedings of Fifth International VMCAI'04 LNCS 2937 2004 73 84
16. W. Hoeffding Probability inequalities for sums of bounded random variables Journal of the American Statistical Association 58 1963 13 30
17. M.R. Jerrum, and A. Sinclair Approximating the permanent SIAM Journal of Computing 18 1989 1149 1178
18. D.R. Karger A randomized fully polynomial time approximation scheme for the all terminal network reliability problem SIAM Journal on Computing 29 1999 492 514
19. R.M. Karp and M. Luby. Monte-Carlo algorithms for enumeration and reliability problems. Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, 56-64, 1983
20. R.M. Karp, M. Luby, and N. Madras Monte-Carlo algorithms for enumeration and reliability problems Journal of Algorithms 10 1989 429 448
21. R. Lassaigne, and S. Peyronnet Approximate Verification of Probabilistic Systems Proc. of the 2nd PAPM-PROBMIV LNCS 2399 2002 213 214
22. O. Lichtenstein, and A. Pnueli Checking that finite state concurrent programs satisfy their linear specification Proceedings of the 12th POPL 1985 ACM CS Press 97 107
23. C.H. Papadimitriou Computational Complexity 1994 Addison Wesley
24. A. Rényi Probability Theory 1970 North-Holland Amsterdam
25. K. Sen, M. Vishanathan, and G. Agha Statistical model checking of black-box probabilistic systems Proc. of the 16th Int. Conf. Computer Aided Verification LNCS 3114 2004 202 215
26. A.P. Sistla, and E.M. Clarke The complexity of propositional linear temporal logics Journal of the ACM 32 3 1985 733 749
27. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. Proc. 26th FOCS, pp. 327-338, 1985
28. H.L.S. Younes, and R.G. Simmons Probabilistic Verication of Discrete Event Systems using Acceptance Sampling Proc. of the 14th International Conference on Computer Aided Verification LNCS 2404 2002 223 235