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
Commits
8e5aba27
Commit
8e5aba27
authored
1 week ago
by
Kimaya Bedarkar
Browse files
Options
Downloads
Patches
Plain Diff
Apply 6 suggestion(s) to 1 file(s)
Co-authored-by:
Björn Brandenburg
<
bbb@mpi-sws.org
>
parent
dd07a209
No related branches found
No related tags found
No related merge requests found
Pipeline
#118949
passed
1 week ago
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
analysis/facts/model/ideal_uni_exceed.v
+9
-9
9 additions, 9 deletions
analysis/facts/model/ideal_uni_exceed.v
with
9 additions
and
9 deletions
analysis/facts/model/ideal_uni_exceed.v
+
9
−
9
View file @
8e5aba27
...
...
@@ -24,9 +24,9 @@ Section ExceedanceProcStateProperties.
(** A job [j] is said to be [scheduled_at] some time [t] if and only if the
processor state at that time is [NominalExecution j] or
[ExceedanceExecution j]. *)
Lemma
scheduled_at_procstate
(
sched
:
schedule
(
exceedance_proc_state
Job
))
j
t
:
scheduled_at
sched
j
t
<->
sched
t
=
NominalExecution
j
\/
sched
t
=
ExceedanceExecution
j
.
Lemma
scheduled_at_procstate
(
sched
:
schedule
(
exceedance_proc_state
Job
))
j
t
:
scheduled_at
sched
j
t
<->
sched
t
=
NominalExecution
j
\/
sched
t
=
ExceedanceExecution
j
.
Proof
.
split
.
-
move
=>
SCHED
.
...
...
@@ -46,7 +46,7 @@ Section ExceedanceProcStateProperties.
(** Next we prove that the processor model under consideration is a uniprocessor
model i.e., only one job can be scheduled at any time instant. *)
model
,
i.e., only one job can be scheduled at any time instant. *)
Lemma
eps_is_uniproc
:
uniprocessor_model
(
exceedance_proc_state
Job
)
.
Proof
.
rewrite
/
uniprocessor_model
.
...
...
@@ -63,7 +63,7 @@ Section ExceedanceProcStateProperties.
Qed
.
(** Next, we prove that the processor model under consideration is fully
consuming i.e., all the supply offered is consumed by the scheduled job. *)
consuming
,
i.e., all the supply offered is consumed by the scheduled job. *)
Lemma
eps_is_fully_consuming
:
fully_consuming_proc_model
(
exceedance_proc_state
Job
)
.
Proof
.
...
...
@@ -81,7 +81,7 @@ Section ExceedanceProcStateProperties.
Qed
.
(** Finally we prove that the processor model under consideration is unit
service i.e., it provides at most one unit of service at any time instant. *)
service
,
i.e., it provides at most one unit of service at any time instant. *)
Lemma
eps_is_unit_service
:
unit_service_proc_model
(
exceedance_proc_state
Job
)
.
Proof
.
rewrite
/
unit_service_proc_model
.
...
...
@@ -97,7 +97,7 @@ End ExceedanceProcStateProperties.
ideal uniprocessor with exceedance processor state. *)
Section
ExceedanceProcStateProperties1
.
(** In this section we consider any type of jobs. *)
(** In this section
,
we consider any type of jobs. *)
Context
`{
Job
:
JobType
}
.
(** First let us define the notion of exceedance execution. A processor state
...
...
@@ -105,8 +105,8 @@ Section ExceedanceProcStateProperties1.
[ExceedanceExecution j] for some [j]. *)
Definition
is_exceedance_exec
(
pstate
:
(
exceedance_proc_state
Job
))
:=
match
pstate
with
|
ExceedanceExecution
_
=>
true
|_
=>
false
|
ExceedanceExecution
_
=>
true
|
_
=>
false
end
.
Local
Transparent
scheduled_in
scheduled_on
service_on
.
...
...
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