Skip to main content
SpringerLink
Log in

From MITL to Timed Automata

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

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

Abstract

We show how to transform formulae written in the real-time temporal logic MITL into timed automata that recognize their satisfying models. This compositional construction is much simpler than previously known and can be easily implemented.

This work was partially supported by the European Community project IST-2003-507219 PROSYD (Property-based System Design).

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.: Timed Automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Alur, R., Feder, T., Henzinger, T.A.: The Benefits of Relaxing Punctuality. Journal of the ACM 43, 116–146 (1996) (first published in PODC 1991)

    Google Scholar 

  4. Alur, R., Henzinger, T.A.: Logics and Models of Real-Time: A Survey. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 74–106. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  5. Alur, R., Henzinger, T.A.: Back to the Future: Towards a Theory of Timed Regular Languages. In: FOCS 1992, pp. 177–186 (1992)

    Google Scholar 

  6. Asarin, E.: Challenges in Timed Languages. Bulletin of EATCS 83 (2004)

    Google Scholar 

  7. Asarin, E., Caspi, P., Maler, O.: Timed Regular Expressions. The Journal of the ACM 49, 172–206 (2002)

    Article  MathSciNet  Google Scholar 

  8. Bozga, M., Graf, S., Mounier, L.: IF-2.0: A Validation Environment for Component-Based Real-Time Systems. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 343–348. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic Model Checking: 1020 States and Beyond. Information and Computation 98, 140–170 (1992)

    Article  MathSciNet  Google Scholar 

  10. Clarke, E.M., Grumberg, O., Hamaguchi, K.: Another look at LTL Model Checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 415–427. Springer, Heidelberg (1994)

    Google Scholar 

  11. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  12. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design 1, 275–288 (1992)

    Article  Google Scholar 

  13. Daws, C., Yovine, S.: Reducing the Number of Clock Variables of Timed Automata. In: RTSS 1996, pp. 73–81 (1996)

    Google Scholar 

  14. D’Souza, D., Tabareau, N.: On Timed Automata with Input-determined Guards. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 68–83. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Gastin, P., Oddoux, D.: Fast LTL to Büchi Automata Translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  16. Gerth, R., Peled, D.A., Vardi, M.Y., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: PSTV, pp. 3–18 (1995)

    Google Scholar 

  17. Henzinger, T.A.: It’s about Time: Real-time Logics Reviewed. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 439–454. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  18. Havelund, K., Rosu, G.: Synthesizing Monitors for Safety Properties. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 342–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Havlicek, J., Fisman, D., Eisner, C.: Basic results on the semantics of Accellera PSL 1.1 foundation language, Technical Report 2004.02, Accelera (2004)

    Google Scholar 

  20. Henzinger, T., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic Model-checking for Real-time Systems. Information and Computation 111, 193–244 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  21. Henzinger, T.A., Raskin, J.-F., Schobbens, P.-Y.: The Regular Real-time Languages. In: Ishikawa, Y., Reynders, J.V.W., Tholburn, M. (eds.) ISCOPE 1997. LNCS, vol. 1343, pp. 580–591. Springer, Heidelberg (1997)

    Google Scholar 

  22. Hirshfeld, Y., Rabinovich, A.: Logics for Real Time: Decidability and Complexity. Fundamenta Informaticae 62, 1–28 (2004)

    MathSciNet  MATH  Google Scholar 

  23. Kesten, Y., Pnueli, A.: A Compositional Approach to CTL* Verification. Theoretical Computer Science 331, 397–428 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  24. Koymans, R.: Specifying Real-time Properties with Metric Temporal Logic. Real-time Systems 2, 255–299 (1990)

    Article  Google Scholar 

  25. Kumari, A., Cohen, B., Venkataramanan, S.: Using PSL/Sugar for Formal and Dynamic Verification. VhdlCohen Publishing (2004)

    Google Scholar 

  26. Larsen, K.G., Pettersson, P., Yi, W.: Uppaal in a Nutshell. International Journal of Software Tools for Technology Transfer 1, 134–152 (1997)

    Article  MATH  Google Scholar 

  27. Maler, O., Manna, Z., Pnueli, A.: From Timed to Hybrid Systems. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol. 600, pp. 447–484. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  28. Maler, O., Nickovic, D.: Monitoring Temporal Properties of Continuous Signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 152–166. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  29. Maler, O., Nickovic, D., Pnueli, A.: Real Time Temporal Logic: Past, Present, Future. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 2–16. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  30. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Specification. Springer, Heidelberg (1991)

    Google Scholar 

  31. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)

    Google Scholar 

  32. Ouaknine, J., Worrell, J.: On the Decidability of Metric Temporal Logic. In: LICS 2005, pp. 188–197 (2005)

    Google Scholar 

  33. Raskin, J.-F., Schobbens, P.Y., Henzinger, T.A.: Axioms for Real-Time Logics. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 219–236. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  34. Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 248–263. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  35. Tauriainen, H.: Nested Emptiness Search for Generalized Bchi automata. Fundamenta Informaticae 70, 127–154 (2006)

    MathSciNet  MATH  Google Scholar 

  36. Tripakis, S.: Checking Timed Büchi Automata Emptiness on Simulation Graphs. Technical Report 2006-1, Verimag (2006)

    Google Scholar 

  37. Tripakis, S., Yovine, S., Bouajjani, A.: Checking Timed Büchi Automata Emptiness Efficiently. Formal Methods in System Design 26, 267–292 (2005)

    Article  MATH  Google Scholar 

  38. Vardi, M.Y.: Alternating Automata and Program Verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 267–278. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  39. Vardi, M.Y., Wolper, P.: An Automata-theoretic Approach to Automatic Program Verification. In: LICS 1986, pp. 322–331 (1986)

    Google Scholar 

  40. Yovine, S.: Kronos: A Verification Tool for Real-time Systems. International Journal of Software Tools for Technology Transfer 1, 123–133 (1997)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Verimag, 2 Av. de Vignate, 38610, Gières, France

    Oded Maler & Dejan Nickovic

  2. Weizmann Institute of Science, Rehovot, 76100, Israel

    Amir Pnueli

  3. New York University, 251 Mercer St., New York, NY, 10012, USA

    Amir Pnueli

Authors
  1. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dejan Nickovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amir Pnueli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIAFA, CNRS and University Paris Diderot,  

    Eugene Asarin

  2. LSV, CNRS & ENS de Cachan, France

    Patricia Bouyer

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maler, O., Nickovic, D., Pnueli, A. (2006). From MITL to Timed Automata. In: Asarin, E., Bouyer, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2006. Lecture Notes in Computer Science, vol 4202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11867340_20

Download citation

  • DOI: https://doi.org/10.1007/11867340_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45026-9

  • Online ISBN: 978-3-540-45031-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation