{"id":"W2595598880","doi":"10.1145/3087801.3087816","title":"Towards Efficient Verification of Population Protocols","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Deutsche Forschungsgemeinschaft","keywords":"Decidability; Computer science; Reachability; Reachability problem; Petri net; Protocol (science); Theoretical computer science; Population; Formal verification; Model checking; Automaton; Computational complexity theory; Communications protocol; Theory of computation; Distributed computing; Algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009125733,0.001017532,0.001625514,0.001387812,0.00156651,0.004728925,0.003703535,0.002737776,0.005275415],"category_scores_gemma":[0.04833832,0.001312702,0.002570901,0.001383959,0.00468735,0.01046672,0.009301669,0.006713186,0.001763516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002640396,"about_ca_system_score_gemma":0.003674626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001892712,"about_ca_topic_score_gemma":0.00160283,"domain_scores_codex":[0.9830715,0.007067352,0.001084337,0.002315576,0.005031386,0.001429882],"domain_scores_gemma":[0.9613452,0.0243631,0.001581494,0.008566933,0.003552983,0.000590295],"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.0003513916,0.0001791935,0.001715276,0.0005801053,0.0001726353,0.0005040272,0.000997475,0.1756431,0.01601546,0.7301534,0.006720908,0.06696702],"study_design_scores_gemma":[0.00008120227,0.00003411349,0.0001088952,0.00005861909,0.00002789343,0.00007568314,0.00009860734,0.3265427,0.006420365,0.6605062,0.006020582,0.00002514181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0150722,0.0002898185,0.9785038,0.001166903,0.00008159299,0.0001500828,0.0002200583,0.001788848,0.002726629],"genre_scores_gemma":[0.4413935,0.0007567921,0.5501039,0.0009075151,0.0001967728,0.0007564613,0.001290412,0.0007178392,0.00387667],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009125733,"threshold_uncertainty_score":0.04826212,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04526719905041192,"score_gpt":0.3373173337839044,"score_spread":0.2920501347334925,"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."}}