{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000577504,0.0001795931,0.0002554457,0.0002017448,0.0001525053,0.0001837963,0.0006335445,0.0001161724,0.00005914936],"category_scores_gemma":[0.000244341,0.0001633792,0.0000917053,0.001302085,0.0000454021,0.0006306085,0.0002077412,0.0001519729,0.0001030312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009842763,"about_ca_system_score_gemma":0.000005039012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005913654,"about_ca_topic_score_gemma":0.000298078,"domain_scores_codex":[0.9980104,0.0002715946,0.0003967335,0.0007565091,0.0002911261,0.0002736516],"domain_scores_gemma":[0.998402,0.0001068305,0.000119798,0.001104261,0.00007440018,0.0001927079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002511491,0.000561139,0.008531273,0.00002331751,0.0001976689,0.000001833734,0.002635528,0.0001965279,0.07735406,0.001527152,0.0005745812,0.9083718],"study_design_scores_gemma":[0.0005581866,0.0002396195,0.05259695,0.000008240201,0.0000674473,0.000003713946,0.0001015413,0.8233265,0.1164037,0.001108492,0.005128691,0.0004569661],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0756337,0.00002386367,0.9184514,0.0002639112,0.00006503635,0.00452088,0.000006157208,0.0003095864,0.0007254837],"genre_scores_gemma":[0.4157417,0.00000183531,0.5803221,0.0002719779,0.0000208808,0.00335427,0.000002481522,0.000007085395,0.0002776833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9079148,"threshold_uncertainty_score":0.666241,"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."}}