Providing evidence of likely being on time: Counterexample generation for CTMC model checking

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

Volumn 4762 LNCS, Issue , 2007, Pages 331-346

  Han, Tingting ^a,b   Katoen, Joost Pieter ^a,b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FEEDBACK; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING; TEMPORAL LOGIC;

COUNTEREXAMPLE GENERATION; DIAGNOSTIC FEEDBACK; K-SHORTEST PATH ALGORITHMS; REFUTATION;

MODEL CHECKING;

EID: 38149103404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75596-8_24     Document Type: Conference Paper

References (18)

1. Aljazzar, H., Hermanns, H., Leue, S.: Counterexamples for timed probabilistic reachability. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 177-195. Springer, Heidelberg (2005)
2. Aljazzar, H., Leue, S.: Extended directed search for probabilistic timed reachability. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 33-51. Springer, Heidelberg (2006)
3. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.K.: Model-checking continous-time Markov chains. ACM Trans. Comput. Log. 1(1), 162-170 (2000)
4. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524-541 (2003)
5. Clarke, E.M., Jha, S., Lu, Y., Veith, H.: Tree-like counterexamples in model checking. In: LICS, pp. 19-29 (2002)
6. Dijkstra, E.W.: A note on two problems in connection with graphs. Num. Math. 1, 395-412 (1959)
7. Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652-673 (1998)
8. Fox, B.L., Glynn, PW: Computing Poisson probabilities. Comm. ACM 31(4), 440-445 (1988)
9. Gurfinkel, A., Chechik, M.: Proof-like counter-examples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 160-175. Springer, Heidelberg (2003)
10. Han, T., Katoen, J.-P.: Counterexamples in probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 72-86. Springer, Heidelberg (2007)
11. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Asp. Comput. 6(5), 512-535 (1994)
12. Jensen, A.: Markoff chains as an aid in the study of Markoff processes. Skand. Aktuarietidskrift 36, 87-91 (1953)
13. Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: QEST 2005, pp. 243-244. IEEE Computer Society Press, Los Alamitos (2005)
14. Kwiatkowska, M.Z., Norman, G., Parker, D.: PRISM 2.0: A tool for probabilistic model checking. In: QEST 2004, pp. 322-323. IEEE Computer Society Press, Los Alamitos (2004)
15. Marie, R.A., Reibman, A.L., Trivedi, K.S.: Transient analysis of acyclic Markov chains. Perform. Eval. 7(3), 175-194 (1987)
16. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins Univ. Press (1981)
17. Qureshi, M., Sanders, W.: A new methodology for calculating distributions of reward accumulated during a finite interval. In: FTCS, pp. 116-125. IEEE Computer Society, Los Alamitos (1996)
18. Shoham, S., Grumberg, O.: A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 275-287. Springer, Heidelberg (2003)