A theory of timed automata, Theoretical Computer Science, vol.126, pp.183-235, 1994. ,
Lower and upper bounds in zone-based abstractions of timed automata, International Journal on Software Tools for Technology Transfer, vol.8, issue.3, pp.204-215, 2006. ,
, , pp.125-126, 2006.
Partial order reductions for timed systems, CONCUR, vol.1466, pp.485-500, 1998. ,
Timed automata: Semantics, algorithms and tools, ACPN 2003, vol.3098, pp.87-124, 2003. ,
Start pruning when time gets urgent: Partial order reduction for timed systems, CAV, vol.10981, pp.527-546, 2018. ,
Model checking of real-time reachability properties using abstractions, TACAS, vol.1384, pp.313-329, 1998. ,
Timing assumptions and verification of finite-state concurrent systems, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, pp.197-212, 1990. ,
Fast algorithms for handling diagonal constraints in timed automata, 2019. ,
, , vol.0, 2019.
Better abstractions for timed automata, LICS, pp.375-384, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00708714
, UPPAAL in a nutshell. STTT, vol.1, issue.1-2, pp.134-152, 1997.
A partial order semantics approach to the clock explosion problem of timed automata, Theor. Comput. Sci, vol.345, issue.1, pp.27-59, 2005. ,
Partial order reduction for model checking of timed automata, CONCUR, vol.1664, pp.431-446, 1999. ,
Partial Order Reduction for Verification of Timed Systems, 1999. ,
On interleaving in timed automata, CONCUR, vol.4137, pp.465-476, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00369800
Abstract interpretation with unfoldings, CAV, pp.197-216, 2017. ,