{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001609665,0.001236035,0.0009122294,0.002435007,0.0006721353,0.001458592,0.001504449,0.0008615156,0.006448872],"category_scores_gemma":[0.003215926,0.000800635,0.003101429,0.001444811,0.0009140374,0.002742312,0.002441369,0.003152993,0.003068578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009557547,"about_ca_system_score_gemma":0.001729153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002847668,"about_ca_topic_score_gemma":0.003658058,"domain_scores_codex":[0.9976391,0.0006546314,0.0002065971,0.000458783,0.0008391381,0.0002018048],"domain_scores_gemma":[0.9986407,0.0004010437,0.00007282753,0.0004011409,0.0004254254,0.00005875118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001778298,0.0002155018,0.0007030123,0.0005739284,0.0001542361,0.0003993553,0.0004242158,0.1233336,0.04108328,0.4305931,0.01035098,0.391991],"study_design_scores_gemma":[0.00005974788,0.00006081252,0.0003070539,0.000109243,0.0001006359,0.0003234681,0.00004553909,0.7435617,0.01050893,0.1940298,0.05084122,0.00005171626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006584962,0.0001111961,0.9968866,0.00004784664,0.00003416212,0.0000391422,0.00005739325,0.0003411434,0.001824038],"genre_scores_gemma":[0.01931985,0.0002947255,0.9765277,0.00008267914,0.00004393385,0.0001792091,0.0003422691,0.0002524438,0.002957202],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006448872,"threshold_uncertainty_score":0.0215736,"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."}}