{"id":"W4412514770","doi":"10.1007/978-3-031-98679-6_12","title":"Robust Probabilistic Bisimilarity for Labelled Markov Chains","year":2025,"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":true,"ca_institutions":"York University","funders":"Clarendon Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Probabilistic logic; Theoretical computer science; Markov process; Examples of Markov chains; Algorithm; Artificial intelligence; Markov model; Markov property; Machine learning; Mathematics; Statistics","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.002525377,0.0005831763,0.0006503795,0.0009409896,0.0004168575,0.0005175509,0.00467432,0.0004811256,0.00001182253],"category_scores_gemma":[0.001052198,0.0005547226,0.0001905762,0.0009513276,0.0006971711,0.0005557986,0.001501297,0.0007897332,0.00001055043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005483571,"about_ca_system_score_gemma":0.001026969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001092558,"about_ca_topic_score_gemma":0.00005113327,"domain_scores_codex":[0.9956689,0.00007602631,0.0007043922,0.001968729,0.0008064103,0.000775544],"domain_scores_gemma":[0.9956596,0.001092104,0.0003665816,0.002170348,0.0005558317,0.0001555734],"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.0000162231,0.0000463195,0.00001202867,0.0002429106,0.00001404421,0.000009685973,0.0002786398,0.02562362,0.00004523481,0.3517269,0.0001355832,0.6218488],"study_design_scores_gemma":[0.0002825737,0.0001434596,0.00004321185,0.0003269592,0.00001266241,0.00001266086,6.270896e-8,0.8142834,0.0005635666,0.1809783,0.002835113,0.0005180695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000007753314,0.0002332468,0.9887806,0.001029208,0.003184072,0.001497461,0.00002243877,0.0002581171,0.004987132],"genre_scores_gemma":[0.001387849,0.00002879105,0.9951196,0.001243379,0.0002996404,0.00007859623,0.0000106473,0.0000277078,0.001803753],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7886598,"threshold_uncertainty_score":0.9996904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0426541683168992,"score_gpt":0.2839261103288533,"score_spread":0.2412719420119541,"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."}}