{"id":"W2972042414","doi":"10.46298/lmcs-17(3:3)2021","title":"The Complexity of Reachability in Affine Vector Addition Systems with States","year":2021,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Undecidable problem; Reachability; Decidability; Parameterized complexity; Affine transformation; Reachability problem; Computational complexity theory","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.001890515,0.0008169202,0.0008273492,0.0009426739,0.001133133,0.004109215,0.001499965,0.001243704,0.004762327],"category_scores_gemma":[0.01133568,0.0006391552,0.002338241,0.001006897,0.002779754,0.007053599,0.002596863,0.003053396,0.0002643177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00327454,"about_ca_system_score_gemma":0.00231902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005341442,"about_ca_topic_score_gemma":0.004782613,"domain_scores_codex":[0.9970409,0.0006878046,0.000252004,0.0008268498,0.0006511829,0.0005411792],"domain_scores_gemma":[0.9821298,0.01522638,0.001082802,0.0008131466,0.000425581,0.0003223585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007794223,0.0002600507,0.004774522,0.0007130546,0.000171712,0.0005374868,0.001011962,0.5730455,0.01326766,0.3686392,0.002057484,0.03474196],"study_design_scores_gemma":[0.00007960775,0.00007777611,0.001031175,0.00004143994,0.00008027553,0.000148549,0.0001669894,0.559716,0.006301358,0.4306581,0.001653776,0.00004491109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6003006,0.0007834894,0.377665,0.003601691,0.00006934071,0.0003211558,0.001536411,0.001011871,0.01471059],"genre_scores_gemma":[0.9548159,0.0004497188,0.03955318,0.0002345369,0.00009372556,0.0002078695,0.0009880947,0.000135295,0.00352174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005341442,"threshold_uncertainty_score":0.02375859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1152495549883317,"score_gpt":0.3819331628623088,"score_spread":0.2666836078739772,"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."}}