Knowing the Worst-Case Execution Time (WCET) of a program is necessary
when designing and verifying real-time systems. A correct WCET
calculation method must take into account the possible program flow
(like loop iterations and function calls), as well as effects of hardware
features like caches and pipelines.
In this paper we describe our work on comparing two different calculation
methods for finding the WCET of a real-time program, namely the
Implicit Path Enumeration Technique (IPET) and the
Path-based calculation method.
We investigate a structured way to fairly compare the
computational complexity, as well as the
expressiveness, i.e. the set of possible program flow constraints that can
be handled by the two methods.
