Skip to main content
SpringerLink
Log in

Accelerating worst case execution time analysis of timed automata models with cyclic behaviour

  • Original Article
  • Published:
Formal Aspects of Computing

Abstract

The paper presents a new efficient algorithm for computing worst case execution time (WCET) of systems modelled as timed automata (TA). The algorithm uses a set of abstraction techniques that improve significantly the efficiency of WCET analysis of TA models with cyclic behaviour. We show that the proposed abstractions are exact with respect to the WCET problem in the sense that the WCET computed in the abstract model is equal to the one computed in the concrete model. We also compare our algorithm with the one implemented in the model checker UPPAAL which shows that when infinite cycles exist (i.e. cycles that can be run infinitely often), UPPAAL’s algorithm may not terminate, and when largely repetitive finite cycles exist (i.e. cycles that can be run a large number of times but finite), UPPAAL’s algorithm suffers from the state space explosion, thus leading to a low efficiency or resource exhaustion.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Al-Bataineh O (2015) Verifying worst-case execution time of timed automata models with cyclic behaviour. Ph.D. thesis, University of Western Australia, Perth, Australia

  2. Al-Bataineh O, Reynolds M, French T (2014) Finding best and worst case execution times of systems using difference-bound matrices. In: FORMATS’14, Lecture notes in computer science. Springer, Berlin

  3. Alur R, Dill D (1994) A theory of timed automata. In: TCS, pp 183–235

  4. Alur R (1998) Timed automata. In: NATO ASI summer school on verification of digital and hybrid systems

  5. Bardin S, Finkel A, Leroux J, Schnoebelen P (2005) Flat acceleration in symbolic model checking. In: Automated technology for verification and analysis, third international symposium, ATVA 2005, Taipei, Taiwan, October 4–7, 2005, Proceedings, pp 474–488

  6. Bardin S, Leroux J, Point G (2006) FAST extended release. In: Computer aided verification, 18th international conference, CAV 2006, Seattle, WA, USA, August 17–20, 2006, Proceedings, pp 63–66

  7. Behrmann G, Fehnker A, Hune T, Larsen K, Pettersson P, Romijn J (2001) Efficient guiding towards cost-optimality in uppaal. In: Proceedings of the 7th international conference on tools and algorithms for the construction and analysis of systems, TACAS 2001. Springer, Berlin, pp 174–188

  8. Behrmann G, Bouyer P, Fleury E, Larsen KG (2003) Static guard analysis in timed automata verification. In: Proceedings of the 9th international conference on tools and algorithms for the construction and analysis of systems, TACAS’03. Springer, Berlin, pp 254–270

  9. Behrmann G, David A, Larsen KG (2004) A tutorial on Uppaal. In: Formal methods for the design of real-time systems (SFM-RT 2004). Springer, Berlin, pp 200–236

  10. Behrmann G, Larsen KG, Rasmussen JI (2005) Beyond liveness: efficient parameter synthesis for time bounded liveness. In: FORMATS, pp 81–94

  11. Behrmann G, Bouyer P, Larsen KG, Radek P (2006) Lower and upper bounds in zone-based abstractions of timed automata. Int J Softw Tools Technol Transf 204–215

  12. Bengtsson J, Yi W (2004) Timed automata: semantics, algorithms and tools. In: Lecture notes on concurrency and petri nets. Springer, Berlin

  13. Boigelot B, Wolper P (1994) Symbolic verification with periodic sets. In: Computer aided verification, 6th international conference, CAV ’94, Stanford, California, USA, June 21–23, 1994, Proceedings, pp 55–67

  14. Boigelot B, Godefroid P, Willems B, Wolper P (1997) The power of QDDs (extended abstract). In: Static analysis, 4th international symposium, SAS ’97, Paris, France, September 8–10, 1997, Proceedings, pp 172–186

  15. Boigelot B, Godefroid P (1999) Symbolic verification of communication protocols with infinite state spaces using QDDs. Formal Methods Syst Des 14(3): 237–255

    Article  Google Scholar 

  16. Bouyer P (2004) Forward analysis of updatable timed automata. Formal Methods Syst Des 24(3): 281–320

    Article  MATH  Google Scholar 

  17. Bowman H, Gómez R (2006) How to stop time stopping. Formal Aspect Comput 18(4): 459–493

    Article  MATH  Google Scholar 

  18. Bozga M, Iosif R, Konecný F (2010) Fast acceleration of ultimately periodic relations. In: Computer aided verification, 22nd international conference, CAV 2010, Edinburgh, UK, July 15–19, 2010. Proceedings, pp 227–242

  19. Clarke EM, Grumberg O, Long DE (1994) Model checking and abstraction. ACM Trans Program Lang Syst 16: 1512–1542

    Article  Google Scholar 

  20. Clarke EM, Grumberg O, Peled D (2001) Model checking. MIT Press, Cambridge

  21. Dalsgaard AE, Olesen MC, Toft M, Hansen RR, Larsen KG (2010) METAMOC: modular execution time analysis using model checking. In: 10th international workshop on worst-case execution time analysis (WCET 2010), pp 113–123

  22. Dalsgaard AE, Hansen RR, Jrgensen KY, Larsen KG, Olesen MC, Olsen P, Srba J (2011) opaal: a lattice model checker. In: NASA formal methods’11, pp 487–493

  23. Daws C, Tripakis S (1998) Model checking of real-time reachability properties using abstractions. In: Proceedings of the 4th international conference on tools and algorithms for construction and analysis of systems, TACAS ’98. Springer, London, pp 313–329

  24. Daws C, Tripakis S (1998) Model checking of real-time reachability properties using abstractions. In: Proceedings of the 4th international conference on tools and algorithms for construction and analysis of systems, TACAS ’98. Springer, London, pp 313–329.

  25. Dill D (1990) Timing assumptions and verification of finite-state concurrent systems. In: Proceedings of the international workshop on automatic verification methods for finite state systems, Springer, New York, pp 197–212

  26. Fietzke A, Kruglov E, Weidenbach C (2012) Automatic generation of invariants for circular derivations in SUP(LA). In: Logic for programming, artificial intelligence, and reasoning—18th international conference, LPAR-18, Mérida, Venezuela, March 11–15, 2012. Proceedings, pp 197–211

  27. Floyd RW (1962) Algorithm 97: shortest path. Commun ACM

  28. Gómez R (2006) Verification of real-time systems: improving tool support. Ph.D. thesis, Computing Laboratory, University of Kent

  29. Hendriks M, Larsen KG (2002) Exact acceleration of real-time model checking. Electr Notes Theor Comput Sci 65(6):120–139

  30. Huber B, Schoeberl M (2009) Comparison of implicit path enumeration and model checking based WCET analysis. In: Holsti N (ed) 9th international workshop on worst-case execution time analysis (WCET’09), OpenAccess series in informatics (OASIcs), vol 10. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Wadern pp 1–12

  31. Metzner A (2004) Why model checking can improve WCET analysis. In: Proceeding of the international conference on computer-aided verification (CAV), pp 334–347

  32. Pettersson P (1999) Modelling and verification of real-time systems using timed automata: theory and practice. Ph.D. thesis, Uppsala University

  33. Rokicki TG (1993) Representing and modeling digital circuits. Ph.D. thesis, Stanford University

  34. Salah RB (2007) On timing analysis of large systems. Ph.D. thesis, Institut National Polytechnique De Grenoble

  35. Wilhelm R 2004 Why AI +  ILP is good for WCET, but MC is not, nor ILP alone. In: Steffen B, Levi G (eds) VMCAI, pp 309–322

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia

    Omar Al-Bataineh, Mark Reynolds & Tim French

Authors
  1. Omar Al-Bataineh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mark Reynolds
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tim French
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Omar Al-Bataineh.

Additional information

Communicated by Amilcar Sernadas

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al-Bataineh, O., Reynolds, M. & French, T. Accelerating worst case execution time analysis of timed automata models with cyclic behaviour. Form Asp Comp 27, 917–949 (2015). https://doi.org/10.1007/s00165-015-0340-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-015-0340-4

Keywords

Search

Navigation