Abstraction for stochastic systems by Erlang's method of stages

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

Volumn 5201 LNCS, Issue , 2008, Pages 279-294

  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 EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT MODELS; ABSTRACTION TECHNIQUES; CASE STUDIES; CONTINUOUS STOCHASTIC LOGICS; CONTINUOUS-TIME; MARKOV CHAINS; POISSON PROCESSES; QUANTITATIVE ANALYSES; RESIDENCE TIMES; STOCHASTIC SYSTEMS; SUBSTRATE CONVERSIONS; TRANSITION PROBABILITIES; VALUED SEMANTICS; VERIFICATION RESULTS;

BIOCHEMISTRY; INFORMATION THEORY; MARKOV PROCESSES; POISSON DISTRIBUTION; RISK ASSESSMENT; STOCHASTIC PROGRAMMING;

ABSTRACTING;

EID: 54249084937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_24     Document Type: Conference Paper

References (28)

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.: Efficient computation of timebounded 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. Bower, J.M., Bolouri, H.: Computational Modeling of Genetic and Biochemical Networks. MIT Press, Cambridge (2001)
6. Busch, H., Sandmann, W., Wolf, V.: A numerical aggregation algorithm for the enzymecatalyzed substrate conversion. In: Priami, C. (ed.) CMSB 2006. LNCS (LNBI), vol. 4210, pp. 298-311. Springer, Heidelberg (2006)
7. Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. Journal of the ACM 42, 857-907 (1995)
8. 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. (eds.) PROBMIV 2001. LNCS, vol. 2165, pp. 39-56. Springer, Heidelberg (2001)
9. de Alfaro, L., Pritam, R.: Magnifying-lens abstraction for Markov decision processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 325-338. Springer, Heidelberg (2007)
10. Fecher, H., Leucker, M., Wolf, V.: Don't know in probabilistic systems. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 71-88. Springer, Heidelberg (2006)
11. Feller, W.: An Introduction to Probability Theory and its Applications, vol. I. John Wiley & Sons, Inc., Chichester (1968)
12. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 512-535 (1994)
13. Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. TCS 274, 43-87 (2002)
14. Hermanns, H., Wachter, B., Zhang, L.: Probabilistic CEGAR. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123. Springer, Heidelberg (2008)
15. Kampen, N.G.v.: Stochastic Processes in Physics and Chemistry, 3rd edn. Elsevier, Amsterdam (2007)
16. Katoen, J.-P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 87-102. Springer, Heidelberg (2007)
17. Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Three-valued abstraction for continuous-time Markov chains. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 316-329. Springer, Heidelberg (2007)
18. Katoen, J.-P., Klink, D., Leucker, M., Wolf, V.: Abstraction for stochastic systems by Erlang's method of stages. Technical Report AIB-2008-12, RWTH Aachen University (2008)
19. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST, pp. 157-166. IEEE CS Press, Los Alamitos (2006)
20. 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)
21. Mamoun, M.B., Pekergin, N., Younes, S.: Model checking of CTMCs by closed-form bounding distributions. In: QEST, pp. 189-199. IEEE CS Press, Los Alamitos (2006)
22. Remke, A., Haverkort, B., Cloth, L.: CSL model checking algorithms for QBDs. TCS 382, 24-41 (2007)
23. Ross, S.: Stochastic Processes. John Wiley and Sons, Chichester (1996)
24. Sen, K., Viswanathan, M., Agha, G.: Model-checking Markov chains in the presence of uncertainties. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 394-410. Springer, Heidelberg (2006)
25. Stewart, W.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1995)
26. Wolf, V., Baier, C., Majster-Cederbaum, M.: Trace machines for observing continuous-time Markov chains. ENTCS 153, 259-277 (2004)
27. Younes, H., Simmons, R.: Statistical probabilistic model checking with a focus on timebounded properties. Inf. and Comp. 204, 1368-1409 (2007)
28. Zhang, L., Hermanns, H., Eisenbrand, F., Jansen, D.N.: Flow faster: efficient decision algorithms for probabilistic simulations. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 155-170. Springer, Heidelberg (2007)