{"id":"W1976967219","doi":"10.1016/j.entcs.2005.01.045","title":"A New Approach to Upward-Closed Set Backward Reachability Analysis","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Parameterized complexity; Petri net; Binary decision diagram; Fixed point; Model checking; Intersection (aeronautics); Computer science; Set (abstract data type); Computation; Algorithm; Theoretical computer science; Stochastic Petri net; Class (philosophy); State (computer science); Mathematics; 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.00209715,0.001014892,0.001081465,0.002446681,0.001169164,0.002130199,0.00272814,0.001071418,0.004337408],"category_scores_gemma":[0.004591958,0.0007324775,0.00242947,0.001159542,0.002288144,0.004614725,0.002813706,0.003673878,0.001087484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001378918,"about_ca_system_score_gemma":0.002189292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002636891,"about_ca_topic_score_gemma":0.002240612,"domain_scores_codex":[0.9976293,0.0003325038,0.0001610755,0.0005551178,0.001159521,0.00016249],"domain_scores_gemma":[0.9981636,0.0007407033,0.0001144602,0.0005334633,0.0003843999,0.00006329532],"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.00009395213,0.0001407573,0.0007419268,0.0002552462,0.0001098015,0.0002382203,0.0004728172,0.08085886,0.02963056,0.7415468,0.001622628,0.1442885],"study_design_scores_gemma":[0.00005765779,0.0001232524,0.0002493511,0.0001018349,0.0001137972,0.0003256228,0.00007287815,0.5593809,0.02469718,0.3763772,0.03842494,0.00007543848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008069041,0.00003181044,0.9982161,0.00003397486,0.00001519403,0.00002154228,0.00001778939,0.0002679616,0.0005887051],"genre_scores_gemma":[0.0496505,0.0001923309,0.9475699,0.00009618641,0.00005704468,0.0001573166,0.0001656212,0.0001899928,0.001921094],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004337408,"threshold_uncertainty_score":0.01451004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01737028778483418,"score_gpt":0.3021167304164428,"score_spread":0.2847464426316086,"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."}}