对时间相关协议的互操作性测试生成:一个案例研究

Zhiliang Wang, Jianping Wu, Xia Yin
{"title":"对时间相关协议的互操作性测试生成:一个案例研究","authors":"Zhiliang Wang, Jianping Wu, Xia Yin","doi":"10.1109/GLOCOM.2004.1378031","DOIUrl":null,"url":null,"abstract":"Protocol interoperability testing is an important technique to ensure the quality of implementations of network communication protocols. In this paper, we present an efficient method to generate interoperability testing for time dependent protocols. We use the formal model, communicating TIOAs (timed input automata) (CTIOAs), to specify the system under test, in which time constraints are specified by linear expressions involving local clock values. In the method, firstly a global state reachability tree of CTIOAs should be generated, in which test sequences can be selected. Then we analyze the executability of the generated test sequences. By converting linear constraints of local clocks to a global clock, the problem reduces to a linear programming problem. We also select a set of appropriate initial clock values to make test sequences executable. An example of a neighbor discovery protocol is used to illustrate our method.","PeriodicalId":162046,"journal":{"name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Towards interoperability test generation of time dependent protocols: a case study\",\"authors\":\"Zhiliang Wang, Jianping Wu, Xia Yin\",\"doi\":\"10.1109/GLOCOM.2004.1378031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Protocol interoperability testing is an important technique to ensure the quality of implementations of network communication protocols. In this paper, we present an efficient method to generate interoperability testing for time dependent protocols. We use the formal model, communicating TIOAs (timed input automata) (CTIOAs), to specify the system under test, in which time constraints are specified by linear expressions involving local clock values. In the method, firstly a global state reachability tree of CTIOAs should be generated, in which test sequences can be selected. Then we analyze the executability of the generated test sequences. By converting linear constraints of local clocks to a global clock, the problem reduces to a linear programming problem. We also select a set of appropriate initial clock values to make test sequences executable. An example of a neighbor discovery protocol is used to illustrate our method.\",\"PeriodicalId\":162046,\"journal\":{\"name\":\"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2004.1378031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2004.1378031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

协议互操作性测试是保证网络通信协议实现质量的一项重要技术。本文提出了一种有效的生成时间相关协议互操作性测试的方法。我们使用正式模型,通信tioa(定时输入自动机)(ctioa)来指定被测系统,其中时间约束由涉及本地时钟值的线性表达式指定。该方法首先生成ctioa的全局状态可达树,并在树中选择测试序列;然后分析了生成的测试序列的可执行性。通过将局部时钟的线性约束转换为全局时钟,将问题简化为线性规划问题。我们还选择了一组适当的初始时钟值,以使测试序列可执行。用一个邻居发现协议的例子来说明我们的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards interoperability test generation of time dependent protocols: a case study
Protocol interoperability testing is an important technique to ensure the quality of implementations of network communication protocols. In this paper, we present an efficient method to generate interoperability testing for time dependent protocols. We use the formal model, communicating TIOAs (timed input automata) (CTIOAs), to specify the system under test, in which time constraints are specified by linear expressions involving local clock values. In the method, firstly a global state reachability tree of CTIOAs should be generated, in which test sequences can be selected. Then we analyze the executability of the generated test sequences. By converting linear constraints of local clocks to a global clock, the problem reduces to a linear programming problem. We also select a set of appropriate initial clock values to make test sequences executable. An example of a neighbor discovery protocol is used to illustrate our method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信