Diagnosers and diagnosability of succinct transition systems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 538-544

  Rintanen, Jussi ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; DIAGNOSABILITY; NUMBER OF STATE; ON-LINE DIAGNOSIS; POLYNOMIAL-TIME; PSPACE-COMPLETE; SYSTEM REPRESENTATION; TRANSITION SYSTEM;

ARTIFICIAL INTELLIGENCE; POLYNOMIAL APPROXIMATION;

AUTOMATA THEORY;

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

References (12)

1. Patricia Bouyer, Fabrice Chevalier, and Deepak D'Souza. Fault diagnosis using timed automata. In Vladimiro Sassone, editor, Foundations of Software Science and Computational Structures: 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings, number 3441 in Lecture Notes in Computer Science, pages 219-233. Springer-Verlag, 2005.
2. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
3. Alban Grastien. personal communication, 2006.
4. L. E. Holloway, B. H. Krogh, and A. Giua. A survey of Petri net methods for controlled discrete-event systems. Discrete Event Dynamic Systems: Theory and Applications, 7:151-190, 1997. (Pubitemid 127510011)
5. 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.
6. D. S. Johnson. A catalog of complexity classes. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A. Algorithms and Complexity, pages 67-161. Elsevier Science Publishers, 1990.
7. Antonio Lozano and José L. Balcázar. The complexity of graph problems for succinctly represented graphs. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG' 89, number 411 in Lecture Notes in Computer Science, pages 277-286. Springer-Verlag, 1990.
8. Jussi Rintanen and Alban Grastien. Diagnosability testing with satisfiability algorithms. In Manuela Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence. AAAI Press, 2007.
9. 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.
10. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
11. Stavros Tripakis. Fault diagnosis for timed automata. InW. Damm and E.-R. Olderog, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems: 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002. Proceedings, number 2469 in Lecture Notes in Computer Science, pages 205-221. Springer-Verlag, 2002.
12. YuanLin Wen, ChunHsi Li, and MuDer Jeng. A polynomial algorithm for checking diagnosability of Petri nets. In IEEE International Conference on Systems, Man and Cybernetics, volume 3, pages 2542-2547, 2005.