Diagnosis of discrete-event systems using satisfiability algorithms

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 305-310

  Grastien, Alban ^a   Anbulagan, ^a   Rintanen, Jussi ^a   Kelareva, Elena ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DISCRETE EVENT SIMULATION;

PROPOSITIONAL SATISFIABILITY PROBLEM (SAT; SATISFIABILITY ALGORITHMS; TRADITIONAL DIAGNOSIS ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. Bailleux, O., and Boufkhad, Y. 2003. Efficient CNF encoding of Boolean cardinality constraints. In Ninth International Conference on Principles and Practice of Constraint Programming (CP'03), 108-122. Springer-Verlag.
2. Biere, A.; Cimatti, A.; Clarke. E. M.; and Zhu, Y. 1999. Symbolic model checking without BDDs. In Cleaveland, W. R., ed., Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-99), 193-207. Springer-Verlag.
3. Cordier, M.-O., and Grastien, A. 2007. Exploiting independence in a decentralised and incremental approach of diagnosis. In Veloso, M., ed., Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 292-297. AAAI press.
4. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communication of ACM 5:394-397.
5. Gomes, C. P.; Selman, B.; Crato, N.; and Kautz, H. 2000. Heavytailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1-2):67-100.
6. Kautz, H., and Selman, B. 1996. Pushing the envelope: planning, propositional logic, and stochastic search. In Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, 1194-1201. AAAI Press.
7. Lamperti, G., and Zanella, M. 2003. Diagnosis of Active Systems. Kluwer Academic Publishers.
8. Reiter, R. 1987. A theory of diagnosis from first principles. Artificial Intelligence 32:57-95.
9. Rintanen, J., and Grastien, A. 2007. Diagnosability testing with satisfiability algorithms. In Veloso, M., ed., Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 532-537. AAAI Press.
10. Rintanen, J. 2007. Diagnosers and diagnosability of succinct transition systems. In Veloso, M., ed., Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), 538-544. AAAI Press.
11. Sampath, M.; Sengupta, R.; Lafortune, S.; Sinnamohideen, K.; and Teneketzis, D. 1995. Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control40(9): 1555-1575.
12. Torta, G., and Torasso, P. 2004. The role of OBDDs in controlling the complexity of model based diagnosis. In Fifteenth international workshop on principles of diagnosis (DX'04).
13. Veneris, A. 2003. Fault diagnosis and logic debugging using Boolean satisfiability. In Fourth International Workshop on Microprocessor Test and Verification: Common Challenges and Solutions, 60-65.
14. Williams, B., and Nayak, P. 1996. A model-based approach to reactive self-configuring systems. In Minker, J., ed., Thirteenth National Conference on Artificial Intelligence (AAAI-96), 971-978. AAAI Press.