{"id":"W3045548741","doi":"10.23919/acc45564.2020.9147572","title":"Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reachability; State space; Computer science; Bounded function; Dependency (UML); Model checking; State (computer science); Graph; Corollary; System dynamics; Mathematical optimization; Control theory (sociology); Topology (electrical circuits); Theoretical computer science; Mathematics; Algorithm; Artificial intelligence; Discrete mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001654838,0.0004628956,0.0005081472,0.000180938,0.0001433507,0.0003441305,0.002551085,0.0003135394,0.00004818334],"category_scores_gemma":[0.0001590316,0.0004548041,0.0002548886,0.0003689219,0.00009966376,0.000403144,0.001615913,0.0009360015,0.0001807259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002677263,"about_ca_system_score_gemma":0.0003400659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002460031,"about_ca_topic_score_gemma":0.00001615881,"domain_scores_codex":[0.9959041,0.0006441157,0.0008343684,0.001493366,0.0006825976,0.0004414821],"domain_scores_gemma":[0.9965957,0.0001394886,0.0004991224,0.002336973,0.0002297007,0.000198993],"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.0005795104,0.001427904,0.001606797,0.00465059,0.0002903182,0.00009565766,0.004105342,0.04156956,0.03215782,0.3006887,0.0009595234,0.6118683],"study_design_scores_gemma":[0.0002173142,0.0000815536,0.000989169,0.00005886782,0.00001427401,0.000006631638,0.00000420208,0.8220872,0.03115412,0.1447093,0.0002277394,0.0004496538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003502731,0.00004162349,0.9868934,0.001288654,0.001180061,0.000993032,0.00003030327,0.001077471,0.004992746],"genre_scores_gemma":[0.1800907,0.000006913871,0.8189029,0.0006672979,0.00005806856,0.0001439489,0.00006458259,0.0000254325,0.00004026119],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7805176,"threshold_uncertainty_score":0.9997904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03830172392467697,"score_gpt":0.3230885096105492,"score_spread":0.2847867856858723,"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."}}