Standard variable for types/general structures #
R : Reversible α βRO : ReversibleOccurrence α βMO : MarkedReversibleOccurrence α β
TransitionType indicates the direction of a transition in a reversible net, which
can be forward or backward in a net.
- fwd : TransitionType
- bwd : TransitionType
Instances For
@[simp]
@[reducible, inline]
Equations
Instances For
Equations
- (▷t) = (t.2 = ReversibleNet.TransitionType.fwd)
Instances For
Equations
- (◁t) = (t.2 = ReversibleNet.TransitionType.bwd)
Instances For
Equations
- ReversibleNet.«term▷_» = Lean.ParserDescr.node `ReversibleNet.«term▷_» 50 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "▷") (Lean.ParserDescr.cat `term 50))
Instances For
Equations
- ReversibleNet.«term◁_» = Lean.ParserDescr.node `ReversibleNet.«term◁_» 50 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "◁") (Lean.ParserDescr.cat `term 50))
Instances For
Instances For
Equations
- ReversibleNet.«term↽_» = Lean.ParserDescr.node `ReversibleNet.«term↽_» 1024 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "↽") (Lean.ParserDescr.cat `term 1024))
Instances For
Equations
- ReversibleNet.«term▷▷_» = Lean.ParserDescr.node `ReversibleNet.«term▷▷_» 50 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "▷▷") (Lean.ParserDescr.cat `term 50))
Instances For
Equations
- ReversibleNet.«term◁◁_» = Lean.ParserDescr.node `ReversibleNet.«term◁◁_» 50 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol "◁◁") (Lean.ParserDescr.cat `term 50))
Instances For
Instances For
Equations
- ReversibleNet.«term_↽⇀_» = Lean.ParserDescr.trailingNode `ReversibleNet.«term_↽⇀_» 50 51 (Lean.ParserDescr.binary `andthen (Lean.ParserDescr.symbol " ↽⇀ ") (Lean.ParserDescr.cat `term 51))
Instances For
@[simp]
@[simp]
Reversible #
For each t, t' ∈ Transition β then •t = t'• if t and t' are reversing.
- pre : ReversibleNet.Transition β → Multiset α
- post : ReversibleNet.Transition β → Multiset α
Instances For
@[implicit_reducible]
instance
ReversibleNet.instCoeReversibleNetTransition
(α β : Type)
:
Coe (Reversible α β) (Nets.Net α (Transition β))
Equations
- ReversibleNet.instCoeReversibleNetTransition α β = { coe := fun (r : ReversibleNet.Reversible α β) => ↑r }
@[simp]
theorem
ReversibleNet.eq_pre_post_of_inverse
{α β : Type}
{t t' : Transition β}
(R : Reversible α β)
(i : t ↽⇀ t')
:
Equations
- ReversibleNet.fwd_subnet N = { pre := fun (x : β) => N.pre (x, ReversibleNet.TransitionType.fwd), post := fun (x : β) => N.post (x, ReversibleNet.TransitionType.fwd), cons_prod := ⋯ }
Instances For
theorem
ReversibleNet.mem_pre_of_mem_pre
{α β : Type}
{a : α}
{t : Transition β}
{R : Reversible α β}
(ft : ▷t)
(h : a ∈ •⦃R⦄t)
:
theorem
ReversibleNet.mem_post_of_mem_post
{α β : Type}
{a : α}
{t : Transition β}
{R : Reversible α β}
(ft : ▷t)
(h : a ∈ t•⦃R⦄)
:
@[simp]
theorem
ReversibleNet.mem_pre_fwd_iff_mem_post_bwd
{α β : Type}
{a : α}
{t t' : Transition β}
{R : Reversible α β}
(i : t ↽⇀ t')
:
@[simp]
theorem
ReversibleNet.in_post_bwd_iff_in_pre_fwd
{α β : Type}
{a : α}
{t t' : Transition β}
{R : Reversible α β}
(i : t ↽⇀ t')
:
@[simp]
theorem
ReversibleNet.enabled_rev_iff_enabled_fwd_subnet
{α β : Type}
{t : Transition β}
{R : Reversible α β}
{m : Multiset α}
:
@[simp]
theorem
ReversibleNet.firing_rev_iff_firing_fwd_subnet
{α β : Type}
{R : Reversible α β}
[DecidableEq α]
{m m' : Multiset α}
{t : Transition β}
{et : m 〚(t.1, TransitionType.fwd)〛⦃R⦄}
{et' : Nets.is_enabled (fwd_subnet ↑R) m t.1}
:
theorem
ReversibleNet.inverse_enabled_after_firing
{α β : Type}
{t : Transition β}
{R : Reversible α β}
[DecidableEq α]
{m m' : Multiset α}
(e : m 〚t〛⦃R⦄)
(f : m 〚e⟩⦃R⦄ m')
:
theorem
ReversibleNet.cancelation
{α β : Type}
{t t' : Transition β}
{R : Reversible α β}
[DecidableEq α]
{m m' : Multiset α}
(i : t ↽⇀ t')
{e : m 〚t〛⦃R⦄}
(f : m 〚e⟩⦃R⦄ m')
(h' : m' 〚t'〛⦃R⦄)
:
Equations
Instances For
Equations
Instances For
Equations
Instances For
Reversible occurrence #
A reversible occurrence is defined as a reversible net and an occurrence net.
Given a reversible net denoted as Reversible α β, and provided that we have a proof of
its occurrence, we can conclude that it constitutes a reversible occurrence net.
- pre : ReversibleNet.Transition β → Multiset α
- post : ReversibleNet.Transition β → Multiset α
- isOccurrence : is_occurrence (ReversibleNet.fwd_subnet ↑↑self)
Instances For
@[implicit_reducible]
instance
ReversibleOcc.instCoeReversibleOccurrenceReversible
{α β : Type}
:
Coe (ReversibleOccurrence α β) (ReversibleNet.Reversible α β)
Equations
- ReversibleOcc.instCoeReversibleOccurrenceReversible = { coe := fun (r : ReversibleOcc.ReversibleOccurrence α β) => ↑r }
@[implicit_reducible]
instance
ReversibleOcc.instCoeReversibleOccurrenceNetTransition
{α β : Type}
:
Coe (ReversibleOccurrence α β) (Nets.Net α (ReversibleNet.Transition β))
Equations
- ReversibleOcc.instCoeReversibleOccurrenceNetTransition = { coe := fun (r : ReversibleOcc.ReversibleOccurrence α β) => ↑↑r }
structure
ReversibleOcc.MarkedReversibleOccurrence
(α β : Type)
extends ReversibleNet.Reversible α β :
- pre : ReversibleNet.Transition β → Multiset α
- post : ReversibleNet.Transition β → Multiset α
- m₀ : Multiset α
- isFwdMarkedOcurrence : is_marked_occurrence { toNet := ReversibleNet.fwd_subnet ↑↑self, m₀ := self.m₀ }
Instances For
@[implicit_reducible]
instance
ReversibleOcc.instCoeMarkedReversibleOccurrenceNetTransition
{α β : Type}
:
Coe (MarkedReversibleOccurrence α β) (Nets.Net α (ReversibleNet.Transition β))
Equations
- ReversibleOcc.instCoeMarkedReversibleOccurrenceNetTransition = { coe := fun (r : ReversibleOcc.MarkedReversibleOccurrence α β) => ↑↑r }
def
ReversibleOcc.markedRO_to_markedN
{α β : Type}
(MO : MarkedReversibleOccurrence α β)
:
↑α (ReversibleNet.Transition β)
Instances For
Instances For
theorem
ReversibleOcc.minus_post_preserves_concurrency_fwd_subnet
{α β : Type}
{m : Multiset α}
[DecidableEq α]
(MO : MarkedReversibleOccurrence α β)
(C : Concurrent (ReversibleNet.fwd_subnet ↑↑MO) m)
(t₁ : β)
:
Concurrent (ReversibleNet.fwd_subnet ↑↑MO) (m - Nets.postsetₜ (ReversibleNet.fwd_subnet ↑↑MO) t₁)
theorem
ReversibleOcc.minus_post_plus_pre_preserves_concurrency_fwd_subnet
{α β : Type}
{m : Multiset α}
[DecidableEq α]
{val : β}
(MO : MarkedReversibleOccurrence α β)
(C : Concurrent (ReversibleNet.fwd_subnet ↑↑MO) m)
(h : Nets.postsetₜ (ReversibleNet.fwd_subnet ↑↑MO) val ≤ m)
:
Concurrent (ReversibleNet.fwd_subnet ↑↑MO)
(m - Nets.postsetₜ (ReversibleNet.fwd_subnet ↑↑MO) val + Nets.presetₜ (ReversibleNet.fwd_subnet ↑↑MO) val)
theorem
ReversibleOcc.firing_preserves_concurrency
{α β : Type}
{m m' : Multiset α}
[DecidableEq α]
(MO : MarkedReversibleOccurrence α β)
(ts : List (ReversibleNet.Transition β))
(C : Concurrent (ReversibleNet.fwd_subnet ↑↑MO) m)
(f : m 〚ts⟩⟩⦃↑MO⦄ m')
:
Concurrent (ReversibleNet.fwd_subnet ↑↑MO) m'
theorem
ReversibleOcc.concurrent_marking_of_reversible_occ_net
{α β : Type}
{m : Multiset α}
[DecidableEq α]
(MO : MarkedReversibleOccurrence α β)
(rr : m ∈ Nets.reachable { toNet := ↑↑MO, m₀ := MO.m₀ })
:
Concurrent (ReversibleNet.fwd_subnet ↑↑MO) m
theorem
ReversibleOcc.reversible_occ_net_safe
{α β : Type}
[DecidableEq α]
(MO : MarkedReversibleOccurrence α β)
:
theorem
ReversibleOcc.forward_disjoint_postset
{α β : Type}
{t t' : ReversibleNet.Transition β}
(R : ReversibleOccurrence α β)
(ft : ▷t)
(ft' : ▷t')
:
theorem
ReversibleOcc.backward_disjoint_preset
{α β : Type}
{t t' : ReversibleNet.Transition β}
(R : ReversibleOccurrence α β)
(bt : ◁t)
(bt' : ◁t')
(ne : t ≠ t')
:
theorem
ReversibleOcc.neq_fwd_disjoint_bwd_preset
{α β : Type}
{t t' : ReversibleNet.Transition β}
(R : ReversibleOccurrence α β)
(ft : ▷t)
(ft' : ▷t')
(ne : t ≠ t')
:
theorem
ReversibleOcc.fwd_bwd_disjoint_post_pre
{α β : Type}
{t t' : ReversibleNet.Transition β}
(R : ReversibleOccurrence α β)
(ft : ▷t)
(bt' : ◁t')
(ne : t ≠ ↽t')
:
theorem
ReversibleOcc.backtracking
{α β : Type}
{m m' : Multiset α}
{RO : ReversibleOccurrence α β}
[DecidableEq α]
:
(∃ (s : List (ReversibleNet.Transition β)), m 〚s⟩⟩⦃↑RO⦄ m') → ∃ (s : List (ReversibleNet.Transition β)), m' 〚s⟩⟩⦃↑RO⦄ m