{"id":"W1949868634","doi":"10.1109/lics.2003.1210074","title":"Labeled Markov processes: stronger and faster approximations","year":2003,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Measure (data warehouse); Markov chain; Markov process; Computer science; Quotient; Simple (philosophy); State (computer science); Temporal logic; Model checking; Theoretical computer science; Algorithm; Point (geometry); Applied mathematics; Mathematics; Discrete mathematics; Pure mathematics; Data mining; Machine learning","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":[],"consensus_categories":[],"category_scores_codex":[0.0005149356,0.0002084612,0.0002033289,0.0001171275,0.00008146961,0.0004014564,0.0007644481,0.0001917935,0.00004385697],"category_scores_gemma":[0.0001990545,0.0001848526,0.00003027565,0.0002479707,0.00005412018,0.0004534274,0.0008275044,0.000326166,0.00002745282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004047225,"about_ca_system_score_gemma":0.0001942325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006171926,"about_ca_topic_score_gemma":0.000003607342,"domain_scores_codex":[0.9985304,0.0001365526,0.0002907951,0.0005946922,0.0002332833,0.0002142481],"domain_scores_gemma":[0.9985703,0.00005819017,0.0001710591,0.0009127511,0.00021158,0.0000761294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001330779,0.0003758017,0.00108878,0.003687277,0.0001684224,0.000004880018,0.004416225,0.0003512594,0.0004616537,0.8332121,0.005101343,0.151119],"study_design_scores_gemma":[0.001802012,0.0002622255,0.008740402,0.0007163131,0.0001585235,0.0001301442,0.0005375559,0.7614971,0.01588931,0.1730787,0.03323533,0.003952296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002920079,0.0001834115,0.9657888,0.0003040765,0.0004111827,0.0004809396,0.000004777616,0.0001973421,0.02970936],"genre_scores_gemma":[0.009413054,0.00004841223,0.9875066,0.0001980236,0.00003070156,0.000171206,0.000009293941,0.0000125743,0.002610083],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7611459,"threshold_uncertainty_score":0.7538072,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03214452298220764,"score_gpt":0.2890622018226806,"score_spread":0.256917678840473,"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."}}