Coverage and Usage Testing Based on Finite‐State Machines and Markov Chains

Jeff Tian · 2005

In this chapter, we introduce finite-state machines (FSMs) as the basis for various testing techniques. The basic concepts of FSMs are introduced and directly used to cover the modeled states, and illustrated by a comprehensive case study to model web testing and web crawling using FSMs. The enhancement of FSMs into Markov chains and Unified Markov Models (UMMs) as usage models is also described and illustrated by a comprehensive case study of statistical web testing based on UMMs.

Read the paper · More papers on PaperTik