Predicate abstraction for reachability analysis of hybrid systems, ACM Transactions on Embedded Computing Systems, vol.5, issue.1, pp.152-199, 2006. ,
DOI : 10.1145/1132357.1132363
A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994. ,
DOI : 10.1016/0304-3975(94)90010-8
The tool TINA ??? Construction of abstract state spaces for petri nets and time petri nets, International Journal of Production Research, vol.99, issue.14, 2004. ,
DOI : 10.1137/0216062
Principles of Model Checking (Representation and Mind Series), 2008. ,
Comparison of Different Semantics for Time Petri Nets, ATVA 2005, pp.293-307, 2005. ,
DOI : 10.1007/11562948_23
Fiacre: An Intermediate Language for Model Verification in the Topcased Environment, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00262442
Modal mu-calculi. In: Handbook of Modal Logic, pp.721-756, 2007. ,
DOI : 10.1016/s1570-2464(07)80015-2
Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation, FORMATS 2009, pp.73-87, 2009. ,
DOI : 10.1007/BFb0023458
Model checking and abstraction, ACM Transactions on Programming Languages and Systems, vol.16, issue.5, pp.1512-1542, 1994. ,
DOI : 10.1145/186025.186051
Methodologies for Specification of Real-Time Systems Using Timed I/O Automata, FMCO 2009, pp.290-310, 2010. ,
DOI : 10.1145/1176887.1176894
Timed I/O automata, Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, HSCC '10, pp.91-100, 2010. ,
DOI : 10.1145/1755952.1755967
Automatic Abstraction Refinement for Timed Automata, FORMATS 2007, pp.114-129, 2007. ,
DOI : 10.1007/978-3-540-75454-1_10
Model checking and the mu-calculus, pp.185-214, 1997. ,
An Automatic Technique for Checking the Simulation of Timed Systems, 2013. ,
DOI : 10.1007/978-3-319-02444-8_7
URL : https://hal.archives-ouvertes.fr/hal-01226470
The Mec??5 Model-Checker, CAV 2004, pp.488-491, 2004. ,
DOI : 10.1007/978-3-540-27813-9_43
URL : https://hal.archives-ouvertes.fr/hal-00351697
Timed transition systems, REX 1991, pp.226-251, 1992. ,
DOI : 10.1007/BFb0031995
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5098
A comparison of additivity axioms in timed transition systems, 1993. ,
Scaling up uppaal: Automatic verification of real-time systems using compositionality and abstraction, FTRTFT 2000, pp.19-30, 2000. ,
The Theory of Timed I/O Automata, Synthesis Lectures on Computer Science, vol.1, issue.1, 2006. ,
DOI : 10.2200/S00006ED1V01Y200508CSL001
Uppaal in a nutshell, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.134-152, 1997. ,
DOI : 10.1007/s100090050010
Forward and backward simulations -part ii: Timingbased systems, Information and Computation, vol.128, 1995. ,
An overview and synthesis on timed process algebras, REX 1991, pp.526-548, 1992. ,
On the language inclusion problem for timed automata: closing a decidability gap, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.54-63, 2004. ,
DOI : 10.1109/LICS.2004.1319600
Concurrent and Real Time Systems: The CSP Approach, 1999. ,
Verifying abstractions of timed systems, CONCUR 1996, pp.546-562, 1996. ,
DOI : 10.1007/3-540-61604-7_75
The Coq proof assistant reference manual, version 8, 2009. ,
The linear time-branching time spectrum (extended abstract) ,