Skip to main content

Almost ASAP Semantics: From Timed Models to Timed Implementations

  • Conference paper

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

Abstract

In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP semantics (also called the maximal progress semantics) which is a mathematical idealization that can not be implemented by any physical device no matter how fast it is. On the contrary, any correct Almost ASAP controller can be implemented by a program on a hardware if this hardware is fast enough. We study the properties of this semantics, show how it can be analyzed using the tool HyTech, and illustrate its practical use on examples.

Supported by the FRFC project “Centre Fédéré en Vérification” funded by the Belgian National Science Fundation (FNRS) under grant nr 2.4530.02

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amnell, T., Fersman, E., Pettersson, P., Sun, H., Yi, W.: Code synthesis for timed automata. Nordic Journal of Computing(NJC) 9 (2003)

    Google Scholar 

  2. Berry, G.: The Foundations of Esterel. MIT Press, Cambridge (2000)

    Google Scholar 

  3. Cassez, F., Henzinger, T.A., Raskin, J.-F.: A comparison of control problems for timed and hybrid systems. In: Tomlin, C.J., Greenstreet, M.R. (eds.) HSCC 2002. LNCS, vol. 2289, pp. 134–148. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HYTECH. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995)

    Google Scholar 

  5. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? Journal of Computer and System Sciences 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Iversen, T., Kristoffersen, K., Larsen, K., Laursen, M., Madsen, R., Mortensen, S., Petterson, P., Thomasen, C.: Model-checking real-time control programs – verifying LEGO mindstorms systems using UPPAAL. In: Proc. 12th Euromicro Conf. on Real-Time Systems, ECRTS 2000 (2000)

    Google Scholar 

  7. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

De Wulf, M., Doyen, L., Raskin, JF. (2004). Almost ASAP Semantics: From Timed Models to Timed Implementations. In: Alur, R., Pappas, G.J. (eds) Hybrid Systems: Computation and Control. HSCC 2004. Lecture Notes in Computer Science, vol 2993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24743-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24743-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics