{"id":"W2096009274","doi":"10.1109/aiccsa.2003.1227511","title":"Timed alternating finite automata","year":2004,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Computation; Automaton; Finite-state machine; ω-automaton; Asynchronous communication; Timed automaton; Deterministic automaton; Quantum finite automata; Set (abstract data type); Deterministic finite automaton; Theoretical computer science; Automata theory; Nondeterministic finite automaton; Algorithm; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065,0.00005181758,0.0000486768,0.00004523971,0.00005334973,0.00008046751,0.0006533513,0.00002206257,0.00001692611],"category_scores_gemma":[0.0001382884,0.0000457217,0.00001931223,0.0001924076,0.00001400888,0.0004973413,0.0001445899,0.00005410384,0.0003727229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003465591,"about_ca_system_score_gemma":0.00002734413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003014022,"about_ca_topic_score_gemma":0.000001121512,"domain_scores_codex":[0.9994067,0.00002309749,0.0001215462,0.0001651663,0.0001527732,0.0001307283],"domain_scores_gemma":[0.9994106,0.00003696448,0.00004433929,0.0004433764,0.0000269477,0.00003778595],"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":[7.105891e-7,0.00002543933,0.00005080572,0.000004117143,0.000003531706,0.000004068206,0.0002927456,0.003590559,0.001137949,0.9048392,0.00006264204,0.08998825],"study_design_scores_gemma":[0.0004162274,0.00005224328,0.002636732,0.00001574033,0.000001335267,0.00001721945,0.000007470003,0.9001458,0.06187741,0.03249158,0.002173945,0.0001643329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00568766,0.000006119502,0.9614165,0.0004299826,0.0002667564,0.00005102733,1.851895e-7,0.000415004,0.03172677],"genre_scores_gemma":[0.1893406,0.000001652798,0.8100571,0.0002874367,0.00002552341,0.000004489231,4.544037e-7,0.000002898151,0.000279844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8965552,"threshold_uncertainty_score":0.4790723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02640514648007177,"score_gpt":0.2935545732813409,"score_spread":0.2671494268012691,"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."}}