Skip to content
Snippets Groups Projects
Select Git revision
  • master default protected
  • classic-prosa
  • wip-hunspell
  • prepare_MC_PR
  • tutorial
  • fset
  • embed_arr_seq_uniq
  • v0.5
  • v0.4
  • v0.3
  • v0.2
  • v0.1
12 results
Blame Permalink
Forked from RT-PROOFS / PROSA - Formally Proven Schedulability Analysis
Source project has a limited visibility.
  • Sergey Bozhko's avatar
    29556ed5
    relax assumption in aRTA · 29556ed5
    Sergey Bozhko authored 
    Currently, aRTA required [F] to be solution of equation
[A + F = task_rtct + IBF A (A + F)], this commit relaxes
this assumption to [A + F >= task_rtct + IBF A (A + F)]
    29556ed5
    History
    relax assumption in aRTA
    Sergey Bozhko authored 
    Currently, aRTA required [F] to be solution of equation
[A + F = task_rtct + IBF A (A + F)], this commit relaxes
this assumption to [A + F >= task_rtct + IBF A (A + F)]