Skip to main content
SpringerLink
Log in

Data Representation and Efficient Solution: A Decision Diagram Approach

  • Chapter
Formal Methods for Performance Evaluation (SFM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4486))

Abstract

Decision diagrams are a family of data structures that can compactly encode many functions on discrete structured domains, that is, domains that are the cross-product of finite sets. We present some important classes of decision diagrams and show how they can be effectively employed to derive “symbolic” algorithms for the analysis of large discrete-state models. In particular, we discuss both explicit and symbolic algorithms for state-space generation, CTL model-checking, and continuous-time Markov chain solution. We conclude with some suggestions for future research directions.

Work supported in part by the National Science Foundation under grants CNS-0501747 and ATM-0428880.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bahar, R.I., Frohm, E.A., Gaona, C.M., Hachtel, G.D., Macii, E., Pardo, A., Somenzi, F.: Algebraic decision diagrams and their applications. Formal Methods in System Design 10(2-3), 171–206 (1997)

    Article  Google Scholar 

  2. Bollig, B., Wegener, I.: Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comp. 45(9), 993–1002 (1996)

    Article  MATH  Google Scholar 

  3. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. 35(8), 677–691 (1986)

    Article  MATH  Google Scholar 

  4. Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv. 24(3), 293–318 (1992)

    Article  Google Scholar 

  5. Buchholz, P.: Structured analysis approaches for large Markov chains. Applied Numerical Mathematics 31(4), 375–404 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Buchholz, P., Ciardo, G., Donatelli, S., Kemper, P.: Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp. 12(3), 203–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Buchholz, P., Katoen, J.P., Kemper, P., Tepper, C.: Model-checking large structured Markov chains. J. Logic & Algebraic Progr. 56(1-2), 69–97 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: Halaas, A., Denyer, P.B. (eds.) Int. Conference on Very Large Scale Integration, Edinburgh, Scotland, Aug. 1991. IFIP Transactions, pp. 49–58. North-Holland, Amsterdam (1991)

    Google Scholar 

  9. Ciardo, G., Jones, R.L., Miner, A.S., Siminiceanu, R.: Logical and stochastic modeling with SMART. Perf. Eval. 63, 578–608 (2006)

    Article  Google Scholar 

  10. Ciardo, G., Lüttgen, G., Yu, A.J.: Improving Static Variable Orders Via Invariants. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 83–103. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Ciardo, G., Marmorstein, R., Siminiceanu, R.I.: Saturation Unbound. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 379–393. Springer, Heidelberg (2003)

    Google Scholar 

  12. Ciardo, G., Marmorstein, R., Siminiceanu, R.: The saturation algorithm for symbolic state space exploration. Software Tools for Technology Transfer 8(1), 4–25 (2006)

    Article  Google Scholar 

  13. Ciardo, G., Miner, A.S.: A data structure for the efficient Kronecker solution of GSPNs. In: Buchholz, P. (ed.) Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM’99), Zaragoza, Spain, Sep. 1999, pp. 22–31. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  14. Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 256–273. Springer, Heidelberg (2002)

    Google Scholar 

  15. Ciardo, G., Siminiceanu, R.I.: Structural Symbolic CTL Model Checking of Asynchronous Systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 40–53. Springer, Heidelberg (2003)

    Google Scholar 

  16. Ciardo, G., Yu, A.J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Borrione, D., Paul, W. (eds.) CHARME 2005. LNCS, vol. 3725, pp. 146–161. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  18. Davio, M.: Kronecker products and shuffle algebra. IEEE Trans. Comp. 30, 116–125 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  19. Deavours, D.D., Sanders, W.H.: “On-the-fly” solution techniques for stochastic Petri nets and extensions. In: Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM’97), Saint-Malo, France, June 1997, pp. 132–141. IEEE Computer Society Press, Los Alamitos (1997)

    Google Scholar 

  20. Fernandes, P., Plateau, B., Stewart, W.J.: Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM 45(3), 381–414 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  21. Fujita, M., McGeer, P.C., Yang, J.C.-Y.: Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Methods in System Design 10, 149–169 (1997)

    Article  Google Scholar 

  22. Grumberg, O., Livne, S., Markovitch, S.: Learning to order BDD variables in verification. J. Art. Int. Res. 18, 83–116 (2003)

    MATH  MathSciNet  Google Scholar 

  23. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  24. Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.: Multi-valued decision diagrams: theory and applications. Multiple-Valued Logic 4(1–2), 9–62 (1998)

    MATH  MathSciNet  Google Scholar 

  25. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. D. Van Nostrand-Reinhold, New York (1960)

    MATH  Google Scholar 

  26. Lai, Y.-T., Sastry, S.: Edge-valued binary decision diagrams for multi-level hierarchical verification. In: Proceedings of the 29th Conference on Design Automation, June 1992, pp. 608–613. IEEE Computer Society Press, Los Alamitos (1992)

    Chapter  Google Scholar 

  27. Miner, A.S.: Efficient solution of GSPNs using canonical matrix diagrams. In: German, R., Haverkort, B. (eds.) Proc. 9th Int. Workshop on Petri Nets and Performance Models (PNPM’01), Aachen, Germany, Sep. 2001, pp. 101–110. IEEE Computer Society Press, Los Alamitos (2001)

    Chapter  Google Scholar 

  28. Miner, A.S., Ciardo, G., Donatelli, S.: Using the exact state space of a Markov model to compute approximate stationary measures. In: Kurose, J., Nain, P. (eds.) Proc. ACM SIGMETRICS, Santa Clara, CA, USA, June 2000, pp. 207–216. ACM Press, New York (2000)

    Chapter  Google Scholar 

  29. Miner, A.S., Parker, D.: Symbolic Representations and Analysis of Large Probabilistic Systems. In: Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P., Siegle, M. (eds.) Validation of Stochastic Systems. LNCS, vol. 2925, pp. 296–338. Springer, Heidelberg (2004)

    Google Scholar 

  30. Plateau, B.: On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In: Proc. ACM SIGMETRICS, Austin, TX, USA, May 1985, pp. 147–153 (1985)

    Google Scholar 

  31. Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of Petri nets. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 374–391. Springer, Heidelberg (1995)

    Google Scholar 

  32. Siminiceanu, R.I., Ciardo, G.: New Metrics for Static Variable Ordering in Decision Diagrams. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 90–104. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Engineering, UC Riverside, CA 92521, USA

    Gianfranco Ciardo

Authors
  1. Gianfranco Ciardo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marco Bernardo Jane Hillston

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this chapter

Cite this chapter

Ciardo, G. (2007). Data Representation and Efficient Solution: A Decision Diagram Approach. In: Bernardo, M., Hillston, J. (eds) Formal Methods for Performance Evaluation. SFM 2007. Lecture Notes in Computer Science, vol 4486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72522-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72522-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72482-7

  • Online ISBN: 978-3-540-72522-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation