Crate response_time_analysis

Response-Time Analysis (RTA)

This crate collects interfaces, definitions, and algorithms for the response-time analysis of real-time systems.

Scope

The crate does not provide a ready-made tool itself, is not specific to any particular input format or set of assumptions, and does not offer or require a canonical task representation. Rather, it is intended as a low-level library of reusable definitions and analyses, held together by a bunch of traits. Based on this foundation, higher-level facilities (and one-off research tools) may be built.

Citations

Some of the algorithms and analyses implemented in this crate come from published papers, as mentioned in the documentation. If you use this crate for academic work, please cite the paper(s) corresponding to the analysis that you are using.

Modules

arrival

Models of arrival processes (periodic, sporadic, etc.)

demand

The request-bound function (RBF) abstraction and related definitions

edf

RTAs for earliest-deadline first (EDF) scheduling

fifo

An RTA for first-in first-out (FIFO) scheduling

fixed_point

Helper functions for fixed-point searches

fixed_priority

RTAs for fixed-priority (FP) scheduling

ros2

RTAs for the default ROS2 executor

supply

Models of resource supply (e.g., dedicated processors, reservations, etc.)

time

A simple discrete time model with type-safe wrappers

wcet

Models of resource needs such as a task’s scalar worst-case execution time (WCET)