Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320–088X IJCSMC, Vol. 2, Issue. 4, April 2013, pg. 491 – 494 RESEARCH ARTICLE © 2013, IJCSMC All Rights Reserved 491 Coverage Analysis and Chinese Postman Algorithm for Efficient Model-Based Test Generation Parampreet Kaur 1 , Gaurav Gupta 2 1 Computer Science Engineering, Punjabi University Patiala, India 2 Computer Science Engineering, Punjabi University Patiala, India 1 paramnagpal16@gmail.com; 2 gaurav_shakti@yahoo.com Abstract— The software testing activity aims to check whether an implementation behaves according to the specified system requirements. Model-based testing is an important black-box testing approach based on formalisms to specify critical and reactive systems. In a black-box approach the internal structure of an implementation candidate is unknown by the test designer. Thus, an implementation receives stimuli from the environment and produces autonomous outputs. Good software testers cannot avoid models. They construct mental models whenever they test an application. They update their mental model of the application and apply new tests according to the model. MBT calls for explicit definition of the model, either in advance or throughout the testing endeavour. However, software testers of today have a difficult time planning such a modelling effort. They are victims of the ad hoc nature of the development process where Requirements change abruptly. Testers who have only a few hours or days to test will most often opt to maintain their models in their head and perform testing manually. Today, the scene seems to be changing. Modelling in general seems to be gaining favour in fields where quality is essential and low quality software is not an option. Henceforth, we have introduced Extensive coverage analysis methods and a Guided Chinese Postman Algorithm for generating Test Cases. Key Terms: - Model Coverage Analysis; MBT; Chinese Postman Algorithm; State charts; extended MBT I. INTRODUCTION Coverage criterion Analysis is the basic and traditional empirical means to measure the fault detection potential of test suites. They are also used to guide and abort the test generation process. Testing is often incomplete, i.e. cannot cover all possible system behaviours. They can be applied to anything from requirements via models to machine code. There are different kinds of coverage criterions which may describe parts of the system behaviour that must be covered by tests. They may not only address single instruction or value assignments but also long sequences of instructions or data flow paths. Most of the criteria used for selecting test cases is classified according to the following three criteria: 1) The test case specification is a description of a structural criterion which needs to be covered. 2) The test case specification is a description of functional aspects, also called scenarios, which needs to be covered. 3) The test case specification contains random information about different aspects of the implementation. Common belief however seems to be that random testing should systematically complement coverage based approaches. Coverage based approaches should be used to detect specific faults while random approaches aim at providing confidence about programs reliability. A test case is defined as a sequence of stimuli from the environment to exercise the system structure. The resulting sequence is named observable and it gives the output behaviour.