Model-checking large structured Markov chains

Journal of Logic and Algebraic Programming

Volumn 56, Issue 1-2 SPEC., 2003, Pages 69-97

  Buchholz, Peter ^a   Katoen, Joost Pieter ^b   Kemper, Peter ^c   Tepper, Carsten ^c  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Kronecker algebra; Markov chains; Model checking; Stochastic bisimulation; Structured analysis

Indexed keywords

ALGEBRA; ALGORITHMS; COMPUTER SIMULATION; LARGE SCALE SYSTEMS; QUEUEING NETWORKS; STATE SPACE METHODS; STOCHASTIC PROGRAMMING;

CONTINUOUS STOCHASTIC LOGIC (CSL); MODEL-CHECKING;

MARKOV PROCESSES;

EID: 0038219973     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1567-8326(02)00067-X     Document Type: Article

References (44)

1. Aziz A., Sanwal K., Singhal V., Brayton R. Verifying continuous time Markov chains. Alur R., Henzinger T.A. Computer-Aided Verification, LNCS 1102. 1996;269-276 Springer-Verlag, Berlin.
2. Aziz A., Sanwal K., Singhal V., Brayton R. Model checking continuous time Markov chains. ACM Trans. Comput. Logic. 1(1):2000;162-170.
3. Bahar I., Frohm E., Gaona C., Hachtel G., Macii E., Pardo A., Somenzi F. Algebraic decision diagrams and their applications. Formal Meth. Syst. Des. 10(2/3):1997;171-206.
4. Baier C., Haverkort B.R., Hermanns H., Katoen J.-P. On the logical characterisation of performability properties. Montanari U., Rolim J.D.P., Welzl E. Automata, Languages, and Programming (ICALP) LNCS 1853. 2000;780-792 Springer-Verlag, Berlin.
5. Baier C., Haverkort B.R., Hermanns H., Katoen J.-P. Model checking continuous-time Markov chains by transient analysis. Emerson E.A., Sistla A.P. Computer-Aided Verification, LNCS 1855. 2000;358-372 Springer-Verlag, Berlin.
6. Baier C., Katoen J.-P., Hermanns H. Approximate symbolic model checking of continuous-time Markov chains. Baeten J.C.M., Mauw S. Concurrency Theory, LNCS 1664. 1999;146-162 Springer-Verlag, Berlin.
7. Bryant R. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8):1986;677-691.
8. Buchholz P. Die Strukturierte Analyse Markovscher Modelle, IFB 282. 1991;Springer, Berlin.
9. P. Buchholz, Markovian process algebra: composition and equivalence, in: U. Herzog, M. Rettelbach (Eds.), Proc. of the 2nd Work. on Process Algebras and Perf. Modelling, vol. 27, Arbeitsberichte des IMMD, University of Erlangen, 1994, pp. 11-30.
10. Buchholz P. Hierarchical Markovian models: symmetries and reduction. Perform. Eval. 22:1995;93-110.
11. Buchholz P. Efficient computation of equivalent and reduced representations for stochastic automata. Int. J. Comput. Syst. Sci. Eng. 15(2):2000;93-103.
12. Buchholz P. Hierarchical structuring of superposed GSPNs. IEEE Trans. Softw. Eng. 25(2):1999;166-181.
13. Buchholz P. Structured analysis approaches for large Markov chains. Appl. Numer. Math. 31(4):1999;375-404.
14. Buchholz P., Ciardo G., Donatelli S., Kemper P. Complexity of Kronecker operations and sparse matrices with applications to the solution of Markov models. INFORMS J. Comput. 12(3):2000;203-222.
15. P. Buchholz, M. Fischer, P. Kemper, C. Tepper, New features in the APNN toolbox, in: P. Kemper (Ed.), Tools of Aachen 2001 Int. Multiconference on Measurement, Modeling and Evaluation of Computer-Communication Systems, Universität Dortmund, Fachbereich Informatik, Forschungsbericht Nr. 760, 2001, pp. 62-68.
16. Buchholz P., Kemper P. Efficient computation and representation of large reachability sets for composed automata. Discrete Event Dyn. Syst. - Theory Applic. 12(3):2002;265-286.
17. Campos J., Silva M., Donatelli S. Structured solution of asynchronously communicating stochastic modules. IEEE Trans. Softw. Eng. 25(2):1999;147-165.
18. Chiola G., Ajmone-Marsan M., Balbo G., Conte G. Generalized stochastic Petri nets: a definition at the net level and its implications. IEEE Trans. Softw. Eng. 19(2):1993;89-107.
19. Ciardo G. Distributed and structured analysis approaches to study large and complex systems. Brinksma E., Hermanns H., Katoen J.-P. Lectures on Formal Methods and Performance Analysis, LNCS 2090. 2001;344-374 Springer-Verlag, Berlin.
20. Ciardo G., Miner A.S. A data structure for the efficient Kronecker solution of GSPNs. Buchholz R., Silva M. Proc. 8th Int. Workshop on Petri Nets and Perf. Models. 1999;22-31 IEEE CS-Press.
21. Clarke E., Emerson E., Sistla A. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Program. Languages Syst. 8:1986;244-263.
22. Clarke E., Fujita M., McGeer P.C., Yang J.C.-Y. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Meth. Syst. Des. 10(2/3):1997;149-169.
23. Clarke E.M., Grumberg O., Peled D.A. Model Checking. 1999;MIT Press.
24. Donatelli S. Superposed stochastic automata: a class of stochastic Petri nets amenable to parallel solution. Perform. Eval. 18:1994;21-36.
25. Donatelli S., Kemper P. Integrating synchronization with priority into a Kronecker representation. Perform. Eval. 44(1-4):2001;73-96.
26. Fox B.L., Glynn P.W. Computing Poisson probabilities. Commun. ACM. 31:1988;440-445.
27. Gross D., Miller D. The randomization technique as a modeling tool and solution procedure for transient Markov processes. Oper. Res. 32(2):1984;926-944.
28. Hansson H., Jonsson B. A logic for reasoning about time and reliability. Formal Aspects Comput. 6:1994;512-535.
29. Haverkort B.R., Hermanns H., Katoen J.-P. The use of model checking techniques for quantitative dependability evaluation. IEEE Symp. on Reliable Distr. Sys. 2000;228-238 IEEE CS Press.
30. Haverkort B.R., Trivedi K.S. Specification techniques for Markov reward models. Discrete Event Syst.: Theory Applic. 3:1993;219-247.
31. Hermanns H., Herzog U., Katoen J.-P. Process algebra for performance evaluation. Theor. Comput. Sci. 274:2002;43-87.
32. Hermanns H., Katoen J.-P., Meyer-Kayser J., Siegle M. A Markov chain model checker. Graf S., Schwartzbach M. Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785. 2000;347-362 Springer-Verlag, Berlin.
33. Hermanns H., Rettelbach M., Weiss T. Formal characterisation of immediate actions in SPA with non-deterministic branching. The Comput. J. 38(7):1995;530-542.
34. Hermanns H., Siegle M. Bisimulation algorithms for stochastic process algebras and their BDD-based implementation. Katoen J.-P. Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601. 1999;244-265 Springer-Verlag, Berlin.
35. Hillston J. A Compositional Approach to Performance Modelling. 1996;Cambridge University Press.
36. Katoen J.-P., Kwiatkowska M., Norman G., Parker D. Faster and symbolic CTMC model checking. de Alfaro L., Gilmore S. Process Algebra and Probabilistic Methods, LNCS 2165. 2001;23-38 Springer-Verlag, Berlin.
37. Kemper P. Reachability analysis based on structured representations. Billington J., Reisig W. Application and Theory of Petri Nets 1996, LNCS 1091. 1996;269-288 Springer-Verlag, Berlin.
38. Kemper P. Numerical analysis of superposed GSPNs. IEEE Trans. Softw. Eng. 22(9):1996;615-628.
39. Kemper P. Transient analysis of superposed GSPNs. IEEE Trans. Softw. Eng. 25(2):1999;182-193.
40. P. Kemper, R. Lübeck, Model checking based on Kronecker algebra, Technical Report 669, Fachbereich Informatik, Universität Dortmund (Germany), 1998.
41. Kwiatkowska M., Norman G., Parker D. Probabilistic symbolic model checking with PRISM: a hybrid approach. Katoen J.-P., Stevens P. Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2280. 2002;52-67 Springer-Verlag, Berlin.
42. Plateau B. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. Perform. Eval. Rev. 13:1985;142-154.
43. Stewart W.J. Introduction to the Numerical Solution of Markov Chains. 1994;Princeton University Press.
44. Tarjan R. Depth-first search and linear graph algorithms. SIAM. J. Comput. 1:1972;146-160.