{"id":"W2164968206","doi":"10.1109/icst.2012.111","title":"Generating Checking Sequences for Nondeterministic Finite State Machines","year":2012,"lang":"en","type":"article","venue":"","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Nondeterministic algorithm; Finite-state machine; Computer science; Sequence (biology); Model checking; Deterministic finite automaton; Theoretical computer science; Generalization; State (computer science); Automaton; Class (philosophy); Algorithm; Fault coverage; Programming language; Mathematics; Artificial intelligence","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.003157708,0.001031506,0.0006022126,0.00144346,0.0007347808,0.0008671238,0.001389882,0.0009230258,0.002428148],"category_scores_gemma":[0.01988613,0.0007600344,0.001246111,0.000689468,0.001456354,0.001923635,0.001266229,0.001142669,0.0007520474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007382139,"about_ca_system_score_gemma":0.001972352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008313717,"about_ca_topic_score_gemma":0.001187865,"domain_scores_codex":[0.9958922,0.001359884,0.0004714602,0.0008165375,0.001181395,0.0002786216],"domain_scores_gemma":[0.9729283,0.01923773,0.001652859,0.003710738,0.002151435,0.0003188691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001185063,0.0005347666,0.01228376,0.001242553,0.0001635752,0.00168592,0.001899561,0.2739937,0.08521384,0.2288093,0.004505045,0.3884829],"study_design_scores_gemma":[0.0001479451,0.0003713214,0.0009501772,0.0001848706,0.00009852283,0.0004972169,0.0001127536,0.6307001,0.1632492,0.1940129,0.009587604,0.00008740516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04878637,0.00005543914,0.9461452,0.00009688012,0.00003903541,0.0002347617,0.0002518543,0.003154441,0.001235989],"genre_scores_gemma":[0.3072466,0.00009530558,0.6883019,0.0001074448,0.00003367663,0.000594659,0.001386621,0.0006532462,0.001580599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003157708,"threshold_uncertainty_score":0.01669973,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04860255123879444,"score_gpt":0.3108628382386156,"score_spread":0.2622602869998212,"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."}}