Activity-local symbolic state graph generation for high-level stochastic models

2006 13th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, MMB 2006

Volumn , Issue , 2006, Pages

  Lampka, Kai ^a   Siegle, Markus ^a  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK MODELS; HIGH-LEVEL MODELING; MULTI-TERMINAL BINARY DECISION DIAGRAMS; STOCHASTIC PETRI NETS; STOCHASTIC PROCESS ALGEBRAS; SYMBOLIC REACHABILITY ANALYSIS; SYMBOLIC REPRESENTATION; SYMBOLIC STATE;

BINARY DECISION DIAGRAMS; MARKOV PROCESSES;

COMMUNICATION SYSTEMS;

EID: 84892660384     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. J.R. Burch, E.M. Clarke, and D.E. Long. Symbolic model checking with partitioned transition relations. In Int. Conf. on Very Large Scale Integration, pages 49-58, Edinburgh, 1991. North-Holland.
2. R.E. Bryant. Graph-based Algorithms for Boolean Function Manipulation. IEEE ToC, C-35(8):677-691, August 1986.
3. G. Ciardo and A. S. Miner. Efficient reachability set generation and storage using decision diagrams. In Proc. of ATPN, LNCS 1639, pages 6-25, 1999.
4. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In Proc. of TACAS, LNCS 2619, 2003.
5. G. Ciardo and K. Trivedi. A decomposition approach for stochastic reward net models. Performance Evaluation, 18(1):37-59, 1993.
6. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, 1996.
7. D. Deavours, G. Clark, T. Courtney, D. Daly, S. Derisavi, J. Doyle, W.H. Sanders, and P. Webster. The Moebius Framework and Its Implementation. IEEE Transactions on Software Engineering, 28(10):956-969, 2002.
8. I. Davies, W.J. Knottenbelt, and P.S. Kritzinger. Symbolic Methods for the State Space Exploration of GSPN Models. In Proc. of TOOLS, pages 188-199. LNCS 2324, 2002.
9. S. Derisavi, P. Kemper, and W. H. Sanders. Symbolic State-space Exploration and Numerical Analysis of State-sharing Composed Models. Linear Algebra and its Applications (LAA), 386:137-166, 2004.
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. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems. An Approach to the State-Explosion Problem. PhD thesis, Université de Liege, 1995.
12. H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In Proc. of 3'rd NSMC, pages 188-207. Prensas Universitarias de Zaragoza, 1999.
13. M. Kuntz and M. Siegle. Deriving Symbolic Representations from Stochastic Process Algebras. In Proc. of PAPM-PROBMIV, LNCS 2399, pages 1-22, 2002.
14. M. Kuntz, M. Siegle, and E. Werner. Symbolic Performance and Dependability Evaluation with the Tool CASPA. In Proc. of EPEW, pages 293-307. Springer, LNCS 3236, 2004.
15. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. Multivalued decision diagrams: theory and applications. Multiple-Valued Logic, 4(1-2):9-62, 1998.
16. K. Lampka and M. Siegle. Symbolic Composition within the Moebius Framework. In Proc. of 2nd MMB Workshop, pages 63-74, September 2002. Forschungsbericht der Universität Hamburg Fachbereich Informatik.
17. K. Lampka and M. Siegle. MTBDD-based activity-local state graph generation. In Proc. of PMCCS 6, pages 15-18, 2003.
18. S. Minato. Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems. In Proc. of DAC, pages 272-277, Dallas (Texas), USA, June 1993. ACM Press.
19. A. Miner. Efficient solution of GSPNs using matrix diagrams. In Proc. of PNPM, pages 101-110. IEEE Computer Society Press, 2001.
20. A. Miner. Saturation for a general class of models. In Proc. of QEST, pages 282-291. IEEE Computer Society Press, 2004.
21. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems, Ph.D. Thesis, University of Birmingham (U.K.), 2002.
22. E. Pastor, O. Roig, and J. Cortadella. Symbolic Petri Net Analysis using Boolean Manipulation. Technical report, Univ. Politec. de Catalunya, DAC/UPC Report No. 97/8, 1997.
23. E. Pastor, O. Roig, J. Cortadella, and R.M. Badia. Petri Net Analysis Using Boolean Manipulation. In R. Valette, editor, Proc. of ATPN, LNCS 815, pages 416-435. Springer, June 1994.
24. PRISM web page. http://www.cs.bham.ac.uk/~dxp/prism/.
25. M. Siegle. Compact representation of large performability models based on extended BDDs. In Proceedings of PMCCS 4, pages 77-80, Williamsburg, VA, Sept. 1998.
26. M. Siegle. Behaviour analysis of communication systems: Compositional modelling, compact representation and analysis of performability properties. Shaker Verlag Aachen, 2002.
27. W. H. Sanders and L. M. Malhis. Dependability evaluation using composed SAN-based reward models. Journal of Parallel and Distributed Computing, 15:238-254, 1992.
28. F. Somenzi. CUDD Package, Release 2.4.x. http://vlsi.colorado.edu/~fabio.
29. M. Woodside and Y. Li. Performance Petri net analysis of communications protocol software by delay-equivalent aggregation. In Proc. of 4th PNPM, pages 64-73, 1991.