{"id":"W1969752454","doi":"10.1007/s10626-011-0100-4","title":"Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Event Dynamic Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reachability; Petri net; Computer science; Stochastic Petri net; Construct (python library); State space; State (computer science); Reachability problem; Theoretical computer science; Distributed computing; Mathematics; Algorithm; Programming language","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002433379,0.0004893142,0.000790039,0.00035765,0.0002545704,0.0002064931,0.001694371,0.0002381852,0.00001269973],"category_scores_gemma":[0.0003771385,0.0004492823,0.0003809476,0.0007402145,0.0001403291,0.0005833181,0.0003707728,0.0002789658,0.0001077129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003864954,"about_ca_system_score_gemma":0.0001790895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003226924,"about_ca_topic_score_gemma":0.00001691678,"domain_scores_codex":[0.995357,0.000460628,0.001330655,0.001239878,0.0007007814,0.0009109954],"domain_scores_gemma":[0.9965056,0.0004526997,0.0007121675,0.0017688,0.0002803642,0.0002803789],"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.0007352341,0.0009242471,0.05022798,0.004677844,0.00215172,0.000214156,0.01850482,0.01236312,0.01737676,0.8547533,0.001396588,0.03667421],"study_design_scores_gemma":[0.0008329131,0.000243479,0.0004946053,0.0005081489,0.00004249009,0.0001524825,0.0005340106,0.9914616,0.0001615464,0.004448892,0.0004318221,0.0006880116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2641579,0.0009328639,0.7261624,0.00005900112,0.003972056,0.001931899,0.0001051841,0.0007020521,0.0019767],"genre_scores_gemma":[0.9629506,0.000008104038,0.03613794,0.00001690383,0.0001098323,0.0002397594,0.00004489276,0.00005919692,0.0004327336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9790985,"threshold_uncertainty_score":0.9997959,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02011644252270533,"score_gpt":0.2521523024658863,"score_spread":0.232035859943181,"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."}}