An effective method to decide bounded reordering conformance in the distributed test architecture

In the distributed test architecture, the system under test interacts with its environment at multiple physically distributed ports and the local testers at these ports do not synchronise their actions. This presents many challenges and, in particular, apparently incorrect behaviours can be the consequence of an erroneous assumption about the exact order in which actions were performed at different ports. In previous work, it was defined a conformance relation for the distributed test architecture considering the order possibilities and the distance actions are able to be delayed. Basically, the system under test is faulty if we observe a trace σ such that no enough admissible reordering of the actions in σ could have been produced by the specification. This notion takes into account both the way of reordering and the amount of changes a trace can receive. In this thesis we implement an algorithm, and provide the theoretical results proving its correctness, to construct a finite automata able to check the whether a system under test conforms to a specification with respect to this implementation relation. Thus, a side result of the thesis is that we slightly extend the theoretical framework for bounded distributed relations