Skip to content
Snippets Groups Projects
Forked from RT-PROOFS / PROSA - Formally Proven Schedulability Analysis
Source project has a limited visibility.
  • Marco Maida's avatar
    7a653e51
    revise ideal uniprocessor schedule facts · 7a653e51
    Marco Maida authored and Björn Brandenburg's avatar Björn Brandenburg committed
    - Slightly change `valid_nonpreemptive_readiness` so that `sched` is a
      parameter. This way, the proposition can be assumed to hold only for a
      certain schedule (making weaker assumptions).
    
    - Modify `prev_job_nonpreemptive, to unconditionally get
      `jobs_must_be_ready_to_execute`.
      
    - Revise lemmas accordingly. 
    7a653e51
    History
    revise ideal uniprocessor schedule facts
    Marco Maida authored and Björn Brandenburg's avatar Björn Brandenburg committed
    - Slightly change `valid_nonpreemptive_readiness` so that `sched` is a
      parameter. This way, the proposition can be assumed to hold only for a
      certain schedule (making weaker assumptions).
    
    - Modify `prev_job_nonpreemptive, to unconditionally get
      `jobs_must_be_ready_to_execute`.
      
    - Revise lemmas accordingly.