Hybrid acceleration using real vector automata (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2725, Issue , 2003, Pages 193-205

  Boigelot, Bernard ^a   Herbreteau, Frédéric ^a   Jodogne, Sébastien ^a,b  

^a UNIVERSITY OF LIÈGE   (Belgium)

^b FNRS   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED ANALYSIS; SET THEORY; SPACE RESEARCH;

CONTINUOUS FEATURES; EXPRESSIVE POWER; EXTENDED ABSTRACTS; HYBRID ACCELERATION; LINEAR HYBRID AUTOMATA; STATE SPACE EXPLORATION; SUFFICIENT CRITERION; TECHNICAL CONTRIBUTION;

AUTOMATA THEORY;

EID: 35248843200     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (27)

1. A. Annichini, B. Asarin, and A. Bouajjani. Symbolic Techniques for Parametric Reasoning about Counters and Clock Systems. In Proc. of the 12th International Conference on Computer-Aided Verification (CAV), number 1855 in Lecture Notes in Computer Science, pages 419-434, Chicago, USA, July 2000. Springer-Verlag.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3-34, 6 February 1995.
3. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 25 April 1994.
4. R. Alur, T. A. Henzinger, and P.-H. Ho. Automatic symbolic verification of embedded systems. In Proc. 14th annual IEEE Real-Time Systems Symposium, pages 2-11, 1993.
5. B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proc. of the 9th International Conference on Computer-Aided Verification (CAV), number 1254 in Lecture Notes in Computer Science, pages 167-177, Haifa, Israël, June 1997. Springer-Verlag.
6. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. of the 8th International Conference on Computer Aided Verification (CAV), volume 1102 of Lecture Notes in Computer Science, pages 1-12, New Brunswick, NJ, USA, July/August 1996. Springer-Verlag.
7. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations. In Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP), volume 1256 of Lecture Notes in Computer Science, pages 560-570, Bologna, Italy, 1997. Springer-Verlag.
8. B. Boigelot, S. Jodogne, and P. Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proc. International Joint Conference on Automated Reasoning (IJCAR), volume 2083 of Lecture Notes in Computer Science, pages 611-625, Sienna, Italy, June 2001.
9. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
10. P. Bouyer. Untameable timed automata! In Proc. of 20th Ann. Symp. Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Berlin, Germany, February 2003. Springer-Verlag.
11. B. Boigelot, S. Rassart, and P. Wolper. On the expressiveness of real and integer arithmetic automata. In Proc. of the 25th Colloquium on Automata, Programming, and Languages (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 152-163. Springer-Verlag, July 1998.
12. K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Communications of the ACM, 12(5):260-261, May 1969.
13. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In D. L. Dill, editor, Proc. of the 6th Int. Conf. on Computer Aided Verification (CAV), volume 818 of Lecture Notes in Computer Science, pages 55-67, Stanford, USA, June 1994. Springer-Verlag.
14. Z. Chaochen, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40:269-276, 1991.
15. H. Comon and Y. Jurski. Timed automata and the theory of real numbers. In Proc. of the 10th Int. Conf. Concurrency Theory (CONCUR), volume 1664 of Lecture Notes in Computer Science, pages 242-257, Eindhoven, The Netherlands, August 1999. Springer-Verlag.
16. D. L. Dill. Timing assumptions and verification of finite-state concurrent systems. In Proc. of Automatic Verification Methods for Finite-State Systems, number 407 in Lecture Notes in Computer Science, pages 197-212. Springer-Verlag, 1989.
17. T. A. Henzinger. The theory of hybrid automata. In Proc. of the 11th Annual IEEE Symposium on Logic in Computer Science, pages 278-292, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
18. T. A. Henzinger and P.-H. Ho. Model checking strategies for linear hybrid systems. In Proc. of Workshop on Formalisms for Representing and Reasoning about Time, May 1994.
19. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What's decidable about hybrid automata? Journal of Computer and System Sciences, 57:94-124, 1998.
20. M. Hendriks and K. G. Larsen. Exact acceleration of real-time model checking. Electronic Notes in Theoretical Computer Science, 65(6), April 2002.
21. N. Halbwachs, Y.-E. Proy, and P. Raymond. Verification of linear hybrid systems by means of convex approximations. In Proc. of the Int. Symposium on Static Analysis, volume 818 of Lecture Notes in Computer Science, pages 223-237. Springer-Verlag, 1994.
22. ∼boigelot/research/lash/.
23. C. Löding. Efficient minimization of deterministic weak ω-automata. Information Processing Letters, 79(3):105-109, 2001.
24. G. J. Pappas, G. Lafferriere, and S. Yovine. A new class of decidable hybrid systems. In Proc. of Hybrid Systems: Computation and Control (HSCC), volume 1569 of Lecture Notes in Computer Science, pages 137-151. Springer-Verlag, 1999.
25. P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proc. of the 2nd Int. Symp. on Static Analysis (SAS), volume 983 of Lecture Notes in Computer Science, pages 21-32. Springer-Verlag, 1995.
26. V. Weispfenning. Mixed real-integer linear quantifier elimination. In Proc. of the 1999 International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 129-136, New York, July 1999. ACM Press.
27. H. Weyl. The elementary theory of convex polyhedra. Annals of Math. Study, 24, 1950.