{"id":"W2883844381","doi":"10.1007/978-3-319-96145-3_39","title":"Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"York University","funders":"","keywords":"Markov chain; Probabilistic logic; Generalization; Equivalence relation; Equivalence (formal languages); Algorithm; Markov process; Mathematics; Discrete mathematics; Total variation; Combinatorics; Computer science; Statistics","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.003042029,0.0005889693,0.0006701399,0.0006245223,0.0005262315,0.00058595,0.004527322,0.0004183635,0.0000250782],"category_scores_gemma":[0.001139286,0.0005782049,0.0001650194,0.0008114834,0.00115999,0.0007526061,0.001260892,0.0006445856,0.00002625042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006440359,"about_ca_system_score_gemma":0.0006182771,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006007056,"about_ca_topic_score_gemma":0.00007825182,"domain_scores_codex":[0.995177,0.00007668052,0.0007522006,0.002073186,0.001031555,0.0008893659],"domain_scores_gemma":[0.9954052,0.001012503,0.0005135185,0.00221415,0.0006514321,0.0002032019],"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.00004659158,0.00009883317,0.0000327272,0.0003010784,0.00002491288,0.00001284354,0.001295358,0.003443873,0.0003709381,0.3700059,0.00008118217,0.6242858],"study_design_scores_gemma":[0.0002873068,0.0002430271,0.00007116946,0.000432209,0.00001191359,0.00001511045,1.083339e-7,0.6711545,0.001988942,0.3228113,0.002356708,0.0006276786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007104479,0.0002267855,0.9934193,0.0005372215,0.002583005,0.001333212,0.0000207432,0.0002447113,0.001563963],"genre_scores_gemma":[0.01232175,0.00002831475,0.9856976,0.0006926326,0.0006464975,0.00006673867,0.000008337794,0.00004582712,0.0004922902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6677107,"threshold_uncertainty_score":0.9996669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04381443064443207,"score_gpt":0.2925889104563065,"score_spread":0.2487744798118744,"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."}}