Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Modeling and Analysis of Timed Systems

FORMATS 2007: Formal Modeling and Analysis of Timed Systems pp 130–146Cite as

Dynamical Properties of Timed Automata Revisited

  • Conference paper

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

Abstract

We give a generalization of a solution by Puri to the problem of checking emptiness in timed automata with drifting clocks for the case of automata with non-closed guards. We show that non-closed guards pose certain specific problems which cannot be handled by Puri’s algorithm, and propose a new algorithm, based on the idea of “boundary clock regions” of Alur, LaTorre and Pappas. We then give a symbolic algorithm for solving the reachability problem. Our algorithm is based on a symbolic construction of the “neighborhood” of a zone, and on a procedure that, given a set of zones \(\mathcal{Z}\), builds the forward propagation of the strongly connected components which can be reached from \(\mathcal{Z}\). This improves a symbolic algorithm of Daws and Kordy, due to the ability to handle sets of zones.

This is a preview of subscription content, 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

Learn about 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  MATH  MathSciNet  Google Scholar 

  2. Alur, R., Henzinger, T.A., Vardi, M.: Parametric real-time reasoning. In: Proceedings of STOC 1993, pp. 592–601. ACM Press, New York (1993)

    Google Scholar 

  3. Altisen, K., Tripakis, S.: Implementation of timed automata: An issue of semantics or modeling? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 273–288. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: a model-checking tool for real-time systems. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 546–550. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Bloem, R., Gabow, H.N., Somenzi, F.: An algorithm for strongly connected component analysis in \(n \ \log\ n\) symbolic steps. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 37–54. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Bouyer, P., Laroussinie, F., Reynier, P.-A.: Diagonal constraints in timed automata: Forward analysis of timed systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 112–126. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. DeWulf, M., Doyen, L., Markey, N., Raskin, J.F.: Robustness and implementability of timed automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 118–133. Springer, Heidelberg (2004)

    Google Scholar 

  9. DeWulf, M., Doyen, L., Raskin, J.-F.: Systematic implementation of real-time models. In: Fitzgerald, J.A., Hayes, I.J., Tarlecki, A. (eds.) FM 2005. LNCS, vol. 3582, pp. 139–156. Springer, Heidelberg (2005)

    Google Scholar 

  10. DeWulf, M., Doyen, L., Raskin, J.F.: Almost asap semantics: from timed models to timed implementations. Formal Aspects of Computing 17(3), 319–341 (2005)

    Article  Google Scholar 

  11. David, A., Hakanson, J., Larsen, K.G., Petersson, P.: Model checking timed automata with priorities with DBM subtraction. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 128–142. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Dima, C.: Dynamical properties of timed automata revisited. Technical Report TR-2006-03, LACL, Université Paris 12 (2006)

    Google Scholar 

  13. Daws, C., Kordy, P.: Symbolic robustness analysis of timed automata. In: Asarin, E., Bouyer, P. (eds.) FORMATS 2006. LNCS, vol. 4202, pp. 143–155. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Gentilini, R., Piazza, C., Policriti, A.: Computing strongly connected components in a linear number of symbolic steps. In: Proceedings of SODA 2003, pp. 573–582 (2003)

    Google Scholar 

  15. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: HYTECH: A model checker for hybrid systems. Software Tools for Technol. Transfer 1, 110–122 (1997)

    Article  MATH  Google Scholar 

  16. Henzinger, T.A., Kopke, P.W., Puri, A., Varaiya, P.: What’s decidable about hybrid automata. J. Comput. Syst. Sci. 57, 94–124 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  17. Larsen, K.G., Pearson, J., Weise, C., Yi, W.: Clock difference diagrams. Nord. J. Comput. 6, 271–298 (1999)

    MATH  MathSciNet  Google Scholar 

  18. Larsen, K.G., Petterson, P., Yi, W.: Uppaal: Status & developments. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 456–459. Springer, Heidelberg (1997)

    Google Scholar 

  19. Puri, A.: Dynamical properties of timed automata. In: Ravn, A.P., Rischel, H. (eds.) FTRTFT 1998. LNCS, vol. 1486, pp. 210–227. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Wong-Toi, H.: Analysis of slope-parametric rectangular automata. In: Antsaklis, P.J., Kohn, W., Lemmon, M.D., Nerode, A., Sastry, S.S. (eds.) Hybrid Systems V. LNCS, vol. 1567, pp. 390–413. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Yovine, S.: Model-checking timed automata. In: Rozenberg, G. (ed.) Lectures on Embedded Systems. LNCS, vol. 1494, pp. 114–152. Springer, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LACL, Université Paris 12, 61 av. du Général de Gaulle, 94010 Créteil, France

    Cătălin Dima

Authors
  1. Cătălin Dima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-François Raskin P. S. Thiagarajan

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dima, C. (2007). Dynamical Properties of Timed Automata Revisited. In: Raskin, JF., Thiagarajan, P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75454-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75454-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-75453-4

  • Online ISBN: 978-3-540-75454-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation