Results 11  20
of
317
DataFlow Frameworks for WorstCase Execution Time Analysis
 RealTime Systems
, 2000
"... The purpose of this paper is to introduce frameworks based on dataflow equations which provide for estimating the worstcase execution time (WCET) of (realtime) programs. These frameworks allow several different WCET analysis techniques, which range from nave approaches to exact analysis, provided ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
The purpose of this paper is to introduce frameworks based on dataflow equations which provide for estimating the worstcase execution time (WCET) of (realtime) programs. These frameworks allow several different WCET analysis techniques, which range from nave approaches to exact analysis
‘Runsort’—An Adaptive Mergesort for Prolog
, 2005
"... This note describes a novel listsorting method for Prolog which is stable, has O(n log n) worstcase behaviour and O(n) bestcase behaviour. The algorithm is an adaptive variant of bottomup mergesort using socalled long runs of preexisting order to improve efficiency; accordingly we have called i ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This note describes a novel listsorting method for Prolog which is stable, has O(n log n) worstcase behaviour and O(n) bestcase behaviour. The algorithm is an adaptive variant of bottomup mergesort using socalled long runs of preexisting order to improve efficiency; accordingly we have called
MeasurementBased WorstCase Execution Time (WCET) Analysis
"... Timeliness is a critical aspect of realtime systems since both functional and temporal properties must be guaranteed to ensure correct system behaviour. This requirement is safeguarded in the realtime research community by means of WorstCase Execution Time (WCET) analysis. Conventionally, a stati ..."
Abstract
 Add to MetaCart
Timeliness is a critical aspect of realtime systems since both functional and temporal properties must be guaranteed to ensure correct system behaviour. This requirement is safeguarded in the realtime research community by means of WorstCase Execution Time (WCET) analysis. Conventionally, a
D.: An analysis of the greedy heuristic for independence systems
 In: Annals of Discrete Math
, 1978
"... 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 wi ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
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
1 Accurate Determination of Loop Iterations for WorstCase Execution Time Analysis
"... Abstract—Determination of accurate estimates for the WorstCase Execution Time of a program is essential for guaranteeing the correct temporal behaviour of any RealTime System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue pessimism ..."
Abstract
 Add to MetaCart
Abstract—Determination of accurate estimates for the WorstCase Execution Time of a program is essential for guaranteeing the correct temporal behaviour of any RealTime System. Of particular importance is tightly bounding the number of iterations of loops in the program or excessive undue
Analysis of the WorstCase Real Token Rotation Time in PROFIBUS Networks
 In Proceedings of the Fieldbus Conference (FeT ’99
, 1999
"... . This paper provides a comprehensive study on how to support time critical distributed applications using PROFIBUS. We show that, despite the absence of synchronous bandwidth allocation, it is possible to guarantee realtime behaviour for the highpriority traffic in PROFIBUS networks. The main ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
contribution of this paper is to give a methodology for the setting of the T TR parameter, by proper analysis of the worstcase 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
An Onthefly Tableaubased Decision Procedure for P DLSatisfiability
"... We present a tableaubased algorithm for deciding satisfiability for propositional dynamic logic (P DL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good loops from bad loops during backtracking. It is easy to implement, with ..."
Abstract
 Add to MetaCart
, with potential for parallelisation, because it constructs a pseudomodel “on the fly ” by exploring each tableau branch independently. But its worstcase behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB
An Onthefly Tableaubased Decision Procedure for PDLSatisfiability
, 2008
"... We present a tableaubased algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra information from children to parents to separate good loops from bad loops during backtracking. It is easy to implement, with ..."
Abstract
 Add to MetaCart
, with potential for parallelisation, because it constructs a pseudomodel “on the fly ” by exploring each tableau branch independently. But its worstcase behaviour is 2EXPTIME rather than EXPTIME. A prototype implementation in the TWB
The Fractional Greedy Algorithm for Data Compression
"... Textcompression 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 online heuristic which locally maximizes the compaction ratio. The worstcase be ..."
Abstract
 Add to MetaCart
Textcompression 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 online heuristic which locally maximizes the compaction ratio. The worstcase
AUTOMOTIVE CAN NETWORK RESPONSE TIME ANALYSIS WITH VARIABLE JITTER
"... Many methods to calculate message latencies for Controller Area Network (CAN) have previously been presented based upon the static worstcase 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 the lik ..."
Abstract
 Add to MetaCart
Many methods to calculate message latencies for Controller Area Network (CAN) have previously been presented based upon the static worstcase 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
Results 11  20
of
317