Nicolas Markey

Résumé

We consider the problems of efficiently diagnosing and predicting what did (or will) happen in a partially-observable one-clock timed automaton. We introduce timed sets as a formalism to keep track of the evolution of the reachable configurations over time, and use our previous work on automata over timed domains to build a candidate diagnoser for our timed automaton. We report on our implementation of this approach compared to the approach of [Tripakis, Fault diagnosis for timed autmata, 2002].

@inproceedings{rv2018-BJM,
  author =              {Bouyer, Patricia and Jaziri, Samy and Markey,
                         Nicolas},
  title =               {Efficient timed diagnosis using automata with timed
                         domains},
  editor =              {Colombo, Christian and Leucker, Martin},
  booktitle =           {{P}roceedings of the 18th {I}nternational {W}orkshop
                         on {R}untime {V}erification ({RV}'18)},
  acronym =             {{RV}'18},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {11237},
  pages =               {205-221},
  year =                {2018},
  month =               nov,
  doi =                 {10.1007/978-3-030-03769-7_12},
  abstract =            {We consider the problems of efficiently diagnosing
                         and predicting what did (or~will) happen in a
                         partially-observable one-clock timed automaton.
                         We~introduce timed sets as a formalism to keep track
                         of the evolution of the reachable configurations
                         over time, and use our previous work on automata
                         over timed domains to build a candidate diagnoser
                         for our timed automaton. We~report on our
                         implementation of this approach compared to the
                         approach of [Tripakis, Fault diagnosis for timed
                         autmata,~2002].},
}