{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001450048,0.0001525955,0.0002670421,0.0001376519,0.0001853598,0.0002124955,0.002295737,0.00004839211,0.00004291692],"category_scores_gemma":[0.0001028878,0.0001139123,0.0000797722,0.0007583039,0.00234657,0.0006885618,0.0004016522,0.0001424152,0.0001532825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004351282,"about_ca_system_score_gemma":0.0001379631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000465627,"about_ca_topic_score_gemma":5.068918e-7,"domain_scores_codex":[0.9978486,0.0001140479,0.0003576468,0.0005232695,0.0006521412,0.0005042842],"domain_scores_gemma":[0.9984121,0.000239973,0.0001293866,0.000749629,0.0002429897,0.000225957],"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.000003041871,0.00006083284,0.0001229441,0.000007782466,0.000003974781,0.000003300391,0.0002437129,0.00004060007,0.000384564,0.8978686,0.00002380384,0.1012369],"study_design_scores_gemma":[0.0008839909,0.0005077275,0.0006788714,0.0000121576,0.00001137222,0.0000948192,0.000007097098,0.6953058,0.008269853,0.2913625,0.002524616,0.0003412704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002540346,0.0001077948,0.9884301,0.001020368,0.0006996762,0.0001823362,4.475831e-7,0.0001537453,0.006865136],"genre_scores_gemma":[0.9691616,0.000002427045,0.03024632,0.0003639101,0.0002037901,0.000005630084,1.647556e-7,0.000004528463,0.00001157713],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9666213,"threshold_uncertainty_score":0.8646035,"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."}}