A note on fault diagnosis algorithms. Cassez, F. In Ouaknine, J. & Vaandrager, F. W., editors, Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China, pages 6941–6946, 2009. IEEE.
Paper
Slides doi abstract bibtex In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.
@inproceedings{DBLP:conf/cdc/Cassez09,
author = {Franck Cassez},
title = {A note on fault diagnosis algorithms},
booktitle = {Proceedings of the 48th {IEEE} Conference on Decision and Control,
{CDC} 2009, combined withe the 28th Chinese Control Conference, December
16-18, 2009, Shanghai, China},
editor = {Jo{\"{e}}l Ouaknine and
Frits W. Vaandrager},
pages = {6941--6946},
year = {2009},
publisher = {{IEEE}},
year = {2009},
url = {http://dx.doi.org/10.1109/CDC.2009.5399968},
doi = {10.1109/CDC.2009.5399968},
ABSTRACT = { In this paper we review algorithms for checking diagnosability of
discrete-event systems and timed automata. We point out that the
diagnosability problems in both cases reduce to the emptiness
problem for (timed) B\"uchi automata. Moreover, it is known that,
checking whether a discrete-event system is diagnosable, can also be
reduced to checking bounded diagnosability. We establish a similar
result for timed automata. We also provide a synthesis of the
complexity results for the different fault diagnosis problems.},
urlpaper = {papers/cdc-09.pdf},
urlslides = {papers/slides-cdc-09.pdf},
Type = {B - International Conferences},
keywords = {diagnosis, timed automata},
}
Downloads: 0
{"_id":"ach6hqRRntbnR89sS","bibbaseid":"cassez-anoteonfaultdiagnosisalgorithms-2009","author_short":["Cassez, F."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]}],"title":"A note on fault diagnosis algorithms","booktitle":"Proceedings of the 48th IEEE Conference on Decision and Control, CDC 2009, combined withe the 28th Chinese Control Conference, December 16-18, 2009, Shanghai, China","editor":[{"firstnames":["Joël"],"propositions":[],"lastnames":["Ouaknine"],"suffixes":[]},{"firstnames":["Frits","W."],"propositions":[],"lastnames":["Vaandrager"],"suffixes":[]}],"pages":"6941–6946","year":"2009","publisher":"IEEE","url":"http://dx.doi.org/10.1109/CDC.2009.5399968","doi":"10.1109/CDC.2009.5399968","abstract":"In this paper we review algorithms for checking diagnosability of discrete-event systems and timed automata. We point out that the diagnosability problems in both cases reduce to the emptiness problem for (timed) Büchi automata. Moreover, it is known that, checking whether a discrete-event system is diagnosable, can also be reduced to checking bounded diagnosability. We establish a similar result for timed automata. We also provide a synthesis of the complexity results for the different fault diagnosis problems.","urlpaper":"papers/cdc-09.pdf","urlslides":"papers/slides-cdc-09.pdf","keywords":"diagnosis, timed automata","bibtex":"@inproceedings{DBLP:conf/cdc/Cassez09,\n author = {Franck Cassez},\n title = {A note on fault diagnosis algorithms},\n booktitle = {Proceedings of the 48th {IEEE} Conference on Decision and Control,\n {CDC} 2009, combined withe the 28th Chinese Control Conference, December\n 16-18, 2009, Shanghai, China},\n editor = {Jo{\\\"{e}}l Ouaknine and\n Frits W. Vaandrager},\n pages = {6941--6946},\n year = {2009},\n publisher = {{IEEE}},\n year = {2009},\n url = {http://dx.doi.org/10.1109/CDC.2009.5399968},\n doi = {10.1109/CDC.2009.5399968},\n ABSTRACT = { In this paper we review algorithms for checking diagnosability of\n discrete-event systems and timed automata. We point out that the\n diagnosability problems in both cases reduce to the emptiness\n problem for (timed) B\\\"uchi automata. Moreover, it is known that,\n checking whether a discrete-event system is diagnosable, can also be\n reduced to checking bounded diagnosability. We establish a similar\n result for timed automata. We also provide a synthesis of the\n complexity results for the different fault diagnosis problems.},\n urlpaper = {papers/cdc-09.pdf},\n urlslides = {papers/slides-cdc-09.pdf},\n Type = {B - International Conferences},\n\n keywords = {diagnosis, timed automata},\n}\n\n","author_short":["Cassez, F."],"editor_short":["Ouaknine, J.","Vaandrager, F. W."],"key":"DBLP:conf/cdc/Cassez09","id":"DBLP:conf/cdc/Cassez09","bibbaseid":"cassez-anoteonfaultdiagnosisalgorithms-2009","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/cdc-09.pdf","Slides":"http://science.mq.edu.au/~fcassez/bib/papers/slides-cdc-09.pdf"},"keyword":["diagnosis","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F","yYF8uwWqay28JyxZC"],"keywords":["diagnosis","timed automata"],"search_terms":["note","fault","diagnosis","algorithms","cassez"],"title":"A note on fault diagnosis algorithms","year":2009}