PRISM: Probabilistic symbolic model checker

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

Volumn 2324 LNCS, Issue , 2002, Pages 200-204

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

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; CONTINUOUS TIME SYSTEMS; DECISION THEORY; MANUFACTURE; MARKOV PROCESSES; MATRIX ALGEBRA; PRISMS; QUALITY OF SERVICE; CHAINS;

CONTINUOUS TIME MARKOV CHAIN; DISCRETE TIME MARKOV CHAINS; MARKOV DECISION PROCESSES; PROBABILISTIC SYSTEMS; PROBABILISTIC TEMPORAL LOGIC; RANDOMIZED DISTRIBUTED ALGORITHMS; SYMBOLIC MODEL CHECKERS; UNIVERSITY OF BIRMINGHAM;

MODEL CHECKING;

EID: 84863981780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46029-2_13     Document Type: Conference Paper

References (20)

1. R. Alur and T. Henzinger. Reactive modules. In Proc. LICS'96, 1996.
2. J. Aspnes and M. Herlihy. Fast Randomized Consensus using Shared Memory. Journal of Algorithms, 15(1), 1990.
3. C. Baier. On algorithmic verification methods for probabilistic systems. Universität Mannheim, 1998.
4. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In CAV 2000, Volume 1855 of LNCS, 2000.
5. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3), 1998.
6. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FST & TCS, 1995.
7. 20 states and beyond. In Proc. LICS'90, 1990.
8. C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography (extended abstract). In Proc. PODC'00, 2000.
9. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stocastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, 1996.
10. E. Clarke, M. Fujita, P. McGeer, J. Yang, and X. Zhao. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. In Proc. IWLS'93, 1993.
11. 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 2000, Volume 1785 of LNCS, 2000.
12. H. Hansson and B. Jonsson. A logic for reasoning about time and probability. Formal Aspects of Computing, 6, 1994.
13. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov Chain Model Checker. In Proc. TACAS 2000, Volume 1785 of LNCS, 2000.
14. O. Ibe and K. Trivedi. Stochastic Petri net models of polling systems. IEEE Journal on Selected Areas in Communications, 8(9), 1990.
15. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and symbolic ctmc model checking. In PAPM/PROBMIV'01, Volume 2165 of LNCS, 2001.
16. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. In Proc. TACAS 2002, 2002. To appear.
17. 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, 2001.
18. PRISM webpage. http://www.cs.bham.ac.uk/~dxp/prism/.
19. F. Somenzi. CUDD: CU Decision Diagram package. Public software, Colorado University, Boulder, 1997.
20. W. Stewart. MARCA: Marcov chain analyzer. a software package for Markov modelling. In Proc. NSMC'91, 1991.