{"title":"多代理系统中通信协议的验证","authors":"Marina Bagić Babac, Aleksandar Babac, M. Kunstic","doi":"10.1145/1456223.1456283","DOIUrl":null,"url":null,"abstract":"This paper provides a framework for specification and verification of intelligent agent-based systems, with the emphasis on their cognitive and reactive features. We use an epistemic transition system to specify the agents and an epistemic synchronous product to specify the multi-agent system.\n We verify the system by means of a special action-based logic - ACTLW for Epistemic Reasoning (ACTLW stands for Action Computation Tree Logic with Unless Operator). Using temporal and epistemic operators we create the appropriate formulae to check whether the relevant property holds, or the protocol works within the given conditions.\n We test our method by the example of security communication protocol called Dining Cryptographers.","PeriodicalId":309453,"journal":{"name":"International Conference on Soft Computing as Transdisciplinary Science and Technology","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Verification of communication protocols in a multi-agent system\",\"authors\":\"Marina Bagić Babac, Aleksandar Babac, M. Kunstic\",\"doi\":\"10.1145/1456223.1456283\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper provides a framework for specification and verification of intelligent agent-based systems, with the emphasis on their cognitive and reactive features. We use an epistemic transition system to specify the agents and an epistemic synchronous product to specify the multi-agent system.\\n We verify the system by means of a special action-based logic - ACTLW for Epistemic Reasoning (ACTLW stands for Action Computation Tree Logic with Unless Operator). Using temporal and epistemic operators we create the appropriate formulae to check whether the relevant property holds, or the protocol works within the given conditions.\\n We test our method by the example of security communication protocol called Dining Cryptographers.\",\"PeriodicalId\":309453,\"journal\":{\"name\":\"International Conference on Soft Computing as Transdisciplinary Science and Technology\",\"volume\":\"129 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Soft Computing as Transdisciplinary Science and Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1456223.1456283\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Soft Computing as Transdisciplinary Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1456223.1456283","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Verification of communication protocols in a multi-agent system
This paper provides a framework for specification and verification of intelligent agent-based systems, with the emphasis on their cognitive and reactive features. We use an epistemic transition system to specify the agents and an epistemic synchronous product to specify the multi-agent system.
We verify the system by means of a special action-based logic - ACTLW for Epistemic Reasoning (ACTLW stands for Action Computation Tree Logic with Unless Operator). Using temporal and epistemic operators we create the appropriate formulae to check whether the relevant property holds, or the protocol works within the given conditions.
We test our method by the example of security communication protocol called Dining Cryptographers.