{"id":"W2164973259","doi":"10.1109/icdcs.1996.508011","title":"Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?)","year":2002,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reachability; Correctness; Computer science; Decidability; Protocol (science); State (computer science); Deadlock; Topology (electrical circuits); Set (abstract data type); Component (thermodynamics); Theoretical computer science; Distributed computing; Algorithm; Mathematics; Combinatorics; 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.005848821,0.0007205774,0.000695706,0.001234308,0.001614103,0.002410751,0.001920153,0.001404139,0.001855097],"category_scores_gemma":[0.01693252,0.0005646686,0.001681329,0.0009587813,0.006756039,0.007750336,0.003979744,0.002622893,0.0003013466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001793825,"about_ca_system_score_gemma":0.002842629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004309932,"about_ca_topic_score_gemma":0.00275144,"domain_scores_codex":[0.9970263,0.001003393,0.0001852133,0.000570989,0.0008674825,0.0003466108],"domain_scores_gemma":[0.9876897,0.007648759,0.0007745994,0.002856706,0.0008396578,0.0001905503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001201625,0.00008890065,0.001558499,0.0001912604,0.00007626888,0.0004340478,0.000991854,0.1237375,0.006636028,0.773241,0.001554266,0.09137028],"study_design_scores_gemma":[0.00001717826,0.00003346437,0.0001287964,0.00004911594,0.00004286612,0.00009864988,0.00009265097,0.335278,0.007408627,0.6530772,0.003741326,0.00003213581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01259008,0.0001529711,0.9845899,0.0003956612,0.00004289319,0.00007826839,0.0000291378,0.0002941164,0.001826994],"genre_scores_gemma":[0.5870832,0.0004876058,0.4089682,0.0004947819,0.000118271,0.0003430327,0.00009906937,0.0001296918,0.002276072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005848821,"threshold_uncertainty_score":0.03093189,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04027782726795532,"score_gpt":0.3097080401084212,"score_spread":0.2694302128404659,"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."}}