{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000705217,0.0009748408,0.0007839765,0.0008218486,0.0003955782,0.0006710878,0.0008330723,0.0004889493,0.002662762],"category_scores_gemma":[0.00279854,0.0006615908,0.001403728,0.000533358,0.001008943,0.0009421813,0.001644278,0.00137992,0.0004516059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001121401,"about_ca_system_score_gemma":0.00170071,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00623592,"about_ca_topic_score_gemma":0.007305876,"domain_scores_codex":[0.9992385,0.0001794976,0.00003970823,0.0001298079,0.0003240021,0.00008852195],"domain_scores_gemma":[0.9989008,0.000597215,0.0001067617,0.0002168056,0.0001345578,0.00004385217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005180484,0.00002055024,0.0003530091,0.00005060633,0.00001879213,0.00006002634,0.00004343906,0.9596896,0.003102679,0.01952605,0.0003518593,0.01673161],"study_design_scores_gemma":[0.000005386091,0.000008616854,0.00003458044,0.000003777512,0.000004118599,0.000007790963,0.000003802977,0.9867942,0.0005760789,0.01232241,0.0002367952,0.000002514885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01248107,0.00004587659,0.9856133,0.0000361673,0.000006902321,0.00002636477,0.00009920917,0.0005996672,0.001091599],"genre_scores_gemma":[0.5892007,0.0001674493,0.4067958,0.00007606744,0.00001507825,0.0002954086,0.0008648901,0.00029465,0.002289889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00623592,"threshold_uncertainty_score":0.01239926,"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."}}