{"id":"W1763211909","doi":"10.1007/978-3-642-03741-2_11","title":"Approximating Labelled Markov Processes Again!","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bisimulation; Monad (category theory); Computer science; Probabilistic logic; State space; Construct (python library); Theoretical computer science; Markov process; Markov chain; Algebra over a field; Algorithm; Mathematics; Discrete mathematics; Pure mathematics; Artificial intelligence; Programming language; Functor; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"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.002170878,0.0006064938,0.0006101286,0.0008388701,0.0003615855,0.0007403721,0.004805556,0.000381626,0.00001407456],"category_scores_gemma":[0.0007905404,0.0005622067,0.0001011403,0.001307651,0.0005359295,0.001122463,0.001091463,0.0009345356,0.00005088968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003276401,"about_ca_system_score_gemma":0.0008401111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005360215,"about_ca_topic_score_gemma":0.00001180891,"domain_scores_codex":[0.9953529,0.00006885936,0.0007996593,0.001758334,0.001234249,0.0007859765],"domain_scores_gemma":[0.9964358,0.0005078618,0.0005952824,0.001799364,0.0004890983,0.0001725662],"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.000004069753,0.0000261059,0.000007614195,0.0001193541,0.000005226225,0.00002490685,0.0006548227,0.004532242,0.0001339862,0.0239227,0.00001221477,0.9705567],"study_design_scores_gemma":[0.0002772134,0.0002220404,0.00004855426,0.0007613499,0.00000898206,0.00009757504,2.222977e-7,0.7420078,0.005320896,0.2478594,0.00238374,0.001012229],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002525184,0.0005697751,0.9798074,0.0004327192,0.001050925,0.0005438238,0.000002171847,0.0003553929,0.01721258],"genre_scores_gemma":[0.005263864,0.00006182591,0.9923243,0.001338989,0.0003593376,0.00001532455,0.000004402391,0.00003318095,0.000598806],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9695445,"threshold_uncertainty_score":0.999683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0231090996723579,"score_gpt":0.2717997450725347,"score_spread":0.2486906454001768,"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."}}