{"title":"Reduction of the number of terminal assignments for detecting feature interactions in telecommunication services","authors":"Tae Yoneda, T. Ohta","doi":"10.1109/ICECCS.2000.873946","DOIUrl":null,"url":null,"abstract":"Telecommunication systems are typical complex systems. Services that independently operate normally will behave differently when simultaneously initiated with another service. This behavior is called feature interaction and is recognized to affect the dependability. This article proposes a method of dramatically reducing the computation time required for detecting feature interactions in telecommunication services. One of the knotty problems in defecting feature interactions at the specification design stage is terminal assignment. For the same service specifications, occurrence of feature interactions depends on how to assign real terminals to terminal variables in the specifications. Consequently, all terminals connected to the network have to be considered in order to detect all interactions. As a result, the number of combinations of terminal assignments is enormous. This causes huge expansion of computation time needed for detection of feature interactions. By considering equivalent states, the proposed method can reduce the number of terminal assignments to one 400th compared with that of the conventional method.","PeriodicalId":228728,"journal":{"name":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","volume":"212 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCS.2000.873946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Telecommunication systems are typical complex systems. Services that independently operate normally will behave differently when simultaneously initiated with another service. This behavior is called feature interaction and is recognized to affect the dependability. This article proposes a method of dramatically reducing the computation time required for detecting feature interactions in telecommunication services. One of the knotty problems in defecting feature interactions at the specification design stage is terminal assignment. For the same service specifications, occurrence of feature interactions depends on how to assign real terminals to terminal variables in the specifications. Consequently, all terminals connected to the network have to be considered in order to detect all interactions. As a result, the number of combinations of terminal assignments is enormous. This causes huge expansion of computation time needed for detection of feature interactions. By considering equivalent states, the proposed method can reduce the number of terminal assignments to one 400th compared with that of the conventional method.