{"id":"W2133285313","doi":"10.1109/ssst.1994.287794","title":"An improved decomposition approach for reachability analysis","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Reachability; Computer science; Deadlock; Set (abstract data type); Model checking; Decomposition; State space; State (computer science); Protocol (science); Theoretical computer science; Space (punctuation); Formal verification; Algorithm; Distributed computing; Programming language; Mathematics; Operating system","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001065915,0.00007819504,0.0001415225,0.000124192,0.0000977937,0.0001131037,0.0005976513,0.00005233995,0.00003136876],"category_scores_gemma":[0.00005493136,0.00006719993,0.0001222628,0.0006706271,0.00002266787,0.0007097837,0.00003422819,0.00004566714,0.000005412875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004214402,"about_ca_system_score_gemma":0.00000366904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002523465,"about_ca_topic_score_gemma":0.000002948218,"domain_scores_codex":[0.998929,0.0001456573,0.0002382656,0.0004167947,0.000117893,0.0001523913],"domain_scores_gemma":[0.9986597,0.00004908129,0.00008308623,0.001037291,0.0001040431,0.00006683468],"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.0000269621,0.001507335,0.00282888,0.00005204103,0.0002593052,1.921337e-7,0.001616853,0.003978778,0.02951548,0.315306,0.0003972632,0.6445109],"study_design_scores_gemma":[0.00009496904,0.0001014905,0.00378059,1.75168e-7,0.00003087486,8.330319e-7,0.0000122785,0.9903643,0.004423666,0.000980407,0.0001199759,0.00009048345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00578873,0.000006550777,0.9889471,0.00007890186,0.00005229126,0.0002686044,0.000002040396,0.0001730607,0.00468275],"genre_scores_gemma":[0.3624869,5.003929e-7,0.6372771,0.00006386652,0.00001702239,0.00004857989,0.00001133942,0.000002283562,0.00009241353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9863855,"threshold_uncertainty_score":0.2740334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04401070915585536,"score_gpt":0.3325961774216556,"score_spread":0.2885854682658003,"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."}}