Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1999: Foundations of Software Technology and Theoretical Computer Science pp 232–244Cite as

Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata

  • Conference paper
  • First Online:

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

Abstract

Theoretical investigations of infinite-state systems have so far concentrated on decidability results; in the case of timed automata these results are based on region graphs. We investigate the specific procedure that is used practically in order to decide verification problems, namely symbolic forward analysis. This procedure is possibly nonterminating. We present basic concepts and properties that are useful for reasoning about sufficient termination conditions, and then derive some conditions. The central notions here are constraint transformers associated with sequences of automaton edges and zone trees labeled with successor constraints.

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. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–236, 1994. 232, 232, 232

    Article  MATH  MathSciNet  Google Scholar 

  2. F. Balarin. Approximate reachability analysis of timed automata. In Proceedings of 17th IEEE Real-Time Systems Symposium, pages 52–61. IEEE Computer Society Press, 1996. 232

    Google Scholar 

  3. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Li`ege, 1998. 243

    Google Scholar 

  4. C. Daws and S. Tripakis. Model checking of real-time reachability properties using abstractions. In B. Steffen, editor, Proceedings of the 4th International Conference on Tools and Algorithms for the Construction of Systems, LNCS 1384, pages 313–329. Springer-Verlag, 1998. 232, 233, 234

    Chapter  Google Scholar 

  5. G. Delzanno and A. Podelski. Model checking in CLP. In Rance Cleaveland, editor, Proceedings of TACAS’99, the Second International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1579 of Springer LNCS. Springer-Verlag, 1999. 237

    Google Scholar 

  6. S. Eilenberg. Automata, Languages and Machines, volume B. Academic Press, 1976. 243

    Google Scholar 

  7. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 373–382. ACM Press, 1995. 232, 233

    Google Scholar 

  8. T. A. Henzinger, O. Kupferman, and S. Qadeer. From pre-historic to postmodern symbolic model checking. In Proceedings of the International Conference on Computer-Aided Verification, pages 195–206. Springer, 1998. 232

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. W. K. C. Lam and R. K. Brayton. Alternating RQ timed automata. In C. Courcoubetis, editor, Proceedings of the 5th International Conference on Computer-Aided Verification, LNCS 697, pages 236–252. Springer-Verlag, 1993. 239, 239, 239, 240

    Google Scholar 

  11. K.G. Larsen, P. Pettersson, and W. Yi. Compositional and symbolic model checking of real-time systems. In Proceedings of the 16th Annual Real-time Systems Symposium, pages 76–87. IEEE Computer Society Press, 1995. 232, 232, 242

    Google Scholar 

  12. K. Marriott and P. J. Stuckey. Programming with Constraints: An Introduction. MITPress, 1998. 237

    Google Scholar 

  13. S. Mukhopadhyay and A. Podelski. Beyond region graphs: Symbolic forward analysis of timed automata, 1999. Full Version. Available at http://www.mpisb. mpg.de/~podelski. 242

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Supratik Mukhopadhyay & Andreas Podelski

Authors
  1. Supratik Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Podelski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Chennai, 600036, India

    C. Pandu Rangan

  2. Institute of Mathematical Sciences C.I.T. Campus, Chennai, 600113, India

    V. Raman  & R. Ramanujam  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mukhopadhyay, S., Podelski, A. (1999). Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-46691-6_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66836-7

  • Online ISBN: 978-3-540-46691-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation