{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002305108,0.0002902837,0.000520498,0.0005409749,0.00007451408,0.00007801091,0.002153078,0.0002658805,0.000003406175],"category_scores_gemma":[0.0006836444,0.0002562914,0.0001332877,0.0004311994,0.0006429924,0.0007398094,0.0003810391,0.0002753913,0.000004628728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001852873,"about_ca_system_score_gemma":0.0005155033,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002006287,"about_ca_topic_score_gemma":0.000005658776,"domain_scores_codex":[0.997209,0.00006648817,0.0008180992,0.0009303131,0.0006931261,0.0002829685],"domain_scores_gemma":[0.9960914,0.0005420498,0.0008844365,0.001756817,0.0006785719,0.00004673079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004673491,0.00007372237,0.0000751524,0.0009369397,0.00001244215,2.417267e-7,0.001923516,0.04118689,0.009403478,0.1288353,0.000003059498,0.8175025],"study_design_scores_gemma":[0.0001766799,0.000284599,0.0002611295,0.0003529064,0.000007593075,0.000002707294,3.571876e-7,0.8447796,0.0972224,0.05641773,0.0002338981,0.0002604578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004727337,0.0001606754,0.9962564,0.0001136647,0.000876069,0.001171289,0.0000113638,0.00005288547,0.0008849922],"genre_scores_gemma":[0.2247301,0.00001476967,0.7750064,0.00004738749,0.00006236605,0.00002212936,0.000007811253,0.00001544343,0.00009357568],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.817242,"threshold_uncertainty_score":0.9999889,"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."}}