Abstract
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the monoid of timed words into a bounded subset of itself. We show that the recognizable languages are exactly those accepted by deterministic timed automata and argue that this is, perhaps, the right class of timed languages, and that the closure of untimed regular languages under projection is a positive accident that cannot be expected to hold beyond the finite-state case.
This work was partially supported by a grant from Intel, by the European Community Projects IST-2001-35304 AMETIST (Advanced Methods for Timed Systems), http://ametist.cs.utwente.nl and by the CNRS project AS 93, Automates, modèles distribués et temporisés.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alur, R.: Techniques for Automatic Verification of Real-Time Systems, PhD Thesis, Stanford (1990)
Alur, R., Dill, D.L.: ATheory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Alur, R., Fix, L., Henzinger, T.A.: Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211, 253–273 (1999)
Angluin, D.: Learning Regular Sets from Queries and Counter-Examples. Information and Computation 75, 87–106 (1987)
Asarin, E., Caspi, P., Maler, O.: Timed Regular Expressions. The Journal of the ACM 49, 172–206 (2002)
Bouyer, P.: Untameable timed automata! In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 620–631. Springer, Heidelberg (2003)
Bouyer, P., Dufourd, C., Fleury, E., Petit, A.: Expressiveness of updatable timed automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 232–242. Springer, Heidelberg (2000)
Bouyer, P., Petit, A., Thérien, D.: An algebraic Approach to Data Languages and Timed Languages. Information and Computation 182, 137–162 (2003)
Dima, C.: Real-Time Automata. Journal of Automata, Languages and Combinatorics 6, 3–24 (2001)
Daws, C., Yovine, S.: Reducing the Number of Clock Variables of Timed Automata. In: Proc. RTSS 1996, pp. 73–81. IEEE, Los Alamitos (1996)
Eilenberg, S.: Automata, Languages and Machines, Vol. A. Academic Press, New-York (1974)
Gold, E.M.: System Identification via State Characterization. Automatica 8, 621–636 (1972)
Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The Regular Real-time Languages. In: Proc. ICALP 1998. LNCS, vol. 1343, pp. 580–591. Springer, Heidelberg (1998)
Kaminski, M., Francez, N.: Finite-memory Automata. Theoretical Computer Science 134, 329–363 (1994)
Raskin, J.-F., Schobbens, P.-Y.: State Clock Logic:ADecidable Real-Time Logic. In: Maler, O. (ed.) HART 1997. LNCS, vol. 1201, pp. 33–47. Springer, Heidelberg (1997)
Tripakis, S.: Folk Theorems on the Determinization and Minimization of Timed Automata. In: FORMATS 2003 (2003)
Springintveld, J.G., Vaandrager, F.W.: Minimizable Timed Automata. In: Jonsson, B., Parrow, J. (eds.) FTRTFT 1996. LNCS, vol. 1135, pp. 130–147. Springer, Heidelberg (1996)
Wilke, T.: Specifying State Sequences in Powerful Decidable Logics and Timed Automata. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, pp. 694–715. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maler, O., Pnueli, A. (2004). On Recognizable Timed Languages. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive