• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3070-3076
• /
• 1999

Petri net is one of the effective modeling techniques which analyzes and designs concurrent and asynchronous systems. CPN is an extended Petri net which has color tokens. In this paper, we propose a new test case generation method using CPN. It transforms Estelle Specification into CPN, which is applicable to Design/CPN. It also generates UIO and subtour from OG and descriptor, which are resulted from Design/CPN. Using the proposed method, we can get more improved test coverage than existing methods. Therefore, more effective protocol conformance testing could be conducted. The test case generating method will be the basis of the automatic testing environmented.

• Journal of Korean Society on Water Environment
• /
• v.20 no.4
• /
• pp.333-338
• /
• 2004

This study was carried out to investigate the generation and discharge characteristics of non-point pollutants from farmlands in Nak-dong river basin. Annual unit generation load of nitrogen and phosphorus by fertilization in the test paddy field was almost similar to those calculated by the fertilization standards of district agricultural technology center, but it was extremely higher in case of the test dry field. By comparing annual total generation load of nutrients from fertilization to the data of fertilizer marketing, the accurate forecasting of generation load of pollutants was achieved by marketing data. The annual total discharge ratio of nutrients through infiltration and overflow from the farmland of the test paddy field were 9.5% and 1.1%, respectively, and those in the test dry field were 22.0% and 0.1%, respectively. The monthly discharge load of nutrients were shown the highest proportioned to the discharge load from lands, but it showed higher in phosphorus, which was caused by the intermittent discharge of phosphorus accumulated in drainage.

• The KIPS Transactions:PartD
• /
• v.17D no.4
• /
• pp.283-296
• /
• 2010

Timing diagram is a useful tool for describing the specification of system, but there is no study for test case strategy of a timing diagram. To solve this problem, we followed the steps to generate test cases from timing diagram in this paper. 1) We defined a timing diagram formally. 2) We describe the method of transforming from a timing diagram model into a Stateflow model which has an equivalent relationship between a timing diagram model and a transformed Stateflow model. 3) We generated test cases from a transformed Stateflow model using SDV which is plugged in Simulink. To show that our approach is useful, we made an experiment with a surveillance model and arbitrary timing diagram models. In the experiment we transformed timing diagram models into Stateflow models, generated test cases from transformed Stateflow models using SDV, and analyzed the generation results. The conclusion that can be obtained from this study is that timing diagram is not only a specification tool but also a useful tool when users are trying to generate test cases based on model.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.653-662
• /
• 2016

This paper describes a test case generation algorithm for Simulink/Stateflow models based on the Rapidly exploring Random Tree (RRT) algorithm that has been successfully applied to path finding. An important factor influencing the performance of the RRT algorithm is the metric used for calculating the distance between the nodes in the RRT space. Since a test case for a Simulink/Stateflow (SL/SF) model is an input sequence to check a specific condition (called a test target in this paper) at a specific status of the model, it is necessary to drive the model to the status before checking the condition. A status maps to a node of the RRT. It is usually necessary to check various conditions at a specific status. For example, when the specific status represents an SL/SF model state from which multiple transitions are made, we must check multiple conditions to measure the transition coverage. We propose a unique distance calculation metric, based on the observation that the test targets are gathered around some specific status such as an SL/SF state, named key nodes in this paper. The proposed metric increases the probability that an RRT is extended from key nodes by imposing penalties to non-key nodes. A test case generation algorithm utilizing the proposed metric is proposed. Three models of Electrical Control Units (ECUs) embedded in a commercial vehicle are used for the performance evaluation. The performances are evaluated in terms of penalties and compared with those of the algorithm using a typical RRT algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.5
• /
• pp.985-991
• /
• 2009

A grammar-based test case generation (GBTG) algorithm takes a grammar G and generates a subset of the language L(G) accepted by G, and called test cases for software product testing. As most languages specified with CFG are recursive, usually L(G) is so large that it is not practical to execute all the of the generated cases. Therefore, this paper presents some "tags" : extra-grammatical annotations which are designed to restrict the generation. A number of control mechanisms have been developed to prune the number of test cases generated while still producing a test set that covers the majority of inputs to the system.

• Journal of Information Processing Systems
• /
• v.7 no.2
• /
• pp.363-384
• /
• 2011

As the complexity of software is increasing, generating an effective test data has become a necessity. This necessity has increased the demand for techniques that can generate test data effectively. This paper proposes a test data generation technique based on adequacy based testing criteria. Adequacy based testing criteria uses the concept of mutation analysis to check the adequacy of test data. In general, mutation analysis is applied after the test data is generated. But, in this work, we propose a technique that applies mutation analysis at the time of test data generation only, rather than applying it after the test data has been generated. This saves significant amount of time (required to generate adequate test cases) as compared to the latter case as the total time in the latter case is the sum of the time to generate test data and the time to apply mutation analysis to the generated test data. We also use genetic algorithms that explore the complete domain of the program to provide near-global optimum solution. In this paper, we first define and explain the proposed technique. Then we validate the proposed technique using ten real time programs. The proposed technique is compared with path testing technique (that use reliability based testing criteria) for these ten programs. The results show that the adequacy based proposed technique is better than the reliability based path testing technique and there is a significant reduce in number of generated test cases and time taken to generate test cases.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.52-64
• /
• 1999

QoS monitoring is a kind of real-time systems which allows each level of the system to track the ongoing QoS levels achieved by the lower network layers. For these systems, real-time communications between corresponding transport protocol objects is essential for their correct behavior. When two or more entities are employed to perform a certain task as in the case of communication protocols, the capability to do so is called interoperability and considered as the essential aspect of correctness of communication systems. This paper describes a formal approach on modeling and interoperability test case generation of a real-time QoS monitoring protocol. For this, we specify the behavior of flow monitoring of transport layer QoS protocol, i.e., METS protocol, which is proposed to address QoS from an end-to-end's point of view, based on QoS architecture model which includes ATM net work in lower layers. We use a real-time Input/Output finite State Machine to model the behavior of real-time flow monitoring over time. From the modeled real-time I/OFSM, we generate interoperability test cases to check the correctness of METS protocol's flow monitoring behaviors for two end systems. A new approach to efficient interoperability testing is described and the method of interoperability test cases generation is shown with the example of METS protocol's flow monitoring. The current TTCN is not appropriate for testing real-time and multimedia systems. Because test events in TTCN are for message-based system and not for stream-based systems, the real-time in TTCN can only be approximated. This paper also proposes the notation of real-time Abstract Test Suite by means of real-time extension of TTCN. This approach gives the advantages that only a few syntactical changes are necessary, and TTCN and real-time TTCN are compatible. This formal approach on interoperability testing can be applied to the real-time protocols related to IMT-2000, B-ISDN and real-time systems.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.70-77
• /
• 2002

This paper describes a design driven approach to drive intelligent test plan generation based on adaptive use case (3,5). Its foundation is an object-oriented software design approach which partitions design schema into design architecture of functional components called “design component”. A use case software development methodology of adaptive use case approach developed in I.I .T is employed which preserves this unit architecture on through to the actual code structure. Based on the partition design schema produced during the design phase of this methodology, a test plan is generated which includes a set of component and scenario based test. A software metric is introduced which produces an ordering of this set to enhance productivity and both promote and capitalize on test case reusability, This paper contains an application that illustrates the proposed approach.

• Journal of Korean Society on Water Environment
• /
• v.31 no.3
• /
• pp.235-240
• /
• 2015

To evaluate the unit load generation and discharge, pig cage test was conducted. Feed intake, drink amount, and urine generation increased growth stage (heavy weight) of the pig more great. However, the sum of the urine and manure did not show a significant difference in the growth stages of pigs. Because of the limit of the experiment, e.g., research period, high pigpen temperature, breed-related stress and etc., it could not be derived the results of the four seasons. Therefore, in order to generalize the results, the feed intakes were calibrated using a NRC (National Research and nutritional requirements of pigs from the Commission) standards. The finalized unit load generation and generation amounts of manure and urine were estimated at BOD 104.1 g/head/d, T-N 21.2 g/head/d, T-P 4.9 g/head/d, manure 0.96 L/d, urine 1.66 L/d with consideration of revised feed intake. Compare to the former research results of MOE (Ministry of Environment, 1999) and NIAS (National Institute of Animal Science, 2008), the generation amounts of manure and urine were similar to the NIAS's values. In case of unit load generation, BOD and T-N were almost similar in all of them. However, the T-P unit load generation of MOE was more difference, e.g., 2.5 times high, compare to this study.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.180-191
• /
• 2008

An Adaptive Random Testing (ART) is one of test case generation algorithms that are designed to detect common failure patterns within input domain. The ART algorithm shows better performance than that of pure Random Testing (RT). Distance-bases ART (D-ART) and Restriction Random Testing (RRT) are well known examples of ART algorithms which are reported to have good performances. But significant drawbacks are observed as quadratic runtime and non-uniform distribution of test case. They are mainly caused by a huge amount of distance computations to generate test case which are distance based method. ART through Iterative Partitioning (IP-ART) significantly reduces the amount of computation of D-ART and RRT with iterative partitioning of input domain. However, non-uniform distribution of test case still exists, which play a role of obstacle to develop a scalable algerian. In this paper we propose a new ART method which mitigates the drawback of IP-ART while achieving improved fault-detection capability. Simulation results show that the proposed one has about 9 percent of improved F-measures with respect to other algorithms.