Diagnosability testing with satisfiability algorithms

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 532-537

  Rintanen, Jussi ^a   Grastien, Alban ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; DIAGNOSABILITY; FAILURE BEHAVIORS; FINDING PATHS; SATISFIABILITY ALGORITHMS; SATISFIABILITY PROBLEMS; SYSTEM BEHAVIORS; TRANSITION GRAPHS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

FORMAL LOGIC;

EID: 84880912141     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In W. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99, volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, 1999.
2. R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
3. J. R. Burch, E. M. Clarke, D. E. Long, K. L. MacMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(4):401-424, 1994.
4. Alessandro Cimatti, Charles Pecheur, and Roberto Cavada. Formal verification of diagnosability with via symbolic model-checking. In Georg Gottlob, editor, Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 363-369. Morgan Kaufmann Publishers, 2003.
5. Adnan Darwiche. Decomposable negation normal form. Journal of the ACM, 48(4):1-42, 2001.
6. Shengbing Jiang, Zhongdong Huang, Vigyan Chandra, and Ratnesh Kumar. A polynomial algorithm for diagnosability of discrete-event systems. IEEE Transactions on Automatic Control, 46:1318-1321, 2001.
7. Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pages 1194-1201. AAAI Press, August 1996.
8. Kenneth L. McMillan. Interpolation and SAT-based model checking. In Warren A. Hunt Jr. and Fabio Somenzi, editors, Proceedings of the 15th International Conference on Computer Aided Verification (CAV 2003), number 2725 in Lecture Notes in Computer Science, pages 1-13, 2003.
9. Jussi Rintanen, Keijo Heljanko, and Ilkka Niemelä. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence, 170(12-13):1031-1080, 2006.
10. Jussi Rintanen. A planning algorithm not based on directional search. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 617-624. Morgan Kaufmann Publishers, June 1998.
11. Jussi Rintanen. Diagnosers and diagnosability of succinct transition systems. In Manuela Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence. AAAI Press, 2007.
12. Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers. Masters thesis, Simon Fraser University, September 2003.
13. Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, and Demosthenis Teneketzis. Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control, 40(9):1555-1575, 1995.
14. Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43:193-224, 1996.
15. Mary Sheeran, Satnam Singh, and Gunnar Stålmarck. Checking safety properties using induction and a SAT-solver. In W. A. Hunt and S. D. Johnson, editors, Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings, volume 1954 of Lecture Notes in Computer Science, pages 108-125. Springer-Verlag, 2000.