Skip to main content
SpringerLink
Log in

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata

  • Conference paper
Book cover Formal Modeling and Analysis of Timed Systems (FORMATS 2003)

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

  • 434 Accesses

Abstract

The paper presents a new method for building abstract models for Timed Automata, enabling on-the-fly reachability analysis. Our pseudo-simulating models, generated by a modified partitioning algorithm, are in many cases much smaller than forward-reachability graphs commonly applied for this kind of verification. A theoretical description of the method is supported by some preliminary experimental results.

Partly supported by the State Committee for Scientific Research under the grant No. 8T11C 01419

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., Courcoubetis, C., Dill, D., Halbwachs, N., Wong-Toi, H.: An implementation of three algorithms for timing verification based on automata emptiness. In: Proc. of the 13th IEEE Real-Time Systems Symposium (RTSS 1992), pp. 157–166. IEEE Comp. Soc. Press, Los Alamitos (1992)

    Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D., Halbwachs, N., Wong-Toi, H.: Minimization of timed transition systems. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 340–354. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  3. Audemard, G., Cimatti, A., Kornilowicz, A., Sebastiani, R.: Bounded model checking for timed systems. Technical Report 0201-05, ITC-IRST, Sommarive 16, 38050 Povo, Trento, Italy (January 2002)

    Google Scholar 

  4. Beyer, D.: Improvements in BDD-based reachability analysis of Timed Automata. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol. 2021, pp. 318–343. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Bouajjani, A., Fernandez, J.-C., Halbwachs, N., Raymond, P., Ratel, C.: Minimal state graph generation. Science of Computer Programming 18, 247–269 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bouajjani, A., Tripakis, S., Yovine, S.: On-the-fly symbolic model checking for real-time systems. In: Proc. of the 18th IEEE Real-Time Systems Symposium (RTSS 1997), pp. 232–243. IEEE Comp. Soc. Press, Los Alamitos (1997)

    Google Scholar 

  7. D’Argenio, P., Jeannet, B., Jensen, H., Larsen, K.: Reachability analysis of probabilistic systems by successive refinements. In: de Luca, L., Gilmore, S. (eds.) PROBMIV 2001, PAPM-PROBMIV 2001, and PAPM 2001. LNCS, vol. 2165, pp. 39–56. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313–329. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Dembiński, P., Janowska, A., Janowski, P., Penczek, W., Półrola, A., Szreter, M., Woźna, B., Zbrzezny, A.: VerICS: A tool for verifying Timed Automata and Estelle specifications. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 278–283. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Dembiński, P., Penczek, W., Półrola, A.: Automated verification of infinite state concurrent systems: an improvement in model generation. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 247–255. Springer, Heidelberg (2002)

    Google Scholar 

  11. Dembiński, P., Penczek, W., Półrola, A.: Verification of Timed Automata based on similarity. Fundamenta Informaticae 51(1-2), 59–89 (2002)

    MATH  MathSciNet  Google Scholar 

  12. Henzinger, T., Majumdar, R.: A classification of symbolic transition systems. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 13–34. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Kang, I., Lee, I.: An efficient state space generation for the analysis of real-time systems. In: Proc. of Int. Symposium on Software Testing and Analysis (1996)

    Google Scholar 

  14. Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: Efficient verification of realtime systems: Compact data structures and state-space reduction. In: Proc. of the 18th IEEE Real-Time System Symposium (RTSS 1997), pp. 14–24. IEEE Comp. Soc. Press, Los Alamitos (1997)

    Google Scholar 

  15. Lee, D., Yannakakis, M.: On-line minimization of transition systems. In: Proc. of the 24th ACM Symp. on the Theory of Computing, May 1992, pp. 264–274 (1992)

    Google Scholar 

  16. Niebert, P., Tripakis, S., Yovine, S.: Minimum-time reachability for Timed Automata. In: Proc. of the 8th IEEE Mediterranean Conf. on Control and Automation (MED 2000), Patros, Greece, IEEE Comp. Soc. Press, Los Alamitos (2000)

    Google Scholar 

  17. Penczek, W.: Partial order reductions for checking branching properties of Time Petri Nets. In: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P 2000). Informatik-Berichte, vol. 140, pp. 189–202. Humboldt University (2000)

    Google Scholar 

  18. Półrola, A., Penczek, W., Szreter, M.: Towards efficient partition refinement for checking reachability in Timed Automata, An electronic version of this paper available at http://www.math.uni.lodz.pl/~polrola

  19. Półrola, A., Penczek, W., Szreter, M.: Reachability analysis for Timed Automata based on partitioning. Technical Report 961, ICS PAS, Ordona 21, 01-237 Warsaw (June 2003)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Woźna, B., Penczek, W., Zbrzezny, A.: Checking reachability properties for Timed Automata via SAT. Technical Report 949, ICS PAS, Ordona 21, 01 – 237 Warsaw (October 2002)

    Google Scholar 

  22. Yannakakis, M., Lee, D.: An efficient algorithm for minimizing real-time transition systems. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 210–224. Springer, Heidelberg (1993)

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Lodz, Banacha 22, 90-238, Lodz, Poland

    Agata Półrola

  2. Institiute of Computer Science, PAS, Ordona 21, 01-237, Warsaw, Poland

    Wojciech Penczek & Maciej Szreter

  3. Institute of Informatics, Podlasie Academy, Sienkiewicza 51, 08-110, Siedlce, Poland

    Wojciech Penczek

Authors
  1. Agata Półrola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wojciech Penczek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maciej Szreter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, Aalborg University, Denmark

    Kim Guldstrand Larsen

  2. Laboratoire d’Informatique Fondamentale de Marseille, CMI, 39, rue Joliot Curie, 13453, Marseille Cedex 13, France

    Peter Niebert

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Półrola, A., Penczek, W., Szreter, M. (2004). Towards Efficient Partition Refinement for Checking Reachability in Timed Automata. In: Larsen, K.G., Niebert, P. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2003. Lecture Notes in Computer Science, vol 2791. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40903-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40903-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21671-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation