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
287ee9b9
Commit
287ee9b9
authored
9 years ago
by
Felipe Cerqueira
Browse files
Options
Downloads
Patches
Plain Diff
Fix name card -> cardA
parent
a20b1957
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
BertognaResponseTimeDefs.v
+12
-11
12 additions, 11 deletions
BertognaResponseTimeDefs.v
with
12 additions
and
11 deletions
BertognaResponseTimeDefs.v
+
12
−
11
View file @
287ee9b9
...
...
@@ -512,18 +512,18 @@ Module ResponseTimeAnalysis.
by
rewrite
-
big_seq_cond
.
}
apply
negbFE
in
HASa
.
set
card
:=
count
(
fun
i
=>
R
-
task_cost
tsk
+
1
<=
x
i
)
ts
.
destruct
(
card
>=
num_cpus
)
eqn
:
CARD
.
set
card
A
:=
count
(
fun
i
=>
R
-
task_cost
tsk
+
1
<=
x
i
)
ts
.
destruct
(
card
A
>=
num_cpus
)
eqn
:
CARD
.
{
apply
leq_trans
with
((
R
-
task_cost
tsk
+
1
)
*
card
);
apply
leq_trans
with
((
R
-
task_cost
tsk
+
1
)
*
card
A
);
first
by
rewrite
leq_mul2l
;
apply
/
orP
;
right
.
unfold
card
;
rewrite
-
sum1_count
big_distrr
/=.
unfold
card
A
;
rewrite
-
sum1_count
big_distrr
/=.
rewrite
-
[
\
sum_
(_
<-
_
|
_)
_]
addn0
.
by
apply
leq_add
;
[
by
apply
leq_sum
;
ins
;
rewrite
muln1
|
by
ins
]
.
}
apply
negbT
in
CARD
;
rewrite
-
ltnNge
in
CARD
.
assert
(
GEsum
:
\
sum_
(
i
<-
ts
|
x
i
<
R
-
task_cost
tsk
+
1
)
x
i
>=
(
R
-
task_cost
tsk
+
1
)
*
(
num_cpus
-
card
))
.
(
R
-
task_cost
tsk
+
1
)
*
(
num_cpus
-
card
A
))
.
{
set
some_interference_A
:=
fun
t
=>
backlogged
job_cost
rate
sched
j
t
&&
...
...
@@ -535,7 +535,7 @@ Module ResponseTimeAnalysis.
((
x
tsk_k
)
<
R
-
task_cost
tsk
+
1
)
&&
task_is_scheduled
job_task
sched
tsk_k
t
)
ts
.
apply
leq_trans
with
((
\
sum_
(
job_arrival
j
<=
t
<
job_arrival
j
+
R
)
some_interference_A
t
)
*
(
num_cpus
-
card
))
.
apply
leq_trans
with
((
\
sum_
(
job_arrival
j
<=
t
<
job_arrival
j
+
R
)
some_interference_A
t
)
*
(
num_cpus
-
card
A
))
.
{
rewrite
leq_mul2r
;
apply
/
orP
;
right
.
move
:
HASa
=>
/
hasP
HASa
;
destruct
HASa
as
[
tsk_a
INa
LEa
]
.
...
...
@@ -571,9 +571,10 @@ Module ResponseTimeAnalysis.
exploit
INVARIANT
;
[
by
apply
JOBtsk
|
by
apply
BACK
|
intro
COUNT
]
.
unfold
card
.
unfold
card
A
.
set
interfering_tasks_at_t
:=
[
seq
tsk_k
<-
ts
|
is_interfering_task
tsk_k
&&
task_is_scheduled
job_task
sched
tsk_k
t
]
.
[
seq
tsk_k
<-
ts
|
is_interfering_task
tsk_k
&&
task_is_scheduled
job_task
sched
tsk_k
t
]
.
rewrite
-
(
count_filter
(
fun
i
=>
true
))
in
COUNT
.
fold
interfering_tasks_at_t
in
COUNT
.
...
...
@@ -640,9 +641,9 @@ Module ResponseTimeAnalysis.
}
}
rewrite
big_const_seq
iter_addn
addn0
;
fold
card
.
apply
leq_trans
with
(
n
:=
(
R
-
task_cost
tsk
+
1
)
*
card
+
(
R
-
task_cost
tsk
+
1
)
*
(
num_cpus
-
card
));
rewrite
big_const_seq
iter_addn
addn0
;
fold
card
A
.
apply
leq_trans
with
(
n
:=
(
R
-
task_cost
tsk
+
1
)
*
card
A
+
(
R
-
task_cost
tsk
+
1
)
*
(
num_cpus
-
card
A
));
last
by
rewrite
leq_add2l
.
by
rewrite
-
mulnDr
subnKC
//
;
apply
ltnW
.
}
...
...
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