{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006345689,0.001303616,0.0004721653,0.002444527,0.0007414038,0.001095647,0.001239823,0.0005365402,0.005454293],"category_scores_gemma":[0.003085066,0.0006558676,0.001166396,0.001739353,0.000493917,0.001147331,0.0005784588,0.001025537,0.001535648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009998031,"about_ca_system_score_gemma":0.002060244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00537465,"about_ca_topic_score_gemma":0.009095242,"domain_scores_codex":[0.9994007,0.0001313396,0.00005334255,0.0001106934,0.0002304654,0.00007342678],"domain_scores_gemma":[0.9993537,0.0002422938,0.00007079993,0.0001124209,0.0001864933,0.00003431591],"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.000335708,0.0002998179,0.00153599,0.0007586451,0.00009320204,0.0007442122,0.0003197546,0.4052636,0.02755215,0.3493578,0.005307318,0.2084318],"study_design_scores_gemma":[0.00006245312,0.0000892293,0.0005502353,0.0001082056,0.0001691146,0.0001577564,0.0001432288,0.7223765,0.04371199,0.220491,0.01208261,0.0000576421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008532179,0.00005273421,0.985518,0.00002723164,0.00002935692,0.0002045859,0.000950089,0.0009170679,0.003768822],"genre_scores_gemma":[0.1872907,0.0003080314,0.8041847,0.00003592165,0.00001848259,0.0004825245,0.004304328,0.0005110019,0.002864258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005454293,"threshold_uncertainty_score":0.01824647,"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."}}