{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004095985,0.0001507659,0.000300645,0.00006199912,0.0000792472,0.0002666226,0.001543376,0.0001824703,0.000006496979],"category_scores_gemma":[0.00005115279,0.0001301761,0.0001060455,0.00006193198,0.00002320167,0.0001013467,0.0006090389,0.0001535424,0.00001523345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005808919,"about_ca_system_score_gemma":0.000115755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007059355,"about_ca_topic_score_gemma":0.000006074069,"domain_scores_codex":[0.9985443,0.00004589421,0.0004261706,0.0004588217,0.0003869823,0.0001378606],"domain_scores_gemma":[0.9970985,0.000007819151,0.0006817936,0.001936639,0.0002285485,0.00004672221],"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.00002953267,0.0006396536,0.00288162,0.002220404,0.0000871105,0.000007132894,0.001031582,0.05183293,0.001017491,0.6027551,0.003629675,0.3338677],"study_design_scores_gemma":[0.0004965843,0.00006883246,0.155249,0.001213135,0.00001050355,0.000004060988,0.000008888851,0.8186771,0.0034505,0.00772233,0.01252351,0.0005755557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005145224,0.00003345226,0.9703906,0.0002839549,0.0006768945,0.009883149,0.00004252088,0.0001470202,0.01339725],"genre_scores_gemma":[0.9806745,0.000001381726,0.0154003,0.000009564946,0.00006316098,0.003497923,0.00007129648,0.00000628052,0.0002756069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9755293,"threshold_uncertainty_score":0.5308428,"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."}}