This file provides the definitions and properties necessary to construct a flow relationship in a Petri net. Which is necessary to establish occurrence nets.
< is a relationship between places and transitions directly.
Their transitive closure ≺ [abr: \pre, \prec] is given by TransGen.
Their reflexo-transitive closure ≼ [abr: \prece, \preceq] is given by ReflTransGen.
A marked net (N, m₀) could be think as a tuple (α, β, •_, _•, m₀).
This is helpful at time to defined the flow relationship, because we can have x,y ∈ α ⊎ β
with x ≼ y (for instance) regardless of whether x and y are the same type or not. This
disjoint union we write as α ⊕ β.
Notation #
- If N is a
Net α β, and you want to write that x ≺ y, you need to establish whether x and y are places or transitions. For example, ifx : βandy : α, then x ≺ y is equivalent toinr x ≺⦃N⦄ inl y. It's not necessary that x and y must be of different types, we can havex y : βandSum.inr x ≺⦃N⦄ Sum.inr y, since is a transitive closure. Trichotomy is not true over this transitive closure. - If two transitions t₁ and t₂ are in inmediate conflict, we write
t₁ #₀⦃N⦄ t₂. - If x and y are in conflict:
x #⦃N⦄ y. This is an extend definition from the inmediate conflict. x co⦃N⦄ yis an abreviature of the concurrency between x and y.
Standard variable for types/general structures #
O : is_occurrence N, ifN : Net α βMO : is_marked_occurrence M, ifM : MarkedNet α β
Equations
- Flow.immediate N (Sum.inl p) (Sum.inr t) = (p ∈ Nets.presetₜ N t)
- Flow.immediate N (Sum.inr t) (Sum.inl p) = (p ∈ Nets.postsetₜ N t)
- Flow.immediate N x✝¹ x✝ = (false = true)
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- immediate_conflict N t t' = (t ≠ t' ∧ ¬Disjoint (Nets.presetₜ N t) (Nets.presetₜ N t'))
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- conflict N x y = ∃ (t : β) (t' : β), Flow.preorder N (Sum.inr t) x ∧ Flow.preorder N (Sum.inr t') y ∧ immediate_conflict N t t'
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
A place has a backward conflict it has more that one transition in its preset.
Equations
- backward_conflict N a = ∃ (t : β) (t' : β), t ≠ t' ∧ Flow.immediate N (Sum.inr t) (Sum.inl a) ∧ Flow.immediate N (Sum.inr t') (Sum.inl a)
Instances For
- acyclicity : acyclic N
- set_preset (t : β) : (Nets.presetₜ N t).Nodup
- set_postset (t : β) : (Nets.postsetₜ N t).Nodup
Instances For
- occurrence : is_occurrence M.toNet
- inital_minimal {x : α} : x ∈ M.m₀ → x ∈ Nets.minimal M.toNet
Instances For
In a concurrent set stands for elements that are able to occur concurrently, i.e., they are not in conflict, and they do not causally depend on each other.
Equations
- concurrent N x y = (x ≠ y ∧ ¬Flow.preorder N x y ∧ ¬Flow.preorder N y x ∧ ¬conflict N x y)
Instances For
Equations
- One or more equations did not get rendered due to their size.