computation tree logic
(computer science) A particular modal logic of branching time with operators next, globally, finally or eventually, until, and weak until.
next
globally
finally
eventually
until
weak until
A fungal mycelium or hypha in which each cell contains a single nucleus
Having a case or covering; encased or clad.
(rare) Pertaining to or possessing an animate nonphysical nature; having a mental or spiritual nature. / Relating to mind or spirit; spiritual.
研究者たちは、計算木論理(分岐時間の特定のモーダル論理で「次」「常に」「最終的に/やがて」「until」「弱いuntil」といった演算子を持つ)を用いて、分散プロトコルがあらゆる可能な実行経路で最終的に合意に達することを検証した。
Don't have an account? Sign up
Do you have an account? Login
DiQt
Free
★★★★★★★★★★