{"id":"W1991609533","doi":"10.1016/j.entcs.2005.03.007","title":"A New Method for Transforming Timed Automata","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Automaton; Computer science; Timed automaton; Transformation (genetics); Theoretical computer science; Conformance testing; Finite-state machine; State (computer science); Model checking; Algorithm; Programming language; Operating system","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.005281452,0.0002216283,0.0002617245,0.0003271187,0.0002506827,0.0002820466,0.003205893,0.00008849148,0.00002248886],"category_scores_gemma":[0.0004342871,0.0002013129,0.00009357091,0.001612519,0.0004725118,0.001366385,0.0003315297,0.0003394242,0.00002823301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004067317,"about_ca_system_score_gemma":0.0007032815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007354362,"about_ca_topic_score_gemma":0.000007220454,"domain_scores_codex":[0.9966742,0.0001604667,0.0004479502,0.0009016077,0.0005650517,0.00125077],"domain_scores_gemma":[0.9978523,0.0008454488,0.00008324862,0.0008992243,0.00009898997,0.0002207808],"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.000008862256,0.00002165387,0.000001775504,0.000003352318,0.000001577078,3.259679e-7,0.0002599166,0.0005379805,0.0008532747,0.5503234,0.000006648476,0.4479812],"study_design_scores_gemma":[0.0004119193,0.0002295842,0.00003888709,0.00001589235,0.000002955508,0.00002879258,9.247066e-7,0.7120531,0.05608381,0.2299216,0.001020534,0.0001919983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007388291,0.00008228481,0.9947652,0.002851272,0.0003064703,0.0005040595,6.581041e-7,0.0002569914,0.0004942451],"genre_scores_gemma":[0.2799569,0.000005620476,0.7194223,0.0004111397,0.0001549801,0.00002903071,5.341897e-7,0.000009821234,0.000009649951],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7115151,"threshold_uncertainty_score":0.8209302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01192194929496741,"score_gpt":0.3276170705568103,"score_spread":0.3156951212618428,"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."}}