Skip to main content
SpringerLink
Log in

Symbolic timing devices

  • Refereed Contributions
  • Conference paper
  • First Online:
Book cover Algebraic Methodology and Software Technology (AMAST 1995)

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

  • 167 Accesses

Abstract

Timing devices such as timers, clocks, or stopwatches, are used in a vast range of processes. In computer science, the need to specify, verify and implement real-time applications had given rise to many different formalizations of timed concurrent processes. This paper is an attempt to understand the underlying ideas of many of these approaches by focusing primarily on the timing devices. Starting with an abstract definition of a timer, we use the formalism of synchronized products, as developed by Arnold and Nivat, to study different formal languages associated with the concurrent operation of n timers.

This work was partially supported by grants from BNR Ltd., FCAR of Québec and NSERC of Canada.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and D. Dill, Automata for Modeling Real-Time Systems, in Automata, Languages and programming, 17th International Colloquium Proceedings, Coventry, UK, July 1990, pp. 322–335.

    Google Scholar 

  2. R. Alur and D. Dill, The Theory of Timed Automata, Theoretical Computer Science, 126 (1994) 183–235.

    Google Scholar 

  3. A. Arnold, Finite Transition Systems, Prentice Hall, 1994.

    Google Scholar 

  4. A. Bergeron, A Study of Two Concurrent Timers, 2nd AMAST Workshop on Real-Time Systems, Bordeaux, June 1995.

    Google Scholar 

  5. S. Di Gennaro, C. Horn, S.R. Kulkarni and P.J. Ramadge, Reduction of Timed Hybrid Systems, Proceedings of the 33rd IEEE Conference on decision and Control, (1994) 4215–4220.

    Google Scholar 

  6. W. Lam and R. Brayton, Alternating RQ Timed Automata, CAV'93, Lecture Notes in Computer Science, no. 697 (1993) 237–252.

    Google Scholar 

  7. X. Nicollin, J. Sifakis and S. Yovine, From ATP to timed graphs and hybrid systems, Acta Informatica, 30 (1993) 181–201.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LACIM, Université du Québec à Montréal, Canada

    Anne Bergeron

  2. Department of Electrical Engineering, Princeton University, 08544-5263, Princeton, New-Jersey, USA

    Anne Bergeron

Authors
  1. Anne Bergeron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. S. Alagar Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergeron, A. (1995). Symbolic timing devices. In: Alagar, V.S., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1995. Lecture Notes in Computer Science, vol 936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60043-4_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-60043-4_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49410-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation