Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications

Formal Methods in System Design

Volumn 36, Issue 3, 2010, Pages 198-222

  Lampka, Kai ^c   Siegle, Markus ^a   Ossowski, Joern ^b   Baier, Christel ^b  

^a BUNDESWEHR UNIVERSITY MUNICH   (Germany)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c NONE

Author keywords

Binary Decision Diagrams and their algorithms; Quantitative verification of systems; Symbolic data structures for performance analysis

Indexed keywords

BEST CHOICE; CANONICAL REPRESENTATIONS; COMPLEX SYSTEMS; DECISION DIAGRAM; FINITE FUNCTIONS; FUNCTION VARIABLES; HIGH-LEVEL MODELS; INPUT SET; MARKOVIAN; MULTI TERMINALS; MULTI-TERMINAL BINARY DECISION DIAGRAMS; MULTIVALUED FUNCTIONS; NEW APPROACHES; PROBABILISTIC MODEL CHECKING; QUANTITATIVE ANALYSIS; QUANTITATIVE VERIFICATION; QUANTITATIVE VERIFICATION OF SYSTEMS; STANDARD TYPE; STATE GRAPHS; SYMBOLIC DATA STRUCTURES FOR PERFORMANCE ANALYSIS;

ALGORITHMS; DATA HANDLING; DECISION THEORY; MODEL CHECKING;

BINARY DECISION DIAGRAMS;

EID: 77956753699     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-010-0095-8     Document Type: Article

References (27)

1. Formal Methods in System Design (1997) 10(2-3). Special Issue on Multi-Terminal Binary Decision Diagrams
2. SB Akers 1978 Binary decision diagrams IEEE Trans Comput C-27 6 509 516 10.1109/TC.1978.1675141
3. Balbo G, Conte G, Donatelli S, Franceschinis G, Ajmone Marsan M, Ajmone Marsan M (1995) Modelling with generalized stochastic Petri nets. Wiley, New York
4. RE Bryant 1986 Graph-based algorithms for Boolean function manipulation IEEE Trans Comput C-35 8 677 691 10.1109/TC.1986.1676819
5. G Ciardo G Lüttgen AS Miner 2007 Exploiting interleaving semantics in symbolic state-space generation Form Methods Syst Des 31 1 63 100 1118.68533 10.1007/s10703-006-0033-y (Pubitemid 46981157)
6. de Alfaro L, Kwiatkowska M, Norman G, Parker D, Segala R (2000) Symbolic model checking for probabilistic processes using MTBDDs and the Kronecker representation. In: Graf S, Schwartzbach M (eds) Proc. of the 6th int. conference on tools and algorithms for the construction and analysis of systems (TACAS'00). LNCS, vol 1785. Springer, Berlin, pp 395-410
7. H Hermanns U Herzog V Mertsiotakis 1998 Stochastic process algebras-between LOTOS and Markov chains Comput Netw ISDN Syst 30 9-10 901 924 10.1016/S0169-7552(97)00133-5
8. H Hermanns M Kwiatkowska G Norman D Parker M Siegle 2003 On the use of MTBDDs for performability analysis and verification of stochastic systems J Log Algebr Program 56 1-2 23 67 1054.68018 10.1016/S1567-8326(02)00066-8 1991579
9. JINC BDD package. www.jossowski.de
10. T Kam T Villa R Brayton A Sangiovanni-Vincentelli 1998 Multi-valued decision diagrams: theory and applications Mult Valued Log 4 1-2 9 62 1025.94515 1760331
11. Kuntz M, Siegle M, Werner E (2004) Symbolic performance and dependability evaluation with the tool CASPA. In: Proc. of EPEW. LNCS, vol 3236. Springer, Berlin, pp 293-307
12. Lampka K, Siegle M (2006) Activity-local state graph generation for high-level stochastic models. In: Meassuring, modeling, and evaluation of systems 2006, April 2006, pp 245-264
13. Lampka K, Siegle M (2006) Analysis of Markov reward models using zero-supressed multi-terminal decision diagrams. In: Proceedings of VALUETOOLS 2006 (CD-edition), October 2006
14. CY Lee 1959 Representation of switching circuits by binary-decision programs Bell Syst Tech J 38 985 999
15. Minato S (1993) Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of the 30th ACM/IEEE design automation conference (DAC), Dallas (Texas), USA, June 1993, pp 272-277
16. S Minato 2001 Zero-suppressed BDDs and their applications Int J Softw Tools Technol Transf 3 2 156 170 1002.68589
17. Miner A, Parker D (2004) Symbolic representations and analysis of large state spaces. In: Baier Ch, Haverkort B, Hermanns H, Katoen J-P, Siegle M (eds) Validation of stochastic systems, Dagstuhl (Germany), 2004. LNCS, vol 2925. Springer, Berlin, pp 296-338
18. Möbius web page. www.moebius.crhc.uiuc.edu
19. J Ossowski C Baier 2008 A uniform framework for weighted decision diagrams and its implementation Int J Softw Tools Technol Transf 10 5 425 441 10.1007/s10009-008-0069-y
20. PRISM. www.prismmodelchecker.org
21. PROMOC modeling tool. www.jossowski.de
22. Sasao T, Fujita M (eds) (1996) Representations of discrete functions, vol 1. Kluwer Academic, Dordrecht
23. Shannon CS (2000) Eine symbolische Analyse von Relaisschaltkreisen. In: Ein/Aus. Brinkmann und Bose, Berlin. The article originally appeared with the title: A symbolic analysis of switching circuits in Trans. AIEE 57 (1938), 713
24. Siegle M (2001) Advances in model representation. In: de Alfaro L, Gilmore S (eds) Proc. of the joint int. workshop, PAPM-PROBMIV 2001, Aachen (Germany). LNCS, vol 2165. Springer, Berlin, pp 1-22
25. SMART. www.cs.ucr.edu/~ciardo/SMART
26. Somenzi F (1998) CUDD: Colorado University decision diagram package release
27. Wegener I (2000) Branching programs and binary decision diagrams. SIAM, Philadelphia