{"id":"W3006339109","doi":"","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis.","year":2004,"lang":"en","type":"article","venue":"Infinity Journal","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Intersection (aeronautics); Model checking; Fixed point; Set (abstract data type); Computation; Class (philosophy); Computer science; Theoretical computer science; Convergence (economics); Algorithm; Mathematics; State (computer science); Programming language","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.003009776,0.0001736317,0.0003214054,0.0004237639,0.0002411115,0.0003952277,0.001479991,0.0001041769,0.0000484073],"category_scores_gemma":[0.0006615734,0.0001578698,0.0002629613,0.002064738,0.00003945299,0.0007776289,0.0002275841,0.0005746518,0.0002120015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002961625,"about_ca_system_score_gemma":0.0004359755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001849383,"about_ca_topic_score_gemma":0.00001296949,"domain_scores_codex":[0.9977605,0.0003339311,0.0005335034,0.0004042906,0.0005904025,0.0003773231],"domain_scores_gemma":[0.9979431,0.00006847049,0.0002342283,0.001002934,0.0002075034,0.0005437448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0002161884,0.001100748,0.012652,0.00006454796,0.001311323,0.00005649871,0.02790313,0.1830676,0.001570731,0.3882286,0.008702312,0.3751263],"study_design_scores_gemma":[0.005832961,0.001170407,0.471309,0.000108816,0.000776239,0.001969556,0.0006557076,0.07392488,0.009743286,0.3285741,0.1032551,0.002679958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02688641,0.00001618481,0.9576966,0.001056936,0.0003494055,0.0001472884,0.00000278791,0.0001014632,0.01374293],"genre_scores_gemma":[0.1089855,0.000005117488,0.8902122,0.000464688,0.0001763017,0.0000042886,0.000002171201,0.000006942251,0.0001427632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.458657,"threshold_uncertainty_score":0.6437742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0704019921991426,"score_gpt":0.3305189717620785,"score_spread":0.2601169795629359,"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."}}