Semantic verification and satisfiability verification of MSC specifications by means of Petri nets in telecommunication software testing
✍ Scribed by Naomoto Kato; Yoshiaki Shigeta; Wataru Tanaka; Haruo Hasegawa
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 230 KB
- Volume
- 81
- Category
- Article
- ISSN
- 1042-0967
No coin nor oath required. For personal study only.
✦ Synopsis
This paper discusses the testing of communication system software, focusing on the semantic verification of specifications. Specifications are defined using message sequence charts (MSC) recommended by the ITU-T. Assuming an MSC-based scenario for which operational system specifications are defined, this paper offers a method to examine whether the scenario specifications are consistent. To make maximum use of existing research results on Petri nets, our semantic verification was carried out as a submarking reachability problem of the Petri net model representing the MSC. This paper also discusses the legality of this modeling approach and indicates that the consistency of specifications is equivalent to the executability of all events included in the specifications. As a method for semantic verification, this paper also introduces an algorithm to solve submarking reachability problems in linear time. We provide a discussion of how to examine whether a trace log, generated as the operational result for a constructed system, satisfies the scenario of a set of specifications. We carried out this sufficiency verification as a fire sequence-defined submarking reachability problem of the corresponding Petri net model and were able to obtain an algorithm to solve this problem in linear time.