Method of Data Association Performance Evaluation Based on Automata Theory Consistency and Reachability Analysis

The research goal of data association in the past has primarily focused on establishing a computational approach for association processing algorithms. In this paper, a performance evaluation model is proposed for data association based on temporal finit automata. An algorithm for checking the consistency and reachability of the model is developed. A simulation experiment illustrates the effectiveness of this method in the analysis and verification of the performance of data association algorithms.