{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005278794,0.000121024,0.0001179464,0.0000670118,0.00019382,0.0001775572,0.0004202499,0.0000292812,0.000004845827],"category_scores_gemma":[0.0005541308,0.00009719732,0.00004595612,0.0001401537,0.00002445861,0.0004145834,0.0001301501,0.0000587641,0.000009550978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000171194,"about_ca_system_score_gemma":0.00003163507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000505121,"about_ca_topic_score_gemma":0.000003197402,"domain_scores_codex":[0.9990934,0.00002804618,0.0001859608,0.0002072653,0.0001228233,0.000362558],"domain_scores_gemma":[0.9987475,0.0007415927,0.00008001033,0.0002924565,0.0000576162,0.00008086253],"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.000007501859,0.0001399994,0.05633543,0.0001660953,0.00003704404,0.00002185699,0.004596774,0.001121334,0.003125919,0.01832991,0.01370092,0.9024172],"study_design_scores_gemma":[0.0001060612,0.00008255911,0.0004615021,0.00003873491,0.000005124199,0.00004948305,0.000003105563,0.9618844,0.003565463,0.03256014,0.0009570559,0.0002863641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01309715,0.0001015198,0.9798983,0.000114801,0.0003208205,0.0001219435,0.000002310838,0.00573678,0.0006063273],"genre_scores_gemma":[0.4713342,0.000001136029,0.5279617,0.0003598322,0.0001019885,0.00003132124,0.000001236818,0.000006345215,0.0002022343],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9607631,"threshold_uncertainty_score":0.3963592,"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."}}