{"id":"W1981776739","doi":"10.1016/j.tcs.2005.10.032","title":"Syntactic control of concurrency","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Finitary; Concurrency; Decidability; Undecidable problem; Observational equivalence; Game semantics; Computer science; Equivalence (formal languages); Recursion (computer science); Mathematics; Semaphore; Programming language; Discrete mathematics; Semantics (computer science); Operational semantics; Theoretical computer science; Denotational semantics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004455859,0.0006614405,0.001050796,0.001830224,0.003804237,0.009466351,0.00237132,0.00181672,0.00910835],"category_scores_gemma":[0.01471724,0.001143926,0.00151747,0.001755076,0.009333021,0.01743931,0.005490847,0.005742093,0.001350682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002771222,"about_ca_system_score_gemma":0.002348855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002025847,"about_ca_topic_score_gemma":0.002029625,"domain_scores_codex":[0.9947802,0.001864525,0.0003467963,0.0008566405,0.001537722,0.0006142146],"domain_scores_gemma":[0.987542,0.006408294,0.0006936661,0.003420494,0.001533377,0.0004022342],"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.00001615373,0.000009334978,0.0001144385,0.00001460444,0.00000366365,0.00001856491,0.0002247682,0.0002867201,0.0003134801,0.9956353,0.0006509592,0.002711998],"study_design_scores_gemma":[0.00001329217,0.000005761204,0.00007121893,0.00001505981,0.00001592647,0.00003926726,0.00005923862,0.003394734,0.001033177,0.9900944,0.005246472,0.00001149403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08702204,0.002417978,0.7342356,0.009323453,0.001074407,0.00008470266,0.0004963793,0.00299216,0.1623533],"genre_scores_gemma":[0.9296958,0.0008349581,0.05161281,0.0008292643,0.000802473,0.0001253136,0.0003196385,0.0009066444,0.01487311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009466351,"threshold_uncertainty_score":0.03047043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01166792273123923,"score_gpt":0.2516900121329037,"score_spread":0.2400220894016645,"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."}}