In order to solve the problem of artificial generation and low efficiency of test sequences for zone controller (ZC), a model-based automatic generation method of test sequence is proposed. Firstly, the timed automata...In order to solve the problem of artificial generation and low efficiency of test sequences for zone controller (ZC), a model-based automatic generation method of test sequence is proposed. Firstly, the timed automata model is established based on function analysis of the zone controller, and the correctness of the model is verified by UPPAAL. Then by parsing the timed automata model files, state information and transition conditions can be extracted to generate test case sets. Finally, according to the serialization conditions of test cases, the test cases are serialized into test sequences by using the improved depth first search algorithm. A case, the ZC controls the train running within its jurisdiction, shows that the method is correct and can effectively improve the efficiency of test sequence generation.展开更多
A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, comput...A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the mathematical structure underlying the time series generated from the elementary cellular automaton of rule 56 is analyzed and its complexity is determined, in which the Dyck language and Catalan numbers emerge naturally.展开更多
文摘In order to solve the problem of artificial generation and low efficiency of test sequences for zone controller (ZC), a model-based automatic generation method of test sequence is proposed. Firstly, the timed automata model is established based on function analysis of the zone controller, and the correctness of the model is verified by UPPAAL. Then by parsing the timed automata model files, state information and transition conditions can be extracted to generate test case sets. Finally, according to the serialization conditions of test cases, the test cases are serialized into test sequences by using the improved depth first search algorithm. A case, the ZC controls the train running within its jurisdiction, shows that the method is correct and can effectively improve the efficiency of test sequence generation.
基金This work is supported by the Special Funds for Major State Basic Research Project.
文摘A new approach to study the evolution complexity of cellular automata is proposed and explained thoroughly by an example of elementary cellular automaton of rule 56. Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the mathematical structure underlying the time series generated from the elementary cellular automaton of rule 56 is analyzed and its complexity is determined, in which the Dyck language and Catalan numbers emerge naturally.
