[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,

Signature symbols in this unit

Symbol Specification Kind Type
# .astatesetfastateset → nat
# .Koenigs-Lemma-gen-bwactfpairastatenat-list → nat
# .Koenigs-Lemma-gen-bwactfpairastatenat-stream → natinf
# .Koenigs-Lemma-gen-bwactfpairastatenat-set → nat
# .Node-heapfheap → nat
# .list-dataflist → nat
# .actionstreamfactionlist → nat
# .actionstreamfactionstream → natinf
# .traceCfcstatelist → nat
# .traceCfcstatestream → natinf
# .traceAfastatelist → nat
# .traceAfastatestream → natinf
# .tidsetftidset → nat
. 'Koenigs-Lemma-gen-bwactfpairastatenat → pairastatenat-list
. 'listfelem → list
. 'DQctrace-absActionfabsAction → actionlist
. 'DQctrace-absActionfDQState → cstatelist
. 'DurQtrace-absActionfDurQState → astatelist
. + .Koenigs-Lemma-gen-bwactfpairastatenat × pairastatenat-list → pairastatenat-list
. + .Koenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat-list → pairastatenat-list
. + .Koenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat → pairastatenat-list
. + .Koenigs-Lemma-gen-bwactfpairastatenat × pairastatenat-stream → pairastatenat-stream
. + .Koenigs-Lemma-gen-bwactfpairastatenat-stream × pairastatenat-stream → pairastatenat-stream
. + .nat-basicfnat × nat → nat
. + .list-datafelem × list → list
. + .listflist × list → list
. + .listflist × elem → list
. + .DQctrace-absActionfabsAction × actionlist → actionlist
. + .actionstreamfactionlist × actionlist → actionlist
. + .DQctrace-absActionfactionlist × absAction → actionlist
. + .nat-inffnatinf × natinf → natinf
. + .DQctrace-absActionfabsAction × actionstream → actionstream
. + .actionstreamfactionstream × actionstream → actionstream
. + .DQctrace-absActionfDQState × cstatelist → cstatelist
. + .traceCfcstatelist × cstatelist → cstatelist
. + .DQctrace-absActionfcstatelist × DQState → cstatelist
. + .DQctrace-absActionfDQState × cstatestream → cstatestream
. + .traceCfcstatestream × cstatestream → cstatestream
. + .DurQtrace-absActionfDurQState × astatelist → astatelist
. + .traceAfastatelist × astatelist → astatelist
. + .DurQtrace-absActionfastatelist × DurQState → astatelist
. + .DurQtrace-absActionfDurQState × astatestream → astatestream
. + .traceAfastatestream × astatestream → astatestream
. ++ .DQ-refines-DurQ-instancefastateset × DurQState → astateset
. ++ .Koenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat → pairastatenat-list
. ++ .Koenigs-Lemma-gen-bwactfpairastatenat-set × pairastatenat → pairastatenat-set
. ++ .list-dupflist × elem → list
. ++ .DQctrace-absActionfactionlist × absAction → actionlist
. ++ .DQctrace-absActionfcstatelist × DQState → cstatelist
. ++ .DurQtrace-absActionfastatelist × DurQState → astatelist
. ++ .tidsetftidset × Tid → tidset
. +1nat-basicfnat → nat
. +2 .Koenigs-Lemma-gen-bwactfpairastatenat × pairastatenat → pairastatenat-list
. +2 .listfelem × elem → list
. +l .DQctrace-absActionfabsAction × absAction → actionlist
. +l .DQctrace-absActionfDQState × DQState → cstatelist
. +l .DurQtrace-absActionfDurQState × DurQState → astatelist
. - .natpfnat × nat → nat with λ n, m. n ≥ m
. -- .DQ-refines-DurQ-instancefastateset × DurQState → astateset
. -- .Koenigs-Lemma-gen-bwactfpairastatenat-set × pairastatenat → pairastatenat-set
. -- .Node-heapfheap × Ref → heap
. -- .tidsetftidset × Tid → tidset
. -1nat-basicpfnat → nat with λ n. n ≠ 0
. -1l .Koenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat → pairastatenat-list
. -1l .DQctrace-absActionfactionlist × absAction → actionlist
. -1l .DQctrace-absActionfcstatelist × DQState → cstatelist
. -1l .DurQtrace-absActionfastatelist × DurQState → astatelist
. -l .Koenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat → pairastatenat-list
. -l .DQctrace-absActionfactionlist × absAction → actionlist
. -l .DQctrace-absActionfcstatelist × DQState → cstatelist
. -l .DurQtrace-absActionfastatelist × DurQState → astatelist
. -p .Koenigs-Lemma-gen-bwactfpairastatenat-list × nat → pairastatenat-list
. -p .actionstreamfactionlist × nat → actionlist
. -p .traceCfcstatelist × nat → cstatelist
. -p .traceAfastatelist × nat → astatelist
. .1DQ-refines-DurQ-instancefpairastatenat → DurQState
. .2pair-astate-natfpairastatenat → nat
. .butlastKoenigs-Lemma-gen-bwactpfpairastatenat-list → pairastatenat-list with λ x. x ≠ []
. .butlastlist-lastpflist → list with λ x. x ≠ []
. .butlastactionstreampfactionlist → actionlist with λ x. x ≠ []
. .butlasttraceCpfcstatelist → cstatelist with λ x. x ≠ []
. .butlasttraceApfastatelist → astatelist with λ x. x ≠ []
. .deqIDNodefNode → OptTid
. .deqID:= .NodefNode × OptTid → Node
. .fKoenigs-Lemma-gen-bwactpfpairastatenat-stream → nat → pairastatenat with λ σ. λ m. ∃ nf. σ = ⌜nf⌝
. .fDQctrace-absActionpfactionstream → nat → absAction with λ σ. λ m. ∃ nf. σ = ⌜nf⌝
. .fDQctrace-absActionpfcstatestream → nat → DQState with λ σ. λ m. ∃ nf. σ = ⌜nf⌝
. .fDurQtrace-absActionpfastatestream → nat → DurQState with λ σ. λ m. ∃ nf. σ = ⌜nf⌝
. .gstateDurQfDurQState → DurQGState
. .gstateDQfDQState → DQGState
. .gstate:= .DurQfDurQState × DurQGState → DurQState
. .gstate:= .DQfDQState × DQGState → DQState
. .headKoenigs-Lemma-gen-bwactpfpairastatenat-list → pairastatenat with λ x. x ≠ []
. .headlist-datapflist → elem with λ x. x ≠ []
. .ivalDurQfDurQLState → elem
. .ivalDQfDQLState → elem
. .ival:= .DurQfDurQLState × elem → DurQLState
. .ival:= .DQfDQLState × elem → DQLState
. .lKoenigs-Lemma-gen-bwactpfpairastatenat-stream → pairastatenat-list with λ σ. finp(σ)
. .lactionstreampfactionstream → actionlist with λ σ. finp(σ)
. .ltraceCpfcstatestream → cstatelist with λ σ. finp(σ)
. .ltraceApfastatestream → astatelist with λ σ. finp(σ)
. .lastKoenigs-Lemma-gen-bwactpfpairastatenat-list → pairastatenat with λ x. x ≠ []
. .lastlist-lastpflist → elem with λ x. x ≠ []
. .lastDQctrace-absActionpfactionlist → absAction with λ x. x ≠ []
. .lastDQctrace-absActionpfcstatelist → DQState with λ x. x ≠ []
. .lastDurQtrace-absActionpfastatelist → DurQState with λ x. x ≠ []
. .lsfDurQfDurQState → Tid → DurQLState
. .lsfDQfDQState → Tid → DQLState
. .lsf:= .DurQfDurQState × (Tid → DurQLState) → DurQState
. .lsf:= .DQfDQState × (Tid → DQLState) → DQState
. .nnat-infpfnatinf → nat with λ n∞. n∞ ≠ ∞
. .nextNodefNode → Ref
. .next:= .NodefNode × Ref → Node
. .obsEmptyDQpDQLState
. .obsEmpty:= .DQfDQLState × bool → DQLState
. .optvalDurQfDurQLState → OptElem
. .optvalDQfDQLState → OptElem
. .optvalDurQpfDurQAction → OptElem with λ a. ∃ tid, optval. a = ARetDeq(tid, optval)
. .optvalDQpfDQAction → OptElem with λ a. ∃ tid, optval. a = RetDeq(tid, optval)
. .optvalabsActionpfabsAction → OptElem with λ aa. ∃ tid, optval. aa = ResDEQ(tid, optval)
. .optval:= .DurQfDurQLState × OptElem → DurQLState
. .optval:= .DQfDQLState × OptElem → DQLState
. .ovalDurQfDurQLState → OptElem
. .ovalDQfDQLState → OptElem
. .oval:= .DurQfDurQLState × OptElem → DurQLState
. .oval:= .DQfDQLState × OptElem → DQLState
. .pcfDurQfDurQState → Tid → DurQPC
. .pcfDQfDQState → Tid → DQPC
. .pcf:= .DurQfDurQState × (Tid → DurQPC) → DurQState
. .pcf:= .DQfDQState × (Tid → DQPC) → DQState
. .queueDurQfDurQGState → list
. .queueDQfDQGState → list
. .queue:= .DurQfDurQGState × list → DurQGState
. .queue:= .DQfDQGState × list → DQGState
. .startDQctrace-absActionfCIOAutomaton → DQState → bool
. .startDurQtrace-absActionfAIOAutomaton → DurQState → bool
. .stepDQctrace-absActionfCIOAutomaton → DQState × absAction × DQState → bool
. .stepDurQtrace-absActionfAIOAutomaton → DurQState × absAction × DurQState → bool
. .tailKoenigs-Lemma-gen-bwactpfpairastatenat-list → pairastatenat-list with λ x. x ≠ []
. .taillist-datapflist → list with λ x. x ≠ []
. .tidDurQfDurQLState → Tid
. .tidDQfDQLState → Tid
. .tidopttidpfOptTid → Tid with λ opttid. weak?(opttid) ∨ some?(opttid)
. .tidDurQpfDurQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalACrash
. .tidDQpfDQAction → Tid with λ a. a ≠ τ ∧ a ≠ globalCrash
. .tidabsActionpfabsAction → Tid with λ aa. aa ≠ globalCRASH ∧ aa ≠ τ
. .tid:= .DurQfDurQLState × Tid → DurQLState
. .tid:= .DQfDQLState × Tid → DQLState
. .tid:= .opttidpfOptTid × Tid → OptTid with λ opttid, tid. weak?(opttid) ∨ some?(opttid)
. .valNodefNode → elem
. .valoptelempfOptElem → elem with λ optval. optval ≠ Empty
. .valDurQpfDurQAction → elem with λ a. ∃ tid, val. a = AInvEnq(tid, val)
. .valDQpfDQAction → elem with λ a. ∃ tid, val. a = InvEnq(tid, val)
. .valabsActionpfabsAction → elem with λ aa. ∃ tid, val. aa = InvENQ(tid, val)
. .val:= .NodefNode × elem → Node
. .valueDurQfDurQLState → elem
. .valueDQfDQLState → elem
. .value:= .DurQfDurQLState × elem → DurQLState
. .value:= .DQfDQLState × elem → DQLState
. < .Koenigs-Lemma-gen-bwactppairastatenat-list × pairastatenat-list
. < .nat-basicpnat × nat
. < .list-dataplist × list
. < .actionstreampactionlist × actionlist
. < .nat-infpnatinf × natinf
. < .traceCpcstatelist × cstatelist
. < .traceApastatelist × astatelist
. > .natpnat × nat
. [ . ]Node-heapfheap × Ref × Node → heap
. [ . ]Koenigs-Lemma-gen-bwactpfpairastatenat-list × nat → pairastatenat with λ x, n. n < # x
. [ . ]Koenigs-Lemma-gen-bwactpfpairastatenat-list × nat × pairastatenat → pairastatenat-list with λ x, n, a. n < # x
. [ . ]Koenigs-Lemma-gen-bwactpfpairastatenat-stream × nat → pairastatenat with λ σ, n. finp(σ) → ⌜n⌝ < # σ
. [ . ]Koenigs-Lemma-gen-bwactpfpairastatenat-stream × nat × pairastatenat → pairastatenat-stream with λ σ, n, a. finp(σ) → ⌜n⌝ < # σ
. [ . ]Node-heappfheap × Ref → Node with λ st, a. a ∈ st
. [ . ]DQctrace-absActionpfactionlist × nat → absAction with λ x, n. n < # x
. [ . ]DQctrace-absActionpfactionlist × nat × absAction → actionlist with λ x, n, a. n < # x
. [ . ]DQctrace-absActionpfactionstream × nat → absAction with λ σ, n. finp(σ) → ⌜n⌝ < # σ
. [ . ]DQctrace-absActionpfactionstream × nat × absAction → actionstream with λ σ, n, a. finp(σ) → ⌜n⌝ < # σ
. [ . ]DQctrace-absActionpfcstatelist × nat → DQState with λ x, n. n < # x
. [ . ]DQctrace-absActionpfcstatelist × nat × DQState → cstatelist with λ x, n, a. n < # x
. [ . ]DQctrace-absActionpfcstatestream × nat → DQState with λ σ, n. finp(σ) → ⌜n⌝ < # σ
. [ . ]DQctrace-absActionpfcstatestream × nat × DQState → cstatestream with λ σ, n, a. finp(σ) → ⌜n⌝ < # σ
. [ . ]DurQtrace-absActionpfastatelist × nat → DurQState with λ x, n. n < # x
. [ . ]DurQtrace-absActionpfastatelist × nat × DurQState → astatelist with λ x, n, a. n < # x
. [ . ]DurQtrace-absActionpfastatestream × nat → DurQState with λ σ, n. finp(σ) → ⌜n⌝ < # σ
. [ . ]DurQtrace-absActionpfastatestream × nat × DurQState → astatestream with λ σ, n, a. finp(σ) → ⌜n⌝ < # σ
. \ .astatesetfastateset × astateset → astateset
. \ .Koenigs-Lemma-gen-bwactfpairastatenat-set × pairastatenat-set → pairastatenat-set
. \ .tidsetftidset × tidset → tidset
. ^remtaufactionstream → actionstream
. ^^ .Koenigs-Lemma-gen-bwactf(pairastatenat-list → pairastatenat-list) × nat → pairastatenat-list → pairastatenat-list
. × .DQ-refines-DurQ-instancefDurQState × nat → pairastatenat
. × .Koenigs-Lemma-gen-bwactf(pairastatenat → bool) × (pairastatenat × pairastatenat → bool) → graph
. ∈ .DQ-refines-DurQ-instancepDurQState × astateset
. ∈ .Koenigs-Lemma-gen-bwactppairastatenat × pairastatenat-list
. ∈ .Koenigs-Lemma-gen-bwactppairastatenat × pairastatenat-set
. ∈ .Node-heappRef × heap
. ∈ .listpelem × list
. ∈ .DQctrace-absActionpabsAction × actionlist
. ∈ .DQctrace-absActionpDQState × cstatelist
. ∈ .DurQtrace-absActionpDurQState × astatelist
. ∈ .tidsetpTid × tidset
. ∩ .astatesetfastateset × astateset → astateset
. ∩ .Koenigs-Lemma-gen-bwactfpairastatenat-set × pairastatenat-set → pairastatenat-set
. ∩ .tidsetftidset × tidset → tidset
. ∪ .astatesetfastateset × astateset → astateset
. ∪ .Koenigs-Lemma-gen-bwactfpairastatenat-set × pairastatenat-set → pairastatenat-set
. ∪ .tidsetftidset × tidset → tidset
. ≤ .Koenigs-Lemma-gen-bwactppairastatenat-stream × pairastatenat-stream
. ≤ .natpnat × nat
. ≤ .actionstreampactionstream × actionstream
. ≤ .traceCpcstatestream × cstatestream
. ≤ .traceApastatestream × astatestream
. ≥ .natpnat × nat
. ⊆ .astatesetpastateset × astateset
. ⊆ .Koenigs-Lemma-gen-bwactppairastatenat-set × pairastatenat-set
. ⊆ .Node-heappheap × heap
. ⊆ .tidsetptidset × tidset
. ⊑ .Koenigs-Lemma-gen-bwactppairastatenat-list × pairastatenat-list
. ⊑ .list-lastplist × list
. ⊑ .actionstreampactionlist × actionlist
. ⊑ .traceCpcstatelist × cstatelist
. ⊑ .traceApastatelist × astatelist
. ⊒ .Koenigs-Lemma-gen-bwactppairastatenat-list × pairastatenat-list
. ⊒ .list-lastplist × list
. ⊒ .actionstreampactionlist × actionlist
. ⊒ .traceCpcstatelist × cstatelist
. ⊒ .traceApastatelist × astatelist
. from .Koenigs-Lemma-gen-bwactf(nat → pairastatenat) × nat → nat → pairastatenat
. from .DQctrace-absActionf(nat → absAction) × nat → nat → absAction
. from .DQctrace-absActionf(nat → DQState) × nat → nat → DQState
. from .DurQtrace-absActionf(nat → DurQState) × nat → nat → DurQState
. from .Koenigs-Lemma-gen-bwactpfpairastatenat-stream × nat → pairastatenat-stream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. from .Koenigs-Lemma-gen-bwactpfpairastatenat-list × nat → pairastatenat-list with λ x, n. n ≤ # x
. from .actionstreampfactionstream × nat → actionstream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. from .actionstreampfactionlist × nat → actionlist with λ x, n. n ≤ # x
. from .traceCpfcstatestream × nat → cstatestream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. from .traceCpfcstatelist × nat → cstatelist with λ x, n. n ≤ # x
. from .traceApfastatestream × nat → astatestream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. from .traceApfastatelist × nat → astatelist with λ x, n. n ≤ # x
. to .Koenigs-Lemma-gen-bwactf(nat → pairastatenat) × nat → pairastatenat-list
. to .DQctrace-absActionf(nat → absAction) × nat → actionlist
. to .DQctrace-absActionf(nat → DQState) × nat → cstatelist
. to .DurQtrace-absActionf(nat → DurQState) × nat → astatelist
. to .Koenigs-Lemma-gen-bwactpfpairastatenat-stream × nat → pairastatenat-stream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. to .Koenigs-Lemma-gen-bwactpfpairastatenat-list × nat → pairastatenat-list with λ x, n. n ≤ # x
. to .actionstreampfactionstream × nat → actionstream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. to .actionstreampfactionlist × nat → actionlist with λ x, n. n ≤ # x
. to .traceCpfcstatestream × nat → cstatestream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. to .traceCpfcstatelist × nat → cstatelist with λ x, n. n ≤ # x
. to .traceApfastatestream × nat → astatestream with λ σ, n. finp(σ) → ⌜n⌝ < # σ ∨ ⌜n⌝ = # σ
. to .traceApfastatelist × nat → astatelist with λ x, n. n ≤ # x
. to∞ .Koenigs-Lemma-gen-bwactpfpairastatenat-stream × natinf → pairastatenat-stream with λ σ, n∞. finp(σ) → n∞ < # σ ∨ n∞ = # σ
. to∞ .actionstreampfactionstream × natinf → actionstream with λ σ, n∞. finp(σ) → n∞ < # σ ∨ n∞ = # σ
. to∞ .traceCpfcstatestream × natinf → cstatestream with λ σ, n∞. finp(σ) → n∞ < # σ ∨ n∞ = # σ
. to∞ .traceApfastatestream × natinf → astatestream with λ σ, n∞. finp(σ) → n∞ < # σ ∨ n∞ = # σ
[]Koenigs-Lemma-gen-bwactcpairastatenat-list
[]Koenigs-Lemma-gen-bwactcpairastatenat-stream
[]list-dataclist
[]actionstreamcactionlist
[]actionstreamcactionstream
[]traceCccstatelist
[]traceCccstatestream
[]traceAcastatelist
[]traceAcastatestream
{ . }DQ-refines-DurQ-instancefDurQState → astateset
{ . }Koenigs-Lemma-gen-bwactfpairastatenat → pairastatenat-set
{ . }tidsetfTid → tidset
τDurQcDurQAction
τDQcDQAction
τabsActioncabsAction
∅astatesetcastateset
∅Koenigs-Lemma-gen-bwactcpairastatenat-set
∅Node-heapcheap
∅tidsetctidset
∞nat-infcnatinf
≤BIObackwardpCIOAutomaton × AIOAutomaton
≤BIIObackward-INVpCIOAutomaton × AIOAutomaton
≤iBimfinIObackwardpCIOAutomaton × AIOAutomaton
≤iBIimfinIObackward-INVpCIOAutomaton × AIOAutomaton
≤wBIObackward-INVpCIOAutomaton × AIOAutomaton
⌜ . ⌝Koenigs-Lemma-gen-bwactfpairastatenat-list → pairastatenat-stream
⌜ . ⌝Koenigs-Lemma-gen-bwactf(nat → pairastatenat) → pairastatenat-stream
⌜ . ⌝actionstreamfactionlist → actionstream
⌜ . ⌝DQctrace-absActionf(nat → absAction) → actionstream
⌜ . ⌝nat-inffnat → natinf
⌜ . ⌝traceCfcstatelist → cstatestream
⌜ . ⌝DQctrace-absActionf(nat → DQState) → cstatestream
⌜ . ⌝traceAfastatelist → astatestream
⌜ . ⌝DurQtrace-absActionf(nat → DurQState) → astatestream
A_≤*T_CIOrefine-defpAIOAutomaton × CIOAutomaton
A_≤ωT_CIOrefine-defpAIOAutomaton × CIOAutomaton
A_≤T_CIOrefine-defpAIOAutomaton × CIOAutomaton
ACrashDurQpr : (Tid → DurQPC)
ADODEQDurQpr : OptElem × list
ADOENQDurQprelem : list
ADoDeqDurQfTid → DurQAction
ADoEnqDurQfTid → DurQAction
AINVDEQDurQpr :
AINVENQDurQprelem : elem
AIOAutDurQtrace-absActionf(DurQState → bool) × (DurQState × absAction × DurQState → bool) → AIOAutomaton
AIOAut?traceApAIOAutomaton
AIOAutomatontraceAs
AInvDeqDurQfTid → DurQAction
AInvEnqDurQfTid × elem → DurQAction
ARETDEQDurQprOptElem : : OptElem
ARETENQDurQpr :
ARetDeqDurQfTid × OptElem → DurQAction
ARetEnqDurQfTid → DurQAction
ARunDurQpr :
C_≡*T_AIOrefine-defpCIOAutomaton × AIOAutomaton
C_≡ωT_AIOrefine-defpCIOAutomaton × AIOAutomaton
C_≡T_AIOrefine-defpCIOAutomaton × AIOAutomaton
C_≤*T_AIOrefine-defpCIOAutomaton × AIOAutomaton
C_≤ωT_AIOrefine-defpCIOAutomaton × AIOAutomaton
C_≤T_AIOrefine-defpCIOAutomaton × AIOAutomaton
CHECKEMPDQprlist : bool
CIOAutDQctrace-absActionf(DQState → bool) × (DQState × absAction × DQState → bool) → CIOAutomaton
CIOAut?traceCpCIOAutomaton
CIOAutomatontraceCs
CallRUNabsActionfTid → absAction
CheckEmpDQfTid → DQAction
CrashDQpr : (Tid → DQPC)
DODEQDQpr : OptElem × list
DODEQEMPTYDQprbool : OptElem
DOENQDQprelem : list
DQActionDQs
DQGInvDQpDQGState
DQGStateDQs
DQINVDQ-refines-DurQpDQState
DQInvDQpDQGState × (Tid → DQLState) × (Tid → DQPC)
DQLInvDQpDQGState × DQLState × DQPC
DQLStateDQs
DQPCDQs
DQStateDQs
DQinitDQ-refines-DurQpDQState
DQstepDQpDQState × DQAction × DQState
DQstepDQ-refines-DurQpDQState × absAction × DQState
DoDeqDQfTid → DQAction
DoDeqEmptyDQfTid → DQAction
DoEnqDQfTid → DQAction
DurQActionDurQs
DurQGInvDurQpDurQGState
DurQGStateDurQs
DurQInvDurQpDurQGState × (Tid → DurQLState) × (Tid → DurQPC)
DurQLInvDurQpDurQGState × DurQLState × DurQPC
DurQLStateDurQs
DurQPCDurQs
DurQStateDurQs
DurQinitDQ-refines-DurQpDurQState
DurQstepDurQpDurQState × DurQAction × DurQState
DurQstepDQ-refines-DurQpDurQState × absAction × DurQState
EmptyoptelemcOptElem
INVDEQDQpr : bool
INVENQDQprelem : elem
InvDEQabsActionfTid → absAction
InvDeqDQfTid → DQAction
InvENQabsActionfTid × elem → absAction
InvEnqDQfTid × elem → DQAction
NodeNodes
NoneopttidcOptTid
OptElemoptelems
OptTidopttids
RETDEQDQprOptElem : : OptElem
RETENQDQpr :
RefRefs
ResDEQabsActionfTid × OptElem → absAction
ResENQabsActionfTid → absAction
RetDeqDQfTid × OptElem → DQAction
RetEnqDQfTid → DQAction
RunDQpr :
SomeopttidfTid → OptTid
Tidtids
Valoptelemfelem → OptElem
WeakopttidfTid → OptTid
aDQ-refines-DurQvDurQAction
aaDQ-refines-DurQvabsAction
aabsaabsfDQAction → absAction
aabsDQ-refines-DurQfDurQAction → absAction
absActionabsActions
absaDQ-refines-DurQfDQAction × (Tid → DurQPC) → DurQAction
actionlistactionstreams
actionstreamactionstreams
aexectraceAfAIOAutomaton → astatestream × actionstream → bool
aexec*traceAfAIOAutomaton → astatestream × actionstream → bool
aexecωtraceAfAIOAutomaton → astatestream × actionstream → bool
afragtraceAfAIOAutomaton → astatestream × actionstream → bool
afrag*traceAfAIOAutomaton → astatestream × actionstream → bool
afragωtraceAfAIOAutomaton → astatestream × actionstream → bool
agsDQ-refines-DurQvDurQGState
allreachableKoenigs-Lemma-genpgraph
alsDQ-refines-DurQvDurQLState
alsfDQ-refines-DurQvTid → DurQLState
amoveDurQtrace-absActionfAIOAutomaton → DurQState × actionstream × DurQState → bool
apcDQ-refines-DurQvDurQPC
apcfDQ-refines-DurQvTid → DurQPC
astatelisttraceAs
astatesetastatesets
astatestreamtraceAs
atracetraceAfAIOAutomaton → actionstream → bool
atrace*traceAfAIOAutomaton → actionstream → bool
atraceωtraceAfAIOAutomaton → actionstream → bool
butlastnKoenigs-Lemma-gen-bwactpfnat × pairastatenat-list → pairastatenat-list with λ n, x. n ≤ # x
butlastnlist-lastpfnat × list → list with λ n, x. n ≤ # x
butlastnactionstreampfnat × actionlist → actionlist with λ n, x. n ≤ # x
butlastntraceCpfnat × cstatelist → cstatelist with λ n, x. n ≤ # x
butlastntraceApfnat × astatelist → astatelist with λ n, x. n ≤ # x
bwabsbwabspDQState × DurQState
bwabsabwabsfDQAction → DurQAction
bwabspcbwabsp(Tid → DQPC) × (Tid → DQLState) × (Tid → DurQPC) × (Tid → DurQLState)
bwabspcfbwabsfDQPC → DurQPC
bwlabsfbwabsfDQLState → DurQLState
bwsimDQ-refines-DurQ-instancepCIOAutomaton × AIOAutomaton × (DQState × DurQState → bool)
bwsimDQ-refines-DurQ-instancepCIOAutomaton × AIOAutomaton × (DQState × DurQState → bool) × (DQState → bool) × (DurQState → bool)
caDQ-refines-DurQvDQAction
callARunDurQfTid → DurQAction
callRunDQfTid → DQAction
cexectraceCfCIOAutomaton → cstatestream × actionstream → bool
cexec*traceCfCIOAutomaton → cstatestream × actionstream → bool
cexecωtraceCfCIOAutomaton → cstatestream × actionstream → bool
cfragtraceCfCIOAutomaton → cstatestream × actionstream → bool
cfrag*traceCfCIOAutomaton → cstatestream × actionstream → bool
cfragωtraceCfCIOAutomaton → cstatestream × actionstream → bool
cmoveDQctrace-absActionfCIOAutomaton → DQState × actionstream × DQState → bool
crashedDurQcDurQPC
crashedDQcDQPC
cstatelisttraceCs
cstatestreamtraceCs
ctracetraceCfCIOAutomaton → actionstream → bool
ctrace*traceCfCIOAutomaton → actionstream → bool
ctraceωtraceCfCIOAutomaton → actionstream → bool
disjKoenigs-Lemma-gen-bwactppairastatenat-list × pairastatenat-list
disjlist-dupplist × list
disjactionstreampactionlist × actionlist
disjtraceCpcstatelist × cstatelist
disjtraceApastatelist × astatelist
dqsDQ-refines-DurQvDQState
dummytidtidcTid
dupsKoenigs-Lemma-gen-bwactppairastatenat-list
dupslist-dupplist
dupsactionstreampactionlist
dupstraceCpcstatelist
dupstraceApastatelist
durqsDQ-refines-DurQvDurQState
edgeKoenigs-Lemma-gen-bwactfgraph → pairastatenat × pairastatenat → bool
elemelems
fillfirstKoenigs-Lemma-gen-bwactfnat × pairastatenat × pairastatenat-list → pairastatenat-list
fillfirstlist-lastfnat × elem × list → list
fillfirstDQctrace-absActionfnat × absAction × actionlist → actionlist
fillfirstDQctrace-absActionfnat × DQState × cstatelist → cstatelist
fillfirstDurQtrace-absActionfnat × DurQState × astatelist → astatelist
fininvdeqDQ-refines-DurQp(Tid → DQPC)
finoutKoenigs-Lemma-genpgraph
finpKoenigs-Lemma-gen-bwactppairastatenat-stream
finpactionstreampactionstream
finptraceCpcstatestream
finptraceApastatestream
finrootKoenigs-Lemma-genpgraph
firstnKoenigs-Lemma-gen-bwactpfnat × pairastatenat-list → pairastatenat-list with λ n, x. n ≤ # x
firstnactionstreampfnat × actionlist → actionlist with λ n, x. n ≤ # x
firstntraceCpfnat × cstatelist → cstatelist with λ n, x. n ≤ # x
firstntraceApfnat × astatelist → astatelist with λ n, x. n ≤ # x
fromeKoenigs-Lemma-gen-bwactfpairastatenat-list × pairastatenat → pairastatenat-list
fromeDQctrace-absActionfactionlist × absAction → actionlist
fromeDQctrace-absActionfcstatelist × DQState → cstatelist
fromeDurQtrace-absActionfastatelist × DurQState → astatelist
gdomDQ-refines-DurQ-instancefgraph → pairastatenat → bool
globalACrashDurQcDurQAction
globalCRASHabsActioncabsAction
globalCrashDQcDQAction
graphinfgraph-gen-basics
gsDQ-refines-DurQvDQGState
gstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQGState
gstepfDQfDQGState × DQLState × DQPC × DQAction → DQGState
haspathanylengthKoenigs-Lemma-gen-bwactfgraph → pairastatenat → bool
hdKoenigs-Lemma-gen-bwactpfpairastatenat-stream → pairastatenat with λ σ. σ ≠ []
hdDQctrace-absActionpfactionlist → absAction with λ x. x ≠ []
hdDQctrace-absActionpfactionstream → absAction with λ σ. σ ≠ []
hdDQctrace-absActionpfcstatelist → DQState with λ x. x ≠ []
hdDQctrace-absActionpfcstatestream → DQState with λ σ. σ ≠ []
hdDurQtrace-absActionpfastatelist → DurQState with λ x. x ≠ []
hdDurQtrace-absActionpfastatestream → DurQState with λ σ. σ ≠ []
heapNode-heaps
idleDurQcDurQPC
idleDQcDQPC
imfinbwsimDQ-refines-DurQ-instancepCIOAutomaton × AIOAutomaton × (DQState × DurQState → bool)
imfinbwsimDQ-refines-DurQ-instancepCIOAutomaton × AIOAutomaton × (DQState × DurQState → bool) × (DQState → bool) × (DurQState → bool)
infgraphKoenigs-Lemma-genpgraph
invDeqDurQcDurQPC
invDeqDQcDQPC
invEnqDurQcDurQPC
invEnqDQcDQPC
isrootKoenigs-Lemma-gen-bwactfgraph → pairastatenat → bool
lastnKoenigs-Lemma-gen-bwactpfnat × pairastatenat-list → pairastatenat-list with λ n, x. n ≤ # x
lastnactionstreampfnat × actionlist → actionlist with λ n, x. n ≤ # x
lastntraceCpfnat × cstatelist → cstatelist with λ n, x. n ≤ # x
lastntraceApfnat × astatelist → astatelist with λ n, x. n ≤ # x
listlist-datas
lsDQ-refines-DurQvDQLState
lsfDQ-refines-DurQvTid → DQLState
lstepDurQpDurQGState × DurQLState × DurQPC × DurQAction × DurQGState × DurQLState × DurQPC
lstepDQpDQGState × DQLState × DQPC × DQAction × DQGState × DQLState × DQPC
lstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQLState
lstepfDQfDQGState × DQLState × DQPC × DQAction → DQLState
minnat-inffnatinf × natinf → natinf
mkNodefelem × OptTid × Ref → Node
mkdgsDurQ-renflist → DurQGState
mkgsDQflist → DQGState
mklistKoenigs-Lemma-gen-bwactfpairastatenat × nat → pairastatenat-list
mklistlist-lastfelem × nat → list
mklistDQctrace-absActionfabsAction × nat → actionlist
mklistDQctrace-absActionfDQState × nat → cstatelist
mklistDurQtrace-absActionfDurQState × nat → astatelist
mklsDurQfTid × elem × OptElem × elem × OptElem → DurQLState
mklsDQfTid × bool × elem × OptElem × elem × OptElem → DQLState
mkstateDurQfDurQGState × (Tid → DurQLState) × (Tid → DurQPC) → DurQState
mkstateDQfDQGState × (Tid → DQLState) × (Tid → DQPC) → DQState
natnat-basics
natinfnat-infs
nullRefcRef
optvalDQ-refines-DurQvOptElem
pairastatenatpair-astate-nats
pairastatenat-listKoenigs-Lemma-gen-bwacts
pairastatenat-setKoenigs-Lemma-gen-bwacts
pairastatenat-streamKoenigs-Lemma-gen-bwacts
pathKoenigs-Lemma-gen-bwactfgraph → pairastatenat × pairastatenat → bool
pathpKoenigs-Lemma-gen-bwactfgraph → pairastatenat-stream → bool
pcDQ-refines-DurQvDQPC
pcfDQ-refines-DurQvTid → DQPC
pcstepfDurQfDurQGState × DurQLState × DurQPC × DurQAction → DurQPC
pcstepfDQfDQGState × DQLState × DQPC × DQAction → DQPC
posKoenigs-Lemma-gen-bwactfpairastatenat × pairastatenat-list → nat
posDQctrace-absActionfabsAction × actionlist → nat
posDQctrace-absActionfDQState × cstatelist → nat
posDurQtrace-absActionfDurQState × astatelist → nat
preDurQpDurQGState × DurQLState × DurQPC × DurQAction
preDQpDQGState × DQLState × DQPC × DQAction
reachKoenigs-Lemma-gen-bwactfgraph → pairastatenat-set × nat → pairastatenat → bool
reach≤Koenigs-Lemma-gen-bwactfgraph → pairastatenat-set × nat → pairastatenat → bool
readyDurQcDurQPC
readyDQcDQPC
resDeqDurQcDurQPC
resDeqDQcDQPC
resEnqDurQcDurQPC
resEnqDQcDQPC
restnKoenigs-Lemma-gen-bwactpfnat × pairastatenat-list → pairastatenat-list with λ n, x. n ≤ # x
restnactionstreampfnat × actionlist → actionlist with λ n, x. n ≤ # x
restntraceCpfnat × cstatelist → cstatelist with λ n, x. n ≤ # x
restntraceApfnat × astatelist → astatelist with λ n, x. n ≤ # x
revKoenigs-Lemma-gen-bwactfpairastatenat-list → pairastatenat-list
revlist-lastflist → list
revactionstreamfactionlist → actionlist
revtraceCfcstatelist → cstatelist
revtraceAfastatelist → astatelist
rmdupKoenigs-Lemma-gen-bwactfpairastatenat-list → pairastatenat-list
rmduplist-dupflist → list
rmdupactionstreamfactionlist → actionlist
rmduptraceCfcstatelist → cstatelist
rmduptraceAfastatelist → astatelist
some?opttidpOptTid
sublistKoenigs-Lemma-gen-bwactpfnat × nat × pairastatenat-list → pairastatenat-list with λ n, m, x. n + m ≤ # x
sublistactionstreampfnat × nat × actionlist → actionlist with λ n, m, x. n + m ≤ # x
sublisttraceCpfnat × nat × cstatelist → cstatelist with λ n, m, x. n + m ≤ # x
sublisttraceApfnat × nat × astatelist → astatelist with λ n, m, x. n + m ≤ # x
tidDQ-refines-DurQvTid
tidsDQ-refines-DurQvtidset
tidsettidsets
tlKoenigs-Lemma-gen-bwactpfpairastatenat-stream → pairastatenat-stream with λ σ. σ ≠ []
tlactionstreampfactionlist → actionlist with λ x. x ≠ []
tlactionstreampfactionstream → actionstream with λ σ. σ ≠ []
tltraceCpfcstatelist → cstatelist with λ x. x ≠ []
tltraceCpfcstatestream → cstatestream with λ σ. σ ≠ []
tltraceApfastatelist → astatelist with λ x. x ≠ []
tltraceApfastatestream → astatestream with λ σ. σ ≠ []
valDQ-refines-DurQvelem
weak?opttidpOptTid
weakbwsimDQ-refines-DurQ-instancepCIOAutomaton × AIOAutomaton × (DQState × DurQState → bool) × (DurQState → bool)