T. Karimov, Edon Kelmendi, J. Ouaknine, J. Worrell
{"title":"离散线性动力系统有什么可判定的?","authors":"T. Karimov, Edon Kelmendi, J. Ouaknine, J. Worrell","doi":"10.48550/arXiv.2206.11412","DOIUrl":null,"url":null,"abstract":". We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to oracles for the Skolem Problem.","PeriodicalId":334753,"journal":{"name":"Principles of Systems Design","volume":"44 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"What's Decidable about Discrete Linear Dynamical Systems?\",\"authors\":\"T. Karimov, Edon Kelmendi, J. Ouaknine, J. Worrell\",\"doi\":\"10.48550/arXiv.2206.11412\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to oracles for the Skolem Problem.\",\"PeriodicalId\":334753,\"journal\":{\"name\":\"Principles of Systems Design\",\"volume\":\"44 6\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Principles of Systems Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2206.11412\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Principles of Systems Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2206.11412","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
What's Decidable about Discrete Linear Dynamical Systems?
. We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to oracles for the Skolem Problem.