, Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems, Proc. of the 12th International Conference on Computer-Aided Verification (CAV), number 1855 in Lecture Notes in Computer Science, pp.419-434, 2000.
DOI : 10.1007/10722167_32
, The algorithmic analysis of hybrid systems, Theoretical Computer Science, vol.138, issue.1, pp.3-34183, 1994.
DOI : 10.1016/0304-3975(94)00202-T
, Automatic symbolic verification of embedded systems, Proc. 14th annual IEEE Real-Time Systems Symposium, pp.2-11, 1993.
, An improved reachability analysis method for strongly linear hybrid systems, Proc. of the 9th International Conference on Computer-Aided Verification (CAV), number 1254 in Lecture Notes in Computer Science, pp.167-177, 1997.
, Symbolic verification of communication protocols with infinite state spaces using QDDs, Proc. of the 8th International Conference on Computer Aided Verification (CAV), pp.1-12, 1996.
DOI : 10.1007/3-540-61474-5_53
, Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations, Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pp.560-570, 1997.
, On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables, Proc. International Joint Conference on Automated ReasoningBoi99] B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Faculté des Sciences Appliquées de l'Université de Lì ege,Lì ege, pp.611-625, 1999.
DOI : 10.1007/3-540-45744-5_50
, Untameable Timed Automata!, Proc. of 20th Ann. Symp. Theoretical Aspects of Computer Science (STACS), 2003.
DOI : 10.1007/3-540-36494-3_54
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.7945
, On the expressiveness of real and integer arithmetic automata, Proc. of the 25th Colloquium on Automata, Programming, and Languages (ICALP), volume 1443 of Lecture Notes in Computer Science, pp.152-163, 1998.
DOI : 10.1007/BFb0055049
, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, vol.12, issue.5, pp.260-261, 1969.
DOI : 10.1145/362946.362970
, Symbolic verification with periodic sets, Proc. of the 6th Int. Conf. on Computer Aided Verification (CAV), pp.55-67, 1994.
DOI : 10.1007/3-540-58179-0_43
, A calculus of durations, CJ99] H. Comon and Y. Jurski. Timed automata and the theory of real numbers, pp.269-276, 1991.
DOI : 10.1016/0020-0190(91)90122-X
, Timing assumptions and verification of finite-state concurrent systems, Proc. of Automatic Verification Methods for Finite-State Systems, number 407 in Lecture Notes in Computer Science, pp.197-212
, The theory of hybrid automata Model checking strategies for linear hybrid systems, Proc. of the 11th Annual IEEE Symposium on Logic in Computer Science Proc. of Workshop on Formalisms for Representing and Reasoning about Time, pp.278-292, 1994.
, What's Decidable about Hybrid Automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.
DOI : 10.1006/jcss.1998.1581
URL : http://doi.org/10.1006/jcss.1998.1581
, Verification of linear hybrid systems by means of convex approximations, Proc. of the Int. Symposium on Static Analysis, pp.223-237, 1994.
DOI : 10.1007/3-540-58485-4_43
, Efficient minimization of deterministic weak -automata, Information Processing Letters, vol.79, issue.3, pp.105-109, 2001.
DOI : 10.1016/S0020-0190(00)00183-6
, A new class of decidable hybrid systems, Proc. of Hybrid Systems: Computation and Control (HSCC), volume 1569 of Lecture Notes in Computer Science, pp.137-151, 1999.
, An automata-theoretic approach to Presburger arithmetic constraints, Proc. of the 2nd Int. Symp. on Static Analysis (SAS), pp.21-32
DOI : 10.1007/3-540-60360-3_30
URL : http://orbi.ulg.ac.be/jspui/handle/2268/74877
, Mixed real-integer linear quantifier elimination, Proc. of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC), pp.129-136, 1995.