{"id":"W3120557648","doi":"10.1142/s0129054121500106","title":"Timed Bounded Verification of Inclusion Based on Timed Bounded Discretized Language","year":2021,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Undecidable problem; Bounded function; Computer science; Decidability; Timed automaton; Automaton; Word (group theory); Discretization; Upper and lower bounds; Regular language; Discrete mathematics; Mathematics; 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.001388107,0.0003448854,0.0004511212,0.0005284038,0.0006108604,0.001319155,0.001154054,0.0004996162,0.002056264],"category_scores_gemma":[0.00603305,0.0003071182,0.001558345,0.0004969325,0.001862986,0.002170862,0.001665945,0.001193441,0.0002717527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117372,"about_ca_system_score_gemma":0.002063649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003452073,"about_ca_topic_score_gemma":0.002230862,"domain_scores_codex":[0.995885,0.0008124691,0.0003877964,0.0009175478,0.001599339,0.000397766],"domain_scores_gemma":[0.9957656,0.002261962,0.0004012028,0.000782834,0.0006957721,0.00009262666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007936826,0.0002824798,0.004507852,0.0006409605,0.0001646254,0.001887328,0.002054821,0.1915342,0.1182387,0.5856773,0.001919963,0.09229811],"study_design_scores_gemma":[0.0001359505,0.0002479176,0.0005756475,0.00008021969,0.00008903423,0.0005340999,0.0002471152,0.7512308,0.07316102,0.1645971,0.009037117,0.00006399772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0429688,0.00008731551,0.9528747,0.0001133844,0.00005416427,0.0001480298,0.0001692018,0.00110081,0.002483632],"genre_scores_gemma":[0.7392891,0.0001339571,0.2576618,0.0001378381,0.00002533879,0.0003297284,0.0004875647,0.0001309079,0.001803627],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003452073,"threshold_uncertainty_score":0.008107185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0166647698265721,"score_gpt":0.3381901749490095,"score_spread":0.3215254051224374,"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."}}