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
88d54a95
Commit
88d54a95
authored
9 years ago
by
Felipe Cerqueira
Browse files
Options
Downloads
Patches
Plain Diff
Fix line
parent
3e0b31d7
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
+1
-0
1 addition, 0 deletions
BertognaResponseTimeDefsEDF.v
with
1 addition
and
0 deletions
BertognaResponseTimeDefsEDF.v
+
1
−
0
View file @
88d54a95
...
@@ -229,6 +229,7 @@ Module ResponseTimeAnalysisEDF.
...
@@ -229,6 +229,7 @@ Module ResponseTimeAnalysisEDF.
[
by
ins
;
apply
(
INts
tsk'
R
)
|
unfold
is_valid_sporadic_task
;
intro
PARAMStsk
;
des
]
.
[
by
ins
;
apply
(
INts
tsk'
R
)
|
unfold
is_valid_sporadic_task
;
intro
PARAMStsk
;
des
]
.
by
unfold
task_cost_positive
in
PARAMStsk
;
rewrite
PARAMStsk
in
GE_COST
.
by
unfold
task_cost_positive
in
PARAMStsk
;
rewrite
PARAMStsk
in
GE_COST
.
}
subst
ctime
;
clear
HeqR
.
}
subst
ctime
;
clear
HeqR
.
(* According to the IH, all jobs with absolute response-time bound t < (job_arrival j + R)
(* According to the IH, all jobs with absolute response-time bound t < (job_arrival j + R)
have correct response-time bounds.
have correct response-time bounds.
Now, we prove the same result for job j by contradiction.
Now, we prove the same result for job j by contradiction.
...
...
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