Model-Based Testing for Embedded Systems

458 Model-Based Testing for Embedded Systems

Before we get to the discussion of some further literature on model-based passive software

testing, let us briefly illustrate these principles, as we have outlined them above, by a very

small and simple example:

Let P be a process defined in the well-known notation of CSP as follows:

P =(QR),whereby

Q=(a → P), and

R=(b →P).

Obviously, this is a nonterminating process in which the “test data” that our “software

module” emits are arbitrary long sequences of a and b in any order. As a valid “test model”

to this trivial “software module,” we could then use the equally trivial regular expression

E = {a|b}

∗

,

which is sufficient to “recognize” (identify) all traces that can be emitted correctly by process

P. Should,