LTL Parameter Synthesis of Parametric Timed Automata
  The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for LTL properties. The investigated bounded integer parameter synthesis problem could be solved using an explicit enumeration of all possible parameter valuations. We propose an alternative symbolic zone-based method for this problem which results in a faster computation. Our technique extends the ideas of the automata-based approach to LTL model checking of timed automata. To justify the usefulness of our approach, we provide experimental evaluation and compare our method with explicit enumeration technique. 
Peter Bezd\v{e}k and Nikola Bene\v{s} and Ji\v{r}\'i Barnat and Ivana   \v{C}ern\'a
cs.FL cs.LO