inductive
TrEq
{α β : Type}
[DecidableEq α]
(R : ReversibleNet.Reversible α β)
:
List (ReversibleNet.Transition β) → List (ReversibleNet.Transition β) → Prop
Trace equivalence #
A trace equivalence is a equivalence relation ≍ [\asymp] if satisfies:
t;t' ≍ t';tift co t't;t' ≍ εandt';t ≍ εift↽⇀t'
For a reversible net R we denote this relation as t ≍⦃R⦄ t'.
- nil {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} : TrEq R [] []
- swap {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (t t' : ReversibleNet.Transition β) : Disjoint t•⦃R⦄ •⦃R⦄t' → Disjoint t'•⦃R⦄ •⦃R⦄t → TrEq R [t, t'] [t', t]
- cancₗ {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (t t' : ReversibleNet.Transition β) : t ↽⇀ t' → TrEq R [t, t'] []
- cancᵣ {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (t t' : ReversibleNet.Transition β) : t ↽⇀ t' → TrEq R [] [t, t']
- congᵣ {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (s₁ s₂ s₃ : List (ReversibleNet.Transition β)) : TrEq R s₁ s₂ → TrEq R (s₃ ++ s₁) (s₃ ++ s₂)
- congₗ {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (s₁ s₂ s₃ : List (ReversibleNet.Transition β)) : TrEq R s₁ s₂ → TrEq R (s₁ ++ s₃) (s₂ ++ s₃)
- trans {α β : Type} [DecidableEq α] {R : ReversibleNet.Reversible α β} (s₁ s₂ s₃ : List (ReversibleNet.Transition β)) : TrEq R s₁ s₂ → TrEq R s₂ s₃ → TrEq R s₁ s₃
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
def
TrEq_refl
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
(s : List (ReversibleNet.Transition β))
:
TrEq R s s
Equations
- ⋯ = ⋯
Instances For
def
TrEq_symm
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
{s₁ s₂ : List (ReversibleNet.Transition β)}
(h : TrEq R s₁ s₂)
:
TrEq R s₂ s₁
Equations
- ⋯ = ⋯
Instances For
def
TrEq_trans
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
{s₁ s₂ s₃ : List (ReversibleNet.Transition β)}
(h : TrEq R s₁ s₂)
(h' : TrEq R s₂ s₃)
:
TrEq R s₁ s₃
Equations
- ⋯ = ⋯
Instances For
theorem
TrEq_congruence
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
{s₁ s₂ s₃ s₄ : List (ReversibleNet.Transition β)}
(h : TrEq R s₁ s₂)
(h' : TrEq R s₃ s₄)
:
theorem
TrEq_of_cons_left
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
{s₁ s₂ : List (ReversibleNet.Transition β)}
{t : ReversibleNet.Transition β}
:
theorem
TrEq_of_cons_right
{α β : Type}
[DecidableEq α]
{R : ReversibleNet.Reversible α β}
{s₁ s₂ : List (ReversibleNet.Transition β)}
{t : ReversibleNet.Transition β}
:
theorem
TrEq_swap_fwd_hd_allbwd
{α β : Type}
[DecidableEq α]
{s : List (ReversibleNet.Transition β)}
{t t' : ReversibleNet.Transition β}
{m m' : Multiset α}
(MO : ReversibleOcc.MarkedReversibleOccurrence α β)
(rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ })
(ft : ▷t)
(bt' : ◁t')
(ni : ¬t ↽⇀ t')
(fs : m 〚[t] ++ t' :: s⟩⟩⦃↑MO⦄ m')
:
theorem
TrEq_swap_exists
{α β : Type}
[DecidableEq α]
{s : List (ReversibleNet.Transition β)}
{t t' : ReversibleNet.Transition β}
{m m' : Multiset α}
(MO : ReversibleOcc.MarkedReversibleOccurrence α β)
(rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ })
(ft : ▷t)
(bt' : ◁t')
(ni : ¬t ↽⇀ t')
(fir : m 〚[t, t'] ++ s⟩⟩⦃↑MO⦄ m')
:
theorem
TrEq_swap_fwd_allbwd
{α β : Type}
[DecidableEq α]
{t : ReversibleNet.Transition β}
{m m' : Multiset α}
{s : List (ReversibleNet.Transition β)}
(MO : ReversibleOcc.MarkedReversibleOccurrence α β)
(rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ })
(ft : ▷t)
(abw : ◁◁s)
(hnr : t ∉ʳ s)
(fs : m 〚[t] ++ s⟩⟩⦃↑MO⦄ m')
:
theorem
TrEq_swap_fwd_allbw_allfw
{α β : Type}
[DecidableEq α]
{t : ReversibleNet.Transition β}
{m m' : Multiset α}
{s s' : List (ReversibleNet.Transition β)}
(MO : ReversibleOcc.MarkedReversibleOccurrence α β)
(rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ })
(ft : ▷t)
(abw : ◁◁s)
(ht : t ∉ʳ s)
(fs : m 〚[t] ++ s ++ s'⟩⟩⦃↑MO⦄ m')
: