一种使用状态转换图约简的快速协议转换技术

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings] Pub Date : 1992-04-01 DOI:10.1109/PCCC.1992.200529

D. Saha, P. Dhar

{"title":"一种使用状态转换图约简的快速协议转换技术","authors":"D. Saha, P. Dhar","doi":"10.1109/PCCC.1992.200529","DOIUrl":null,"url":null,"abstract":"A technique to improve the formal protocol conversion method suggested by K. Okumura (1986) is presented. The algorithm first constructs the reduced state transition graphs (STGs) of the protocols for which the converter is to be designed, and then follows the Okumura algorithm to produce a reduced communicating finite state machine (CFSM) model of the converter. This reduced machine is expanded to obtain the complete single CFSM converter. The reduction of STGs lowers the computational complexity of Okumura's algorithm by one or two orders of magnitude but does not disturb the desired functionality of the converter. The approach has been applied to design a converter between two example protocols.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"132 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A fast protocol conversion technique using reduction of state transition graphs\",\"authors\":\"D. Saha, P. Dhar\",\"doi\":\"10.1109/PCCC.1992.200529\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A technique to improve the formal protocol conversion method suggested by K. Okumura (1986) is presented. The algorithm first constructs the reduced state transition graphs (STGs) of the protocols for which the converter is to be designed, and then follows the Okumura algorithm to produce a reduced communicating finite state machine (CFSM) model of the converter. This reduced machine is expanded to obtain the complete single CFSM converter. The reduction of STGs lowers the computational complexity of Okumura's algorithm by one or two orders of magnitude but does not disturb the desired functionality of the converter. The approach has been applied to design a converter between two example protocols.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"132 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200529\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200529","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

提出了一种改进K. Okumura(1986)提出的形式协议转换方法的技术。该算法首先构造了转换器设计协议的简化状态转移图(STGs)，然后根据Okumura算法建立了转换器的简化通信有限状态机(CFSM)模型。将简化后的机器扩展为完整的单CFSM变换器。STGs的减少将Okumura算法的计算复杂度降低了一到两个数量级，但不会干扰转换器的预期功能。该方法已用于设计两个示例协议之间的转换器

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A fast protocol conversion technique using reduction of state transition graphs

A technique to improve the formal protocol conversion method suggested by K. Okumura (1986) is presented. The algorithm first constructs the reduced state transition graphs (STGs) of the protocols for which the converter is to be designed, and then follows the Okumura algorithm to produce a reduced communicating finite state machine (CFSM) model of the converter. This reduced machine is expanded to obtain the complete single CFSM converter. The reduction of STGs lowers the computational complexity of Okumura's algorithm by one or two orders of magnitude but does not disturb the desired functionality of the converter. The approach has been applied to design a converter between two example protocols.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]

自引率

0.00%

发文量