Efficient timed diagnosis using automata with timed domains

Patricia Bouyer (1) , Samy Jaziri (1) , Nicolas Markey (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 SUMO - SUpervision of large MOdular and distributed systems

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 di-agnoser for our timed automaton. We report on our implementation of this approach compared to the approach of [Tripakis, Fault diagnosis for timed autmata, 2002].

Domaines: Informatique et théorie des jeux [cs.GT]; Système multi-agents [cs.MA]; Théorie et langage formel [cs.FL]; Logique en informatique [cs.LO]

Patricia Bouyer, Samy Jaziri, Nicolas Markey. Efficient timed diagnosis using automata with timed domains. RV 2018 - 18th International Conference on Runtime Verification, Nov 2018, Limassol, Cyprus. pp.205-221, ⟨10.1007/978-3-030-03769-7_12⟩. ⟨hal-01889030⟩