Abstract
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal logics in the literature, including MTL. We make use of this characterization to show that MTL+Past satisfies an “ultimate stability” property with respect to periodic sequences of timed words. Our results hold for both the pointwise and continuous semantics. Along the way we generalize the result of McNaughton-Papert to show a counter-free automata characterization of FO-definable finitely varying functions.
This work was partly supported by P2R Timed-DISCOVERI.
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., Fix, L., Henzinger, T.A.: A Determinizable Class of Timed Automata. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 1–13. Springer, Heidelberg (1994)
Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctuality. Journal of the ACM 43(1), 116–146 (1996)
Chevalier, F., D’Souza, D., Prabakhar, P.: On continuous timed automata with input-determined guards. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 369–380. Springer, Heidelberg (2006)
Chevalier, F., D’Souza, D., Prabhakar, P.: Counter-free input-determined timed automata. Technical Report IISc-CSA-TR-, -1, Indian Institute of Science, Bangalore 560012, India (January 2007), URL http://archive.csa.iisc.ernet.in/TR/2007/1/
D’Souza, D., Mohan, M.R.: Eventual Timed Automata. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 322–334. Springer, Heidelberg (2005)
D’Souza, D., Tabareau, N.: On timed automata with input-determined guards. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 68–83. Springer, Heidelberg (2004)
Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The Regular Real-Time Languages. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 580–591. Springer, Heidelberg (1998)
Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California (1968)
Koymans, R.: Specifying Real-Time Properties with Metric Temporal Logic. Real-Time Systems 2(4), 255–299 (1990)
McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge, MA (1971)
Ouaknine, J., Worrell, J.: On the Decidability of Metric Temporal Logic. In: LICS, pp. 188–197. IEEE Computer Society, Los Alamitos (2005)
Prabhakar, P., D’Souza, D.: On the Expressiveness of MTL with Past Operators. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 322–336. Springer, Heidelberg (2006)
Raskin, J.-F., Schobbens, P.-Y.: The logic of event clocks: decidability, complexity and expressiveness. Automatica 4(3), 247–282 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chevalier, F., D’Souza, D., Prabhakar, P. (2007). Counter-Free Input-Determined Timed Automata. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-75454-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75453-4
Online ISBN: 978-3-540-75454-1
eBook Packages: Computer ScienceComputer Science (R0)