{"id":"W3155827701","doi":"10.1007/s10703-021-00367-3","title":"Towards efficient verification of population protocols","year":2021,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Correctness; Computer science; Decidability; Reachability; Protocol (science); Theoretical computer science; Petri net; Population; Reachability problem; Formal verification; Model checking; Computational complexity theory; Distributed computing; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.003869042,0.0001170338,0.0003314426,0.00009573185,0.00005549472,0.00007210909,0.0004217342,0.00009613262,0.000002520691],"category_scores_gemma":[0.0001600022,0.0001074444,0.00006847297,0.0008102437,0.00001212618,0.0003048249,0.00008582392,0.0000836631,0.000006311785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001408671,"about_ca_system_score_gemma":0.0001076045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005220045,"about_ca_topic_score_gemma":8.95826e-7,"domain_scores_codex":[0.9971805,0.001238995,0.0007129444,0.0003118051,0.0003113599,0.0002443599],"domain_scores_gemma":[0.9987153,0.0001159232,0.0002961318,0.0006164607,0.0002065645,0.00004957796],"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.00007650846,0.0003232152,0.001310974,0.001795425,0.00003176597,0.00004423769,0.002020385,0.06326457,0.03021025,0.5049562,0.00009770655,0.3958687],"study_design_scores_gemma":[0.0006965447,0.0001091539,0.01813541,0.0008568763,0.000005149831,0.00006792344,0.0002477197,0.8888981,0.08916956,0.0004239943,0.001138879,0.0002507037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009854045,0.00008219347,0.9935697,0.00001856673,0.0003527724,0.00349953,0.00000523194,0.00007737333,0.001409261],"genre_scores_gemma":[0.3915856,2.980345e-7,0.6068929,0.000005015437,0.000019448,0.001467719,0.000004296327,0.000004787445,0.00001996715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8256335,"threshold_uncertainty_score":0.4381456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07312539246779999,"score_gpt":0.3896241254999382,"score_spread":0.3164987330321382,"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."}}