Symbolic performance and dependability evaluation with the tool CASPA

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

Volumn 3236, Issue , 2004, Pages 293-307

  Kuntz, Matthias ^a   Siegle, Markus ^a   Werner, Edith ^b  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

^b UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BINARY DECISION DIAGRAMS; COMPUTATION THEORY; CONTINUOUS TIME SYSTEMS; FORMAL METHODS; MARKOV PROCESSES; RANDOM PROCESSES; STOCHASTIC SYSTEMS;

ALGEBRAIC SPECIFICATIONS; CONTINUOUS TIME MARKOV CHAIN; DEPENDABILITY EVALUATION; MARKOVIAN STOCHASTIC PROCESS; MODEL CONSTRUCTION; MULTI-TERMINAL BINARY DECISION DIAGRAMS; PERFORMANCE EVALUATION TOOLS; PROCESS ALGEBRAS;

INTEGRATION TESTING;

EID: 33845214157     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30233-9_22     Document Type: Article

References (26)

1. AT&T. Drawing graphs with dot http://www.research.att.com.
2. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic Decision Diagrams and their Applications. Formal Methods in System Design, 10(2/3):171-206, April/May 1997.
3. R. E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. I EEE Transactions on Computers, C-35(8):677-691, August 1986.
4. G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu. SMART: Stochastic Model Analyzer for Reliability and Timing. In Tools of Aachen 2001 Int. Multiconference on Measurement, Modelling and Evaluation of Computer Communication Systems, pages 29-34, 2001.
5. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. Technical Report 96-35, ICASE, 1996.
6. daVinci V2.1. http://www.informatik.uni-bremen.de/davinci/.
7. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic Model Checking for Probabilistic Processes using MTBDDs and the Kronecker Representation. In TACAS'2000, pages 395-410. Springer LNCS 1785, 2000.
8. S. Derisavi, P. Kemper, and W. H. Sanders. Symbolic State-Space Exploration and Numerical Analysis of State-Sharing Composed Models. In Fourth Int. Conf. on the Numerical Solution of Markov Chains, pages 167-18167-189, 2003.
9. E. Frank. Codierung und numerische Analyse von Transitionssystemen unter Verwendung von MTBDDs. Student's thesis, Universität Erlangen- Nürnberg, IMMD VII, 1999 (in German).
10. M. Fujita, P. McGeer, and J. C.-Y. Yang. Multi-terminal Binary Decision Diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10 (2/3):149-169, April/May 1997.
11. S. Gilmore and L. Kloul. A unified tool for performance modelling and prediction. In Proc. 22nd Int. Conf. on Computer Safety, Reliability and Security (SAFECOMP 2003), pages 179-192, 2003. LNCS 2788.
12. H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, and M. Siegle. Compositional performance modelling with the TIPPtool. Performance Evaluation, 39(l-4):5-35, January 2000.
13. H. Hermanns, M. Kwiatkowska, G. Norman, D. Parker, and M. Siegle. On the use of MTBDDs for performability analysis and verification of stochastic systems. Journal of Logic and Algebraic Programming, 56 (l-2):23-67, 2003.
14. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In 3rd Int. Workshop on the Numerical Solution of Markov Chains, pages 188-207. Prensas Universitarias de Zaragoza, 1999.
15. H. Hermanns and M. Rettelbach. Syntax, Semantics, Equivalences, and Axioms for MTIPP. In Proc. of PAPM'94, pages 71-88. Arbeitsberichte des IMMD 27 (4), Universität Erlangen-Nürnberg, 1994.
16. O. C. Ibe and K. S. Trivedi. Stochastic Petri Net Models of Polling Systems. I EEE Journal on Selected Areas in Communications, 8(9):1649-1657, December 1990.
17. J.-P. Katoen, M. Kwiatkowska, G. Norman, and D. Parker. Faster and Symbolic CTMC Model Checking. In PAP M-PROB M IV' 0 l, pages 23-38. Springer, LNCS 2165, 2001.
18. M. Kuntz and M. Siegle. Deriving symbolic representations from stochastic process algebras. In Process Algebra and Probabilistic Methods, Proc. PAP MPROB M I V'02, pages 188-206. Springer, LNCS 2399, 2002.
19. M. Kuntz and M. Siegle. A stochastic extension of the logic PDL. In Sixth Int. Workshop on Performability Modeling of Computer and Communication Systems (PMCCS6), pages 58-61, Monticello, Illinois, 2003.
20. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic Symbolic Model Checker. In MMB-PNP M-PAP M-PROBM I V Tool Proceedings, pages 712. Univ. Dortmund, Informatik IV, Bericht 760/2001, 2001.
21. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. In TACAS'2002, pages 52-66. Springer LNCS 2280, April 2002.
22. D. Parker. Implementation of symbolic model checking for probabilistic systems. PhD thesis, School of Computer Science, Faculty of Science, University of Birmingham, 2002.
23. W. H. Sanders and L. M. Malhis. Dependability evaluation using composed SANbased reward models. Journal of Parallel and Distributed Computing, 15 (3):238254, 1992.
24. M. Siegle. Behaviour analysis of communication systems: Compositional modelling, compact representation and analysis of performability properties. Shaker Verlag, Aachen, 2002.
25. F. Somenzi. CUDD: Colorado University Decision Diagram Package, Release 2.3.1. User's Manual and Programmer's Manual, February 2001.
26. E. Werner. Leistungsbewertung mit Multi-Terminalen Binären Entscheidungsdiagrammen. Master's thesis, Universität Erlangen- Nürnberg, Informatik 7, 2003 (in German).