Game-Based Probabilistic Predicate Abstraction in PRISM

Electronic Notes in Theoretical Computer Science

Volumn 220, Issue 3, 2008, Pages 5-21

  Kattenbelt, Mark ^a   Kwiatkowska, Marta ^a   Norman, Gethin ^a   Parker, David ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Automatic verification; Markov models; predicate abstraction; probabilistic model checking

Indexed keywords

ABSTRACTING; COMPUTER NETWORKS; GAME THEORY; HIGH LEVEL LANGUAGES; LINGUISTICS; MARKOV PROCESSES; PATIENT MONITORING; PRISMS; PROBABILITY; REAL TIME SYSTEMS;

ABSTRACTION TECHNIQUES; AND VERIFICATIONS; AUTOMATIC VERIFICATION; CASE STUDIES; COMPLEX SYSTEMS; COMPOSITIONAL APPROACHES; LOWER AND UPPER BOUNDS; MARKOV DECISION PROCESSES; MARKOV MODELS; PREDICATE ABSTRACTION; PREDICATE ABSTRACTIONS; PROBABILISTIC MODEL CHECKING; PROMISING APPROACHES; REACH ABILITIES; SECURITY PROTOCOLS;

MODEL CHECKING;

EID: 57449105232     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.11.016     Document Type: Article

References (22)

1. Ball T., Millstein T., and Rajamani S.K. Automatic predicate abstraction of C programs. SIGPLAN Notices 36 (2001) 203-213
2. Bianco A., and de Alfaro L. Model checking of probabilistic and nondeterministic systems. In: Thiagarajan P.S. (Ed). Proc. 15th Conf. on Foundations of Software Technology and Theoretical Computer Science. (FSTTC'95). LNCS vol. 1026 (1995) 499-513
3. Cheshire S., Adoba B., and Gutterman E. Dynamic configuration of IPv4 link local addresses. available from. http://www.ietf.org/rfc/rfc3927.txt
4. Ciesinski F., and Baier C. LiQuor: A tool for qualitative and quantitative linear time analysis of reactive systems. Proc. 3rd Int. Conf. Quantitative Evaluation of Systems. (QEST'06) (2006) 131-132
5. Clarke E., Kroening D., Sharygina N., and Yorav K. Predicate abstraction of ANSI-C programs using SAT. Formal Methods in System Design 25 (2004) 105-127
6. D'Argenio P., Jeannet B., Jensen H., and Larsen K. Reachability analysis of probabilistic systems by successive refinements. In: de Alfaro L., and Gilmore S. (Eds). Proc. 1st Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification. (PAPM/PROBMIV'01). LNCS vol. 2165 (2001) 39-56
7. de Alfaro L., Henzinger T., and Jhala R. Compositional methods for probabilistic systems. In: Larsen K., and Nielsen M. (Eds). Proc. 12th Int. Conf. Concurrency Theory. (CONCUR'01). LNCS vol. 2154 (2001) 351-365
8. de Alfaro L., and Roy P. Magnifying-lens abstraction for Markov decision processes. In: Dam W., and Hermanns H. (Eds). Proc. 19th Int. Conf. Computer Aided Verification. (CAV'07). LNCS vol. 4590 (2007) 325-338
9. Duflot M., Fribourg L., and Picaronny C. Randomized finite-state distributed algorithms as Markov chains. In: Welch J. (Ed). Proc. 15th Int. Conf. Distributed Computing. (DISC'01). LNCS vol. 2180 (2001) 240-254
10. Dutertre B., and de Moura L. A fast linear-arithmetic solver for DPLL(T). In: Ball T., and Jones R. (Eds). Proc. 18th Int. Conf. Computer Aided Verification. (CAV'06). LNCS vol. 4114 (2006) 81-94
11. Fecher H., Leucker M., and Wolf V. Don't know in probabilistic systems. In: Valmari A. (Ed). Proc. 13th Int. SPIN Workshop. (SPIN'06). LNCS vol. 3925 (2006) 71-88
12. Graf S., and Saïdi H. Construction of abstract state graphs with PVS. In: Grumberg O. (Ed). Proc. 9th Int. Conf. Computer Aided Verification. (CAV'97). LNCS vol. 1254 (1997) 72-83
13. Hinton A., Kwiatkowska M., Norman G., and Parker D. PRISM: A tool for automatic verification of probabilistic systems. In: Hermanns H., and Palsberg J. (Eds). Proc. 12th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems. (TACAS'06). LNCS vol. 3920 (2006) 441-444
14. Huth M. On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science 346 (2005) 113-134
15. Israeli A., and Jalfon M. Token management schemes and random walks yield self-stabilizing mutual exclusion. Proc. 9th ACM Symp. Principles of Distributed Computing. (PODC'90) (1990) 119-131
16. Kattenbelt, M., M. Kwiatkowska, G. Norman and D. Parker, Game-based probabilistic predicate abstraction in PRISM, Technical Report RR-08-01, Oxford University Computing Laboratory (2008)
17. Kemeny J.G., Snell J.L., and Knapp A.W. Denumerable Markov Chains. 2 edition (1976), Springer-Verlag
18. Kwiatkowska M., Norman G., and Parker D. Game-based abstraction for Markov decision processes. Proc. 3rd Int. Conf. Quantitative Evaluation of Systems. (QEST'06) (2006) 157-166
19. Lahiri S., Ball T., and Cook B. Predicate abstraction via symbolic decision procedures. In: Etessami K., and Rajamani S. (Eds). Proc. 17th Int. Conf. on Computer Aided Verification. (CAV'05). LNCS vol. 3576 (2005) 24-38
20. Lahiri S.K., Nieuwenhuis R., and Oliveras A. SMT techniques for fast predicate abstraction. In: Ball T., and Jones R.B. (Eds). Proc. 18th Int. Conf. Computer Aided Verification. (CAV'06). LNCS vol. 4144 (2006) 424-437
21. Stahl K., Baukus K., Lakhnech Y., and Steffen M. Divide, abstract, and model-check. In: Dams D., Gerth R., Leue S., and Massink M. (Eds). Proc. 5th and 6th Int. SPIN Workshops. (SPIN'99). LNCS vol. 1680 (1999) 57-76
22. Wachter B., Zhang L., and Hermanns H. Probabilistic model checking modulo theories. Proc. 4th Int. Conf. Quantitative Evaluation of Systems. (QEST'07) (2007) 119-128