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
3ebb171f
Commit
3ebb171f
authored
4 years ago
by
Sergey Bozhko
Committed by
Björn Brandenburg
3 years ago
Browse files
Options
Downloads
Patches
Plain Diff
add two helper lemmas on processor service
parent
3f3fac41
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
analysis/facts/behavior/service.v
+33
-4
33 additions, 4 deletions
analysis/facts/behavior/service.v
with
33 additions
and
4 deletions
analysis/facts/behavior/service.v
+
33
−
4
View file @
3ebb171f
...
...
@@ -156,11 +156,20 @@ Section UnitService.
by
move
=>
t
;
rewrite
/
service_at
.
Qed
.
(** ...which implies that the cumulative service received by job [j] in any
interval of length delta is at most delta. *)
(** ... which implies that the instantaneous service always equals to 0 or 1. *)
Corollary
service_is_zero_or_one
:
forall
t
,
service_at
sched
j
t
=
0
\/
service_at
sched
j
t
=
1
.
Proof
.
intros
.
have
Lewf
:=
service_at_most_one
t
.
remember
(
service_at
sched
j
t
)
as
ρ
.
by
destruct
ρ
;
last
destruct
ρ
;
[
left
|
right
|
exfalso
]
.
Qed
.
(** Next we prove that the cumulative service received by job [j] in
any interval of length [delta] is at most [delta]. *)
Lemma
cumulative_service_le_delta
:
forall
t
delta
,
service_during
sched
j
t
(
t
+
delta
)
<=
delta
.
forall
t
delta
,
service_during
sched
j
t
(
t
+
delta
)
<=
delta
.
Proof
.
unfold
service_during
;
intros
t
delta
.
apply
leq_trans
with
(
n
:=
\
sum_
(
t
<=
t0
<
t
+
delta
)
1
);
...
...
@@ -168,6 +177,26 @@ Section UnitService.
by
apply
:
leq_sum
=>
t'
_;
apply
:
service_at_most_one
.
Qed
.
(** Conversely, we prove that if the cumulative service received by
job [j] in an interval of length [delta] is greater than or
equal to [ρ], then [ρ ≤ delta]. *)
Lemma
cumulative_service_ge_delta
:
forall
t
delta
ρ
,
ρ
<=
service_during
sched
j
t
(
t
+
delta
)
->
ρ
<=
delta
.
Proof
.
induction
delta
;
intros
?
LE
.
-
by
rewrite
service_during_geq
in
LE
;
ssrlia
.
-
rewrite
addnS
-
service_during_last_plus_before
in
LE
;
last
by
ssrlia
.
destruct
(
service_is_zero_or_one
(
t
+
delta
))
as
[
EQ
|
EQ
];
rewrite
EQ
in
LE
.
+
rewrite
addn0
in
LE
.
by
apply
IHdelta
in
LE
;
rewrite
(
leqRW
LE
)
.
+
rewrite
addn1
in
LE
.
destruct
ρ
;
first
by
done
.
by
rewrite
ltnS
in
LE
;
apply
IHdelta
in
LE
;
rewrite
(
leqRW
LE
)
.
Qed
.
Section
ServiceIsAStepFunction
.
(** We show that the service received by any job [j] is a step function. *)
...
...
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