Model of component transport behavioral tests

Decomposition approach to the synthesis of tests, taking into account the structure of information systems extends the testing tasks needed to ensure controllability and observability analysis cannot be directly exposed to the components. The aim is a constructive description of transportable advanced automata input-output words as building special subautomata without the loss of information. A formal model of transport for a set of behavioral tests transported by extended automata is defined. The modified verification graph for the initial extended automata, allowing to get for the extended automata special subautomata without the loss of information on the basis of a modified screening graph is built. Subautomata`s model without the loss of information determines the conditions of the component transportation of network behavioral tests. The advantages and disadvantages of the proposed approach are considered. Continuing in the transport model NP-complexity of the problem a behavioral recognition requires the expediency of its decomposition in order to bring to the attainable level of implementation. Experimental software and algorithmic implementation of the model, made with the use of object-component programming for the network service level of DIS, has confirmed the feasibility of the development and implementation of research in this area