Data representation and efficient solution: A decision diagram approach

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

Volumn 4486 LNCS, Issue , 2007, Pages 371-394

  Ciardo, Gianfranco ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Binary decision diagrams; Edge valued decision diagrams; Kronecker algebra; Multi valued decision diagrams; State space generation; Symbolic model checking

Indexed keywords

ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; MODEL CHECKING; PROBLEM SOLVING; SET THEORY;

DECISION DIAGRAMS; MULTI-VALUED DECISION DIAGRAMS; RESEARCH DIRECTIONS; STATE-SPACE GENERATION;

BINARY DECISION DIAGRAMS;

EID: 34548104693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72522-0_9     Document Type: Conference Paper

References (32)

1. 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, Apr. 1997.
2. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comp., 45(9):993-1002, Sept. 1996.
3. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp., 35(8):677-691, Aug. 1986.
4. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surv., 24(3):293-318, 1992.
5. P. Buchholz. Structured analysis approaches for large Markov chains. Applied Numerical Mathematics, 31(4):375-404, 1999.
6. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, 2000.
7. P. Buchholz, J. P. Katoen, P. Kemper, and C Tepper. Model-checking large structured Markov chains. J. Logic & Algebraic Progr., 56(1/2):69-97, 2003.
8. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P.B. Denyer, editors, Int. Conference on Very Large Scale Integration, pages 49-58, Edinburgh, Scotland, Aug. 1991. IFIP Transactions, North-Holland.
9. G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu. Logical and stochastic modeling with SMART. Perf. Eval., 63:578-608, 2006.
10. G. Ciardo, G. Lüttgen, and A. J. Yu. Improving static variable orders via invariants. In Proc. 28th International Conference on Application and Theory of Petri nets and Other Models of Concurrency (ICATPN), Siedlce, Poland, June 2007. Springer-Verlag. To appear.
11. G. Ciardo, R. Marmorstein, and R. Siminiceanu. Saturation unbound. In H. Garavel and J. Hatcliff, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 2619, pages 379-393, Warsaw, Poland, Apr. 2003. Springer-Verlag.
12. G. Ciardo, R. Marmorstein, and R. Siminiceanu. The saturation algorithm for symbolic state space exploration. Software Tools for Technology Transfer, 8(1) :4-25, Feb. 2006.
13. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In P. Buchholz, editor, Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM'99), pages 22-31, Zaragoza, Spain, Sept. 1999. IEEE Comp. Soc. Press.
14. G. Ciardo and R. Siminiceanu. Using edge-valued decision diagrams for symbolic generation of shortest paths. In M. D. Aagaard and J. W. O'Leary, editors, Proc. Fourth International Conference on Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 256-273, Portland, OR, USA, Nov. 2002. Springer-Verlag.
15. G. Ciardo and R. Siminiceanu. Structural symbolic CTL model checking of asynchronous systems. In W. Hunt, Jr. and F. Somenzi, editors, Computer Aided Verification (CAV'03), LNCS 2725, pages 40-53, Boulder, CO, USA, July 2003. Springer-Verlag.
16. G. Ciardo and A. J. Yu. Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In D. Borrione and W. Paul, editors, Proc. CHARME, LNCS 3725, pages 146-161, Saarbrücken, Germany, Oct. 2005. Springer-Verlag.
17. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. IBM Workshop on Logics of Programs, LNCS 131, pages 52-71, London, UK, 1981. Springer-Verlag.
18. M. Davio. Kronecker products and shuffle algebra. IEEE Trans. Comp., C-30:116-125, Feb. 1981.
19. D. D. Deavours and W. H. Sanders. "On-the-fly" solution techniques for stochastic Petri nets and extensions. In Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM'97), pages 132-141, Saint-Malo, France, June 1997. IEEE Comp. Soc. Press.
20. P. Fernandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. J. ACM, 45(3):381-414, 1998.
21. M. Fujita, P. C. McGeer, , and J. C.-Y. Yang. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation. Formal Methods in System Design, 10:149-169, 1997.
22. O. Grumberg, S. Livne, and S. Markovitch. Learning to order BDD variables in verification. J. Art. Int. Res., 18:83-116, 2003.
23. K. L. McMillan. Symbolic Model Checking. Kluwer, 1993.
24. T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: theory and applications. Multiple- Valued Logic, 4(1-2):9-62, 1998.
25. J. G. Kemeny and J. L. Snell. Finite Markov Chains. D. Van Nostrand-Reinhold, New York, NY, 1960.
26. Y.-T. Lai and S. Sastry. Edge-valued binary decision diagrams for multi-level hierarchical verification. In Proceedings of the 29th Conference on Design Automation, pages 608-613, Los Alamitos, CA, USA, June 1992. IEEE Computer Society Press.
27. A. S. Miner. Efficient solution of GSPNs using canonical matrix diagrams. In R. German and B. Haverkort, editors, Proc. 9th Int. Workshop on Petri Nets and Performance Models (PNPM'01), pages 101-110, Aachen, Germany, Sept. 2001. IEEE Comp. Soc. Press.
28. A. S. Miner, G. Ciardo, and S. Donatelli. Using the exact state space of a Markov model to compute approximate stationary measures. In J. Kurose and P. Nain, editors, Proc. ACM SIGMETRICS, pages 207-216, Santa Clara, CA, USA, June 2000. ACM Press.
29. A. S. Miner and D. Parker. Symbolic representations and analysis of large state spaces. In C Baier, B. R. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors, Validation of Stochastic Systems, LNCS 2925, pages 296-338. SpringerVerlag, 2004.
30. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. ACM SIGMETRICS, pages 147-153, Austin, TX, USA, May 1985.
31. O. Roig, J. Cortadella, and E. Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets. In G. De Michelis and M. Diaz, editors, Proc. 16th Int. Conf. on Applications and Theory of Petri Nets, LNCS 935, pages 374-391, Turin, Italy, June 1995. Springer-Verlag.
32. R. Siminiceanu and G. Ciardo. New metrics for static variable ordering in decision diagrams. In H. Hermanns and J. Palsberg, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), LNCS 3920, pages 90-104, Vienna, Austria, Mar. 2006. Springer-Verlag.