Unification & Sharing in Timed Automata Verification | SpringerLink
Skip to main content
Springer Nature Link
Log in

Unification & Sharing in Timed Automata Verification

  • Conference paper
  • First Online:
Model Checking Software (SPIN 2003)

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

Included in the following conference series:

Abstract

We present work on unifying the two main data structures involved during reachability analysis of timed automata. We also present result on sharing common elements between states. The experimental evaluations show speedups of up to 60% and memory savings of up to 80% compared to previous implementations.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. S. Christensen and L. M. Kristensen. State space analysis of hierarchical coloured petri nets. In B. Farwer, D. Moldt, and M-O. Stehr, editors, Proceedings of PNSE’97, number 205, pages 32–43, Hamburg, Germany, 1997.

    Google Scholar 

  2. Gianfranco F. Ciardo and David M. Nicol. Automated parallelization of discrete state-space generation. In Journal of Parallel and Distributed Computing, volume 47, pages 153–167. ACM, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Uppsala University, Sweden

    Alexandre David & Wang Yi

  2. Department of Computer Science, Aalborg University, Denmark

    Gerd Behrmann & Kim G. Larsen

Authors
  1. Alexandre David
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerd Behrmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wang Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Thomas Ball  & Sriram K. Rajamani  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

David, A., Behrmann, G., Larsen, K.G., Yi, W. (2003). Unification & Sharing in Timed Automata Verification. In: Ball, T., Rajamani, S.K. (eds) Model Checking Software. SPIN 2003. Lecture Notes in Computer Science, vol 2648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44829-2_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-44829-2_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44829-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics