{"id":"W2139426253","doi":"10.1109/acc.2010.5531392","title":"Overapproximating the reachable sets of LTI systems through a similarity transformation","year":2010,"lang":"en","type":"article","venue":"","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Reduction (mathematics); Disjoint sets; Computer science; Set (abstract data type); Decomposition; Transformation (genetics); Similarity (geometry); Series (stratigraphy); Algorithm; Computational complexity theory; Controller (irrigation); Linear system; Mathematics; Control theory (sociology); Mathematical optimization; Discrete mathematics; Control (management); Artificial intelligence","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.001084739,0.0007448242,0.0006597922,0.0006549216,0.0005028124,0.0005993473,0.00071518,0.0004895022,0.001223069],"category_scores_gemma":[0.003579956,0.000432285,0.001330763,0.0005068253,0.001383004,0.001135478,0.001706765,0.00137973,0.000357155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005770837,"about_ca_system_score_gemma":0.0008095735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008878079,"about_ca_topic_score_gemma":0.001013689,"domain_scores_codex":[0.9985772,0.000367855,0.00008492143,0.000163043,0.0007079672,0.00009908495],"domain_scores_gemma":[0.9982089,0.0009194092,0.0002038603,0.0004518502,0.0001692833,0.00004669884],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001957548,0.0001792001,0.0009338342,0.0001473533,0.00007327033,0.0003014014,0.0003896685,0.6840257,0.06038453,0.1506132,0.0004916363,0.1022645],"study_design_scores_gemma":[0.00001653247,0.00009274055,0.0001320192,0.00001114598,0.00001762556,0.00009848484,0.00002754656,0.9270432,0.01984082,0.05154258,0.001165399,0.00001185339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01536629,0.00001600082,0.9833872,0.00002298024,0.000003982835,0.00002464211,0.00001069274,0.0002792708,0.0008890717],"genre_scores_gemma":[0.5161356,0.00008935635,0.4820242,0.0000450023,0.00001534916,0.0002454591,0.0001187478,0.0001387603,0.001187555],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001223069,"threshold_uncertainty_score":0.005736768,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03710882140374817,"score_gpt":0.3048743828217536,"score_spread":0.2677655614180054,"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."}}