{"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}
引用次数: 7
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.