Stochastic model checking

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

Volumn 4486 LNCS, Issue , 2007, Pages 220-270

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

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; MODEL CHECKING; PROBABILISTIC LOGICS; PROBABILITY; TEMPORAL LOGIC;

CTMCS; DTMCS; PRISM; QUANTITATIVE PROPERTIES; SECURITY PROTOCOL;

STOCHASTIC MODELS;

EID: 34548060449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72522-0_6     Document Type: Conference Paper

References (63)

1. R. Alur and T. Henzinger. Reactive modules. Formal Methods in System Design, 15(1):7-48, 1999.
2. S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In K. Larsen and P. Niebert, editors, Proc. Formal Methods for Timed Systems (FORMATS'03), volume 2791 of LNCS, pages 88-104. Springer, 2003.
3. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 15(1):441-460, 1990.
4. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Verifying continuous time Markov chains. In R. Alur and T. Henzinger, editors, Proc. 8th Int. Conf. Computer Aided Verification (CAV'96), volume 1102 of LNCS, pages 269-276. Springer, 1996.
5. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton. Model checking continuous time Markov chains. ACM Transactions on Computational Logic, 1(1):162-170, 2000.
6. A. Aziz, V. Singhal, F. Balarin, R. Brayton, and A. Sangiovanni- Vincentelli. It usually works: The temporal logic of stochastic systems. In P. Wolper, editor, Proc. 7th Int. Conf. Computer Aided Verification (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. Formal Methods in System Design, 10(2/3):171-206, 1997.
8. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In A. Emerson and A. Sistla, editors, Proc. 12th Int. Conf. Computer Aided Verification (CAV'OO), volume 1855 of LNCS, pages 358-372. Springer, 2000.
9. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. On the logical characterisation of performability properties. In U. Montanari, J. Rolim, and E. Welzl, editors, Proc. 27th Int. Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS, pages 780-792. Springer, 2000.
10. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524-541, 2003.
11. C. Baier, J. Katoen, H. Hermanns, and B. Haverkort. Simulation for continuous-time Markov chains. In L. Brim, P. Jancar, M. Kretinzki, and A. Kucera, editors, Proc. Concurrency Theory (CONCUR'02), volume 2421 of LNCS, pages 338-354. Springer, 2002.
12. C. Baier, J.-P. Katoen, and H. Hermanns. Approximate symbolic model checking of continuous-time Markov chains. In J. Baeten and S. Mauw, editors, Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), volume 1664 of LNCS, pages 146-161. Springer, 1999.
13. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
14. L. Benini, A. Bogliolo, G. Paleologo, and G. D. Micheli. Policy optimization for dynamic power management. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 8(3):299-316, 2000.
15. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. Thiagarajan, editor, Proc. 15th Conf. Foundations of Software Technology and Theoretical Computer Science, volume 1026 of LNCS, pages 499-513. Springer, 1995.
16. P. Billingsley. Probability and Measure. Wiley, 1995.
17. P. Buchholz. Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability, 31:59-75, 1994.
18. L. Cheung. Randomized wait-free consensus using an atomicity assumption. In Proc. 9th International Conference on Principles of Distributed Systems (OPODIS'05), 2005.
19. G. Ciardo, R. Jones, A. Miner, and R. Siminiceanu. Logic and stochastic modeling with smart. Performance Evaluation, 63(6):578-608, 2006.
20. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal logics. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
21. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multiterminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10((2/3):149-169, 1997.
22. C. Courcoubetis and M. Yannakakis. Verifying temporal properties of finite state probabilistic programs. In Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS'88), pages 338-345. IEEE Computer Society Press, 1988.
23. C Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
24. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. Int. Journal on Software Tools for Technology Transfer, 5(2-3):221-236, 2004.
25. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
26. W. Fokkink and J. Pang. Variations on itai-rodeh leader election for anonymous rings and their analysis in prism. Journal of Universal Computer Science, 12(8):981-1006, 2006.
27. B. Fox and P. Glynn. Computing Poisson probabilities. Communications of the ACM, 31(4):440-445, 1988.
28. R. German. Performance Analysis of Communication Systems: Modeling with NonMarkovian Stochastic Petri Nets. John Wiley and Sons, 2000.
29. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
30. B. Haverkort. Performance of Computer Communication Systems: A Model-Based Approach. John Wiley & Sons, 1988.
31. B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen, and C. Baier. Model checking performability properties. In Proc. Int. Conf. Dependable Systems and Networks (DSN'02). IEEE Computer Society Press, 2002.
32. J. Heath, M. Kwiatkowska, G. Norman, D. Parker, and O. Tymchyshyn. Probabilistic model checking of complex biological pathways. In C. Priami, editor, Proc. Computational Methods in Systems Biology (CMSB'06), volume 4210 of Lecture Notes in Bioinformatics, pages 32-47. Springer, 2006.
33. T. Hérault, R. Lassaigne, F. Magniette, and S. Peyronnet. Approximate probabilistic model checking. In B. Steffen and G. Levi, editors, Proc. Verification, Model Checking and Abstract Interpretation (VMCAI'04), volume 2937 of LNCS, pages 73-84. Springer, 2004.
34. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov chain model checker. In S. Graf and M. Schwartzbach, editors, Proc. 6th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), volume 1785 of LNCS, pages 347-362. Springer, 2000.
35. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. Towards model checking stochastic process algebra. In W. Grieskamp and T. Santen, editors, Proc. Integrated Formal Method (IFM 2000), volume 1945 of LNCS, pages 420-439. Springer, 2000.
36. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In H. Hermanns and J. Palsberg, editors, Proc. 12th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), volume 3920 of LNCS, pages 441-444. Springer, 2006.
37. IEEE standard for a high performance serial bus. IEEE Computer Society, IEEE Std 1394-1995.
38. A. Itai and M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1):60-87, 1990.
39. J.-P. Katoen, M. Khattri, and I. Zapreev. A Markov reward model checker. In Proc. Second Int. Conf. Quantitative Evaluation of Systems (QEST 05), pages 243-244. IEEE Computer Society Press, 2005.
40. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic CTMC model checking. In L. de Alfaro and S. Gilmore, editors, Proc. 1st Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01), volume 2165 of LNCS, pages 23-38. Springer, 2001.
41. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Springer, 2nd edition, 1976.
42. M. Kwiatkowska, G. Norman, and A. Pacheco. Model checking CSL until formulae with random time bounds. In H. Hermanns and R. Segala, editors, Proc. 2nd Joint Int. Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02), volume 2399 of LNCS, pages 152-168. Springer, 2002.
43. 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.
44. M. Kwiatkowska, G. Norman, and A. Pacheco. Model checking expected time and expected reward formulae with random time bounds. Computers & Mathematics with Applications, 51(2):305-316, 2006.
45. M. Kwiatkowska, G. Norman, and D. Parker. PRISM users' guide. Available from www.cs.bham.ac.uk/~dxp/prism.
46. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. Int. Journal on Software Tools for Technology Transfer, 6(2):128-142, 2004.
47. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. Formal Methods in System Design, 29:33-78, 2006.
48. M. Kwiatkowska, D. Parker, Y. Zhang, and R. Mehmood. Dual-processor parallelisation of symbolic probabilistic model checking. In D. DeGroot and P. Harrison, editors, Proc. 12th Int. Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'04), pages 123-130. IEEE Computer Society Press, 2004.
49. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94:1-28, 1991.
50. G. Norman, D. Parker, M. Kwiatkowska, S. Shukla, and R. Gupta. Using probabilistic model checking for dynamic power management. Formal Aspects of Computing, 17(2):160-176, 2005.
51. G. Norman and V. Shmatikov. Analysis of probabilistic contract signing. Journal of Computer Security, 14(6):561-589, 2006.
52. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems. PhD thesis, University of Birmingham, 2002.
53. PRISM web site, www.cs.bham.ac.uk/~dxp/prism.
54. Q. Qiu, Q. Wu, and M. Pedram. Stochastic modeling of a power-managed system: Construction and optimization. In Proc. Int. Symposium on Low Power Electronics and Design, 1999.
55. Q. Qiu, Q. Wu, and M. Pedram. Stochastic modeling of a power-managed system: construction and optimization. IEEE Transactions on Computer Aided Design, 20(10): 1200-1217, 2001.
56. J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel (eds.), volume 23 of CRM Monograph Series. American Mathematical Society, 2004.
57. R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. In B. Jonsson and J. Parrow, editors, Proc. 5th Int. Conf. Concurrency Theory (CONCUR'94), volume 836 of LNCS, pages 481-496. Springer, 1994.
58. F. Somenzi. CUDD: Colorado University decision diagram package. Public software, Colorado Univeristy, Boulder, http://vlsi.colorado.edu/~fabio/, 1997.
59. W. J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton, 1994.
60. R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
61. K. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications. John Wiley & Sons, 2001.
62. M. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. 26th Annual Symposium on Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.
63. H. Younes, M. Kwiatkowska, G. Norman, and D. Parker. Numerical vs. statistical probabilistic model checking. Int. Journal on Software Tools for Technology Transfer, 8(3):216-228, 2006.