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
eff367aa
Commit
eff367aa
authored
3 years ago
by
Sergey Bozhko
Committed by
Björn Brandenburg
3 years ago
Browse files
Options
Downloads
Patches
Plain Diff
move [Context] declaration out of the global context
parent
631a3fdf
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!151
move [Context] declaration out of the global context
Pipeline
#54348
passed with warnings
3 years ago
Stage: build
Stage: process
Changes
1
Pipelines
2
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
model/task/arrival/arrival_curve_to_rbf.v
+6
-6
6 additions, 6 deletions
model/task/arrival/arrival_curve_to_rbf.v
with
6 additions
and
6 deletions
model/task/arrival/arrival_curve_to_rbf.v
+
6
−
6
View file @
eff367aa
...
@@ -4,18 +4,18 @@ Require Export prosa.model.task.arrival.curves.
...
@@ -4,18 +4,18 @@ Require Export prosa.model.task.arrival.curves.
(** * Converting an Arrival Curve + Worst-Case/Best-Case to a Request-Bound Function (RBF) *)
(** * Converting an Arrival Curve + Worst-Case/Best-Case to a Request-Bound Function (RBF) *)
(** Consider any type of tasks with a given cost ... *)
Context
{
Task
:
TaskType
}
`{
TaskCost
Task
}
`{
TaskMinCost
Task
}
.
(** ... and any type of jobs associated with these tasks. *)
Context
{
Job
:
JobType
}
`{
JobTask
Job
Task
}
`{
JobCost
Job
}
.
(** In the following, we show a way to convert a given arrival curve,
(** In the following, we show a way to convert a given arrival curve,
paired with a worst-case/best-case execution time, to a request-bound function.
paired with a worst-case/best-case execution time, to a request-bound function.
Definitions and proofs will handle both lower-bounding and upper-bounding arrival
Definitions and proofs will handle both lower-bounding and upper-bounding arrival
curves. *)
curves. *)
Section
ArrivalCurveToRBF
.
Section
ArrivalCurveToRBF
.
(** Consider any type of tasks with a given cost ... *)
Context
{
Task
:
TaskType
}
`{
TaskCost
Task
}
`{
TaskMinCost
Task
}
.
(** ... and any type of jobs associated with these tasks. *)
Context
{
Job
:
JobType
}
`{
JobTask
Job
Task
}
`{
JobCost
Job
}
.
(** Let [MaxArr] and [MinArr] represent two arrivals curves. [MaxArr] upper-bounds
(** Let [MaxArr] and [MinArr] represent two arrivals curves. [MaxArr] upper-bounds
the possible number or arrivals for a given task, whereas [MinArr] lower-bounds it. *)
the possible number or arrivals for a given task, whereas [MinArr] lower-bounds it. *)
Context
`{
MaxArr
:
MaxArrivals
Task
}
`{
MinArr
:
MinArrivals
Task
}
.
Context
`{
MaxArr
:
MaxArrivals
Task
}
`{
MinArr
:
MinArrivals
Task
}
.
...
...
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