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
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
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
RT-PROOFS
PROSA - Formally Proven Schedulability Analysis
Merge requests
!212
various cleanups and simplifications in util
Code
Review changes
Check out branch
Download
Patches
Plain diff
Merged
various cleanups and simplifications in util
MathComp-PR-cleanups-and-simplifications
into
master
Overview
19
Commits
21
Pipelines
7
Changes
35
Merged
Björn Brandenburg
requested to merge
MathComp-PR-cleanups-and-simplifications
into
master
2 years ago
Overview
19
Commits
21
Pipelines
7
Changes
35
Expand
Pierre's cleanups from
!190
, minus the TODO annotations.
CC:
@proux
Edited
2 years ago
by
Björn Brandenburg
0
0
Merge request reports
Compare
master
version 5
771bdee0
2 years ago
version 4
802efc7f
2 years ago
version 3
bc89e5cb
2 years ago
version 2
f642885b
2 years ago
version 1
2f13c730
2 years ago
master (base)
and
latest version
latest version
45391d62
21 commits,
2 years ago
version 5
771bdee0
21 commits,
2 years ago
version 4
802efc7f
28 commits,
2 years ago
version 3
bc89e5cb
27 commits,
2 years ago
version 2
f642885b
25 commits,
2 years ago
version 1
2f13c730
20 commits,
2 years ago
35 files
+
242
−
405
Inline
Compare changes
Side-by-side
Inline
Show whitespace changes
Show one file at a time
Files
35
Search (e.g. *.vue) (Ctrl+P)
analysis/abstract/abstract_seq_rta.v
+
3
−
3
Options
@@ -415,7 +415,7 @@ Section Sequential_Abstract_RTA.
apply
Hn
in
CONTR
;
rewrite
scheduled_at_def
in
CONTR
;
simpl
in
CONTR
.
by
move
:
CONTR
;
rewrite
H_sched
=>
/
eqP
EQ
;
inversion
EQ
;
subst
;
move
:
H_j_neq_j'
=>
/
eqP
.
}
rewrite
big_mkcond
;
apply
/
sum_
seq
_gt0P
;
exists
j'
;
split
;
last
first
.
rewrite
big_mkcond
sum_
nat
_gt0
filter_predT
;
apply
/
has
P
;
exists
j'
;
last
first
.
{
move
:
H_not_job_of_tsk
=>
/
eqP
TSK
.
by
rewrite
/
job_of_task
TSK
eq_refl
service_at_def
H_sched
eq_refl
.
}
{
intros
.
have
ARR
:=
arrives_after_beginning_of_busy_interval
j
j'
_
_
_
_
_
t1
t2
_
t
.
@@ -470,8 +470,8 @@ Section Sequential_Abstract_RTA.
move
:
WORK
=>
[_
ZIJT
]
.
feed
ZIJT
;
first
by
rewrite
scheduled_at_def
H_sched
;
simpl
.
move
:
ZIJT
=>
/
negP
/
eqP
;
rewrite
eqb_negLR
;
simpl
;
move
=>
/
eqP
ZIJT
;
rewrite
ZIJT
;
simpl
;
rewrite
add0n
.
rewrite
big_mkcond
//=
;
apply
/
sum_seq_gt0
P
.
exists
j
;
split
;
first
by
apply
j_is_in_arrivals_between
.
rewrite
big_mkcond
//=
sum_nat_gt0
filter_predT
;
apply
/
has
P
.
exists
j
;
first
by
apply
j_is_in_arrivals_between
.
by
move
:
(
H_job_of_tsk
)
=>
->
;
rewrite
service_at_def
H_sched
eq_refl
.
Qed
.
Loading