[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. 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
,
Theorem COP-sat-rely-guar
Idle(n, CS), Inv(CS) ⊦ [: CS, Outp | (Rely(n, CS', CS'') ∧ (Idle(n, CS') ↔ Idle(n, CS''))) , (Guar(n, CS, CS') ∧ (∀ m. m ≠ n → (Idle(m, CS) ↔ Idle(m, CS')))) , Inv(CS) , COP(n, Inp; CS, Outp) ] (Idle(n, CS) ∧ Inv(CS))
Type: An axiom
Validity: The proof is valid.
Features: tl,
Comment:
Used by:
Used by units in proved state:
RG-I-n-Theory
,
Proof exists?: No