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
ce01dfe1
Commit
ce01dfe1
authored
5 years ago
by
Björn Brandenburg
Browse files
Options
Downloads
Patches
Plain Diff
address spell-checker complaints in behavior module
parent
085ea530
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
restructuring/behavior/ready.v
+2
-2
2 additions, 2 deletions
restructuring/behavior/ready.v
restructuring/behavior/schedule.v
+1
-1
1 addition, 1 deletion
restructuring/behavior/schedule.v
restructuring/behavior/time.v
+3
-3
3 additions, 3 deletions
restructuring/behavior/time.v
with
6 additions
and
6 deletions
restructuring/behavior/ready.v
+
2
−
2
View file @
ce01dfe1
...
...
@@ -25,7 +25,7 @@ Class JobReady (Job : JobType) (PState : Type)
(** Based on the general notion of readiness, we define what it means to be
backlogged, i.e., ready to run but not executing. *)
Section
Backlogged
.
(** Conside any kinds of jobs and any kind of processor state. *)
(** Conside
r
any kinds of jobs and any kind of processor state. *)
Context
{
Job
:
JobType
}
{
PState
:
Type
}
.
Context
`{
ProcessorState
Job
PState
}
.
...
...
@@ -79,7 +79,7 @@ Section ValidSchedule.
jobs_must_be_ready_to_execute
.
(** Note that we do not explicitly require that a valid schedule satisfies
jobs_must_arrive_to_execute or completed_jobs_dont_execute because these
[
jobs_must_arrive_to_execute
]
or
[
completed_jobs_dont_execute
]
because these
properties are implied by jobs_must_be_ready_to_execute. *)
End
ValidSchedule
.
This diff is collapsed.
Click to expand it.
restructuring/behavior/schedule.v
+
1
−
1
View file @
ce01dfe1
...
...
@@ -6,7 +6,7 @@ Require Export rt.restructuring.behavior.arrival_sequence.
(** Rather than choosing a specific schedule representation up front, we define
the notion of a generic processor state, which allows us to state general
definitions of core concepts (such as "how much service has a job
received") that work across many possble scenarios (e.g., ideal
received") that work across many poss
i
ble scenarios (e.g., ideal
uniprocessor schedules, schedules with overheads, variable-speed
processors, multiprocessors, etc.).
...
...
This diff is collapsed.
Click to expand it.
restructuring/behavior/time.v
+
3
−
3
View file @
ce01dfe1
(** * Model of Time *)
(** Prosa is based on a discrete model of time. Thus, time is simply defined by
the natural numbers. To aid readability, we distinguish between
time
values
that represent duration
s
and
time
values that represent specific
instant
s
. *)
the natural numbers. To aid readability, we distinguish between values
of time
that represent
a
duration and values
of time
that represent
a
specific
instant. *)
Definition
duration
:=
nat
.
Definition
instant
:=
nat
.
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