{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008992066,0.0007524391,0.0009141114,0.001071798,0.0008419055,0.001867206,0.001288993,0.000804343,0.006131408],"category_scores_gemma":[0.004724517,0.001065376,0.001010234,0.001810993,0.001435815,0.003852244,0.001597054,0.001818984,0.0005773176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453649,"about_ca_system_score_gemma":0.001240219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002029431,"about_ca_topic_score_gemma":0.002926448,"domain_scores_codex":[0.9990619,0.0001950027,0.00009032297,0.0002302419,0.0002952034,0.0001273372],"domain_scores_gemma":[0.9980153,0.001328792,0.0001537089,0.0001857566,0.0002201194,0.00009639776],"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.0001611494,0.00005140539,0.0003197764,0.0002526091,0.00003716395,0.0001085341,0.0002353379,0.1193695,0.004582725,0.8139658,0.001231287,0.05968466],"study_design_scores_gemma":[0.00002209076,0.00002640918,0.00006695866,0.00002780283,0.00002498936,0.00003869107,0.00004343057,0.1199832,0.001991208,0.875428,0.002336793,0.00001045837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06334856,0.0004934103,0.919227,0.0002150488,0.00009746654,0.00010176,0.0002427772,0.0005611578,0.01571282],"genre_scores_gemma":[0.5349347,0.001330819,0.4425956,0.0001109617,0.00007873565,0.00037025,0.000622239,0.0005700698,0.01938666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006131408,"threshold_uncertainty_score":0.02051163,"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."}}