Generating synchronizable test sequences with overlaps

Finite-state-machine-based conformance testing has been comprehensively studied in the literature in the context of centralized test architecture. As distributed test architecture involves multiple remote testers, applying a test sequence generated from a given n-port finite state machine to an implementation under test (IUT) may result in controllability problems. A possible way to resolve this problem is to select an appropriate test sequence, whose application to the IUT will not involve controllability problems. Thus generating such efficient test sequences is an interesting issue. There are several possibilities for such test sequence generation and we provide empirical study to compare the efficiency of two typical solutions proposed in the literature in terms of the length of the generated test sequences. While both of the two techniques rely on solutions to the Rural Postman Problem (RPP), a well-used RPP solution has been adopted and further improved in this thesis work

On triangularizability of the commutant of a single matrix

AbstractThe main purpose of this paper is to characterize triangularizable matrices A∈Mn(F) whose commutants are triangularizable, where F is an arbitrary field. More precisely, we show that the commutant of a triangularizable matrix A∈Mn(F) is triangularizable if and only if for any eigenvalue λ of A, the corresponding Jordan blocks in the Jordan canonical form of A have distinct sizes