{"schema_version":"ocme-site-results-v1","locale":"zh-Hant","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-computational-model"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-computational-model-01","title":{"zh-Hant":"抽象計算模型：在七狀態模型中截斷停止邊、計算可達集並區分停止、卡住與不終止","en":"Abstract computational model: truncating halt edges, computing reachability and separating halting, stuck and non-terminating runs in a seven-state model"},"summary":{"zh-Hant":"給定有限模型 (S,Init,Step,Halt)：S={s0,s1,s2,s3,s4,s5,s6}，Init={s0}，Halt={s3}，原始邊資料 {(s0,s1),(s0,s2),(s1,s3),(s1,s5),(s2,s4),(s4,s2),(s3,s6)}。依 MKO 規則截斷停止狀態的外出邊，以不動點迭代算出可達集，找出停止狀態、卡住狀態與可達循環，給出合法的停止、卡住與無窮執行，排除三條不合法的 trace，並說明為何尚未窮盡可達圖的有限深度探索，不能僅憑未見反例就斷言所有極大執行終止。","en":"Given the finite model (S,Init,Step,Halt) with S={s0,s1,s2,s3,s4,s5,s6}, Init={s0}, Halt={s3} and raw edge data {(s0,s1),(s0,s2),(s1,s3),(s1,s5),(s2,s4),(s4,s2),(s3,s6)}: truncate edges out of halt states as the MKO requires, compute the reachable set by fixpoint iteration, identify halt states, stuck states and reachable cycles, exhibit legal halting, stuck and infinite executions, rule out three illegal traces, and explain why depth-bounded exploration that has not exhausted the reachable graph cannot certify termination of all maximal executions merely from the absence of an observed counterexample."},"mko_ids":["mko-computational-model"]}],"title":"概念推導導讀"}