Probabilistic verification and approximation

Annals of Pure and Applied Logic

Volumn 152, Issue 1-3, 2008, Pages 122-131

  Lassaigne, Richard ^a   Peyronnet, Sylvain ^a,b  

^a CNRS   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Probabilistic verification; Randomized approximation algorithms

Indexed keywords

EID: 39549115436     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2007.11.006     Document Type: Article

References (29)

1. Bianco A., and de Alfaro L. Model checking of probabilistic and nondeterministic systems. Proc. 15th Conf. Foundations of Software Technology and Theoretical Computer Science. LNCS vol. 1026 (1995) 499-513
2. Brémaud P. Markov chains, Gibbs fields, Monte Carlo simulation, and queues. Texts in Applied Mathematics (1999), Springer 445 pages
3. M. Cadilhac, T. Herault, R. Lassaigne, S. Peyronnet, Sebastien Tixeuil, Evaluating complex MAC protocols for sensor networks with APMC. Proc. 6th Int. Workshop on Automated Verification of Critical Systems, 2006
4. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
5. Courcoubetis C., and Yannakakis M. The complexity of probabilistic verification. Journal of the ACM 42 4 (1995) 857-907
6. Dagum P., Karp R., Luby M., and Ross S. An optimal algorithm for Monte Carlo estimation. SIAM Journal of Computing 29 5 (2000) 1484-1496
7. de Alfaro L., Kwiatkowska M., Norman G., Parker D., and Segala R. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the kronecker representation. Proc. 6th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems. LNCS vol. 1785 (2000) 395-410
8. Duflot M., Fribourg L., Herault T., Lassaigne R., Magniette F., Messika S., Peyronnet S., and Picaronny C. Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC. Proc. 4th Int. Workshop on Automated Verification of Critical Systems. ENTCS 128 6 (2005) 195-214
9. R. Grosu, S.A. Smolka, Quantitative model checking, in: Proc. 1st Int. Symposium on Leveraging Applications of Formal Methods, 2004
10. Grosu R., and Smolka S.A. Monte-Carlo model checking. Proc. 11th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems. LNCS vol. 3440 (2005) 271-286
11. Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing 6 (1994) 512-535
12. Guirado G., Herault T., Lassaigne R., and Peyronnet S. Distribution, approximation and probabilistic model checking. Proc. Int. Workshop on Parallel and Distributed Methods in Verification. ENTCS 135 2 (2006) 19-30
13. Herault T., Lassaigne R., Magniette F., and Peyronnet S. Approximate probabilistic model checking. Proc. 5th Int. Conf. Verification, Model Checking, and Abstract Interpretation. LNCS vol. 2937 (2004) 73-84
14. Herault T., Lassaigne R., and Peyronnet S. APMC 3.0: Approximate verification of discrete and continuous time Markov chains. Proc. 3rd Int. Conf. on Quantitative Evaluation of Systems (2006), IEEE Computer Society 129-130
15. Hoeffding W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58 (1963) 13-30
16. Jerrum M.R., Valiant L.G., and Vazirani V.V. Random generation of combinatorial structures from a uniform distribution. Theoretical Computer Science 43 (1986) 169-188
17. Karger D.R. A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. SIAM Journal on Computing 29 (1999) 492-514
18. Karp R.M., and Luby M. Monte-Carlo algorithms for enumeration and reliability problems. Proc. 24th Annual IEEE Symposium on Foundations of Computer Science (1983) 56-64
19. Karp R.M., Luby M., and Madras N. Monte-Carlo algorithms for enumeration and reliability problems. Journal of Algorithms 10 (1989) 429-448
20. Lassaigne R., and Peyronnet S. Approximate verification of probabilistic systems. Proc. 2nd Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification. LNCS vol. 2399 (2002) 213-214
21. Lichtenstein O., and Pnueli A. Checking that finite state concurrent programs satisfy their linear specification. Proc. 12th ACM Symposium on Principles of Programming Languages (1985), ACM CS Press 97-107
22. S. Peyronnet, Can verification be approximated? in: Proc. 1st Int. Workshop on Automated Verification of Critical Systems, Programming Research Group Research, Report RR-01-07, Oxford University, 2001
23. Sen K., Viswanathan M., and Agha G. Statistical model checking of black-box probabilistic systems. Proc. 16th Int. Conf. Computer Aided Verification. LNCS vol. 3114 (2004) 202-215
24. E. Seneta, Non-negative Matrices and Markov Chains. Springer Series in Statistics, 1973
25. Sinclair A. Algorithms for random generation and counting: A Markov chain approach. Progress in Theoretical Computer Science (1993), Birkhauser, Boston
26. Sistla A.P., and Clarke E.M. 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, in: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 327-338
28. Younes H.L.S., and Simmons R.G. Probabilistic verification of discrete event systems using acceptance sampling. Proc. 14th Int. Conf. Computer Aided Verification. LNCS vol. 2404 (2002) 223-235
29. Younes H.L.S. Error control for probabilistic model checking. Proc. 7th Int. Conf. Verification, Model Checking, and Abstract Interpretation. LNCS vol. 3855 (2006) 142-156