Skip to main content

The Observational Power of Clocks

  • Conference paper
CONCUR ’94: Concurrency Theory (CONCUR 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 836))

Included in the following conference series:

Abstract

We develop a theory of equivalences for timed systems. Two systems are equivalent iff external observers cannot observe differences in their behavior. The notion of equivalence depends, therefore, on the distinguishing power of the observers. The power of an observer to measure time results in untimed, clock, and timed equivalences: an untimed observer cannot measure the time difference between events; a clock observer uses a clock to measure time differences with finite precision; a timed observer is able to measure time differences with arbitrary precision.

We show that the distinguishing power of clock observers grows with the number of observers, and approaches, in the limit, the distinguishing power of a timed observer. More precisely, given any equivalence for untimed systems, two timed systems are k-clock congruent, for a nonnegative integer k, iff their compositions with every environment that uses k clocks are untimed equivalent. Both k-clock bisimulation congruence and k-clock trace congruence form strict decidable hierarchies that converge towards the corresponding timed equivalences. Moreover, k-clock bisimulation congruence and k-clock trace congruence provide an adequate and abstract semantics for branching-time and linear-time logics with k clocks.

Our results impact on the verification of timed systems in two ways. First, our decision procedure for k-clock bisimulation congruence leads to a new, symbolic, decision procedure for timed bisimilarity Second, timed trace equivalence is known to be undecidable. If the number of environment clocks is bounded, however, then our decision procedure for k-clock trace congruence allows the verification of timed systems in a trace model.

Supported in part by the ESPRIT BRA project REACT.

Supported in part by the National Science Foundation under grant CCR-9200794 and by the United States Air Force Office of Scientific Research under contract F49620-93-1-0056.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, and D. Dill. Model checking in dense real time. Information and Computation, 104: 2–34, 1993.

    MATH  MathSciNet  Google Scholar 

  2. R. Alur, C. Courcoubetis, N. Halbwachs, D. Dill, and H. Wong-Toi. Minimization of timed transition systems. In 3rd CONCUR, 340–354. Springer LNCS 630, 1992.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, and T. Henzinger. Computing accumulated delays in real-time systems. In 5th CAV, 181–193. Springer LNCS 697, 1993.

    Google Scholar 

  4. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126: 183–235, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Alur and T. Henzinger. A really temporal logic. J. ACM, 41: 181–204, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. Alur, T. Henzinger, and M. Vardi. Parametric real-time reasoning. In 25th ACM STOC, 592–601, 1993.

    Google Scholar 

  7. C. Courcoubetis and M. Yannakakis. Minimum and maximum delay problems in real-time systems. In 3rd CAV, 399–409. Springer LNCS 575, 1991.

    Google Scholar 

  8. T. Henzinger, Z. Manna, and A. Pnueli. Temporal proof methodologies for real-time systems. In 18th ACM POPL, 353–366, 1991.

    Google Scholar 

  9. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In 7th IEEE LICS, 394–406, 1992.

    Google Scholar 

  10. K. Laren and Y. Wang. Time-abstracting bisimulation: implicit specifications and decidability. In Mathematical Foundations of Programming Semantics, 1993.

    Google Scholar 

  11. N. Lynch and F. Vaandrager. Action transducers and timed automata. In 3rd CONCUR, 436–455. Springer LNCS 630, 1992.

    Google Scholar 

  12. X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Real Time: Theory in Practice, 549–572. Springer LNCS 600, 1991.

    Google Scholar 

  13. R. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Vrije Universiteit to Amsterdam, 1990.

    Google Scholar 

  14. K. Cerâns. Decidability of bisimulation equivalence for parallel timer processes. In 4th CAV, 302–315. Springer LNCS 663, 1992.

    Google Scholar 

  15. K. Cerans, J. Godskesen, and K. Larsen. Timed modal specification: theory and tools. In 5th CAV, 253–267. Springer LNCS 697, 1993.

    Google Scholar 

  16. Y. Wang. Real-time behavior of asynchronous agents. In 1st CONCUR, 502–520. Springer LNCS 458, 1990.

    Google Scholar 

  17. M. Yannakakis and D. Lee. An efficient algorithm for minimizing real-time transition systems. In 5th CAV, 210–224. Springer LNCS 697, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alur, R., Courcoubetis, C., Henzinger, T.A. (1994). The Observational Power of Clocks. In: Jonsson, B., Parrow, J. (eds) CONCUR ’94: Concurrency Theory. CONCUR 1994. Lecture Notes in Computer Science, vol 836. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-48654-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-48654-1_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58329-5

  • Online ISBN: 978-3-540-48654-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics