{"id":"W2091607538","doi":"10.1109/lics.2013.38","title":"Stone Duality for Markov Processes","year":2013,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Probabilistic logic; Markov chain; Duality (order theory); Countable set; Mathematics; Completeness (order theory); Algebra over a field; Algebraic number; Stone's representation theorem for Boolean algebras; Modal logic; Markov process; Complete Boolean algebra; Markov kernel; Algebraic structure; Free Boolean algebra; Discrete mathematics; Modal; Pure mathematics; Two-element Boolean algebra; Markov model; Variable-order Markov model; Algebra representation","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003451241,0.00004991195,0.00005794864,0.00002381996,0.00005416273,0.0001000175,0.0004298567,0.00002594072,0.00005824914],"category_scores_gemma":[0.0003193015,0.00003959253,0.00001617129,0.000185128,0.00002022504,0.0007878282,0.00006919824,0.00002593926,0.0001004563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001290271,"about_ca_system_score_gemma":0.00003808457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002670568,"about_ca_topic_score_gemma":0.000002271694,"domain_scores_codex":[0.999457,0.0000270403,0.0001172131,0.0001712134,0.00009709215,0.0001304608],"domain_scores_gemma":[0.9992923,0.0000954261,0.00004174313,0.0003277747,0.0002053749,0.00003744039],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004597602,0.00009584148,0.0004597898,0.0002232409,0.000009200229,1.310601e-7,0.000496677,0.000007030639,0.001795949,0.6318398,0.0172937,0.347774],"study_design_scores_gemma":[0.0009595921,0.0004133397,0.06329028,0.00003368928,0.00001041036,0.00002017284,0.0002157541,0.3563647,0.2709438,0.2296429,0.07719108,0.0009142226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004986218,0.00001848582,0.984918,0.0008312209,0.0001607661,0.0003340061,5.833335e-7,0.0001658973,0.008584809],"genre_scores_gemma":[0.05710867,0.000002506609,0.9404773,0.0003324726,0.00002727199,0.0001789639,8.329648e-7,0.000002962636,0.001869062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4021969,"threshold_uncertainty_score":0.1614536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04069751279656358,"score_gpt":0.3221777949655652,"score_spread":0.2814802821690016,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}