Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
P
PROSA - Formally Proven Schedulability Analysis
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
RT-PROOFS
PROSA - Formally Proven Schedulability Analysis
Commits
c6c18ebf
Commit
c6c18ebf
authored
1 year ago
by
Sergey Bozhko
Browse files
Options
Downloads
Patches
Plain Diff
add more lemmas about [task_scheduled_at]
parent
23c06da2
No related branches found
Branches containing commit
No related tags found
1 merge request
!314
Add "conditional" interference to remove duplication
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
analysis/facts/model/task_schedule.v
+33
-10
33 additions, 10 deletions
analysis/facts/model/task_schedule.v
with
33 additions
and
10 deletions
analysis/facts/model/task_schedule.v
+
33
−
10
View file @
c6c18ebf
...
...
@@ -31,30 +31,53 @@ Section TaskSchedule.
(** Let [tsk] be any task. *)
Variable
tsk
:
Task
.
(** We show that if a job of task [tsk] is scheduled at time [t],
then task [tsk] is scheduled at time [t]. *)
Lemma
job_of_task_scheduled_implies_task_scheduled
:
(** We show that if the processor is idle at time [t], then no task
is scheduled. *)
Lemma
idle_implies_no_task_scheduled
:
forall
t
,
is_idle
arr_seq
sched
t
->
~~
task_scheduled_at
arr_seq
sched
tsk
t
.
Proof
.
move
=>
t
IDLE
;
rewrite
/
task_scheduled_at
.
case
EQ
:
(
scheduled_job_at
arr_seq
sched
t
)
=>
[
j
|
//
]
.
exfalso
.
apply
scheduled_job_at_iff
in
EQ
=>
//.
move
:
IDLE
=>
/
negPn
/
negP
=>
IDLE
;
apply
:
IDLE
.
by
apply
is_nonidle_iff
=>
//.
Qed
.
(** We show that if a job is scheduled at time [t], then
[task_scheduled_at tsk t] is equal to [job_of_task tsk j]. In
other words, any occurrence of [task_scheduled_at] can be
replaced with [job_of_task]. *)
Lemma
job_scheduled_implies_task_scheduled_eq_job_task
:
forall
j
t
,
scheduled_at
sched
j
t
->
task_scheduled_at
arr_seq
sched
tsk
t
=
job_of_task
tsk
j
.
Proof
.
by
move
=>
j
t
;
rewrite
-
(
scheduled_job_at_iff
arr_seq
)
//
/
task_scheduled_at
=>
->
.
Qed
.
(** As a corollary, we show that if a job of task [tsk] is scheduled
at time [t], then task [tsk] is scheduled at time [t]. *)
Corollary
job_of_task_scheduled_implies_task_scheduled
:
forall
j
t
,
job_of_task
tsk
j
->
scheduled_at
sched
j
t
->
task_scheduled_at
arr_seq
sched
tsk
t
.
Proof
.
move
=>
j
t
TSK
.
rewrite
-
(
scheduled_job_at_iff
arr_seq
)
//
/
task_scheduled_at
=>
->
.
by
move
:
TSK
;
rewrite
/
job_of_task
.
by
move
=>
j
t
TSK
SCHED
;
rewrite
(
job_scheduled_implies_task_scheduled_eq_job_task
j
)
=>
//.
Qed
.
(** And vice versa, if no job of task [tsk] is scheduled at time
[t], then task [tsk] is not scheduled at time [t]. *)
Lemma
job_of_task_scheduled_implies_task_scheduled'
:
Corollary
job_of_task_scheduled_implies_task_scheduled'
:
forall
j
t
,
~~
job_of_task
tsk
j
->
scheduled_at
sched
j
t
->
~~
task_scheduled_at
arr_seq
sched
tsk
t
.
Proof
.
move
=>
j
t
TSK
SCHED
;
apply
:
contra
;
last
exact
:
TSK
.
move
:
SCHED
;
rewrite
-
(
scheduled_job_at_iff
arr_seq
)
//
/
task_scheduled_at
=>
->
.
by
rewrite
/
job_of_task
.
by
move
=>
j
t
TSK
SCHED
;
rewrite
(
job_scheduled_implies_task_scheduled_eq_job_task
j
)
=>
//.
Qed
.
End
TaskSchedule
.
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment