Abstract
The paper formalizes two types of refinement for finite state machines: OR refinement and p-OR refinement. For each such type of refinement, it shows that, if the implementation is also constructed through a process of refinement, then the application of Chow's W test generation method can be distributed into smaller chunks, thus diminishing the effort devoted to testing and the size of the final test set.
Get full access to this article
View all access options for this article.
