{"id":"W2972294382","doi":"10.1007/978-3-030-30281-8_5","title":"Finite Approximation of LMPs for Exact Verification of Reachability Properties","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Reachability; Markov decision process; Discretization; Bisimulation; Countable set; Computer science; Probabilistic logic; Computation; Mathematics; State space; Markov process; Discrete mathematics; Algorithm","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.001419434,0.001097912,0.001191223,0.0008509682,0.0006568622,0.001598936,0.001860727,0.001024531,0.008579177],"category_scores_gemma":[0.007180563,0.0006382996,0.001721817,0.0006801679,0.001413095,0.001999083,0.001973913,0.003484269,0.001575257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002067715,"about_ca_system_score_gemma":0.001417736,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002888197,"about_ca_topic_score_gemma":0.004451423,"domain_scores_codex":[0.9982421,0.0005630181,0.0001020284,0.0002942456,0.0005707102,0.000227857],"domain_scores_gemma":[0.9946402,0.004099702,0.0001765664,0.0007654626,0.000254076,0.00006407979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006161094,0.0002058371,0.0005711034,0.0006512286,0.0001036354,0.0003239091,0.0003615429,0.5262679,0.01975361,0.2822018,0.004008558,0.1649348],"study_design_scores_gemma":[0.00003110377,0.00004472613,0.00006297526,0.00005895736,0.00002361671,0.00003822492,0.00002886478,0.9045636,0.006045608,0.08621671,0.002873862,0.00001181164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008826203,0.0001510351,0.9834992,0.00009399249,0.00005720626,0.00007185503,0.0001178334,0.001688925,0.005493763],"genre_scores_gemma":[0.4736398,0.0003088465,0.5171225,0.0001802583,0.00006977781,0.0005659616,0.0007265761,0.0006452436,0.006741114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008579177,"threshold_uncertainty_score":0.02870017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04791737085453156,"score_gpt":0.2755737733067918,"score_spread":0.2276564024522602,"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."}}