The purpose of this paper is to introduce frameworks based on data-flow equations which provide for estimating the worst-case execution time (WCET) of (real-time) programs. These frameworks allow several different WCET analysis techniques, which range from nave approaches to exact analysis

This note describes a novel list-sorting method for Prolog which is stable, has O(n log n) worst-case behaviour and O(n) best-case behaviour. The algorithm is an adaptive variant of bottom-up mergesort using so-called long runs of preexisting order to improve efficiency; accordingly we have called

Timeliness is a critical aspect of real-time systems since both functional and temporal properties must be guaranteed to ensure correct system behaviour. This requirement is safeguarded in the real-time research community by means of Worst-Case Execution Time (WCET) analysis. Conventionally, a

The worst case behaviour of the greedy heuristic for independence systems is analyzed by deriving lower bounds for the ratio of the greedy solution value to the optimal value. For two special independence systems, this ratio can be bounded by 1/2, for two other independence systems, it converges

Abstract—Determination of accurate estimates for the Worst-Case Execution Time of a program is essential for guaranteeing the correct temporal behaviour of any Real-Time System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue

contribution of this paper is to give a methodology for the setting of the T TR parameter, by proper analysis of the worst-case real token rotation time (T RR ). 1 Introduction Communication networks aimed at the interconnection of sensors, actuators and controllers are commonly known as fieldbus networks

, with potential for parallelisation, because it constructs a pseudo-model “on the fly ” by exploring each tableau branch independently. But its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB

, with potential for parallelisation, because it constructs a pseudo-model “on the fly ” by exploring each tableau branch independently. But its worst-case behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB

Text-compression problems are considered where substrings are substituted by code-- words according to a static dictionary such that the original text is encoded by a shorter code sequence. We introduce a new efficient on-line heuristic which locally maximizes the compaction ratio. The worst-case

Many methods to calculate message latencies for Controller Area Network (CAN) have previously been presented based upon the static worst-case behaviour of the system. With the use of mo dern simulation tools however, the behaviour of CAN networks can be simulated dynamically in order to find