Lecture Notes in Computer Science 3472

8 Test Derivation from Timed Automata 219
applied to A starting from any state s of its OS(A ). The application of σ to
A in s uniquely determines a finite, maximal execution fragment in OS(A ).
How to perform a test sequence is shown in the following definition. The
outcome of performing a test sequence on A is described in terms of an auxiliary
labeled transition system T .
Definition 8.27. The test sequence is the LTS T = 〈(Exp × Q),Σ,(ɛ, s0), ↠〉
with (Exp ×Q) as its set of states, where Exp is the test sequence to be executed,
Σ is a set of actions, (ɛ, s0) is (arbitrarily chosen) initial state, and a transition
relation ↠ that is inductively defined as the least relation satisfying the following
four rules, for all q, q ′ ∈ Q,σ ∈ Exp, i ∈I, o ∈Oand d, d ′ ∈ R >0 :
•
•
•
•
q o!
↣ q ′
(σ,q) o!
↠ (σ,q ′ )
q i?
↣ q ′
(i?σ,q) i?
↠ (σ,q ′ )
q d
↣ q ′
(dσ,q) d
↠ (σ,q ′ )
q d′
↣ q ′ , sup{t∈R >0 |q t
↣}=d ′