Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
We define a new class of hybrid automata for which reach-ability is decidable—a proper superclass of the initialized rectangular hybrid automata—by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. Modifying the construction to apply to parametric timed automata, we reprove the undecidability of the emptiness problem, and then distinguish the dense and discrete-time cases with a new result. The algorithmic complexity—both classical and parametric—of one-clock parametric timed automata is also examined. We finish with a table of computability-theoretic complexity results, including that the existence of a Zeno run is Σ11-complete for semi-linear hybrid automata; it is too complex to be expressed in first-order arithmetic.
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- 5.R. G. Downey and M. R. Fellows. Parameterized complexity. Springer-Verlag, New York, 1999.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar