Abstract
Timed automata [1] are a well established theoretical framework used for modeling real time systems. In this paper, we introduce a class of timed automata with updates of the form x : ~d − y. We show that these updates preserve the decidability of emptiness of classical timed automata with diagonal constraints for ~ ∈ { = , < , ≤ }, while emptiness is undecidable for ~ ∈ { > , ≥ , ≠ }. When used along with additive constraints, these updates give decidable emptiness with 2 or lesser number of clocks, and become undecidable for 3 clocks. This provides a partial solution to a long standing open problem [5].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science 126(2) (1994)
Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic Symbolic Verification of Embedded Systems. IEEE Transactions on Software Engineering 22, 181–201 (1996)
Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical sytems having piecewise-constant derivatives. Theoretical Computer Science 138, 35–65 (1995)
Bouyer, P., Duford, C., Fleury, E., Petit, A.: Updatable Timed Automata. Theoretical Computer Science 321(2-3), 291–345 (2004)
Bérard, B., Duford, C.: Timed automata and additive clock constraints. Information Processing Letters 75(1-2), 1–7 (2000)
Bérard, B., Gastin, P., Petit, A.: On the power of non observable actions in timed automata. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 257–268. Springer, Heidelberg (1996)
Demichelis, F., Zielonka, W.: Controlled Timed Automata. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 455–469. Springer, Heidelberg (1998)
Behrmann, G., David, A., Larsen, K.G., Mller, O., Pettersson, P., Yi, W.: Uppaal - Present and Future. In: Proceedings of the 40th IEEE Conference on Decision and Control, Orlando, Florida, USA, December 4-7, 2001 (2001)
Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The Tool KRONOS, Hybrid Systems, pp. 208–219 (1995)
Lakshmi Manasa, G., Krishna, S.N., Nagaraj, K.: Updatable Timed automata, Technical Report, http://www.cse.iitb.ac.in/krishnas/uta.pdf
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, USA (1967)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manasa, L., Krishna, S.N., Nagaraj, K. (2008). Updatable Timed Automata with Additive and Diagonal Constraints. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)