Three-valued abstraction for continuous-time markov chains

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

Volumn 4590 LNCS, Issue , 2007, Pages 311-324

  Katoen, Joost Pieter ^a   Klink, Daniel ^a   Leucker, Martin ^b   Wolf, Verena ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^c UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONTINUOUS TIME SYSTEMS; FORMAL METHODS; MODEL CHECKING; SEMANTICS;

CONTINUOUS STOCHASTIC LOGIC; THREE VALUED ABSTRACTION METHODS;

MARKOV PROCESSES;

EID: 38149121410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73368-3_37     Document Type: Conference Paper

References (24)

1. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous time Markov chains. ACM TOCL 1, 162-170 (2000)
2. Baier, C., Hermanns, H., Katoen, J.P., Haverkort, B.R.H.M.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. TCS 345, 2-26 (2005)
3. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29, 524-541 (2003)
4. Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200, 149-214 (2005)
5. Bause, F., Kritzinger, P.S.: Stochastic Petri nets: An introduction to the theory. SIGMETRICS Performance Evaluation Review 26 (1998)
6. Ben Mamoun, M., Pekergin, N., Younès, S.: Model checking of continuous-time Markov chains by closed-form bounding distributions. In: QEST, pp. 189-198. IEEE CS, Los Alamitos (2006)
7. Böde, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Wimmer, R., Becker, B.: Compositional performability evaluation for Statemate. In: QEST, pp. 167-178. IEEE CS, Los Alamitos (2006)
8. Ciardo, G.I.R.L.J., Miner, A., Siminiceanu, R.: Logical and stochastic modeling with SMART. In: Kemper, P., Sanders, W.H. (eds.) TOOLS 2003. LNCS, vol. 2794, pp. 78-97. Springer, Heidelberg (2003)
9. D'Aprile, D., Donatelli, S., Sproston, J.: CSL model checking for the GreatSPN tool. In: Aykanat, C., Dayar, T., Körpeoǧlu, İ. (eds.) ISCIS 2004. LNCS, vol. 3280, pp. 543-553. Springer, Heidelberg (2004)
10. D'Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S.T. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 39-56. Springer, Heidelberg (2001)
11. Fecher, H., Leucker, M., Wolf, V.: Don't know in probabilistic systems. In: Valmari, A. (ed.) Model Checking Software. LNCS, vol. 3925, pp. 71-88. Springer, Heidelberg (2006)
12. Gilmore, S., Hillston, J.: The PEPA workbench: A tool to support a process algebra-based approach to performance modelling. In: Haring, G., Kotsis, G. (eds.) Computer Performance Evaluation. LNCS, vol. 794, pp. 353-368. Springer, Heidelberg (1994)
13. Groesser, M., Baier, C.: Partial order reduction for Markov decision processes: a survey. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 408-427. Springer, Heidelberg (2006)
14. Huth, M.: An abstraction framework for mixed non-deterministic and probabilistic systems. In: Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 419-444. Springer, Heidelberg (2004)
15. Huth, M.: On finite-state approximants for probabilistic computation tree logic. TCS 346, 113-134 (2005)
16. Katoen, J.-P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: TACAS. LNCS, vol. 4424, pp. 87-102. Springer, Heidelberg (2007)
17. Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: QEST, pp. 243-244. IEEE Computer Society Press, Los Alamitos (2005)
18. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST, pp. 157-166. IEEE Computer Society Press, Los Alamitos (2006)
19. Kwiatkowska, M., Norman, G., Parker, D.: Symmetry reduction for probabilistic model checking. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 234-248. Springer, Heidelberg (2006)
20. Monniaux, D.: Abstract interpretation of programs as Markov decision processes. Science of Computer Programming 58, 179-205 (2005)
21. Remke, A., Haverkort, B.R., Cloth, L.: Model checking infinite-state Markov chains. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 237-252. Springer, Heidelberg (2005)
22. Sen, K., Viswanathan, M., Agha, G.: Model-checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 394-410. Springer, Heidelberg (2006)
23. Sproston, J., Donatelli, S.: Backward bisimulation in Markov chain model checking. IEEE TSE 32, 531-546 (2006)
24. Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: efficient decision algorithms for probabilistic simulations. In: TACAS. LNCS, vol. 4424, pp. 155-170. Springer, Heidelberg (2007)