Skip to main content

Analysis of Reactive Systems with n Timers

  • Conference paper
  • First Online:
Automata Implementation (WIA 1999)

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

Included in the following conference series:

  • 305 Accesses

Abstract

In this paper, we develop theoretical, as well as practical, tools for the synthesis and the verification of processes that contain n timers. Such tools are equally adapted to numerical calculations as to symbolical ones, thus allowing for parametric analysis. The results we have obtained rely on a simple and efficient representation of the states of an automaton that recognizes the behaviors of the process. This representation is based on a mechanical structure which helps us encode the states in a compact manner and leads to simple algorithms.

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 and D. Dill, The Theory of Timed Automata, Theoretical Computer Science, 126 (1994) 183–235.

    Article  MathSciNet  Google Scholar 

  2. A. Bergeron and A.M. Roy-Boulard, Contraintes temporelles paramétrisées et produits synchronisés, Proc. of NOTERE’97, Pau, France, (1997) 191–205.

    Google Scholar 

  3. A. Bergeron and A.M. Roy-Boulard, Contrôleurs temps-réel paramétrisés, Proc. of ADPM’98, Reims, France, (1998).

    Google Scholar 

  4. A. Bergeron, On the Rational Behaviors of Concurrent Timers, Theoretical Computer Science 189 (1997) 229–237.

    Article  MathSciNet  Google Scholar 

  5. B. Berthomieu and M. Diaz, Modelingand Verification of Time Dependent systems Usingtime d Petri Nets, IEEE Transactions on Software Engineering, Vol. 17, No. 3, (1991), 259–273.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergeron, A., Catalano, R. (2001). Analysis of Reactive Systems with n Timers. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45526-4_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42812-1

  • Online ISBN: 978-3-540-45526-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics