{"type":"ScholarlyArticle","title":"Diagnosability Testing with Satisfiability Algorithms","authors":[{"name":"Jussi Rintanen","slug":"jussi-rintanen","given":"Jussi","family":"Rintanen","affiliation":"National ICT Australia Ltd and Australian National University Canberra , Australia"},{"name":"Alban Grastien","slug":"alban-grastien","given":"Alban","family":"Grastien","affiliation":"National ICT Australia Ltd and Australian National University Canberra , Australia"}],"abstract":"We show how testing whether a system is diagnosable can be reduced to the satisfiability problem and how satisfiability algorithms yield a very efficient approach to testing diagnosability. Diagnosability is the question whether it is always possible to know whether a given system has exhibited a failure behavior. This is a basic question that underlies diagnosis, and it is also closely related to more general questions about the possibility to know given facts about system behavior. The work combines the twin plant construct of Jiang et al., which is the basis of diagnosability testing of systems with an enumerative representation, and SAT-based techniques to AI planning which form a very promising approach to finding paths in very large transition graphs.","doi":null,"url":"https://ijcai.org/proceedings/2007/84","pdf":"https://ijcai.org/proceedings/2007/0084.pdf","markdown":"https://ijcai.org/proceedings/2007/84.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/84","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":84,"pages":{"first":532,"last":536},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Biere et al., 1999] Armin Biere, Alessandro Cimatti, Ed- mund 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.","title":"Symbolic model checking without BDDs","authors":"Armin Biere, Alessandro Cimatti, Edmund M Clarke, Yunshan Zhu","year":"1999","venue":"Tools and Algorithms for the Construction and Analysis of Systems, Proceedings of 5th International Conference, TACAS'99","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bryant, 1992] R. E. Bryant. Symbolic Boolean manipula- tion with ordered binary decision diagrams. ACM Com- puting Surveys, 24(3):293-318, September 1992.","title":"Symbolic Boolean manipulation with ordered binary decision diagrams","authors":"R E Bryant","year":"1992","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Burch et al., 1994] J. R. Burch, E. M. Clarke, D. E. Long, K. L. MacMillan, and D. L. Dill. Symbolic model check- ing for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Sys- tems, 13(4):401-424, 1994.","title":"Symbolic model checking for sequential circuit verification","authors":"J R Burch, E M Clarke, D E Long, K L Macmillan, D L Dill","year":"1994","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cimatti et al., 2003] Alessandro Cimatti, Charles Pecheur, and Roberto Cavada. Formal verification of diagnosabil- ity with via symbolic model-checking. In Georg Gottlob, editor, Proceedings of the 18th International Joint Con- ference on Artificial Intelligence, pages 363-369.","title":"Formal verification of diagnosability with via symbolic model-checking","authors":"Alessandro Cimatti, Charles Pecheur, Roberto Cavada","year":null,"venue":"Proceedings of the 18th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Darwiche, 2001] Adnan Darwiche. Decomposable negation normal form. Journal of the ACM, 48(4):1-42, 2001.","title":"Decomposable negation normal form","authors":"Adnan Darwiche","year":"2001","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Jiang et al., 2001] Shengbing Jiang, Zhongdong Huang, Vi- gyan Chandra, and Ratnesh Kumar. A polynomial algo- rithm for diagnosability of discrete-event systems. IEEE Transactions on Automatic Control, 46:1318-1321, 2001.","title":"A polynomial algorithm for diagnosability of discrete-event systems","authors":"Jiang","year":"2001","venue":"IEEE Transactions on Automatic Control","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Kautz and Selman, 1996] 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 Inno- vative Applications of Artificial Intelligence Conference, pages 1194-1201. AAAI Press, August 1996.","title":"Pushing the envelope: planning, propositional logic, and stochastic search","authors":"Selman Kautz, Henry Kautz, Bart Selman","year":"1996","venue":"Proceedings of the 13th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[McMillan, 2003] Kenneth L. McMillan. Interpolation and SAT-based model checking. In Warren A. Hunt Jr. and Fabio Somenzi, editors, Proceedings of the 15th Interna- tional Conference on Computer Aided Verification (CAV 2003), number 2725 in Lecture Notes in Computer Sci- ence, pages 1-13, 2003.","title":"Interpolation and SAT-based model checking","authors":"L Kenneth, Mcmillan","year":"2003","venue":"Proceedings of the 15th International Conference on Computer Aided Verification (CAV 2003)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Rintanen et al., 2006] 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.","title":"Planning as satisfiability: parallel plans and algorithms for plan search","authors":"Rintanen","year":"2006","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Rintanen, 1998] Jussi Rintanen. A planning algorithm not based on directional search. In A. G. Cohn, L. K. Schu- bert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98), pages 617-624.","title":"A planning algorithm not based on directional search","authors":"Jussi Rintanen","year":null,"venue":"Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR '98)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Rintanen, 2007] Jussi Rintanen. Diagnosers and diagnos- ability of succinct transition systems. In Manuela Veloso, editor, Proceedings of the 20th International Joint Confer- ence on Artificial Intelligence. AAAI Press, 2007.","title":"Jussi Rintanen. Diagnosers and diagnosability of succinct transition systems","authors":"Rintanen","year":"2007","venue":"Proceedings of the 20th International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ryan, 2003] Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers. Masters thesis, Simon Fraser University, September 2003.","title":"Efficient algorithms for clause-learning SAT solvers","authors":"Lawrence Ryan","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Sampath et al., 1995] Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, and De- mosthenis Teneketzis. Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control, 40(9):1555-1575, 1995.","title":"Diagnosability of discrete-event systems","authors":"Meera Sampath, Raja Sengupta, Stéphane Lafortune, Kasim Sinnamohideen, Demosthenis Teneketzis","year":"1995","venue":"IEEE Transactions on Automatic Control","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Selman and Kautz, 1996] Bart Selman and Henry Kautz. Knowledge compilation and theory approximation. Jour- nal of the ACM, 43:193-224, 1996.","title":"Knowledge compilation and theory approximation","authors":"Kautz Selman, Bart Selman, Henry Kautz","year":"1996","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Sheeran et al., 2000] Mary Sheeran, Satnam Singh, and Gunnar Stålmarck. Checking safety properties using in- duction and a SAT-solver. In W. A. Hunt and S. D. John- son, 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.","title":"Checking safety properties using induction and a SAT-solver","authors":"Mary Sheeran, Satnam Singh, Gunnar Stålmarck","year":"1954","venue":"Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}