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
ec51a2dc
Commit
ec51a2dc
authored
4 years ago
by
Sergey Bozhko
Committed by
Björn Brandenburg
3 years ago
Browse files
Options
Downloads
Patches
Plain Diff
note basic `task_schedule` properties
parent
3ebb171f
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!130
Switch basic readiness to sequential readiness in [results] folder
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
analysis/facts/model/task_schedule.v
+50
-0
50 additions, 0 deletions
analysis/facts/model/task_schedule.v
with
50 additions
and
0 deletions
analysis/facts/model/task_schedule.v
0 → 100644
+
50
−
0
View file @
ec51a2dc
Require
Export
prosa
.
model
.
task
.
concept
.
Require
Export
prosa
.
analysis
.
definitions
.
task_schedule
.
Require
Export
prosa
.
analysis
.
facts
.
model
.
ideal_schedule
.
(** In this file we provide basic properties related to schedule of a task. *)
Section
TaskSchedule
.
(** Consider any type of tasks ... *)
Context
{
Task
:
TaskType
}
.
Context
`{
TaskCost
Task
}
.
(** ... and any type of jobs associated with these tasks. *)
Context
{
Job
:
JobType
}
.
Context
`{
JobTask
Job
Task
}
.
Context
`{
JobArrival
Job
}
.
Context
`{
JobCost
Job
}
.
(** Let [sched] be any ideal uni-processor schedule. *)
Variable
sched
:
schedule
(
ideal
.
processor_state
Job
)
.
(** 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
:
forall
j
t
,
job_of_task
tsk
j
->
scheduled_at
sched
j
t
->
task_scheduled_at
sched
tsk
t
.
Proof
.
intros
?
?
TSK
SCHED
.
unfold
task_scheduled_at
.
by
move
:
SCHED
;
rewrite
scheduled_at_def
=>
/
eqP
->
.
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'
:
forall
j
t
,
~~
job_of_task
tsk
j
->
scheduled_at
sched
j
t
->
~~
task_scheduled_at
sched
tsk
t
.
Proof
.
move
=>
j
t
/
negP
TSK
SCHED
;
apply
/
negP
=>
TSCHED
;
apply
:
TSK
.
move
:
SCHED
;
rewrite
scheduled_at_def
=>
/
eqP
SCHED
.
by
move
:
TSCHED
;
rewrite
/
task_scheduled_at
SCHED
.
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