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
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
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
Lasse Blaauwbroek
PROSA - Formally Proven Schedulability Analysis
Commits
b59b3d3a
Commit
b59b3d3a
authored
5 years ago
by
Björn Brandenburg
Browse files
Options
Downloads
Patches
Plain Diff
prove ready jobs are incomplete
parent
a63ca8f7
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
restructuring/behavior/facts/completion.v
+37
-0
37 additions, 0 deletions
restructuring/behavior/facts/completion.v
with
37 additions
and
0 deletions
restructuring/behavior/facts/completion.v
+
37
−
0
View file @
b59b3d3a
...
...
@@ -286,3 +286,40 @@ Section PositiveCost.
Qed
.
End
PositiveCost
.
Section
RelationToReady
.
(* Consider any kinds of jobs and any kind of processor state. *)
Context
{
Job
:
JobType
}
{
PState
:
Type
}
.
Context
`{
ProcessorState
Job
PState
}
.
(* Consider any schedule... *)
Variable
sched
:
schedule
PState
.
(* ...and suppose that jobs have a cost, an arrival time, and a notion of
readiness. *)
Context
`{
JobCost
Job
}
.
Context
`{
JobArrival
Job
}
.
Context
`{
JobReady
Job
PState
}
.
(* We observe that a given job is ready only if it is also incomplete... *)
Lemma
ready_implies_incomplete
:
forall
j
t
,
job_ready
sched
j
t
->
~~
completed_by
sched
j
t
.
Proof
.
move
=>
j
t
READY
.
move
:
(
any_ready_job_is_pending
sched
j
t
READY
)
.
by
rewrite
/
pending
=>
/
andP
[_
INCOMPLETE
]
.
Qed
.
(* ...and lift this observation also to the level of whole schedules. *)
Lemma
completed_jobs_are_not_ready
:
jobs_must_be_ready_to_execute
sched
->
completed_jobs_dont_execute
sched
.
Proof
.
rewrite
/
jobs_must_be_ready_to_execute
/
completed_jobs_dont_execute
.
move
=>
READY_IF_SCHED
j
t
SCHED
.
move
:
(
READY_IF_SCHED
j
t
SCHED
)
=>
READY
.
rewrite
less_service_than_cost_is_incomplete
.
by
apply
ready_implies_incomplete
.
Qed
.
End
RelationToReady
.
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