{"title":"ABS:一个正式正确的软件工具,用于节省空间的符号合成","authors":"Alexander Weber, Elisei Macoveiciuc, G. Reissig","doi":"10.1145/3501710.3519519","DOIUrl":null,"url":null,"abstract":"We present ABS, a software for Abstraction-Based Synthesis of controllers for continuous-state control systems. The tool distinguishes itself from previously known such software by being formally correct, i.e., any controller synthesized by ABS is mathematically guaranteed to solve the control problem provided as input. ABS achieves this quality by providing an input language with mathematically defined semantics and a respective compiler, and by carefully taking into account all numerical and rounding errors that might be incurred at either compile- or run-time. To mitigate computational overhead caused by the aforementioned approach, ABS implements, e.g. on-the-fly synthesis algorithms with greatly reduced memory requirement. The tool is currently applicable to invariance and reachability problems and requires state measurement. We discuss structure, algorithmic details and basic usage of ABS, and we demonstrate on two examples that its performance compares favorably with that of competing, not formally correct synthesis software. The source code of ABS is publicly available. See http://www.reiszig.de/gunther/pubs/ABS.html","PeriodicalId":194680,"journal":{"name":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"ABS: A formally correct software tool for space-efficient symbolic synthesis\",\"authors\":\"Alexander Weber, Elisei Macoveiciuc, G. Reissig\",\"doi\":\"10.1145/3501710.3519519\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present ABS, a software for Abstraction-Based Synthesis of controllers for continuous-state control systems. The tool distinguishes itself from previously known such software by being formally correct, i.e., any controller synthesized by ABS is mathematically guaranteed to solve the control problem provided as input. ABS achieves this quality by providing an input language with mathematically defined semantics and a respective compiler, and by carefully taking into account all numerical and rounding errors that might be incurred at either compile- or run-time. To mitigate computational overhead caused by the aforementioned approach, ABS implements, e.g. on-the-fly synthesis algorithms with greatly reduced memory requirement. The tool is currently applicable to invariance and reachability problems and requires state measurement. We discuss structure, algorithmic details and basic usage of ABS, and we demonstrate on two examples that its performance compares favorably with that of competing, not formally correct synthesis software. The source code of ABS is publicly available. See http://www.reiszig.de/gunther/pubs/ABS.html\",\"PeriodicalId\":194680,\"journal\":{\"name\":\"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3501710.3519519\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 25th ACM International Conference on Hybrid Systems: Computation and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3501710.3519519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ABS: A formally correct software tool for space-efficient symbolic synthesis
We present ABS, a software for Abstraction-Based Synthesis of controllers for continuous-state control systems. The tool distinguishes itself from previously known such software by being formally correct, i.e., any controller synthesized by ABS is mathematically guaranteed to solve the control problem provided as input. ABS achieves this quality by providing an input language with mathematically defined semantics and a respective compiler, and by carefully taking into account all numerical and rounding errors that might be incurred at either compile- or run-time. To mitigate computational overhead caused by the aforementioned approach, ABS implements, e.g. on-the-fly synthesis algorithms with greatly reduced memory requirement. The tool is currently applicable to invariance and reachability problems and requires state measurement. We discuss structure, algorithmic details and basic usage of ABS, and we demonstrate on two examples that its performance compares favorably with that of competing, not formally correct synthesis software. The source code of ABS is publicly available. See http://www.reiszig.de/gunther/pubs/ABS.html