Abstract
Train-ground communication data that are generated during the operation of high-speed railway train control system are key information which reflects the safety control logic and function of high-speed railways. Since the possible existence of defects in the devices of train control system, the communication data may contain some errors (e.g. missing, redundant or wrong messages). As a result, error location and diagnosis of these communication data is an important part of function test in train-ground communication. These problems can be abstracted into an approximate string matching problem which has seldom been studied in previous research. This paper extends the bit-parallel algorithm for approximate regular expression matching problem and proposes an online method to locate and diagnose errors. Finally, a case study is presented and the results indicate the effectiveness of this method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Sellers, P.H.: The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms 1, 359–373 (1980)
Ukkonen, E.: Finding approximate patterns in strings. Journal of Algorithms 6, 132–137 (1985)
Wu, S., Manber, U.: Fast text searching allowing errors. Communications of ACM, 83–91 (1992)
Baeza-Yates, R.A., Navarro, G.: Faster approximate string matching. Algorithmica 23, 127–158 (1999)
Myers, E.W.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM 46, 395–415 (1999)
Navarro, G.: Nr-grep: a fast and flexible pattern matching tool. Software Practice and Experience 31, 1265–1312 (2001)
Levenshtein, V.I.: Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission 1, 8–17 (1965)
Navarro, G., Raffinot, M.: Flexble pattern matching in strings, vol. 145, pp. 117–123. Cambridge University Press, New York (2002)
Gluskov, V.M.: The abstract theory of automata. Russian Mathematical Surveys 16, 1–53 (1961)
Navarro, G., Raffinot, M.: Compact DFA representation for fast regular expression search. In: 5th International Workshop Algorithm Engineering, p. 6 (August 2001)
Zhang, S.: CTCS-3 general technical scheme, pp. 6–10. China Railway Press (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, L., Dong, W., Ji, Y., Sun, X. (2011). An Error Location and Diagnosis Method for Communication Test of High-Speed Railway Train Control System Based on String Pattern Matching. In: Zhou, M., Tan, H. (eds) Advances in Computer Science and Education Applications. Communications in Computer and Information Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22456-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-22456-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22455-3
Online ISBN: 978-3-642-22456-0
eBook Packages: Computer ScienceComputer Science (R0)