{"id":"W2113093180","doi":"10.1109/tac.2005.858658","title":"Efficient implementation of fairness in discrete-event systems using queues","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; Concordia University","funders":"","keywords":"FIFO (computing and electronics); Queue; Supervisor; Computer science; Modular design; Bounded function; Event (particle physics); Supervisory control; Queueing theory; Discrete event simulation; Distributed computing; Control (management); Computer network; Mathematics; Simulation","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.0006449851,0.0001716918,0.0003606521,0.0004102653,0.00008693956,0.00007574358,0.0003864598,0.00005805033,0.00001724499],"category_scores_gemma":[0.000003991009,0.000162428,0.000108151,0.0004869484,0.00002407431,0.0001968299,0.000002455309,0.00009205351,0.0000123478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003647615,"about_ca_system_score_gemma":0.0001187477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004889472,"about_ca_topic_score_gemma":0.0001757262,"domain_scores_codex":[0.9978761,0.000216503,0.0008420008,0.0003024537,0.0004758607,0.0002870916],"domain_scores_gemma":[0.9989567,0.0001866189,0.000254462,0.0004649251,0.00007523461,0.00006199523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004385783,0.0001036093,0.00002013347,0.00005886634,0.00002678101,0.000001920699,0.0009148537,0.9613889,0.002109427,0.0004045184,0.000001510804,0.03496503],"study_design_scores_gemma":[0.001499227,0.00004994693,0.0001568839,0.0002197076,0.00002422044,0.00001521701,0.0003760866,0.9944783,0.003010029,0.00001399082,0.000007124288,0.0001493107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.299274,0.0000601331,0.6994813,0.0001135081,0.000435977,0.0005002044,0.00001091858,0.0001073495,0.00001661362],"genre_scores_gemma":[0.993701,0.000001571615,0.006122255,0.0000285737,0.00002574397,0.00009402494,2.796993e-7,0.0000128535,0.00001364411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6944271,"threshold_uncertainty_score":0.6623623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01812983840814124,"score_gpt":0.2987135509164384,"score_spread":0.2805837125082972,"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."}}