Fault Detection of Reachability Testing with Game Theoretic Approach
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 2
Abstract
This paper presents a game theoretic approach to fault detection of reachability testing. Physical systems are susceptible to fault at any time. Due to this reason the problem of determining and reacting to fault detection has received a greater attention in today’s era. In this paper we study the fault detection of reachability tesing from a game theoretic point of view. Reachability testing is an approach that combines non-deterministic and deterministic testing. It is based on a technique, called prefix-based testing, which executes a test run deterministically up to a certain point and there after allows the test run to proceed non-deterministically. We use the well known framework of reachability testing in two fold. First, reachability testing adopts a dynamic framework in which SYN-sequences are derived automatically and on-the-fly, without constructing any static models. Second, reachability testing is an interleaving-free approach in which independent events are never totally ordered in a SYN-sequence. Therefore, reachability testing automatically avoids the problem of exercising more than one interleaving of the same partial ordering of events. The methodology controls the evolution of the system and chooses whether and when a fault occurs and the detection of the same. Case study and preliminary experimental results indicate that proves to be a viable approach using game theoretic method.
Authors and Affiliations
S. Preetha , Dr. M. Punithavalli
Keywords
Related Articles
- EP ID EP135029
- DOI -
- Views 101
- Downloads 0
Rule Based Classification to Detect Malnutrition in Children
Data mining is an area which used in vast field of areas. Rule based classification is one of the sub areas in data mining. From this paper it will describe how rule based classification is used alone with Agent Technolo...
Introducing a New Language for Stream Applications
Stream programs represent an important class of high-performance computing. These programs are rich in parallelism and can be naturally targeted to distributed and multi-core architectures. Since computer architectures g...
Discovering suffixes: A Case Study for Marathi Language
Suffix stripping is a pre-processing step required in a number of natural language processing applications. Stemmer is a tool used to perform this step. This paper presents and evaluates a rule-based and an unsupervised...
Frequent Data Itemset Mining Using VS_Apriori Algorithms
The organization, management and accessing of information in better manner in various data warehouse applications have been active areas of research for many researchers for more han last two decades. The work resented i...
A GENERIC APPROACH TO CONTENT BASED IMAGE RETRIEVAL USING DCT AND CLASSIFICATION TECHNIQUES
With the rapid development of technology, the traditional information etrieval techniques based on keywords are not sufficient, content - based image retrieval (CBIR) has been an active research opic.Content Based Imag...