{"id":"W84587889","doi":"10.1007/978-3-642-24372-1_8","title":"Formalization of Finite-State Discrete-Time Markov Chains in HOL","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Computer science; Markov chain; Automated theorem proving; Markov process; Theoretical computer science; Examples of Markov chains; Probabilistic logic; Binary number; Markov model; Scalability; Variable-order Markov model; Markov property; Algorithm; Mathematics; Programming language; Artificial intelligence; Machine learning","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001368281,0.0005556894,0.0005279147,0.0007774411,0.0007968776,0.002285482,0.001449745,0.0006813143,0.007304102],"category_scores_gemma":[0.003325126,0.0005131952,0.001494439,0.0006392191,0.002456147,0.003212147,0.00157882,0.002925643,0.0008628527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001624979,"about_ca_system_score_gemma":0.001599527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00179696,"about_ca_topic_score_gemma":0.002310371,"domain_scores_codex":[0.9991118,0.0002377517,0.00007798189,0.0001328973,0.0003076236,0.000131889],"domain_scores_gemma":[0.9975165,0.001579542,0.0001682262,0.0003757231,0.0002591092,0.0001008667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003324185,0.00004214138,0.0001531688,0.00009091209,0.00001198583,0.0001283302,0.0002442291,0.02261886,0.001396727,0.964067,0.0006997514,0.01051366],"study_design_scores_gemma":[0.00003399875,0.00002385995,0.0001278637,0.00006127115,0.00002218847,0.00008038969,0.0000671263,0.1508971,0.003285455,0.8364112,0.008972106,0.00001744139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009474533,0.0002397471,0.9745297,0.0003668857,0.0001009683,0.0000813667,0.000214664,0.0006838397,0.01430818],"genre_scores_gemma":[0.7067444,0.0008526345,0.275442,0.0002987788,0.0002670768,0.0003323222,0.000722132,0.0005199819,0.01482079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007304102,"threshold_uncertainty_score":0.02443469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02202561707330057,"score_gpt":0.2588579265956386,"score_spread":0.236832309522338,"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."}}