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
c34d901c
Commit
c34d901c
authored
9 years ago
by
Felipe Cerqueira
Browse files
Options
Downloads
Patches
Plain Diff
Add placeholder for monotonicity of EDF bound
parent
1a7a0dae
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
BertognaResponseTimeDefsEDF.v
+10
-2
10 additions, 2 deletions
BertognaResponseTimeDefsEDF.v
with
10 additions
and
2 deletions
BertognaResponseTimeDefsEDF.v
+
10
−
2
View file @
c34d901c
...
@@ -66,7 +66,16 @@ Module ResponseTimeAnalysisEDF.
...
@@ -66,7 +66,16 @@ Module ResponseTimeAnalysisEDF.
Section
Proofs
.
Section
Proofs
.
(* The proof that edf_specific_bound works should go here...*)
(* The EDF-specific bound is is monotonically increasing
with the size of the interval. *)
Lemma
edf_specific_bound_monotonic
:
forall
tsk_other
R
R'
,
R
<=
R'
->
edf_specific_bound
(
tsk_other
,
R
)
<=
edf_specific_bound
(
tsk_other
,
R'
)
.
Proof
.
admit
.
Qed
.
End
Proofs
.
End
Proofs
.
...
@@ -521,7 +530,6 @@ Module ResponseTimeAnalysisEDF.
...
@@ -521,7 +530,6 @@ Module ResponseTimeAnalysisEDF.
is not enough to cover the sum of the "minimum" term over
is not enough to cover the sum of the "minimum" term over
all tasks (artifact of the proof by contradiction). *)
all tasks (artifact of the proof by contradiction). *)
Print
interference_bound_edf
.
assert
(
SUM
:
\
sum_
(
k
<-
rt_bounds
|
is_interfering_task_jlfp
tsk
(
fst
k
))
assert
(
SUM
:
\
sum_
(
k
<-
rt_bounds
|
is_interfering_task_jlfp
tsk
(
fst
k
))
(
minn
(
minn
(
interference_bound_edf
task_cost
task_period
task_deadline
(
interference_bound_edf
task_cost
task_period
task_deadline
...
...
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