{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006457499,0.001141965,0.001069776,0.000723818,0.001059344,0.002566835,0.002046996,0.001288651,0.07439265],"category_scores_gemma":[0.004137358,0.0003435529,0.0009060986,0.001657639,0.001304114,0.002776039,0.001556773,0.001706753,0.01744607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001576854,"about_ca_system_score_gemma":0.001408544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001839798,"about_ca_topic_score_gemma":0.002342343,"domain_scores_codex":[0.9987539,0.0002590486,0.0001457108,0.000360871,0.0003552562,0.0001251848],"domain_scores_gemma":[0.9977406,0.0009777638,0.0001680287,0.0003952269,0.0005470737,0.0001712533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000455891,0.0001189771,0.0008778247,0.001406993,0.00008215218,0.0007953495,0.0004473756,0.01841632,0.006084641,0.7153862,0.06320783,0.1927205],"study_design_scores_gemma":[0.0001088873,0.0001185474,0.0003043391,0.0004548397,0.000134148,0.0005959288,0.0001375936,0.05117908,0.003286057,0.4004272,0.5431896,0.00006378528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0199093,0.008909275,0.5164936,0.003723673,0.00608956,0.0007789753,0.004619711,0.007293832,0.4321822],"genre_scores_gemma":[0.4745777,0.00997051,0.2322429,0.001752677,0.001592616,0.001352069,0.010362,0.001424551,0.266725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07439265,"threshold_uncertainty_score":0.2488682,"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."}}