A modest approach to checking probabilistic timed automata

QEST - 6th International Conference on the Quantitative Evaluation of Systems

Volumn , Issue , 2009, Pages 187-196

  Hartmanns, Arnd ^a   Hermanns, Holger ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Compositional modelling; Digital clocks; Model checking; Probabilistic timed automata

Indexed keywords

AUTOMATIC TOOLS; COMPOSITIONAL MODELLING; DIGITAL CLOCKS; EXCEPTION HANDLING; INTEGER VARIABLES; MODEL SPECIFICATIONS; NON-DETERMINISM; PROBABILISTIC CHOICES; PROBABILISTIC MODELS; PROBABILISTIC TIMED AUTOMATA; REACHABILITY; REAL TIME; RECURSIONS;

CLOCKS; HIGH LEVEL LANGUAGES; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 74049146186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2009.41     Document Type: Conference Paper

References (21)

1. M. Kwiatkowska, G. Norman, and D. Parker, "Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach," International Journal on Software Tools for Technology Transfer (STTT), vol. 6, no. 2, pp. 128-142, 2004.
2. P. Pettersson and K. Larsen, "Uppaal2k," Bulletin of the European Association for Theoretical Computer Science, vol. 70, pp. 40-44, 2000.
3. R. Segala, "Modeling and verification of randomized distributed realtime systems," Ph.D. dissertation, Cambridge, MA, USA, 1995.
4. R. Alur and D. L. Dill, "A theory of timed automata," Theor. Comput. Sci., vol. 126, no. 2, pp. 183-235, 1994.
5. H. C. Bohnenkamp, P. R. D'Argenio, H. Hermanns, and J.-P. Katoen, "MoDeST: A compositional modeling formalism for hard and softly timed systems," IEEE Trans. Softw. Eng., vol. 32, no. 10, pp. 812-830, 2006.
6. M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, "Automatic verification of real-time systems with discrete probability distributions," Theor. Comput. Sci., vol. 282, no. 1, pp. 101-150, 2002.
7. C. Daws, M. Z. Kwiatkowska, and G. Norman, "Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM," STTT, vol. 5, no. 2-3, pp. 221-236, 2004.
8. M. Z. Kwiatkowska, G. Norman, J. Sproston, and F. Wang, "Symbolic model checking for probabilistic timed automata," Information and Computation, vol. 205, no. 7, pp. 1027-1077, 2007.
9. M. Z. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, "Performance analysis of probabilistic timed automata using digital clocks," Formal Methods in System Design, vol. 29, no. 1, pp. 33-78, 2006.
10. P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen, "Reduction and refinement strategies for probabilistic analysis," in PAPM-PROBMIV, ser. Lecture Notes in Computer Science, H. Hermanns and R. Segala, Eds., vol. 2399. Springer, 2002, pp. 57-76.
11. B. Jeannet and K. G. Larsen, "Private communication," 2009.
12. J. Berendsen, D. N. Jansen, and J.-P. Katoen, "Probably on time and within budget: On reachability in priced probabilistic timed automata," in QEST. IEEE Computer Society, 2006, pp. 311-322.
13. C. Baier and J.-P. Katoen, Principles of Model Checking. MIT Press, 2008.
14. J. Sifakis, "An algebraic framework for urgency," Information and Computation, vol. 163, p. 2000, 2000.
15. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, "Symbolic model checking for real-time systems," Information and Computation, vol. 111, no. 2, pp. 193-244, 1994.
16. A. Hartmanns, "A Modest checker for probabilistic timed automata," SFB/TR 14 AVACS, Reports of SFB/TR 14 AVACS 49, April 2009, ISSN: 1860-9821, http://www.avacs.org.
17. E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
18. Y. Mai and M. de Champlain, "A pattern language to visitors," in Proceedings of the 8th Annual Conference of Pattern Languages of Programs (PLoP). The Hillside Group, Inc., September 2001.
19. L. Helmink, M. P. A. Sellink, and F. W. Vaandrager, "Proof-checking a data link protocol," in TYPES, ser. Lecture Notes in Computer Science, H. Barendregt and T. Nipkow, Eds., vol. 806. Springer, 1993, pp. 127-165.
20. P. R. D'Argenio, J.-P. Katoen, T. C. Ruys, and J. Tretmans, "The bounded retransmission protocol must be on time!" in TACAS, ser. Lecture Notes in Computer Science, E. Brinksma, Ed., vol. 1217. Springer, 1997, pp. 416-431.
21. P. R. D'Argenio, B. Jeannet, H. E. Jensen, and K. G. Larsen, "Reachability analysis of probabilistic systems by successive refinements," in PAPM-PROBMIV, ser. Lecture Notes in Computer Science, L. de Alfaro and S. Gilmore, Eds., vol. 2165. Springer, 2001, pp. 39-56.