Symbolic and parametric model checking of discrete-time markov chains

Lecture Notes in Computer Science

Volumn 3407, Issue , 2005, Pages 280-294

  Daws, Conrado ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARAMETER ESTIMATION; PROBABILITY; RECURSIVE FUNCTIONS;

LOSSY CHANNEL; PARAMETRIC MODEL; RANDOMIZED PROTOCOL; SYMBOLIC MODEL;

COMPUTER PROGRAMMING LANGUAGES;

EID: 24644502200     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31862-0_21     Document Type: Conference Paper

References (22)

1. A. Aziz, V. Singhal, F. Balarin, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In P. Wolper, editor, 7th International Conference On Computer Aided Verification, volume 939 of LNCS, pages 155-165, Liege, Belgium, 1995. Springer Verlag.
2. J. Bergstra, W. Fokkink, and A. Ponse. Process algebra with recursive operations. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebrea. Elsevier Science, 2001.
3. J. A. Bergstra, I. Bethke, and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37(4):243-258, 1994.
4. J. Berstel and C. Reutenauer. Rational Series and Their Languages. EATCS Monographs in Computer Science. Springer-Verlag, 1988.
5. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proc. 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer-Verlag, 1995.
6. H. Bohnenkamp, P. van der Stok, H. Hermanns, and F. Vaandrager. Cost-optimization of the IPv4 zeroconf protocol. In Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), pages 531-540. IEEE Computer Society, June 2003.
7. J. Brzozowsky. Derivatives of regular expressions. Journal of ACM, 11(4), 1964.
8. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
9. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In L. de Alfaro and S. Gilmore, editors, Proceedings of Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Joint International Workshop, PAPM-PROBMIV 2001, Aachen, Germany, volume 2165 of Lecture Notes in Computer Science, pages 29-56. Springer-Verlag, 2001.
10. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reduction and refinement strategies for probabilistic analysis. In H. Hermanns and R. Segala, editors, Proceedings of Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Joint International Workshop, PAPM-PROBMIV 2002, Copenhagen, Denmark, volume 2399 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
11. M. J. C. Gordon. HOL: A proof generating system for higher-order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, VLSI Specification, Verification and Synthesis, pages 73-128. Kluwer Academic Publishers, Boston, 1988.
12. M. J. C. Gordon and T. F. Melham. Introduction to HOL (A theorem-proving environment for higher order logic). Cambridge University Press, 1993.
13. Gramond and Rodger. Using JFLAP to interact with theorems in automata theory. SIGCSEB: SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education), 31, 1999.
14. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6(5):512-535, 1994.
15. J. E. Hopcroft, R. Motwani, Rotwani, and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Longman, Reading, Massachusetts, 2000.
16. J. Hurd. Formal Verification of Probabilistic Algorithms. PhD thesis, University of Cambridge, 2002.
17. B. Jeannet, P. D'Argenio, and K. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. In I. Cerna, editor, Tools Day'02, Brno, Czech Republic, Technical Report. Faculty of Informatics, Masaryk University Brno, 2002.
18. JFLAP (Java formal languages and automata package) web page, http://www.cs.duke.edu/~rodger/tools/jflap/.
19. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
20. D. E. Knuth and A. C. Yao. The complexity of nonuniform random number generation. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results. Academic Press, New York, 1976.
21. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In J. B. T. Field, P. Harrison and U. Harder, editors, Proc. Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02), volume 2324 of LNCS, pages 200-204. Springer, 2002.
22. PRISM web page, http://www.cs.bham.ac.uk/~dxp/prism/.