{"id":"W2537710561","doi":"10.1109/iecon.2009.5414917","title":"A reachability graph construction technique for supervisor synthesis with parameters","year":2009,"lang":"en","type":"article","venue":"","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Reachability; Parameterized complexity; Computer science; Supervisor; Workflow; Petri net; Theoretical computer science; State space; Construct (python library); Graph; Distributed computing; Supervisory control; Algorithm; Control (management); Programming language; Mathematics; Database; Artificial intelligence","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634817,0.0008906438,0.0004596539,0.0006978757,0.0006058334,0.0005975076,0.0009941676,0.0007533776,0.005789107],"category_scores_gemma":[0.001668333,0.0005386812,0.001035151,0.0004873895,0.0007471574,0.001272642,0.0009035876,0.001677072,0.001982289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004928957,"about_ca_system_score_gemma":0.0009903235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008177933,"about_ca_topic_score_gemma":0.001128003,"domain_scores_codex":[0.999339,0.0001328634,0.00006076217,0.0002113608,0.0002155363,0.00004048135],"domain_scores_gemma":[0.9992833,0.0003762683,0.00005265942,0.000177482,0.0000945634,0.00001576314],"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.00016479,0.0001504393,0.0004330038,0.0009012838,0.0001144511,0.0005055438,0.0005801715,0.124219,0.1667044,0.1570887,0.004358845,0.5447794],"study_design_scores_gemma":[0.0001342311,0.0003735227,0.0004383925,0.0002733616,0.0002206731,0.0009661472,0.0001246486,0.5216213,0.2163977,0.1551996,0.1040792,0.0001711469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007118977,0.00003478406,0.9969067,0.00002093847,0.0000152994,0.00005460524,0.00004348165,0.0009910153,0.001221331],"genre_scores_gemma":[0.06274641,0.0001696597,0.9338831,0.00004431472,0.00001503565,0.0003736043,0.0002712246,0.0005414147,0.001955251],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005789107,"threshold_uncertainty_score":0.01936644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02296598462414716,"score_gpt":0.2391601996559441,"score_spread":0.2161942150317969,"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."}}