Monotonic hybrid systems

Journal of Computer and System Sciences

Volumn 71, Issue 1, 2005, Pages 34-69

  Lanotte, Ruggero ^a   Maggiolo Schettini, Andrea ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Decidability of system properties; Dense time; Discrete time; Expressiveness; Hybrid systems; Monotonic hybrid systems; Succinctness

Indexed keywords

DECISION THEORY; FORMAL LOGIC; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

DECIDABILITY OF SYSTEM PROPERTIES; DENSE TIME; DISCRETE TIME; EXPRESSIVENESS; HYBRID SYSTEMS; MONOTONIC HYBRID SYSTEMS; SUCCINCTNESS;

REAL TIME SYSTEMS;

EID: 18444409039     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.11.003     Document Type: Article

References (31)

1. R. Alur, C. Coucoubetis, T. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine The algorithmic analysis of hybrid systems Theoret. Comput. Sci. 138 1995 3 34
2. R. Alur, C. Courcoubetis, and D.L. Dill Model-checking in dense real-time Inform. Comput. 104 1993 2 34
3. R. Alur, and D. Dill A theory of timed automata Theoret. Comput. Sci. 126 1994 183 235
4. R. Alur, K. Etessami, S. La Torre, D. Peled, Parametric temporal logic for model measuring, in: Proceedings of the ICALP 99, Lecture Notes in Computer Science, vol. 1664, Springer, Berlin, 1999, pp. 159-168.
5. R. Alur, T. Feder, and T. Henzinger The benefits of relaxing punctuality J. Assoc. Comput. Mach. 43 1996 116 146
6. R. Alur, R. Grosu, Y. Hur, V. Kumar, I. Lee, Modular specification of hybrid systems in charon, in: Proceedings of the HSCC 00, Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 6-19.
7. R. Alur, and T. Henzinger A really temporal logic J. Assoc. Comput. Mach. 41 1994 181 204
8. R. Alur, T.A. Henzinger, Logic and models of real time: a survey, in: Proceedings of the REX Workshop, Lecture Notes in Computer Science, vol. 600, Springer, Berlin, 1992, pp. 74-106.
9. R. Alur, T.A. Henzinger, P.-H. Ho, Automatic symbolic verification of embedded systems, in: IEEE Real-Time Systems Symposium, 1993, pp. 2-11.
10. R. Alur, F. Limor, and T.A. Henzinger Event-clock automata a determinizable class of timed automata Theoret. Comput. Sci. 211 1999 253 273
11. V. Bruyère, E. Dall'Olio, J.F. Raskin, Durations, parametric model-checking in timed automata with presburger arithmetic, in: Proceedings of the STACS 03, Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, 2003, pp. 687-698.
12. J.R. Büchi, On a decision method in restricted second order arithmetic, in: Proceedings of the International Congress on Logic, Method, and Philosophy of Science, Stanford University Press, 1962, pp. 1-12.
13. F. Cassez, K. Larsen, The impressive power of stopwatches, in: Proceedings of the CONCUR 00, Lecture Notes in Computer Science, vol. 1877, Springer, Berlin, 2000, pp. 138-152.
14. L.N. Childs A Concrete Introduction to Higher Algebra 1979 Springer Berlin
15. Z. Chaochen, M.R. Hansen, P. Sestoft, Decidability and undecidability results for Duration Calculus, in: Proceedings of the STACS 93, Lecture Notes in Computer Science, vol. 665, Springer, Berlin, 1993, pp. 58-68.
16. D. Drusinsky, and D. Harel On the power of bounded concurrency i finite automata J. Assoc. Comput. Mach. 41 1994 517 539
17. M. Fränzle, Analysis of hybrid systems: an ounce of realism can save an infinity of states, in: Proceedings of the CSL, Lecture Notes in Computer Science, vol. 1683, Springer, Berlin, 1999, pp. 126-140.
18. M. Fränzle, What will be eventually true of polynomial hybrid automata, in: Proceedings of the TACS, Lecture Notes in Computer Science, vol. 2215, Springer, Berlin, 2001, pp. 340-359.
19. R. Grosu, and T. Stauner Modular and visual specification of Hybrid Systems - an introduction to HyCharts Formal Methods System Design 21 2002 5 38
20. T.A. Henzinger, P. Ho, and H. Wong-Toi Algorithmic analysis of nonlinear hybrid systems IEEE Trans. Automat. Control 43 1998 540 554
21. T.A. Henzinger, R. Majumdar, Symbolic model-checking for rectangular hybrid systems, in: Proceedings of TACAS 00, Lecture Notes in Computer Science, vol. 1785, Springer, Berlin, 2000, pp. 142-156.
22. T.A. Henzinger, Z. Manna, A. Pnueli, What good are digital clocks?, in: Proceedings of the ICALP, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 545-558.
23. G. Lafferriere, G. Pappas, S. Yovine, A new class of decidable hybrid systems, in: Proceedings of the HSCC, Lecture Notes in Computer Science, vol. 1569, Springer, Berlin, 1999, pp. 137-151.
24. Y. Lakhneche, and J. Hooman Metric temporal logic with durations Theoret. Comput. Sci. 138 1995 169 199
25. R. Lanotte, Expressive power of hybrid systems with variables, parameters and arrays, in: Proceedings of the EXPRESS, Electronic Notes in Theoretical Computer Science, vol. 96, Elsevier, Amsterdam, pp. 91-112.
26. R. Lanotte, A. Maggiolo-Schettini, Timed automata with monotonic activities, in: Proceedings of the MFCS, Lecture Notes in Computer Science, vol. 1893, Springer, Berlin, 2000, pp. 518-527.
27. R. Lanotte, A. Maggiolo-Schettini, and S. Tini Concurrency in timed automata Theoret. Comput. Sci. 309 2003 503 527
28. F. Laroussinie, K.G. Larsen, C. Weise, From timed automata to logic - and back, in: Proceedings of the MFCS 95, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 27-41.
29. A. Pnueli, J. Sifakis (Eds.), Special issue on Hybrid Systems, Theoret. Comput. Sci. 138 (1995).
30. A. Tarski, A decision method for elementary algebra and geometry, Technical Report, University of California, Berkeley, California, 1951.
31. P. Wolper, Constructing automata from temporal logic formulas: a tutorial, in: E. Brinksma, H. Hermanns, J.P. Katoen (Eds.), Lectures on Formal Methods and Performance Analysis: First EEF/Euro Summer School on Trends in Computer Science, Lecture Notes in Computer Science, vol. 2090, Springer, Berlin, 2002, pp. 261-277.