{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002093862,0.001002226,0.0008630719,0.002341527,0.001085091,0.001903325,0.002242192,0.001103553,0.00435974],"category_scores_gemma":[0.004652742,0.0007345137,0.002400512,0.001049249,0.002429314,0.003801748,0.00297319,0.00340461,0.001422847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365632,"about_ca_system_score_gemma":0.002406731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002615302,"about_ca_topic_score_gemma":0.002522107,"domain_scores_codex":[0.997888,0.0003061512,0.0001440491,0.0005236815,0.001010466,0.0001276221],"domain_scores_gemma":[0.9983152,0.0006504948,0.0001279993,0.0005121617,0.0003294218,0.00006472383],"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.00009951485,0.0001777419,0.001033236,0.0003714287,0.0001734023,0.0002742429,0.000535625,0.06252253,0.03186741,0.7098198,0.002923811,0.1902012],"study_design_scores_gemma":[0.00006051179,0.0001201384,0.0003141322,0.0001266067,0.0001416827,0.0005175762,0.00008605267,0.4670089,0.02355648,0.4514062,0.05658663,0.00007512014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007034687,0.00004993264,0.9980651,0.00004125838,0.00002317857,0.00003249139,0.00002501328,0.0003374182,0.0007223035],"genre_scores_gemma":[0.04569624,0.0001945084,0.9511322,0.0001189954,0.00004754397,0.0001818616,0.0002035638,0.0001806626,0.002244592],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00435974,"threshold_uncertainty_score":0.01458484,"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."}}