<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05876517</id>
  <dt>a</dt>
  <an>05876517</an>
  <augroup>
    <au>Tripakis, Stavros</au>
  </augroup>
  <ti>Fault diagnosis for timed automata.</ti>
  <so>Damm, Werner (ed.) et al., 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. Berlin: Springer (ISBN 3-540-44165-4/pbk). Lecture Notes in Computer Science 2469, 205-221 (2002).</so>
  <py>2002</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>fault diagnosis</ut>
    <ut>partial observability</ut>
    <ut>timed automata</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/3-540-45739-9_14</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We study the problem of fault-diagnosis in the context of dense-time automata. The problem is, given the model of a plant as a timed automaton with a set of observable events and a set of unobserv-able events, including a special event modeling faults, to construct a deterministic machine, the diagnoser, which reacts to observable events and time delays, and announces a fault within a delay of at most $\Delta $ time units after the fault occurred. We define what it means for a timed automaton to be diagnosable, and provide algorithms to check diagnosability. The algorithms are based on standard reachability analyses in search of accepting states or non-zeno runs. We also show how to construct a di-agnoser for a diagnosable timed automaton, and how the diagnoser can be implemented using data structures and algorithms similar to those used in most timed-automata verification tools.</ab>
    <rv></rv>
  </abgroup>
</item>