The construction algorithm takes a collection of LTSs and maps them into a single Petri net representing the system. This Petri net is futher used to construct its unfolding, i.e. another Petri net with a simpler structure. Then, the BM is constructed from the finite prefix of the Petri net unfolding. Finally, the test derivation approach is extended, by applying appropriate algorithms, such as to deal with the BM model.

A prototype toolset using this approach and supporting LOTOS specifications has been developed. This toolset uses the CAESAR compiler to generate a global Petri net of the specification that is subsequently used as input for the construction of the complete finite prefix of the net using the PEP tool. Finally, the behaviour machine is constructed from the prefix using the proposed algorithm. The prototype toolset has been applied for test derivation of a distributed leader election algorithm in unidirectional ring networks. The experimental results show that, as the degree of parallelism in the system increases, the BM is much smaller than the corresponding interleaved LTS model.