@article{DBLP:journals/corr/abs-1004-2764,
  author    = {Franck Cassez},
  title     = {A Note on Fault Diagnosis Algorithms},
  journal   = {CoRR},
  Type = {E - Reports},
  volume    = {abs/1004.2764},
  year      = {2010},
  url       = {http://arxiv.org/abs/1004.2764},
  timestamp = {Mon, 05 Dec 2011 18:04:58 +0100},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764},
  bibsource = {dblp computer science bibliography, http://dblp.org},
      keywords = {fault diagnosis, timed automata},

  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.}
}

{"_id":"zooFmmsj9uwYwMbgt","bibbaseid":"cassez-anoteonfaultdiagnosisalgorithms-2010","author_short":["Cassez, F."],"bibdata":{"bibtype":"article","type":"E - Reports","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]}],"title":"A Note on Fault Diagnosis Algorithms","journal":"CoRR","volume":"abs/1004.2764","year":"2010","url":"http://arxiv.org/abs/1004.2764","timestamp":"Mon, 05 Dec 2011 18:04:58 +0100","biburl":"http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764","bibsource":"dblp computer science bibliography, http://dblp.org","keywords":"fault diagnosis, timed automata","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.","bibtex":"@article{DBLP:journals/corr/abs-1004-2764,\n author = {Franck Cassez},\n title = {A Note on Fault Diagnosis Algorithms},\n journal = {CoRR},\n Type = {E - Reports},\n volume = {abs/1004.2764},\n year = {2010},\n url = {http://arxiv.org/abs/1004.2764},\n timestamp = {Mon, 05 Dec 2011 18:04:58 +0100},\n biburl = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1004-2764},\n bibsource = {dblp computer science bibliography, http://dblp.org},\n keywords = {fault diagnosis, timed automata},\n\n 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.}\n}\n\n","author_short":["Cassez, F."],"key":"DBLP:journals/corr/abs-1004-2764","id":"DBLP:journals/corr/abs-1004-2764","bibbaseid":"cassez-anoteonfaultdiagnosisalgorithms-2010","role":"author","urls":{"Paper":"http://arxiv.org/abs/1004.2764"},"keyword":["fault diagnosis","timed automata"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F"],"keywords":["fault diagnosis","timed automata"],"search_terms":["note","fault","diagnosis","algorithms","cassez"],"title":"A Note on Fault Diagnosis Algorithms","year":2010}