par Bruyère, Véronique;Raskin, Jean-François 
Référence Logical methods in computer science, 3, 1, page (1-30), 7
Publication Publié, 2007
Référence Logical methods in computer science, 3, 1, page (1-30), 7
Publication Publié, 2007
Article révisé par les pairs
| Résumé : | In this paper, we study the model-checking and parameter synthesis problems of the logic TCTL over discrete-timed automata where parameters are allowed both in the model (timed automaton) and in the property (temporal formula). Our results are as follows. On the negative side, we show that the model-checking problem of TCTL extended with parameters is undecidable over discrete-timed automata with only one parametric clock. The undecidability result needs equality in the logic. On the positive side, we show that the model-checking and the parameter synthesis problems become decidable for a fragment of the logic where equality is not allowed. Our method is based on automata theoretic principles and an extension of our method to express durations of runs in timed automata using Presburger arithmetic. |
