[Imprint][Data Privacy Statement][E-Mail]
Back to main index.
View the specification.
View theorem base summary,
View theorem base listing,
the used properties by spec,
the dependency list,
the symbol table,
enrich
IOtrace
with
functions after : IOAutomaton → actionstream × state → bool;
predicates det : IOAutomaton;
stepdet : IOAutomaton;
forest : IOAutomaton;
fin : IOAutomaton;
forest : IOAutomaton × (state → bool);
variables α : actionstream;
sl : statelist;
al : actionlist;
sf : nat → state;
af : nat → action;
σ : statestream;
isstate : state → bool;
afterv : actionstream × state → bool;
axioms deterministic
: ⊦ det(IOAut(startf, stepf))
↔ (∃ s. ∀ s0. startf(s0) ↔ s = s0) ∧ (∀ s, s0. stepf(s, τ, s0) → s = s0) ∧ (∀ s, a, s0, s1. stepf(s, a, s0) ∧ stepf(s, a, s1) → s0 = s1);
stepdeterministic : ⊦ stepdet(IOAut(startf, stepf)) ↔ (∀ s, a0, a1, s0, s1. stepf(s, a0, s0) ∧ stepf(s, a1, s1) → a0 = a1 ∧ s0 = s1);
after : ⊦ after(IOAut(startf, stepf))(β, s) ↔ (∃ α, σ. α ^ = β ∧ exec*(IOAut(startf, stepf))(σ, α) ∧ s = σ.l.last);
finiteinvisiblenondet
: ⊦ fin(IOAut(startf, stepf)) ↔ (∃ sl. ∀ s. startf(s) ↔ s ∈ sl) ∧ (∀ s1, β. ∃ sl. ∀ s2. move(IOAut(startf, stepf))(s1, β, s2) ↔ s2 ∈ sl);
forest
: ⊦ forest(IOAut(startf, stepf))
↔ (∀ s2.
(∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last)
∧ (∀ α1, sl1, α2, sl2.
exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last
→ α1 = α2 ∧ sl1 = sl2));
forest-relative
: ⊦ forest(IOAut(startf, stepf), isstate)
↔ (∀ s2.
isstate(s2)
→ (∃ α, sl. exec*(IOAut(startf, stepf))(⌜sl⌝ , α) ∧ s2 = sl.last)
∧ (∀ α1, sl1, α2, sl2.
exec*(IOAut(startf, stepf))(⌜sl1⌝ , α1) ∧ exec*(IOAut(startf, stepf))(⌜sl2⌝ , α2) ∧ s2 = sl1.last ∧ s2 = sl2.last
→ α1 = α2 ∧ sl1 = sl2));
end enrich