Bounded model checking for GSMP models of stochastic real-time systems

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

Volumn 3927 LNCS, Issue , 2006, Pages 19-33

  Alur, Rajeev ^a   Bernadsky, Mikhail ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED MODEL CHECKING; GENERALIZED SEMI-MARKOV PROCESSES (GSMP); STOCHASTIC REAL-TIME SYSTEMS;

ALGORITHMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; REAL TIME SYSTEMS;

MARKOV PROCESSES;

EID: 33745784414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11730637_5     Document Type: Conference Paper

References (20)

1. R. Alur, C. Courcoubetis, and D.L. Dill. Model-checking for probabilistic real-time systems. In Automata, Languages and Programming: Proceedings of the 18th ICALP, LNCS 510, pages 115-136. Springer-Verlag, 1991.
2. R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126: 183-235, 1994.
3. A. Aziz, K. Sanwal, V. Singhal, and R.K. Brayton. Model-checking continuous-time markov chains. ACM Transactions on Computational Logic, 1(1): 162-170, 2000.
4. A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proceedings of the 36th ACM/IEEE Design Automation Conference, pages 317-320, 1999.
5. E.M. Clarke, O. Grumberg, and D.A. Peled. Model checking. MIT Press, 2000.
6. E.M. Clarke and R.P. Kurshan. Computer-aided verification. IEEE Spectrum, 33(6):61-67, 1996.
7. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
8. R. German. Performance analysis of communication systems: Modeling with non-Markovian stochastic Petrinets. J. Wiley & Sons, 2000.
9. P.W. Glynn. A GSMP formalism for discrete event systems. Proceedings of the IEEE, 77(1):14-23, 1988.
10. H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proceedings of the Tenth IEEE Real-Time Systems Symposium, pages 102-111, 1989.
11. B. Haverkort. Performance of computer-communication systems: A model-based approach. Wiley & Sons, 1998.
12. G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
13. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proceedings of Computer Performance Evaluation/Tools 2002, LNCS 2324, pages 200-204, 2002.
14. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In Proceedings of the 11th International Conference on Concurrency Theory, LNCS 1877, pages 123-137. Springer, 2000.
15. M.Z. Kwiatkowska. Model checking for probability and time: from theory to pratice. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science, pages 351-360, 2003.
16. M.Z. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: a hybrid approach. Software Tools for Technology Transfer, 6(2): 128-142, 2004.
17. P.D'Argenio, H. Hermanns, J.-P. Katoen, and R. Klaren. Modest - a modeling and description language for stochastic timed systems. In Proceedings of the PAPM-PROBMIV Joint International Workshop, LNCS 2165, pages 87-104. Springer, 2001.
18. G.S. Shedler. Regenerative stochastic simulation. Academic Press, 1993.
19. M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327-338, 1985.
20. H. Younes and R. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In Computer Aided Verification, 14th International Conference, LNCS 2404, pages 223-235, 2002.