An Effective Logical Wire Connection Verification Algorithm for Automotive Wiring System

As the number of user selectable electrical modules increases for passenger car, the number of cars with different combinations of option can easily exceed 100,000 cars. It results to a situation where we can not manually verify all the logical connection by making wiring combinations for each car. In this paper, we propose an algorithm that can reduce verification time for all possible wiring with available option combinations. The algorithm separates the whole wiring circuits into independent circuits and verifies the logical connections for each independent circuit with all possible options. The algorithm is time effective so the required time to verify the connections increases logarithmically as the number of possible car increases. The algorithm was implemented as software verification tool and its effectiveness was proved to be feasible.