What will be eventually true of polynomial hybrid automata?

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

Volumn 2215, Issue , 2001, Pages 340-359

  Fränzle, Martin ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Decidability; Hybrid systems; Progress properties; State recurrence; Verification procedures

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER SOFTWARE; DISCRETE TIME CONTROL SYSTEMS; HYBRID SYSTEMS; POLYNOMIALS; ROBOTS;

AUTOMATIC VERIFICATION; DISCRETE-CONTINUOUS SYSTEMS; ENGINEERING AND COMPUTER SCIENCE; INFINITE STATE SYSTEMS; LIVENESS PROPERTIES; PROGRESS PROPERTIES; SEMI-DECISION PROCEDURES; STATE RECURRENCE;

COMPUTER CONTROL SYSTEMS;

EID: 84978946933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45500-0_17     Document Type: Conference Paper

References (14)

1. [AB01] Eugene Asarin and Ahmed Bouajjani. Perturbed turing machines and hybrid systems. In Proceedings of the Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2001). IEEE, 2001.
2. [AD94] Rajeev Alur and David L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 1994.
3. [AHS96] Rajeev Alur, Thomas A. Henzinger, and Eduardo D. Sontag, editors. Hybrid Systems III-Verification and Control, volume 1066 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
4. [AHV93] Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. Parametric real-time reasoning. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 592-601, 1993.
5. [AKNS95] P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors. Hybrid Systems II, volume 999 of Lecture Notes in Computer Science. Springer-Verlag, 1995.
6. [Frä99] Martin Fränzle. Analysis of hybrid systems: An ounce of realism can save an infinity of states. In Jörg Flum and Mario Rodríguez-Artalejo, editors, Computer Science Logic (CSL'99), volume 1683 of Lecture Notes in Computer Science, pages 126-140. Springer-Verlag, 1999.
7. [GHJ97] Vineet Gupta, Thomas A. Henzinger, and Radha Jagadeesan. Robust timed automata. In Oded Maler, editor, Proceedings of the First International Workshop on Hybrid and Real-Time Systems (HART 97), volume 1201 of Lecture Notes in Computer Science, pages 331-345. Springer-Verlag, 1997.
8. [GNRR93] Robert L. Grossman, Anil Nerode, Anders P. Ravn, and Hans Rischel, editors. Hybrid Systems, volume 736 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
9. [HHWT95] Thomas A. Henzinger, Pei-Hsin Ho, and Howard Wong-Toi. HyTech: The next generation. In 16th Annual IEEE Real-time Systems Symposium (RTSS 1995), pages 56-65. IEEE Computer Society Press, 1995.
10. [HKPV95] Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What's decidable about hybrid automata. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 373-382. ACM, 1995.
11. [Moo98] Chris Moore. Finite-dimensional analog computers: Flows, maps, and recurrent neural networks. In C. S. Calude, J. Casti, and M. J. Dinneen, editors, 1st International Conference on Unconventional Models of Computation. Springer-Verlag, 1998.
12. [MS97] Wolfgang Maass and Eduardo D. Sontag. Analog neural nets with Gaussian or other common noise distributions cannot recognize arbitrary regular languages. In Electronic Colloquium on Computational Complexity, technical reports. 1997.
13. [Pur98] Anuj Puri. Dynamical properties of timed automata. In A. P. Ravn and H. Rischel, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'98), volume 1486 of Lecture Notes in Computer Science, pages 210-227. Springer-Verlag, 1998.
14. [Tar48] Alfred Tarski. A decision method for elementary algebra and geometry. RAND Corporation, Santa Monica, Calif., 1948.