{"id":"W4414783286","doi":"10.1145/3769868","title":"The Complexity of Linear Temporal Verification for Continuous Counter Systems","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Linear temporal logic; Temporal logic; Fragment (logic); Constant (computer programming); Computational complexity theory; Time complexity; Hybrid system; Linear logic","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.005613591,0.000961615,0.001532594,0.001084616,0.001491965,0.006104704,0.003518445,0.001923824,0.00603486],"category_scores_gemma":[0.03702197,0.001335711,0.00310863,0.00128322,0.003936178,0.01205832,0.004022098,0.004447206,0.0004643681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005283774,"about_ca_system_score_gemma":0.004219525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007891197,"about_ca_topic_score_gemma":0.007308006,"domain_scores_codex":[0.9912345,0.00275508,0.0005766051,0.001836283,0.002601763,0.0009956366],"domain_scores_gemma":[0.9087682,0.08120141,0.003145705,0.004264005,0.001887386,0.0007333194],"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.001522302,0.0003768366,0.007347587,0.001301135,0.0004012714,0.001248651,0.001448875,0.5371137,0.01281515,0.3689916,0.005140353,0.06229256],"study_design_scores_gemma":[0.0001216807,0.00003837403,0.0004747758,0.00003213678,0.00008473538,0.0001233785,0.0001165162,0.7133926,0.003293395,0.2813004,0.0009822954,0.00003980666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3225713,0.001000095,0.6527632,0.00670668,0.0001097755,0.0003824435,0.001641949,0.002515856,0.0123087],"genre_scores_gemma":[0.8968776,0.0004770845,0.09688113,0.0005438039,0.0001558766,0.0002952742,0.001080543,0.000291882,0.003396871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007891197,"threshold_uncertainty_score":0.03833663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08437898775922498,"score_gpt":0.3436640172484169,"score_spread":0.2592850294891919,"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."}}