Documentation

PetriNet.Swapping

Swapping #

In this file we proved lemmas about swap a forward transition t on a backward list ω: ``

Equations
Instances For
    Equations
    Instances For
      theorem disj_post_pre_disjoint_pre_post_occ {α β : Type} {m m' : Multiset α} {t t' : ReversibleNet.Transition β} [DecidableEq α] (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (fs : m 〚[t, t']⟩⟩⦃↑MO⦄ m') (h : Disjoint t•⦃↑MO⦄ •⦃↑MO⦄t') :
      theorem not_reverse_disjoint_pre_post_occ {α β : Type} {m m' : Multiset α} {t t' : ReversibleNet.Transition β} [DecidableEq α] (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (fs : m 〚[t, t']⟩⟩⦃↑MO⦄ m') (nrev : ¬t ↽⇀ t') (h : ¬Disjoint t•⦃↑MO⦄ •⦃↑MO⦄t') :
      theorem not_reverse_disjoint_pre_post {α β : Type} {m m' : Multiset α} [DecidableEq α] {t t' : ReversibleNet.Transition β} (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (fs : m 〚[t, t']⟩⟩⦃↑MO⦄ m') :
      theorem not_reverse_disjoint_post_pre₂ {α β : Type} {m m' : Multiset α} {s : List (ReversibleNet.Transition β)} [DecidableEq α] {t t' : ReversibleNet.Transition β} (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (ni : ¬t ↽⇀ t') (fs : m 〚[t] ++ t' :: s⟩⟩⦃↑MO⦄ m') :
      theorem swap_fwd_bwd_pre_post_empty {α β : Type} {m m' : Multiset α} [DecidableEq α] {t t' : ReversibleNet.Transition β} (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) :
      ¬t ↽⇀ t' → ∀ (b : m 〚[t, t']⟩⟩⦃↑MO⦄ m') (d₁ : Disjoint t•⦃↑MO⦄ •⦃↑MO⦄t'), m 〚[t', t]⟩⟩⦃↑MO⦄ m'
      theorem swap_fwd_reverse_not_inverse {α β : Type} {m m' : Multiset α} [DecidableEq α] {t t' : ReversibleNet.Transition β} (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (ft : ▷t) (bt' : ◁t') (ni : ¬t ↽⇀ t') (fs : m 〚[t, t']⟩⟩⦃↑MO⦄ m') :
      m 〚[t', t]⟩⟩⦃↑MO⦄ m'
      theorem fs_rev_empty {α β : Type} {m m' : Multiset α} [DecidableEq α] {RO : ReversibleOcc.ReversibleOccurrence α β} {t t' : ReversibleNet.Transition β} (i : t ↽⇀ t') (fs : m 〚[t, t']⟩⟩⦃↑RO⦄ m') :
      m = m'
      theorem swapping {α β : Type} {m m' : Multiset α} {s : List (ReversibleNet.Transition β)} [DecidableEq α] {t : ReversibleNet.Transition β} (MO : ReversibleOcc.MarkedReversibleOccurrence α β) (rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ }) (bw : ◁◁s) (ft : ▷t) (nrev : t ∉ʳ s) (fs : m 〚t :: s⟩⟩⦃↑MO⦄ m') :
      m 〚s ++ [t]⟩⟩⦃↑MO⦄ m'

      A forward transition t can be swapped with a backward sequence ω if there a firing sequence that passes through the sequence t :: ω

      theorem tr_in_list_bwd {β : Type} {s : List (ReversibleNet.Transition β)} {t t' hd : ReversibleNet.Transition β} (h : t' ∈ hd :: s) :
      t ↽⇀ t' → ¬hd ↽⇀ t → t' ∈ s
      theorem fst_split_not_rev {β : Type} {t : ReversibleNet.Transition β} {ω : List (ReversibleNet.Transition β)} (abw : ◁◁ω) (h : t ∃ʳ ω) :
      ∃ (s : List (ReversibleNet.Transition β)) (s' : List (ReversibleNet.Transition β)) (t' : ReversibleNet.Transition β), t' ↽⇀ t ∧ ω = s ++ t' :: s' ∧ t ∉ʳ s