Time-bounded reachability in tree-structured QBDS by abstraction

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

Volumn , Issue , 2009, Pages 133-142

  Klink, Daniel ^a   Remke, Anne ^b   Haverkort, Boudewijn R ^c   Katoen, Joost Pieter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c EMBEDDED SYSTEMS INSTITUTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIRTH-DEATH PROCESS; BLOW-UP; CONTINUOUS TIME; DIRECT METHOD; GRID-LIKE; INFINITE TREES; MARKOV CHAIN; MARKOV DECISION PROCESSES; PERFORMANCE EVALUATION; PUSH-DOWN AUTOMATA; QUANTITATIVE MODEL CHECKING; REACHABILITY; RECURSIVE MARKOV CHAINS; STATE SPACE; TIME-BOUNDED REACHABILITY; UNIFORMIZATION;

AUTOMATA THEORY; MARKOV PROCESSES; MODEL CHECKING;

ABSTRACTING;

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

References (32)

1. Abdulla, P., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: CONCUR. LNCS, 3170. (2004) 35-48
2. Baier, C., Hermanns, H., Katoen, J. P., Haverkort, B. R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. TCS 345 (2005) 2-26
3. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29 (2003) 524-541
4. Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200 (2005) 149-214
5. Bini, D., Latouche, G., Meini, B.: Solving nonlinear matrix equations arising in tree-like stochastic processes. Lin. Alg. and its Applications 366 (2003) 39-64
6. Brázdil, T., Kucera, A., Strazovský, O.: On the decidability of temporal properties of probabilistic pushdown automata. In: STACS. LNCS, 3404. (2005) 145-157
7. Ciardo, G.: Discrete-time Markovian stochastic Petri nets. In: Computations with Markov Chains. Raleigh (1995) 339-358
8. Ciardo, G., III, R. L. J., Miner, A., Siminiceanu, R.: Logic and stochastic modeling with SMART. In: Computer Performance Evaluation. LNCS 2794. (2003) 78-97
9. D'Aprile, D., Donatelli, S., Sproston, J.: CSL model checking for the GreatSPN tool. In: Computer and Information Sc., ISCIS. LNCS, 3280. (2004) 543-553
10. D'Argenio, P. R., Jeannet, B., Jensen, H. E., Larsen, K. G.: Reachability analysis of probabilistic systems by successive refinements. In: PAPM-PROBMIV. LNCS, 2165. (2001) 39-56
11. de Alfaro, L., Roy, P.: Magnifying-lens abstraction for Markov decision processes. In: CAV. LNCS, 4590. (2007) 325-338
12. Etessami, K., Wojtczak, D., Yannakakis, M.: Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. In: QEST. IEEE CS Press (2008) 243-253
13. Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: STACS LNCS, 3404. (2005) 340-352
14. Gilmore, S., Hillston, J.: The PEPA workbench: A tool to support a process algebra-based approach to performance modelling. In: Computer Performance Evaluation. LNCS, 794. (1994) 353-368
15. Grassmann, W.: Finding transient solutions in Markovian event systems through randomization. In: Numerical Solution of Markov Chains. Dekker (1991) 411-420
16. Gross, D., Miller, D.: The randomization technique as a modeling tool and solution procedure for transient Markov chains. Operations Research 32 (1984) 343-361
17. He, Q., Alfa, A.: The discrete time MMAP[K]/PH[K]/1/LCFS-GPR queue and its variants. In: 3rd Int. Conf. on Matrix Analytic Methods. (2000) 167-190
18. Katoen, J.-P., Khattri, M., Zapreev, I. S.: A Markov reward model checker. In: QEST. IEEE CS Press (2005) 243-244
19. Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: CAV. LNCS, 4590. (2007) 316-329
20. Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: CAV. LNCS, 4590. Springer (2007) 316-329
21. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST. IEEE CS Press (2006) 157-166
22. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM (1999)
23. Remke, A., Haverkort, B.: A uniformization-based algorithm for model checking the CSL until operator on labeled queueing networks. In: FORMATS. LNCS, 4763. (2008) 336-351
24. Remke, A., Haverkort, B., Cloth, L.: CSL model checking algorithms for QBDs. Theoretical Computer Science (2007)
25. Schnoebelen, P.: The verification of probabilistic lossy channel systems. In: Validation of Stochastic Systems. LNCS, 2925. (2004) 445-465
26. Spaey, K., van Houdt, B., Blondia, C.: On the generality of binary treelike Markov chains. In: Markov Aniversary Meeting. Boston Books (2006) 79-88
27. Takine, T., Sengupta, B., Yeung, R. W.: A generalization of the matrix M/G/1 paradigm for Markov chains with a tree structure. Stochastic Models 11 (1995) 411-421
28. van Houdt, B., Blondia, C.: Throughput of Q-ary splitting algorithms for contention resolution in communication networks. Commun. Inform. Sys. 4 (2005) 135-164
29. van Houdt, B., Blondia, C.: Analyzing priority queues with 3 classes using tree-like processes. Queueing Systems 54 (2006) 99-109
30. van Velthoven, J., van Houdt, B., Blondia, C.: Transient analysis of tree-like processes and its application to random access systems. SIGMETRICS/Performance 34 (2006) 181-190
31. Yeung, R., Alfa, A.: The Quasi-Birth-Death type Markov chain with a tree structure. Stochastic Models 15 (1999) 639-659
32. Zhang, L., Hermanns, H., Moritz Hahn, E., Wachter, B.: Time-bounded model checking of infinite-state continuous-time Markov chains. In: ACSD. IEEE CS Press (2008) 98-107