{"title":"适合Web服务的拜占庭容错算法的形式化规范","authors":"Wei Zhou, Liu Chen","doi":"10.1109/IPTC.2011.16","DOIUrl":null,"url":null,"abstract":"A Byzantine Fault Tolerant Algorithm suiting web services is proposed considering the features of web services. There are significant differences between the algorithm and the Castro and Liskov's well-known practical Byzantine fault tolerance method. First, we have to create replicas on both sides of communicating web services, while in CLBFT's method, replicas are created only on the server side. Second, due to the autonomous behavior of web services, we have to synchronize the timing of the receiving of messages among replicas. The I/O automata model of the algorithm is presented, and it's correctness is formally specified and verified.","PeriodicalId":388589,"journal":{"name":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services\",\"authors\":\"Wei Zhou, Liu Chen\",\"doi\":\"10.1109/IPTC.2011.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Byzantine Fault Tolerant Algorithm suiting web services is proposed considering the features of web services. There are significant differences between the algorithm and the Castro and Liskov's well-known practical Byzantine fault tolerance method. First, we have to create replicas on both sides of communicating web services, while in CLBFT's method, replicas are created only on the server side. Second, due to the autonomous behavior of web services, we have to synchronize the timing of the receiving of messages among replicas. The I/O automata model of the algorithm is presented, and it's correctness is formally specified and verified.\",\"PeriodicalId\":388589,\"journal\":{\"name\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPTC.2011.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Symposium on Intelligence Information Processing and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPTC.2011.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services
A Byzantine Fault Tolerant Algorithm suiting web services is proposed considering the features of web services. There are significant differences between the algorithm and the Castro and Liskov's well-known practical Byzantine fault tolerance method. First, we have to create replicas on both sides of communicating web services, while in CLBFT's method, replicas are created only on the server side. Second, due to the autonomous behavior of web services, we have to synchronize the timing of the receiving of messages among replicas. The I/O automata model of the algorithm is presented, and it's correctness is formally specified and verified.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
