[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 DQinit-def
⊦ DQinit(mkstate(ags, alsf, apcf)) ↔ ags.queue = [] ∧ apcf = (λ tid. idle) ∧ (∀ tid. alsf(tid).tid = tid)
Type: An axiom
Validity: The proof is valid.
Features:
Comment: a predicate identical to the initial state of the automaton DQ (except lsf(tid).tid = tid was implicit)
Used by:
Used by units in proved state:
DMSQ-refines-DQ
,
Proof exists?: No