Repairing Timed Automata Clock Guards through Abstraction and Testing

Abstract : Timed automata (TAs) are a widely used formalism to specify systems having temporal requirements. However, exactly specifying the system may be difficult, as the user may not know the exact clock constraints triggering state transitions. In this work, we assume the user already specified a TA, and (s)he wants to validate it against an oracle that can be queried for acceptance. Under the assumption that the user only wrote wrong guard transitions (i.e., the structure of the TA is correct), the search space for the correct TA can be represented by a Parametric Timed Automaton (PTA), i.e., a TA in which some constants are parametrized. The paper presents a process that i) abstracts the initial (faulty) TA tainit in a PTA pta; ii) generates some test data (i.e., timed traces) from pta; iii) assesses the correct evaluation of the traces with the oracle; iv) uses the IMITATOR tool for synthesizing some constraints phi on the parameters of pta; v) instantiate from phi a TA tarep as final repaired model. Experiments show that the approach is successfully able to partially repair the initial design of the user.
Complete list of metadatas
Contributor : Étienne André <>
Submitted on : Thursday, August 1, 2019 - 11:25:58 AM
Last modification on : Saturday, August 3, 2019 - 1:43:05 AM

Links full text


  • HAL Id : hal-02235206, version 1
  • ARXIV : 1907.02133


Étienne André, Paolo Arcaini, Angelo Gargantini, Marco Radavelli. Repairing Timed Automata Clock Guards through Abstraction and Testing. 13th International Conference on Tests and Proofs (TAP 2019), Dirk Beyer; Chantal Keller, Oct 2019, Porto, Portugal. ⟨hal-02235206⟩



Record views