Last Updated：2025/11/23
Sentence
研究者たちは、計算木論理（分岐時間の特定のモーダル論理で「次」「常に」「最終的に／やがて」「until」「弱いuntil」といった演算子を持つ）を用いて、分散プロトコルがあらゆる可能な実行経路で最終的に合意に達することを検証した。
Quizzes for review
Researchers used computation tree logic to verify that the distributed protocol would eventually reach consensus along every possible execution path.
See correct answer
Researchers used computation tree logic to verify that the distributed protocol would eventually reach consensus along every possible execution path.
音声機能が動作しない場合はこちらをご確認ください
Related words
computation tree logic
Noun
uncountable
Japanese Meaning
計算木論理：分岐時間を扱う特殊な様相論理であり、『次』、『全体』、『最終（または最終的に）』、『until』、『weak until』などのオペレーターを用いて、システムの状態遷移などを形式的に表現する論理体系
English - English
Word Edit Setting
- Users who have edit permission for words - All Users
- Screen new word creation
- Screen word edits
- Screen word deletion
- Screen the creation of new headword that may be duplicates
- Screen changing entry name
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Sentence Edit Setting
- Users who have edit permission for sentences - All Users
- Screen sentence deletion
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
Quiz Edit Setting
- Users who have edit permission for quizzes - All Users
- Users authorized to vote on judging - Editor
- Number of votes required for decision - 1
