Abstract
We show that the class of Event Recording Automata [2] admit a logical characterisation via an unrestricted monadic second order logic interpreted over timed words. We point out the closure properties corresponding to existential quantification in the logic. A timed temporal logic considered earlier in the literature is shown to be expressively complete with respect to our monadic logic.
The results in this paper extend smoothly to the class of event clock automata (also introduced in [2]).
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
R. Alur, D. L. Dill: A theory of timed automata, Theoretical Computer Science 126:183–235 (1994).
R. Alur, L. Fix, T. A. Henzinger: Event-clock automata: a determinizable class of timed automata, Proc. 6th International Conference on Computer-aided Verification, LNCS 818, 1–13, Springer-Verlag (1994).
R. Alur, T. A. Henzinger: Real-time logics: complexity and expressiveness, Infor-mation and Computation 104, 35–77 (1993).
J. R. Büchi: Weak second-order arithmetic and finite automata, Zeitschrift für Math. Logik und Grundlagen der Mathematik, 6, 66–92 (1960).
D. D’Souza, T. Hune: An on-the-fly Construction for an Event Clock Logic, Manuscript (1999).
D. D’Souza, P. S. Thiagarajan: Product Interval Automata: A Subclass of Timed Automata, Proc. 19th Foundations of Software Technology and Theoretical Computer Science (FSTTCS), LNCS 1732 (1999).
A. W. H. Kamp: Tense Logic and the Theory of Linear Order, PhD Thesis, University of California (1968).
D. Gabbay, A. Pnueli, S. Shelah, J. Stavi: The Temporal Analysis of Fairness, Seventh ACM Symposium on Principles of Programming Languages, 163–173, (1980).
T. A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens: The regular real-time languages, Proc. 25th International Colloquium on Automata, Languages, and Programming 1998, LNCS 1443, 580–591 (1998).
J.-F. Raskin: Logics, Automata and Classical Theories for Deciding Real Time, Ph.D Thesis, FUNDP, Belgium.
J.-F. Raskin, P.-Y. Schobbens: State-clock Logic: A Decidable Real-Time Logic, Proc. HART’ 97: Hybrid and Real-Time Systems, LNCS 1201, 33–47 (1997).
W. Thomas: Automata on Infinite Objects, in J. V. Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, 133–191, Elsevier Science Publ., Amsterdam (1990).
Th. Wilke: Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata, in Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, 694–715 (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
D’Souza, D. (2000). A Logical Characterisation of Event Recording Automata. In: Joseph, M. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 2000. Lecture Notes in Computer Science, vol 1926. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45352-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-45352-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41055-3
Online ISBN: 978-3-540-45352-9
eBook Packages: Springer Book Archive