{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841678,0.0001350393,0.000197065,0.0001439804,0.00009863958,0.00009000808,0.0005011894,0.0000734409,0.000002416067],"category_scores_gemma":[0.0001056453,0.0001022388,0.00007605418,0.0004179865,0.00005626057,0.000378787,0.00003058605,0.00006730657,0.000001868589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005497107,"about_ca_system_score_gemma":0.00004566904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003819403,"about_ca_topic_score_gemma":0.000007726987,"domain_scores_codex":[0.9988118,0.00006246631,0.0002352115,0.0004557648,0.0001906978,0.0002440532],"domain_scores_gemma":[0.9987929,0.0002704748,0.00006535566,0.0006913858,0.0001126682,0.00006722796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001950328,0.0003518306,0.002713067,0.0001716582,0.00009410713,0.00001104763,0.0007914653,0.00183937,0.03584616,0.3125688,0.0006315827,0.6447859],"study_design_scores_gemma":[0.001516148,0.002222951,0.001534993,0.0004769691,0.00008060729,0.0009822751,0.0004770183,0.2301415,0.5809979,0.1785775,0.00109627,0.00189594],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01994342,0.00001410198,0.976721,0.0008110058,0.00007315243,0.0006910536,0.000002223968,0.0003537043,0.001390331],"genre_scores_gemma":[0.4738806,0.00000133179,0.5258602,0.00009046082,0.000007995841,0.000144174,2.65164e-7,0.000003325239,0.00001158638],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.64289,"threshold_uncertainty_score":0.4169177,"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."}}