61 citations · 74 across the 4 of their papers we have counts for
4 papers
What's decidable about parametric timed automata?
Étienne André
Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well-und…
Repairing Timed Automata Clock Guards through Abstraction and Testing
Étienne André, Paolo Arcaini, Angelo Gargantini +1
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…
Parametric schedulability analysis of a launcher flight control system under reactivity constraints
Étienne André, Emmanuel Coquard, Laurent Fribourg +2
The next generation of space systems will have to achieve more and more complex missions. In order to master the development cost and duration of such systems, an alternative to a…
Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report
Étienne André, Mohamed Mahdi Benmoussa, Christine Choppy
UML state machines are widely used to specify dynamic systems behaviours. However its semantics is described informally, thus preventing the application of model checking technique…