{"id":"W1987382208","doi":"10.1109/icicisys.2009.5358318","title":"On the computational complexity of the reachability problem in UML activity diagrams","year":2009,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Reachability; Reachability problem; Activity diagram; Computer science; Unified Modeling Language; Class diagram; Model checking; Theoretical computer science; Computational complexity theory; Class (philosophy); Programming language; Algorithm; Artificial intelligence","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.004730488,0.0008517615,0.001323726,0.001248532,0.001610334,0.00512824,0.001791927,0.001706249,0.006232364],"category_scores_gemma":[0.04298159,0.0007744948,0.002262505,0.001878358,0.003887103,0.01057382,0.002584313,0.004676342,0.0004915604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004115531,"about_ca_system_score_gemma":0.002627773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006995122,"about_ca_topic_score_gemma":0.006329069,"domain_scores_codex":[0.9945721,0.002231083,0.0002934973,0.0008948638,0.001404912,0.0006035132],"domain_scores_gemma":[0.8771217,0.1175393,0.001678817,0.001889434,0.001269716,0.0005010382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008507824,0.0003222502,0.003445583,0.0008437583,0.0001582814,0.0005122936,0.0009649099,0.5845701,0.004072164,0.3420061,0.005691657,0.05656226],"study_design_scores_gemma":[0.00008582923,0.00004408787,0.0008813661,0.00007699679,0.00006617074,0.0001154475,0.0001507952,0.4979411,0.001762838,0.4972165,0.001622315,0.00003662326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3312549,0.002856821,0.604416,0.01220306,0.0002049583,0.0003564753,0.001578272,0.0007166983,0.04641292],"genre_scores_gemma":[0.87687,0.00267507,0.1120054,0.0006424019,0.0004259125,0.0004099974,0.001650562,0.0002967983,0.005023901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006995122,"threshold_uncertainty_score":0.02986044,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07156622867090677,"score_gpt":0.3106251788583221,"score_spread":0.2390589501874154,"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."}}