Saturation: An efficient iteration strategy for symbolic state - Space generation

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

Volumn 2031 LNCS, Issue , 2001, Pages 328-342

  Ciardo, Gianfranco ^a   Lüttgen, Gerald ^b   Siminiceanu, Radii ^a  

^a The College of William and Mary   (United States)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; MANY VALUED LOGICS; BINARY DECISION DIAGRAMS; ITERATIVE METHODS;

ASYNCHRONOUS SYSTEM; INTEGER FUNCTIONS; MULTI-VALUED DECISION DIAGRAMS; NEXT STATE FUNCTIONS; NOVEL ALGORITHM; ORDERS OF MAGNITUDE; RELATED WORKS; SYMBOLIC STATE SPACE; CROSS PRODUCT;

ITERATIVE METHODS; ALGORITHMS;

EID: 84903156410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_23     Document Type: Conference Paper

References (27)

1. P. Aziz Abdulla, P. Bjesse, and N. Eén. Symbolic reachability analysis based on SAT-solvers. In TAG AS 2000, vol. 1785 of LNCS, pp. 411-425. Springer- Verlag, 2000.
2. R. Alur, R.K. Bray ton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state-space exploration. In CAV 791, vol. 1254 of LNCS, pp. 340-351. Springer-Verlag, 1997.
3. H.R. Andersen, J. Staunstmp, and N. Maretti. Partial model checking with RO-BDDs. In TAG AS '97, vol. 1217 of LNCS, pp. 35-49. Springer-Verlag, 1997.
4. P. Ashar and M. Cheong. Efficient breadth-first manipulation of binary decision diagrams. In ICCAD '94, pp. 622-627. Computer Society Press, 1994.
5. J.A. Bergstra, A. Ponse, and S.A. Smolka. Handbook of Process Algebra. Elsevier Science, 2000.
6. A. Biere, A. Cimatti, E.M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In TAG AS '99, vol. 1579 of LNCS, pp. 193-207. Springer-Verlag, 1999.
7. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans, on Comp., 35(8):677-691, 1986.
8. R.E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surveys, 24(3):393-418, 1992.
9. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Inform. & Comp., 98(2):142-170, 1992.
10. G. Ciardo, G. Lüttgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In ICATPN 2000, vol. 1639 of LNCS, pp. 103-122. Springer-Verlag, 2000.
11. G. Ciardo and A.S. Miner. SMART: Simulation and Markovian Analyzer for Reliability and Timing. In IPDS '96, p. 60. IEEE Computer Society Press, 1996.
12. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: A new symbolic model verifier. In CAV '99, vol. 1633 of LNCS, pp. 495-499. Springer-Verlag, 1999.
13. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
14. R. Cleaveland, J. Parrow, and B. Steffen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. TOPLAS, 15(1):36-72, 1993.
15. M. Fujita, H. Fujisawa, and Y. Matsunaga. Variable ordering algorithms for ordered binary decision diagrams and their evaluation. IEEE Trans, on Computer- Aided Design of Integrated Circuits and Systems, 12(1):6-l2, 1993.
16. A. Geser, J. Knoop, G. Lüttgen, B. Steffen, and O. Rüthing. Chaotic fixed point iterations. Techn. Rep. MIP-9403, Univ. of Passau, 1994.
17. S. Graf, B. Steffen, and G. Lüttgen. Compositional minimisation of finite state systems using interface specifications. Formal Asp. of Comp., 8(5):607-616, 1996.
18. T. Kara, T. Villa, R.K. Brayton, and A. Sangiovanni-Vincentelli. Multi-valued decision diagrams: Theory and applications. Multiple-Valued Logic, 4(l-2):9-62, 1998.
19. K. Larsen, P. Pettersson, and W. Yi. Compositional and symbolic mo del-checking of real-time systems. In RTSS '95, pp. 76-89. Computer Society Press, 1995.
20. K.L. McMillan. Symbolic Model Checking: An Approach to the State-explosion Problem. PhD thesis, Carnegie-Mellon Univ., 1992.
21. K.L. McMillan. A conjunctively decomposed Boolean representation for symbolic model checking. In CAV '96, LNCS, pp. 13-24. Springer-Verlag, 1996.
22. A.S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In ICATPN '99, vol. 1639 of LNCS, pp. 6-25. Springer-Verlag, 1999.
23. T. Murata. Petri nets: Properties, analysis and applications. Proc. of the IEEE, 77(4):541-579, 1989.
24. E. Pastor and J. Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets. In DATE '98, pp. 790-795. IEEE Computer Society Press, 1998.
25. E. Pastor, O. Roig, J. Cortadella, and R.M. Badia. Petri net analysis using Boolean manipulation. In ICATPN '94, vol. 815 of LNCS, pp. 416-435. Springer- Verlag, 1994.
26. M. Sheeran and G. Stålmarck. A tutorial on Stålmarck's proof procedure for propositional logic. Formal Methods in System Design, 16(1):23-58, 2000.
27. B. Yang, R.E. Bryant, D.R. O'Hallaron, A. Biere, O. Coudert, G. Janssen, R.K. Ranjan, and F. Somenzi. A performance study of BDD-based model checking. In FMCAD '98, vol. 1522 of LNCS, pp. 255-289. Springer-Verlag, 1998.