{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008388572,0.001117776,0.001476543,0.001461603,0.0008574193,0.004355718,0.002238516,0.001964476,0.006577515],"category_scores_gemma":[0.03181913,0.0008944555,0.002148398,0.001229317,0.00307185,0.01066122,0.005005871,0.005808587,0.001069826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002786863,"about_ca_system_score_gemma":0.001477462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00257653,"about_ca_topic_score_gemma":0.002201135,"domain_scores_codex":[0.9931767,0.002090394,0.0004181363,0.001232393,0.002577636,0.0005047594],"domain_scores_gemma":[0.9807997,0.01171597,0.001568519,0.00420064,0.001163066,0.0005521008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002463969,0.00004628808,0.0006565256,0.0001598707,0.00005537634,0.0001028877,0.0006314043,0.07059638,0.004240515,0.8982076,0.0006469681,0.02440982],"study_design_scores_gemma":[0.00004424997,0.00007284735,0.0001962997,0.00006764937,0.00004715622,0.00009669131,0.0001223765,0.4519808,0.003201889,0.5375645,0.00657184,0.00003356954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02868985,0.0006547693,0.9644228,0.0006637349,0.0001216663,0.00005126779,0.00009054521,0.0004277835,0.004877594],"genre_scores_gemma":[0.4641859,0.0008925634,0.5251107,0.0004356998,0.0002654084,0.0001745143,0.0003193123,0.0005660137,0.008049793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008388572,"threshold_uncertainty_score":0.04436356,"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."}}