Logs of a prime event structure #
Choice points are minimal conflicts.
theorem
Log.logged_symm
{L : Type u_1}
(es : PES L)
{e e' : es.Event}
(h : es.minimalConflict e e')
:
logged es e'
Minimal conflict is symmetric, so its partner is logged too.
theorem
Log.log_has_conflict_outside
{L : Type u_1}
(es : PES L)
{c : Conf es}
{e : es.Event}
(he : e ∈ log es c)
:
∃ e' ∉ ↑c, es.minimalConflict e e'
@[reducible, inline]
abbrev
PES.compatibleWithLog
{L : Type u_1}
(es : PES L)
(σ : Computations es.toFamily)
(l : Set es.Event)
:
Compatibility with a log, for the conflict relation of es.
Equations
- es.compatibleWithLog σ l = Log.compatibleWithLog es.toFamily es.conflict σ l
Instances For
def
PES.compatibleWithConfigLog
{L : Type u_1}
(es : PES L)
(c : Conf es)
(σ : Computations es.toFamily)
:
A computation compatible with the log of a configuration.
Equations
- es.compatibleWithConfigLog c σ = es.compatibleWithLog σ (log es c)
Instances For
Computations compatible with the log of a configuration.
Equations
- es.CompatibleWithConfigLog c = Log.CompatibleComputations es.toFamily es.conflict (log es c)