Decidability and complexity results for timed automata and semi-linear hybrid automata

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

Volumn 1790, Issue , 2000, Pages 296-310

  Miller, Joseph S ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; HYBRID SYSTEMS; PARALLEL PROCESSING SYSTEMS;

ALGORITHMIC COMPLEXITY; COMPLEXITY RESULTS; DISCRETE-TIME CASE; EMPTINESS PROBLEM; HYBRID AUTOMATONS; LINEAR HYBRID AUTOMATA; PARALLEL COMPOSITION; PARAMETRIC TIMED AUTOMATA;

AUTOMATA THEORY;

EID: 84974698849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46430-1_26     Document Type: Conference Paper

References (14)

1. Rajeev Alur and David L. Dill. A theory of timed automata. Theoret. Comput. Sci., 126(2):183-235, 1994.
2. Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. Parametric real-time reasoning. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 592-601, San Diego, California, 16-18 May 1993.
3. Eugene Asarin and Oded Maler. Achilles and the tortoise climbing up the arithmetical hierarchy. Journal of Computer and System Sciences, 57(3):389-398, December 1998.
4. Olivier Bournez. Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. Theoretical Computer Science, 210(1):21-71, January 1999.
5. R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.
6. O. A. Gross. Preferential arrangements. Amer. Math. Monthly, 69:4-8, 1962.
7. Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, and Pravin Varaiya. What’s decidable about hybrid automata? J. Comput. System Sci., 57(1):94-124, 1998. 27th Annual ACM Symposium on the Theory of Computing (STOC’95) (Las Vegas, NV).
8. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine. Integration graphs: a class of decidable hybrid systems. In Hybrid systems, pages 179-208. Springer, Berlin, 1993.
9. M. Kourjanski and P. Varaiya. A class of rectangular hybrid systems with computable reach set. Lecture Notes in Computer Science, 1273:228-234, 1997.
10. G. Lafferriere, G. J. Pappas, and S. Sastry. O-minimal hybrid systems. Technical Report UCB/ERL M98/29, Department of Electrical Engineering and Computer Science, University of California at Berkeley, May 1998.
11. Marvin L. Minsky. Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines. Ann. of Math. (2), 74:437-455, 1961.
12. Anuj Puri and Pravin Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In Computer aided verification (Stanford, CA, 1994), pages 95-104. Springer, Berlin, 1994.
13. Alfred Tarski. A Decision Method for Elementary Algebra and Geometry. RAND Corporation, Santa Monica, Calif., 1948.
14. Lou van den Dries. Tame topology and o-minimal structures. Cambridge University Press, Cambridge, 1998.