Automatic Generation Of Test Cases For Computer Interlocking Route Control Process Based On UPPAAL

Computer interlocking system is an important means of ensuring the safety of train moving in the station.The safety and reliability of interlocking logical calculation affects the real-time state of whole station equipment and plays an important role of the train running safety.Therefore it needs a security test for interlocking system software design.However,since the various signal manufactures’ software is not uniform,resulting in a very difficult test.Currently,the software test methods is mainly centered on the code to design the test cases.the generality and flexibility is poor for the system test.Against the same problem for different developers to write programs and framework ideas is not completely same,it is necessary to design test cases for each line Code or each module,the test efficiency is extremely low and more time-consuming.In this paper,the core process of interlocking logic operation is deeply analyzec’.,and the influence of human and environment is introduced.The computer interlocking state machine model is built up and the model is simulated and validated to generate the final test.Firstly,the paper studies the function requirement and the human-environment factor,and introduces the influence of natural accident and human-caused equipment failure on interlocking operation to the interlocking core calculation.on the base of’system requirement analysis,The UPPAAL software is used to model the entrance control module according to the interlocking logic process,including the route establishment,route normal release,shunt reentry release,route cancel and the route fail release.Secondly,uses UPPAAL simulation environment and BNF grammar to simulate and validate the model by taking the concrete approach as an example to ensure the correctness of the model and save the relationship between the state and the edge in the XML file.The generated dom4j technology is used to parse the generated XML file,and The basic principle of graph theory is introduced and the storage of the adjacency table is used to store the relation between state and edge.In each model,a code is assigned to each state to simplify the model.In order to ensure the completeness of the test case,a DFS search algorithm is designed to traverse the simplified model,and get abstract test cases.lastly,all transition conditions are obtained according to the abstract test cases,and all transition conditions are analyzed by Java reflection mechanism to get the final test cases.