Searching powerset automata by combining explicit-state and symbolic model checking

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

Volumn 2031 LNCS, Issue , 2001, Pages 313-327

  Cimatti, Alcssandro ^a   Rovcri, Marco ^a,b   Bcrtoli, Picrgiorgio ^a  

^a ITC IRST   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

Binary Decision Diagrams; Explicit State Model Checking; Symbolic Model Checking; Synchronization Sequences

Indexed keywords

AUTOMATA THEORY; BINARY DECISION DIAGRAMS; UNCERTAINTY ANALYSIS; ALGORITHMS;

DIGITAL SYSTEM; EXPLICIT STATE; EXPLICIT-STATE MODEL CHECKING; NEW APPROACHES; SEARCH ALGORITHMS; SYMBOLIC MODEL CHECKING; SYNCHRONIZATION SEQUENCE; TRADITIONAL MODELS;

MODEL CHECKING;

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

References (16)

1. B. Bonet and H. Geffner. Planning with Incomplete Information as Heuristic Se arch in Belief Space. In S. Chicn, S. Kambhampati, and C.A. Knoblock, editors, 5th International Conference on Artificial Intelligence Planning and Scheduling, pages 52 61. AAAI-Prcss, April 2000.
2. T. L. Booth. Sequential Machines and Automata Theory. J. Wiley, 1967.
3. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677 691, August 1986.
4. G. Cabodi, P. Camurati, and S. Qucr. Improving symbolic travcrsals by means of activity profiles. In Proceedings of the 31st Conference on Design Automation, pages 306 311, New York, NY, USA, June 21 25 1999. ACM Pros.
5. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Rovcri. NuSMV: a new symbolic model checker. International Journal on Software Tools for Technology Transfer (STTT), 2(4), March 2000.
6. A. Cimatti and M. Rovcri. Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research (JAIR), 13:305 338, 2000.
7. F. Brglcz, D. Bryan, and K. Kozminski. Combinational profiles of sequential benchmark circuits. In International Symposium on Circuits and Systems, May 1989.
8. G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991.
9. Zvi Kohavi. Switching and Finite Automata Theory. McGraw-Hill Book Company, New York, 1978. ISBN 0-07-035310-7.
10. K.L. McMillan. Symbolic Model Checking. Kluwcr Academic Publ., 1993.
11. D. Michic. Machine Intelligence at Edinburgh. In On Machine Intelligence, pages 143 155. Edinburgh University Press, 1974.
12. C. Pixlcy, S.-W. Jcong, and G. D. Hachtcl. Exact calculation of synchronization sequences based on binary decision diagrams. In Proceedings of the 29th Conference on Design Automation, pages 620 623, Los Alamitos, CA, USA, June 1992. IEEE Computer Society Press.
13. J.-K. Rho, F. Somcnzi, and C. Pixlcy. Minimum length synchronizing sequences of finite state machine. In ACM-SIGDA; IEEE, editor, Proceedings of the 30th ACM/IEEE Design Automation Conference, pages 463 468, Dallas, TX, June 1993. ACM Press.
14. J. Rintancn. Constructing conditional plans by a thcorcm-provcr. Journal of Artificial Intellegence Research, 10:323 352, 1999.
15. David E. Smith and Daniel S. Weld. Conformant graphplan. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 889 896, Mcnlo Park, July 26 30 1998. AAAI Press.
16. S. Yang. Logic synthesis and optimization benchmarks user guide version 3.0. Technical report, Microelectronics Center of North Carolina, Research Triangle Park, January 1991.