A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.90010-90018, 1994. ,
Parametric real-time reasoning, pp.592-601, 1993. ,
IMITATOR 2.5: A tool for analyzing robustness in scheduling problems, FM. Lecture Notes in Computer Science, vol.7436, pp.33-36, 2012. ,
Liveness in L/U-parametric timed automata, pp.9-18, 2017. ,
Timed automata with parametric updates, pp.21-29, 2018. ,
Parametric updates in parametric timed automata, 2019. ,
Decision problems for parametric timed automata, In: ICFEM. Lecture Notes in Computer Science, vol.10009, pp.400-416, 2016. ,
Language emptiness of continuous-time parametric timed automata, ICALP, Part II. Lecture Notes in Computer Science, vol.9135, pp.69-81, 2015. ,
Timed automata: Semantics, algorithms and tools, Lectures on Concurrency and Petri Nets, vol.3098, pp.87-124, 2003. ,
Updatable timed automata, Theoretical Computer Science, vol.321, issue.2-3, pp.291-345, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00350196
,
Decision problems for lower/upper bound parametric timed automata, Formal Methods in System Design, vol.35, issue.2, pp.121-151, 2009. ,
Time-bounded reachability for monotonic hybrid automata: Complexity and fixed points, ATVA. Lecture Notes in Computer Science, vol.8172, pp.55-70, 2013. ,
Advances in parametric real-time reasoning, MFCS. Lecture Notes in Computer Science, vol.8634, pp.123-134, 2014. ,
Timing assumptions and verification of finite-state concurrent systems, Lecture Notes in Computer Science, vol.407, pp.197-212, 1989. ,
Robust parametric reachability for timed automata, Information Processing Letters, vol.102, issue.5, pp.208-213, 2007. ,
,
What's decidable about hybrid automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998. ,
Linear parametric model checking of timed automata, Journal of Logic and Algebraic Programming, vol.52, pp.37-38, 2002. ,
Integer parameter synthesis for real-time systems, IEEE Transactions on Software Engineering, vol.41, issue.5, pp.445-461, 2015. ,
A new polynomial-time algorithm for linear programming, Combinatorica, vol.4, issue.4, pp.373-396, 1984. ,
Decidability and complexity results for timed automata and semilinear hybrid automata, HSCC. Lecture Notes in Computer Science, vol.1790, pp.296-309, 2000. ,
MTL-model checking of one-clock parametric timed automata is undecidable, SynCoP. EPTCS, vol.145, pp.5-17, 2014. ,
Revisiting reachability in timed automata, LICS. pp, pp.1-12, 2017. ,
,