{"id":"W1573865009","doi":"10.1007/3-540-45351-2_8","title":"Optimal Paths in Weighted Timed Automata","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Timed automaton; Reachability; Computer science; Automaton; Deterministic automaton; Reachability problem; Shortest path problem; Floyd–Warshall algorithm; Directed graph; Algorithm; Graph; Dijkstra's algorithm; Theoretical computer science","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.001976541,0.0005945168,0.0006142444,0.001460244,0.0001692626,0.0004788139,0.005227826,0.0004935372,0.00004496359],"category_scores_gemma":[0.0001706757,0.0005707547,0.0001161526,0.001454975,0.0006410733,0.001115479,0.001592247,0.001126004,0.0001395315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005764439,"about_ca_system_score_gemma":0.0005732077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003096274,"about_ca_topic_score_gemma":0.00003375824,"domain_scores_codex":[0.9951782,0.00009984905,0.0007986446,0.001839983,0.001193987,0.0008892932],"domain_scores_gemma":[0.9966736,0.0003258612,0.000370009,0.002245861,0.0001963815,0.0001882331],"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.00001020986,0.00005732816,0.00005847734,0.0000294507,0.000006057167,0.0002167563,0.0007320818,0.01618043,0.0001039376,0.04747519,0.00003138443,0.9350987],"study_design_scores_gemma":[0.0003497707,0.0001424148,0.0003822515,0.0002996632,0.000003654377,0.0001211834,1.08937e-7,0.9350987,0.001103642,0.05814045,0.00369272,0.0006654087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002141577,0.0002284741,0.9847003,0.0004152068,0.002219028,0.0004962049,0.000003823342,0.0003146473,0.01140812],"genre_scores_gemma":[0.009403779,0.00007311949,0.989088,0.0006357495,0.0002691974,0.00001846512,0.000007266407,0.00003834569,0.0004660875],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9344333,"threshold_uncertainty_score":0.9996744,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02187225969365655,"score_gpt":0.2734728750933508,"score_spread":0.2516006153996942,"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."}}