Model checking for probability and time: From theory to practice

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 351-360

  Kwiatkowska, Marta ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DECISION THEORY; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; COMPUTER HARDWARE; COMPUTER SOFTWARE; FAULT TOLERANCE; HARDWARE; LINEAR PROGRAMMING; LOGIC PROGRAMMING; NATURAL RESOURCES MANAGEMENT; PROBABILISTIC LOGICS; PROBABILITY; RESOURCE ALLOCATION;

TEMPORAL LOGICS;

PROBABILISTIC LOGICS; MODEL CHECKING;

FAULT TOLERANT SYSTEMS; NOMINATIONS AND ELECTIONS; RESOURCE MANAGEMENT; ROUTING; SOFTWARE PERFORMANCE; SOFTWARE SYSTEMS;

EID: 0042969046     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (60)

1. PRISM web site, www.cs.bham.ac.uk/̃dxp/prism.
2. R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real time. Information and Computation, 104(1):2-34, 1993.
3. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
4. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. J. of Algorithms, 15(1):441-460, 1990.
5. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In Proc. CAV'96, volume 1102 of LNCS, pages 269-276. Springer, 1996.
6. A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Proc. CAV'95, volume 939 of LNCS, pages 155-165. Springer, 1995.
7. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E.Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. In Proc. ICCAD'93, 1993.
8. C. Baier. On algorithmic verification methods for probabilistic systems. Habilitation thesis, Universität Mannheim, 1998.
9. C. Baier, E. Clarke, V. Hartonas-Garmhausen, M. Kwiatkowska, and M. Ryan. Symbolic model checking for probabilistic processes. In Proc. ICALP'97, volume 1256 of LNCS, pages 430-440. Springer, 1997.
10. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Proc. CAV'00, volume 1855 of LNCS, pages 358-372. Springer, 2000.
11. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In Proc. CONCUR'99, volume 1664 of LNCS, 1999.
12. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11 (3):125-155, 1998.
13. D. Bertsekas. Dynamic Programming and Optimal Control, Volumes 1 and 2. Athena Scientific, 1995.
14. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FST&TCS, volume 1026 of LNCS, 1995.
15. 20 states and beyond. In Proc. LICS'90, pages 428-439. IEEE Computer Society Press, 1990.
16. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography. In Proc. PODC'00, 2000.
17. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In Proc. International Workshop on Logic Synthesis (IWLS'93), 1993.
18. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite state probabilistic programs. In Proc. FOCS'88, pages 338-345, 1988.
19. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
20. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In Proc. PAPM/PROBMIV'01, volume 2165 of LNCS, pages 39-56. Springer, 2001.
21. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In Proc. FMICS'02, volume 66.2 of ENTCS. Elsevier, 2002.
22. 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. TACAS'00, volume 1785 of LNCS, 2000.
23. 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.
24. M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(5):374-382, 1985.
25. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
26. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
27. S. Hart, M. Sharir, and A. Pnueli. Termination of probabilistic concurrent programs. ACM Transactions on Programming Languages and Systems, 5(3):356-380, 1983.
28. V. Hartonas-Garmhausen, S. Campos, and E. Clarke. Prob-Verus: Probabilistic symbolic model checking. In Proc. ARTS'99, volume 1601 of LNCS, pages 96-110, 1999.
29. B. Haverkort. Performance of Computer-Communication Systems: A Model-Based Approach. Wiley & Sons, 1998.
30. T. Herman. Probabilistic self-stabilization. Information Processing Letters, 35(2):63-67, 1990.
31. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov chain model checker. In Proc. TACAS'00, volume 1785 of LNCS, pages 347-362. Springer, 2000.
32. H. Hermanns, M. Kwiatkowska, G. Norman, D. Parker, and M. Siegle. On the use of MTBDDs for performability analysis and verification of stochastic systems. Journal of Logic and Algebraic Programming, 2002. To appear.
33. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In Proc. PAPM/PROBMIV'01, volume 2165 of LNCS, 2001.
34. F. Kelly. Modelling communication networks, present and future. Philosophical Transactions of the Royal Society of London, 354(1707):437-463, 1996.
35. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
36. M. Kwiatkowska and R. Mehmood. Out-of-core solution of large linear systems of equations arising from stochastic modelling. In Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 135-151. Springer, 2002.
37. M. Kwiatkowska, R. Mehmood, G. Norman, and D. Parker. A symbolic out-of-core solution method for Markov models. In Proc. PDMC'02, volume 68.4 of ENTCS. Elsevier, 2002.
38. M. Kwiatkowska and G. Norman. Verifying randomized byzantine agreement. In Proc. FORTE'02, volume 2529 of LNCS, pages 194-209. Springer, 2002.
39. M. Kwiatkowska, G. Norman, and A. Pacheco. Model checking CSL until formulae with random time bounds. In Proc. PAPM/PROBMIV'02. Springer, 2002.
40. M. Kwiatkowska, G. Norman, and A. Pacheco. Model checking expected time and expected reward formulae with random time bounds. In Proc. 2nd Euro-Japanese Workshop on Stochastic Risk Modelling for Finance, Insurance, Production and Reliability, 2002. To appear.
41. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proc. TOOLS'02, volume 2324 of LNCS, pages 200-204. Springer, 2002.
42. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In Proc. TACAS'02, volume 2280 of LNCS, 2002.
43. M. Kwiatkowska, G. Norman, and R. Segala. Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In Proc. CAV'01, volume 2102 of LNCS, pages 194-206. Springer, 2001.
44. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In Proc. CONCUR'00, volume 1877 of LNCS, pages 123-137. Springer, 2000.
45. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150, 2002.
46. M. Kwiatkowska, G. Norman, and J. Sproston. Symbolic computation of maximal probabilistic reachability. In Proc. CONCUR'01, volume 2154 of LNCS, 2001.
47. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Special Issue of Formal Aspects of Computing, 2002. To appear.
48. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 169-187. Springer, 2002.
49. R. Lassaigne and S. Peyronnet. Approximate verification of probabilistic systems. In H. Hermanns and R. Segala, editors, Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 213-214. Springer, 2002.
50. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
51. G. Norman, D. Parker, M. Kwiatkowska, S. Shukla, and R. Gupta. Formal analysis and validation of continuous time Markov chain based system level power management strategies. In Proc. HLDVT'02, pages 45-50, 2002.
52. G. Norman and V. Shmatikov. Analysis of probabilistic contract signing. In Proc. BCS-FACS Formal Aspects of Security (FASec'02), LNCS. Springer, 2002.
53. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems. PhD thesis, University of Birmingham, 2002.
54. A. Pnueli and L. Zuck. Verification of multiprocess probabilistic protocols. Distributed Computing, 1(1):53-72, 1986.
55. 2 N-valued shared variable. Journal of Computer and System Sciences, 25(1):66-75, 1982.
56. V. Shmatikov, Probabilistic analysis of anonymity. In Proc. CSFW'02, pages 119-128, 2002.
57. F. Somenzi. CUDD: Colorado University decision diagram package. Public software, Colorado Univeristy, Boulder, http://vlsi.colorado.edu/̃fabio/, 1997.
58. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.
59. M. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. FOCS'85, pages 327-338. IEEE Computer Society Press, 1985.
60. H. Younes and R. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In E. Brinksma and K. Larsen, editors, Proc. (CAV'02), volume 2404 of LNCS, pages 223-235. Springer, 2002.