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
ba086071
Commit
ba086071
authored
5 years ago
by
Björn Brandenburg
Browse files
Options
Downloads
Patches
Plain Diff
preemption_time.v should not depend on task concept
This is a purely accidental dependency; purge it.
parent
f96feefc
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
restructuring/model/schedule/preemption_time.v
+5
-15
5 additions, 15 deletions
restructuring/model/schedule/preemption_time.v
with
5 additions
and
15 deletions
restructuring/model/schedule/preemption_time.v
+
5
−
15
View file @
ba086071
...
...
@@ -7,26 +7,16 @@ From mathcomp Require Import ssreflect ssrbool ssrfun eqtype ssrnat seq fintype
ideal uni-processor model. *)
Section
PreemptionTime
.
(** Consider any type of tasks ... *)
Context
{
Task
:
TaskType
}
.
Context
`{
TaskCost
Task
}
.
Context
`{
TaskMaxNonpreemptiveSegment
Task
}
.
(** ... and any type of jobs associated with these tasks. *)
(** Consider any type of jobs... *)
Context
{
Job
:
JobType
}
.
Context
`{
JobTask
Job
Task
}
.
Context
`{
JobArrival
Job
}
.
Context
`{
JobCost
Job
}
.
(** In addition, we assume the existence of a function mapping a
task to its maximal non-preemptive segment ... *)
Context
`{
TaskMaxNonpreemptiveSegment
Task
}
.
(** ... and the existence of a function mapping a job and
(** ... and assume the existence of a function mapping a job and
its progress to a boolean value saying whether this job is
preemptable at its current point of execution. *)
Context
`{
JobPreemptable
Job
}
.
(** Consider any arrival sequence with consistent arrivals. *)
Variable
arr_seq
:
arrival_sequence
Job
.
Hypothesis
H_arrival_times_are_consistent
:
consistent_arrival_times
arr_seq
.
...
...
@@ -35,7 +25,7 @@ Section PreemptionTime.
Variable
sched
:
schedule
(
ideal
.
processor_state
Job
)
.
Hypothesis
H_jobs_come_from_arrival_sequence
:
jobs_come_from_arrival_sequence
sched
arr_seq
.
(** We say that a time instant t is a preemption time iff the job
that is currently scheduled at t can be preempted (according to
the predicate). *)
...
...
@@ -43,5 +33,5 @@ Section PreemptionTime.
if
sched
t
is
Some
j
then
job_preemptable
j
(
service
sched
j
t
)
else
true
.
End
PreemptionTime
.
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