Skip to main content
SpringerLink
Log in

A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata

  • Conference paper
Formal Modeling and Analysis of Timed Systems (FORMATS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5813))

Abstract

Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal, a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows Uppaal to aid the design and analysis of TAD models.

This research has been supported by the UK Engineering and Physical Sciences Research Council under grant EP/D067197/1.

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

Access this chapter

Log in via an institution
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. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183–235 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  2. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Information and Computation 111(2), 193–244 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer 1(1-2), 123–133 (1997)

    Article  MATH  Google Scholar 

  4. Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Bowman, H.: Time and action lock freedom properties for timed automata. In: Proceedings of FORTE 2001, pp. 119–134. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  6. Bowman, H., Gomez, R.: How to stop time stopping. Formal Aspects of Computing 18(4), 459–493 (2006)

    Article  MATH  Google Scholar 

  7. Sifakis, J., Yovine, S.: Compositional specification of timed systems. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 347–359. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  8. Bornot, S., Sifakis, J., Tripakis, S.: Modeling urgency in timed systems. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 103–129. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Bowman, H., Faconti, G., Katoen, J.P., Latella, D., Massink, M.: Automatic verification of a lip synchronization protocol using uppaal. Formal Aspects of Computing 10(5-6), 550–575 (1998)

    Article  MATH  Google Scholar 

  10. Bornot, S., Sifakis, J.: On the composition of hybrid systems. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 49–63. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  11. Bozga, M., Graf, S., Ober, I., Ober, I., Sifakis, J.: The IF toolset. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 237–267. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Aceto, L., Bouyer, P., Burgueño, A., Larsen, K.: The power of reachability testing for timed automata. Theoretical Computer Science 1-3(300), 411–475 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  14. D’Argenio, P.R., Hermanns, H., Katoen, J.-P., Klaren, R.: MoDeST - a modelling and description language for stochastic timed systems. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 87–104. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Bohnenkamp, H.C., Hermanns, H., Katoen, J.-P.: MOTOR: The MODEST tool environment. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 500–504. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Barbuti, R., Tesei, L.: Timed automata with urgent transitions. Acta Informatica 40(5) (March 2004)

    Google Scholar 

  17. Moller, F., Tofts, C.: A temporal calculus of communicating systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 401–415. Springer, Heidelberg (1990)

    Google Scholar 

  18. Gomez, R.: Verification of Timed Automata with Deadlines in Uppaal. TR 2-08-2008, Computing Laboratory, University of Kent (2008)

    Google Scholar 

  19. Bowman, H., Gomez, R.: Concurrency Theory, Calculi and Automata for Modelling Untimed and Timed Concurrent Systems. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  20. Tripakis, S., Yovine, S.: The analysis of timed systems using time-abstracting bisimulations. Formal Methods in System Design 18(1), 25–68 (2001)

    Article  MATH  Google Scholar 

  21. Gebremichael, B., Vaandrager, F., Zhang, M.: Analysis of the zeroconf protocol using Uppaal. In: EMSOFT 2006, pp. 242–251. ACM Press, New York (2006)

    Google Scholar 

  22. Vaandrager, F., de Groot, A.: Analysis of a biphase mark protocol with Uppaal and PVS. Formal Aspects of Computing 18(4), 433–458 (2006)

    Article  MATH  Google Scholar 

  23. Lindahl, M., Pettersson, P., Yi, W.: Formal design and analysis of a gearbox controller. Software Tools for Technology Transfer (STTT) 3(3), 353–368 (2001)

    MATH  Google Scholar 

  24. Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal modeling and analysis of an audio/video protocol: an industrial case study using Uppaal. In: IEEE Real-Time Systems Symposium, RTSS 1997, pp. 2–13. IEEE Computer Society, Los Alamitos (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, United Kingdom

    Rodolfo Gómez

Authors
  1. Rodolfo Gómez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Laboratory, Oxford University, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

    Joël Ouaknine

  2. Institute for Computing and Information Sciences , Radboud University Nijmegen , P.O. Box 9010, 6500, Nijmegen, GL, The Netherlands

    Frits W. Vaandrager

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gómez, R. (2009). A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata. In: Ouaknine, J., Vaandrager, F.W. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2009. Lecture Notes in Computer Science, vol 5813. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04368-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04368-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04367-3

  • Online ISBN: 978-3-642-04368-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation