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
578dd89e
Commit
578dd89e
authored
9 years ago
by
Felipe Cerqueira
Browse files
Options
Downloads
Patches
Plain Diff
Prove decidable equality of JobIn
parent
7efdf29a
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
arrival_sequence.v
+3
-7
3 additions, 7 deletions
arrival_sequence.v
jobin_eqdec.v
+30
-0
30 additions, 0 deletions
jobin_eqdec.v
with
33 additions
and
7 deletions
arrival_sequence.v
+
3
−
7
View file @
578dd89e
...
@@ -46,13 +46,9 @@ Module ArrivalSequence.
...
@@ -46,13 +46,9 @@ Module ArrivalSequence.
Definition
job_arrival
{
arr_seq
:
arrival_sequence
Job
}
(
j
:
JobIn
arr_seq
)
:=
Definition
job_arrival
{
arr_seq
:
arrival_sequence
Job
}
(
j
:
JobIn
arr_seq
)
:=
_
arrival_time
arr_seq
j
.
_
arrival_time
arr_seq
j
.
(* Finally, we assume a decidable equality for JobIn, to make it compatible
(* Finally, we define a decidable equality for JobIn, in order to make
with ssreflect. TODO: Is there a better way to do this? *)
it compatible with ssreflect (see jobin_eqdec.v). *)
Definition
jobin_eqdef
(
arr_seq
:
arrival_sequence
Job
)
:=
Load
jobin_eqdec
.
(
fun
j1
j2
:
JobIn
arr_seq
=>
(
JobIn_is_Job
j1
)
==
(
JobIn_is_Job
j2
))
.
Axiom
eqn_jobin
:
forall
arr_seq
,
Equality
.
axiom
(
jobin_eqdef
arr_seq
)
.
Canonical
jobin_eqMixin
arr_seq
:=
EqMixin
(
eqn_jobin
arr_seq
)
.
Canonical
jobin_eqType
arr_seq
:=
Eval
hnf
in
EqType
(
JobIn
arr_seq
)
(
jobin_eqMixin
arr_seq
)
.
End
JobInArrivalSequence
.
End
JobInArrivalSequence
.
...
...
This diff is collapsed.
Click to expand it.
jobin_eqdec.v
0 → 100644
+
30
−
0
View file @
578dd89e
(* The decidable equality for JobIn checks whether the Job
and the arrival times are the same. *)
Definition
jobin_eqdef
(
arr_seq
:
arrival_sequence
Job
)
:=
(
fun
j1
j2
:
JobIn
arr_seq
=>
(_
job_in
arr_seq
j1
==
_
job_in
arr_seq
j2
)
&&
(_
arrival_time
arr_seq
j1
==
_
arrival_time
arr_seq
j2
))
.
Lemma
eqn_jobin
:
forall
arr_seq
,
Equality
.
axiom
(
jobin_eqdef
arr_seq
)
.
Proof
.
unfold
Equality
.
axiom
;
intros
arr_seq
x
y
.
destruct
(
jobin_eqdef
arr_seq
x
y
)
eqn
:
EQ
.
{
apply
ReflectT
.
unfold
jobin_eqdef
in
*.
move
:
EQ
=>
/
andP
[
/
eqP
EQjob
/
eqP
EQarr
]
.
destruct
x
,
y
;
ins
;
subst
.
f_equal
;
apply
proof_irrelevance
.
}
{
apply
ReflectF
.
unfold
jobin_eqdef
,
not
in
*
;
intro
BUG
.
apply
negbT
in
EQ
;
rewrite
negb_and
in
EQ
.
destruct
x
,
y
.
move
:
EQ
=>
/
orP
[
/
negP
DIFFjob
|
/
negP
DIFFarr
]
.
by
apply
DIFFjob
;
inversion
BUG
;
subst
;
apply
/
eqP
.
by
apply
DIFFarr
;
inversion
BUG
;
subst
;
apply
/
eqP
.
}
Qed
.
Canonical
jobin_eqMixin
arr_seq
:=
EqMixin
(
eqn_jobin
arr_seq
)
.
Canonical
jobin_eqType
arr_seq
:=
Eval
hnf
in
EqType
(
JobIn
arr_seq
)
(
jobin_eqMixin
arr_seq
).
\ No newline at end of file
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