Forked from
RT-PROOFS / PROSA - Formally Proven Schedulability Analysis
Source project has a limited visibility.
-
Felipe Cerqueira authored
- Add definitions related to APA scheduling - Prove correctness of reduction-based RTA for APA scheduling (FP and EDF) - Add implementation of a weak APA scheduler - Update definition of taskset to assume uniqueness - Modify names and comments to improve readability - Remove strong assumptions about priority order in FP scheduling - Add tests with FP RTA for every model - Add tests for RTA with parallel jobs
Felipe Cerqueira authored- Add definitions related to APA scheduling - Prove correctness of reduction-based RTA for APA scheduling (FP and EDF) - Add implementation of a weak APA scheduler - Update definition of taskset to assume uniqueness - Modify names and comments to improve readability - Remove strong assumptions about priority order in FP scheduling - Add tests with FP RTA for every model - Add tests for RTA with parallel jobs