We investigate the expressive power of timing restrictions on labeled transition systems. In particular, we show how constraints on clock variables together with a uniform liveness condition—the divergence of time—can express Büchi, Muller, Streett, Rabin, and weak and strong fairness conditions on a given labeled transition system. We then consider the effect, on both timed and time-abstract expressiveness, of varying the following parameters: time domain (discrete or dense), number of clocks, number of states, and size of constants used in timing restrictions.
- Expressive Power
- Regular Language
- Finite Automaton
- Label Transition System
- Acceptance Condition
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.
This research was supported in part by the National Science Foundation under grant CCR-9200794, by the United States Air Force Office of Scientific Research under contract F49620-93-1-0056, by the Defense Advanced Research Projects Agency under grant NAG2-892, and by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University, Contract Number DAAL03-91-C-0027.
The full version of this paper is available from the Department of Computer Science, Cornell University, Ithaca, NY 14853, as Technical Report TR95-1496.
This is a preview of subscription content, access via your institution.
Unable to display preview. Download preview PDF.
R. Alur, C. Courcoubetis, and T.A. Henzinger. The observational power of clocks. In CONCUR 94, LNCS 836, pp. 162–177. Springer-Verlag, 1994.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.
R. Alur and T.A. Henzinger. Back to the future: towards a theory of timed regular languages. In. Proc. 33rd FOCS, pp. 177–186. IEEE Computer Society Press, 1992.
R. Alur and T.A. Henzinger. Logics and models of real time: a survey. In Real Time: Theory in Practice, LNCS 600, pp. 74–106. Springer-Verlag, 1992.
R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104(1):35–77, 1993.
R. Alur and T.A. Henzinger. Real-time system=discrete system+clock variables. In Proc. of the First AMAST Workshop on Real-time Systems, 1993. To appear.
C. Daws, A. Olivero, and S. Yovine. Verifying ET-LOTOS programs with KRO-NOS. In Proceedings of FORTE '94, 1994.
T.A. Henzinger. Sooner is safer than later. Information Processing Letters, 43:135–141, 1992.
T.A. Henzinger and P. Kopke. Verification methods for the divergent runs of clock systems. In FTRTFT 94, LNCS 863, pp. 351–372. Springer-Verlag, 1994.
T.A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In ICALP 92, LNCS 623, pp. 545–558. Springer-Verlag, 1992.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193–244, 1994.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pp. 133–191. Elsevier Science Publishers (North-Holland), 1990.
Editors and Affiliations
Rights and permissions
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henzinger, T.A., Kopke, P.W., Wong-Toi, H. (1995). The expressive power of clocks. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_93
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60084-8
Online ISBN: 978-3-540-49425-6
eBook Packages: Springer Book Archive