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
a03c73df
Commit
a03c73df
authored
5 years ago
by
Maxime Lesourd
Committed by
Björn Brandenburg
5 years ago
Browse files
Options
Downloads
Patches
Plain Diff
Renaming in arrival_sequence.v
parent
82454601
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!22
Naming conventions
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
behavior/arrival/arrival_sequence.v
+10
-5
10 additions, 5 deletions
behavior/arrival/arrival_sequence.v
with
10 additions
and
5 deletions
behavior/arrival/arrival_sequence.v
+
10
−
5
View file @
a03c73df
...
...
@@ -39,8 +39,8 @@ End JobProperties.
Class
JobArrival
(
J
:
JobType
)
:=
job_arrival
:
J
->
instant
.
(* Next, we define
properties of a
valid arrival sequence. *)
Section
ArrivalSequence
Properties
.
(* Next, we define valid arrival sequence
s
. *)
Section
Valid
ArrivalSequence
.
(* Assume that job arrival times are known. *)
Context
{
Job
:
JobType
}
.
...
...
@@ -59,10 +59,15 @@ Section ArrivalSequenceProperties.
jobs at any given time. *)
Definition
arrival_sequence_is_a_set
:=
forall
t
,
uniq
(
jobs_arriving_at
arr_seq
t
)
.
End
ArrivalSequenceProperties
.
(* We say that the arrival sequence is valid iff it is a set and arrival times
are consistent *)
Definition
arrival_sequence_is_valid
:=
arrival_times_are_consistent
/\
arrival_sequence_is_a_set
.
End
ValidArrivalSequence
.
(* Next, we define properties of job arrival times. *)
Section
PropertiesOf
ArrivalTime
.
Section
ArrivalTime
Properties
.
(* Assume that job arrival times are known. *)
Context
{
Job
:
JobType
}
.
...
...
@@ -83,7 +88,7 @@ Section PropertiesOfArrivalTime.
some time t with t1 <= t < t2. *)
Definition
arrived_between
(
t1
t2
:
instant
)
:=
t1
<=
job_arrival
j
<
t2
.
End
PropertiesOf
ArrivalTime
.
End
ArrivalTime
Properties
.
(* In this section, we define arrival sequence prefixes, which are useful to
define (computable) properties over sets of jobs in the schedule. *)
...
...
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