.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
A communication system uses a precise set;of rules, called a protocol, to define interactions among its entities. With advancing computer, transmission and switching technology, communication systems are providing sophisticated services demanded by users over a wide area. Protocol standards include a very large number of options to take care of different service possibilities and to please all the people involved in the Standards Committees. Consequently, protocols have become large and complex, and, therefore their design and analysis have become a formidable task. To cope with this problem, a variety of approaches to simplify the protocols have been proposed in the published literature, such as protocol projection, homomorphism, selective resolution, and many others. We have recently developed a new technique called protocol pruning. It reduces the complexity of the protocols by pruning them to keep only that part which is required for a specified subset of services. More importantly, it takes polynomial (rather than exponential) time and space in the size of the protocol specification. This makes the algorithm feasible for engineers to use for practical problems involving large and complex protocols. We describe the technique and discuss applications to synthesis of protocol converters/gateways, protocol conformance testing, and thinning for lightweight and high performance protocols. The technique could also be useful for protocol implementation, synthesis, validation, and verification.
Keyword:
VERIFICATION
SEQUENCES
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
25.9
论文数:
9.9K
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
分享收藏
查看更多内容