Model checking interactive Markov chains

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

Volumn 6015 LNCS, Issue , 2010, Pages 53-68

  Zhang, Lijun ^a   Neuhäußer, Martin R ^b,c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATION PROPERTY; CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME MARKOV CHAIN; INTERACTIVE MARKOV CHAINS; LABELLED TRANSITION SYSTEMS; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; STATE SPACE;

COMPUTER SOFTWARE; CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; SEMICONDUCTING INTERMETALLICS; ALGORITHMS; CHAINS; SEMANTICS; STOCHASTIC SYSTEMS;

MODEL CHECKING;

EID: 77951614372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12002-2_5     Document Type: Conference Paper

References (26)

1. Ash, R., Doléans-Dade, C.: Probability & Measure Theory, 2nd edn. Academic Press, London (2000)
2. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.K.: Verifying continuous time Markov chains. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 269-276. Springer, Heidelberg (1996)
3. Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29, 524-541 (2003)
4. Baier, C., Hermanns, H., Katoen, J.-P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comp. Sci. 345, 2-26 (2005)
5. Bertsekas, D.: Dynamic Programming and Optimal Control, vol. II. Athena Scientific, Belmont (1995)
6. Bianco, A., de Alfaro, L.: Model checking of probabilistic and nondeterministic systems. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol. 1026, pp. 499-513. Springer, Heidelberg (1995) (Pubitemid 126012732)
7. Böde, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Rakow, J., Wimmer, R., Becker, B.: Compositional dependability evaluation for STATEMATE. IEEE Trans. Software Eng. 35, 274-292 (2009)
8. Boudali, H., Crouzen, P., Haverkort, B.R., Kuntz, M., Stoelinga, M.: Architectural dependability evaluation with Arcade. In: DSN, pp. 512-521. IEEE, Los Alamitos (2008)
9. Bouyer, P., Forejt, V.: Reachability in stochastic timed games. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 103-114. Springer, Heidelberg (2009)
10. Bravetti, M., Hermanns, H., Katoen, J.-P.: YMCA: Why Markov chain algebra? In: Essays on Algebraic Process Calculi. Electronic Notes in Theoretical Computer Science, vol. 162, pp. 107-112. Elsevier, Amsterdam (2006)
11. Brazdil, T., Forejt, V., Krcal, J., Kretinsky, J., Kucera, A.: Continuous-time stochastic games with time-bounded reachability. In: FSTTCS. LIPIcs (2009) (to appear)
12. Cerotti, D., Donatelli, S., Horváth, A., Sproston, J.: CSL model checking for generalized stochastic Petri nets. In: QEST, pp. 199-210. IEEE, Los Alamitos (2006) (Pubitemid 351424362)
13. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: ACM Symposium on Theory of Computing. ACM, New York (1987)
14. Coste, N., Garavel, H., Hermanns, H., Hersemeule, R., Thonnart, Y., Zidouni, M.: Quantitative evaluation in embedded system design: Validation of multiprocessor multithreaded architectures. In: DATE, pp. 88-89. IEEE, Los Alamitos (2008)
15. Coste, N., Hermanns, H., Lantreibecq, E., Serwe, W.: Towards performance prediction of compositional models in industrial GALS designs. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification. LNCS, vol. 5643, pp. 204-218. Springer, Heidelberg (2009)
16. Haverkort, B.R., Hermanns, H., Katoen, J.-P.: On the use of model checking techniques for dependability evaluation. In: Reliable Distributed Systems, pp. 228-239. IEEE, Los Alamitos (2000) (Pubitemid 32026844)
17. Hermanns, H. (ed.): Interactive Markov Chains: The Quest for Quantified Quality. LNCS, vol. 2428. Springer, Heidelberg (2002)
18. Hermanns, H., Herzog, U., Katoen, J.-P.: Process algebra for performance evaluation. Theor. Comp. Sci. 274, 43-87 (2002)
19. Hermanns, H., Katoen, J.-P.: Automated compositional Markov chain generation for a plain-old telephone system. Sci. Comput. Program. 36, 97-127 (2000)
20. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
21. Johr, S.: Model Checking Compositional Markov Systems. PhD thesis, Saarland University, Saarbrücken, Germany (2007)
22. Maciá, H., Valero, V., Cuartero, F., Ruiz, M.C.: sPBC: A Markovian extension of Petri box calculus with immediate multiactions. Fundamenta Informaticae 87, 367-406 (2008)
23. Neuhäußer, M.R.: Model Checking Nondeterministic and Randomly Timed Systems. PhD thesis, RWTH Aachen University, Aachen, Germany (2010)
24. Neuhäußer, M.R., Stoelinga, M., Katoen, J.-P.: Delayed nondeterminism in continuous-time Markov decision processes. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 364-379. Springer, Heidelberg (2009)
25. Neuhäußer, M.R., Zhang, L.: Time-bounded reachability in continuous-time Markov decision processes. Technical report, RWTH Aachen University (2009)
26. Pulungan, R.: Reduction of Acyclic Phase-Type Representations. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany (2009)