Checking Experiments with Labeled Transition Systems for Trace Equivalence

Q. M. Tan, Alexandre Petrenko, Gregor von Bochmann · 1997

We apply the state identification techniques for testing communication sys­tems which are modeled labeled by transition systems (LTSs). The confor­mance requirements of specifications are represented as the trace equivalence relation and derived tests have finite behavior and provide well-defined fault coverage. We redefine in the realm of LTSs the notions of state identification that were originally defined in the realm of input/output finite state machines (FSMs). Then we present the corresponding test generation methods and dis­cuss their fault coverage.

Read the paper · More papers on PaperTik