{"id":"W1596735499","doi":"10.1109/icsmc.1999.814201","title":"Petri net models of process synchronization mechanisms","year":2003,"lang":"en","type":"article","venue":"","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semaphore; Petri net; Mutual exclusion; Synchronization (alternating current); Rendezvous; Computer science; Distributed computing; Process (computing); Net (polyhedron); Simple (philosophy); Stochastic Petri net; Deadlock; Concurrency; Programming language; Computer network; Engineering; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001097216,0.001361013,0.0006538258,0.0008708336,0.0008367972,0.002373682,0.002558232,0.001468564,0.005676043],"category_scores_gemma":[0.002328916,0.000626133,0.0008972594,0.001115533,0.001393957,0.002878408,0.0008068748,0.00151491,0.001239064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001923279,"about_ca_system_score_gemma":0.002223711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005267934,"about_ca_topic_score_gemma":0.004128877,"domain_scores_codex":[0.9991077,0.0002121781,0.00008073307,0.000156391,0.000325076,0.0001179772],"domain_scores_gemma":[0.998961,0.0004605334,0.0001671627,0.0001196765,0.0002139614,0.0000775643],"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.00007182677,0.00003919615,0.0001752052,0.0001276633,0.00002397705,0.0002999631,0.000220403,0.204084,0.003175242,0.7835365,0.001275294,0.006970745],"study_design_scores_gemma":[0.0001007551,0.00005766981,0.0001276761,0.00006718151,0.00007252535,0.0001288113,0.00005659954,0.6315804,0.003411009,0.3219226,0.04243868,0.00003602887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0118086,0.00114399,0.9514852,0.0004257961,0.0002007957,0.0002187561,0.0004183968,0.001059769,0.03323864],"genre_scores_gemma":[0.518648,0.004494867,0.4017169,0.000362614,0.0003242783,0.001746554,0.001445631,0.0003401691,0.07092091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005676043,"threshold_uncertainty_score":0.01898819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02342562797972384,"score_gpt":0.2482125484167367,"score_spread":0.2247869204370129,"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."}}