{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333171,0.00007150357,0.00009476113,0.00002499747,0.00008385442,0.00002728252,0.0007984035,0.00003123242,0.000008679097],"category_scores_gemma":[0.0002100805,0.00003731658,0.0000481545,0.0004294077,0.0001849141,0.0001837691,0.00009957189,0.0001736685,0.000004351031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005960475,"about_ca_system_score_gemma":0.00003992017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009063944,"about_ca_topic_score_gemma":0.00003327438,"domain_scores_codex":[0.9987564,0.0004529041,0.0001819364,0.0001955935,0.0002945035,0.0001186652],"domain_scores_gemma":[0.9989254,0.000269495,0.0001106443,0.0006206086,0.00005568896,0.00001810987],"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.000006478924,0.0001692802,0.0008376187,0.0000029762,0.000001113962,4.575046e-8,0.0002384426,0.001481422,0.000171456,0.9151369,0.00004616579,0.08190814],"study_design_scores_gemma":[0.00005404042,0.00004191366,0.4043299,0.000005824196,3.598784e-7,5.865236e-7,0.000002714652,0.2521513,0.002004534,0.341369,0.000008503152,0.00003133826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2991515,0.000001482306,0.6857758,0.006930485,0.00006449874,0.0003479997,0.000001144202,0.00003590108,0.007691294],"genre_scores_gemma":[0.7842492,1.973039e-7,0.2153894,0.000330806,0.000004676215,0.000006598651,2.609208e-7,0.000001057559,0.00001779088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5737678,"threshold_uncertainty_score":0.1521726,"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."}}