{"title":"金合欢- k的实验评价:从KLTL+规格合成反应体系的工具","authors":"Rodica Condurache","doi":"10.1109/SYNASC.2018.00031","DOIUrl":null,"url":null,"abstract":"Acacia-K is a tool that solves the synthesis problem for the positive fragment of epistemic temporal logic (KLTL). We briefly describe the implemented algorithm and our test cases. The tool is an extension of Acacia+ that solves the synthesis problem for epistemic temporal specifications where the resulting strategies need memory. To stress more the importance of such implementation, in this paper we compare Acacia-K with MCMAS-SLK, an open-source model-checker supporting the verification of interactive systems against specifications written in a variant of strategy logic under memoryless setting. The results obtained prove the feasibility of our method and represent an encouraging (and necessary) step towards developing implementable procedures for the entire logic KLTL.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experimental Evaluation of Acacia-K: A Tool for Synthesis of Reactive Systems from KLTL+ Specifications\",\"authors\":\"Rodica Condurache\",\"doi\":\"10.1109/SYNASC.2018.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Acacia-K is a tool that solves the synthesis problem for the positive fragment of epistemic temporal logic (KLTL). We briefly describe the implemented algorithm and our test cases. The tool is an extension of Acacia+ that solves the synthesis problem for epistemic temporal specifications where the resulting strategies need memory. To stress more the importance of such implementation, in this paper we compare Acacia-K with MCMAS-SLK, an open-source model-checker supporting the verification of interactive systems against specifications written in a variant of strategy logic under memoryless setting. The results obtained prove the feasibility of our method and represent an encouraging (and necessary) step towards developing implementable procedures for the entire logic KLTL.\",\"PeriodicalId\":273805,\"journal\":{\"name\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2018.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
Acacia-K是一个解决认知时间逻辑正片段(positive fragment of epistemic temporal logic, KLTL)合成问题的工具。我们简要地描述了实现的算法和我们的测试用例。该工具是Acacia+的扩展,它解决了认知时间规范的综合问题,其中产生的策略需要内存。为了更加强调这种实现的重要性,在本文中,我们将Acacia-K与MCMAS-SLK进行了比较,MCMAS-SLK是一种开源模型检查器,支持根据无内存设置下以策略逻辑变体编写的规范验证交互式系统。所获得的结果证明了我们的方法的可行性,并代表了为整个逻辑KLTL开发可实现程序的一个令人鼓舞的(和必要的)步骤。
Experimental Evaluation of Acacia-K: A Tool for Synthesis of Reactive Systems from KLTL+ Specifications
Acacia-K is a tool that solves the synthesis problem for the positive fragment of epistemic temporal logic (KLTL). We briefly describe the implemented algorithm and our test cases. The tool is an extension of Acacia+ that solves the synthesis problem for epistemic temporal specifications where the resulting strategies need memory. To stress more the importance of such implementation, in this paper we compare Acacia-K with MCMAS-SLK, an open-source model-checker supporting the verification of interactive systems against specifications written in a variant of strategy logic under memoryless setting. The results obtained prove the feasibility of our method and represent an encouraging (and necessary) step towards developing implementable procedures for the entire logic KLTL.