Fault localization for automatic train operation based on the adaptive error locating array algorithm

When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Sch...

Full description

Saved in:
Bibliographic Details
Published inScientific reports Vol. 15; no. 1; pp. 81 - 17
Main Authors Zhang, Yanpeng, Cao, Yuxiang
Format Journal Article
LanguageEnglish
Published London Nature Publishing Group UK 02.01.2025
Nature Publishing Group
Nature Portfolio
Subjects
Online AccessGet full text
ISSN2045-2322
2045-2322
DOI10.1038/s41598-024-82455-y

Cover

Abstract When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity , average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.
AbstractList When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity, average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.
When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity , average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.
When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity, average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity, average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.
Abstract When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being affected by combinatorial testing case explosion, which could results from the masking effects caused by multiple faults, the Minimum Fault Schema (MFS) can be accurately and efficiently located. Taking the Automatic Train Operation (ATO) scenario in intelligent high-speed rail as an example, a fault localization method based on the Adaptive Error Locating Array (AELA) algorithm is proposed. To begin with, according to the characteristics of ATO, the adaptive fault localization model is designed and the test parameter table is constructed. Then the Partial Variable Intensity Covering Array (PVICA) algorithm is used to generate the initial set of test cases, and the cases are executed sequentially. Furthermore, based on the test case execution results, the fault location module is invoked to prioritize the generation of additional test cases. These cases are designed to locate the MFS more easily in the given parameter range using the Adaptive Particle Swarm Optimization (APSO) algorithm. Finally, the MFS is determined. The validity and accuracy of the proposed method are verified through the simulation testing platform for Beijing-Shenyang high-speed rail. The experimental results of ablation and comparison show that the Integrity, average Accuracy and average C-Evaluation of the proposed algorithm can reach up to 100%, 91.07% and 84.56% respectively. Compared to four mainstream adaptive algorithms of fault localization, the proposed algorithm is less affected by the masking effects caused by multiple faults and requires the fewest number of test cases. The research results can offer useful guidance for verifying the integrity and reliability of the ATO function and contribute to the intrinsic safety for rail transit.
ArticleNumber 81
Author Zhang, Yanpeng
Cao, Yuxiang
Author_xml – sequence: 1
  givenname: Yanpeng
  surname: Zhang
  fullname: Zhang, Yanpeng
  email: zhangyanpeng@lzjtu.edu.cn
  organization: School of Automation and Electrical Engineering, Lanzhou Jiaotong University
– sequence: 2
  givenname: Yuxiang
  surname: Cao
  fullname: Cao, Yuxiang
  organization: School of Automation and Electrical Engineering, Lanzhou Jiaotong University
BackLink https://www.ncbi.nlm.nih.gov/pubmed/39747909$$D View this record in MEDLINE/PubMed
BookMark eNqNUk1v1DAQjVARLaV_gAOKxKWXgD-TzAmhipZKlbjA2RrHTjYrr73YSdHy6_FultJyQPjij3nvzZsZvyxOfPC2KF5T8o4S3r5PgkpoK8JE1TIhZbV7VpwxImTFOGMnj86nxUVKa5KXZCAovChOOTSiAQJnhb3G2U2lCx268SdOY_BlH2KJ8xQ2-dqVU8TRl2Fr4xLVmKwp82Fa2RINbqfx3pY2xszay0yjH0qMEXcluiHEcVptXhXPe3TJXhz38-Lb9aevV5-ruy83t1cf76pOAJsqAbo3vdAIzAjAvkMUjYAWKFIuCAHTCiAImgHjNTVWGioFN73m2hAj-Hlxu-iagGu1jeMG404FHNXhIcRBYcxFOatqqGXH67rhLQjdSW3qLNtobIwWQFnW4ovW7Le4-4HOPQhSovYzUMsMVJ6BOsxA7TLrw8LaznpjTWd97p97YuVpxI8rNYR7RWl2VDf7vJdHhRi-zzZNajOmzjqH3oY5KU4lpQCtkBn69i_oOszR5w4fUITmnu0F3zy29ODl9yfIALYAuhhSirb_v0KP7UkZ7Acb_-T-B-sX5-jWdw
Cites_doi 10.1016/j.infsof.2023.107225
10.1109/TITS.2023.3338295
10.1109/TFUZZ.2022.3227464
10.1109/TSE.2023.3279125
10.1155/2020/1091548
ContentType Journal Article
Copyright The Author(s) 2024
2024. The Author(s).
Copyright Nature Publishing Group 2025
The Author(s) 2024 2024
Copyright_xml – notice: The Author(s) 2024
– notice: 2024. The Author(s).
– notice: Copyright Nature Publishing Group 2025
– notice: The Author(s) 2024 2024
DBID C6C
AAYXX
CITATION
NPM
3V.
7X7
7XB
88A
88E
88I
8FE
8FH
8FI
8FJ
8FK
ABUWG
AEUYN
AFKRA
AZQEC
BBNVY
BENPR
BHPHI
CCPQU
DWQXO
FYUFA
GHDGH
GNUQQ
HCIFZ
K9.
LK8
M0S
M1P
M2P
M7P
PHGZM
PHGZT
PIMPY
PJZUB
PKEHL
PPXIY
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7X8
5PM
ADTOC
UNPAY
DOA
DOI 10.1038/s41598-024-82455-y
DatabaseName Springer Nature OA Free Journals
CrossRef
PubMed
ProQuest Central (Corporate)
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
Biology Database (Alumni Edition)
Medical Database (Alumni Edition)
Science Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Natural Science Journals
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest One Sustainability
ProQuest Central UK/Ireland
ProQuest Central Essentials
Biological Science Collection
ProQuest Central
Natural Science Collection
ProQuest One Community College
ProQuest Central Korea
Health Research Premium Collection
Health Research Premium Collection (Alumni)
ProQuest Central Student
SciTech Premium Collection
ProQuest Health & Medical Complete (Alumni)
Biological Sciences
Health & Medical Collection (Alumni Edition)
Medical Database
Science Database
Biological Science Database
ProQuest Central Premium
ProQuest One Academic
ProQuest Publicly Available Content Database
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
MEDLINE - Academic
PubMed Central (Full Participant titles)
Unpaywall for CDI: Periodical Content
Unpaywall
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
PubMed
Publicly Available Content Database
ProQuest Central Student
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Natural Science Collection
ProQuest Central China
ProQuest Biology Journals (Alumni Edition)
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest One Sustainability
ProQuest Health & Medical Research Collection
Health Research Premium Collection
Health and Medicine Complete (Alumni Edition)
Natural Science Collection
ProQuest Central Korea
Health & Medical Research Collection
Biological Science Collection
ProQuest Central (New)
ProQuest Medical Library (Alumni)
ProQuest Science Journals (Alumni Edition)
ProQuest Biological Science Collection
ProQuest Central Basic
ProQuest Science Journals
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
Health Research Premium Collection (Alumni)
Biological Science Database
ProQuest SciTech Collection
ProQuest Hospital Collection (Alumni)
ProQuest Health & Medical Complete
ProQuest Medical Library
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
MEDLINE - Academic
DatabaseTitleList PubMed


MEDLINE - Academic

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: C6C
  name: Springer Nature Open Access Journals (LUT & LAB)
  url: http://www.springeropen.com/
  sourceTypes: Publisher
– sequence: 2
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 3
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 4
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 5
  dbid: BENPR
  name: ProQuest Central
  url: http://www.proquest.com/pqcentral?accountid=15518
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Biology
EISSN 2045-2322
EndPage 17
ExternalDocumentID oai_doaj_org_article_6965c36673894bc5bd6b297ba7db4912
10.1038/s41598-024-82455-y
PMC11696672
39747909
10_1038_s41598_024_82455_y
Genre Journal Article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 52062028
  funderid: http://dx.doi.org/10.13039/501100001809
– fundername: Gansu Province Youth Doctoral Fund for Higher Education Institutions
  grantid: 2022QB-068
– fundername: China Railway
  grantid: N2024G040
  funderid: http://dx.doi.org/10.13039/100015860
– fundername: China Railway
  grantid: N2024G040
– fundername: National Natural Science Foundation of China
  grantid: 52062028
GroupedDBID 0R~
3V.
4.4
53G
5VS
7X7
88A
88E
88I
8FE
8FH
8FI
8FJ
AAFWJ
AAJSJ
AAKDD
ABDBF
ABUWG
ACGFS
ACSMW
ACUHS
ADBBV
ADRAZ
AENEX
AEUYN
AFKRA
AJTQC
ALIPV
ALMA_UNASSIGNED_HOLDINGS
AOIJS
AZQEC
BAWUL
BBNVY
BCNDV
BENPR
BHPHI
BPHCQ
BVXVI
C6C
CCPQU
DIK
DWQXO
EBD
EBLON
EBS
ESX
FYUFA
GNUQQ
GROUPED_DOAJ
GX1
HCIFZ
HH5
HMCUK
HYE
KQ8
LK8
M0L
M1P
M2P
M48
M7P
M~E
NAO
OK1
PIMPY
PQQKQ
PROAC
PSQYO
RNT
RNTTT
RPM
SNYQT
UKHRP
AASML
AAYXX
AFPKN
CITATION
PHGZM
PHGZT
PJZUB
PPXIY
PQGLB
PUEGO
NPM
7XB
8FK
K9.
PKEHL
PQEST
PQUKI
PRINS
Q9U
7X8
5PM
ADTOC
EJD
IPNFZ
RIG
UNPAY
ID FETCH-LOGICAL-c492t-49bfdf4ba92d49afcaa4749891a134009d8490a9b292361de5d1543dfb3bd0d43
IEDL.DBID UNPAY
ISSN 2045-2322
IngestDate Fri Oct 03 12:52:02 EDT 2025
Sun Oct 26 04:00:46 EDT 2025
Tue Sep 30 17:06:13 EDT 2025
Fri Sep 05 13:23:58 EDT 2025
Tue Oct 07 07:49:51 EDT 2025
Wed Feb 19 02:03:12 EST 2025
Wed Oct 01 02:45:46 EDT 2025
Fri Feb 21 02:35:28 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Fault localization
Adaptive particle swarm optimization
Automatic train operation
Adaptive error locating array
Combinatorial testing
Masking effects
Language English
License 2024. The Author(s).
Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.
cc-by-nc-nd
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c492t-49bfdf4ba92d49afcaa4749891a134009d8490a9b292361de5d1543dfb3bd0d43
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
OpenAccessLink https://proxy.k.utb.cz/login?url=https://www.nature.com/articles/s41598-024-82455-y.pdf
PMID 39747909
PQID 3151014002
PQPubID 2041939
PageCount 17
ParticipantIDs doaj_primary_oai_doaj_org_article_6965c36673894bc5bd6b297ba7db4912
unpaywall_primary_10_1038_s41598_024_82455_y
pubmedcentral_primary_oai_pubmedcentral_nih_gov_11696672
proquest_miscellaneous_3151199845
proquest_journals_3151014002
pubmed_primary_39747909
crossref_primary_10_1038_s41598_024_82455_y
springer_journals_10_1038_s41598_024_82455_y
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2025-01-02
PublicationDateYYYYMMDD 2025-01-02
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-02
  day: 02
PublicationDecade 2020
PublicationPlace London
PublicationPlace_xml – name: London
– name: England
PublicationTitle Scientific reports
PublicationTitleAbbrev Sci Rep
PublicationTitleAlternate Sci Rep
PublicationYear 2025
Publisher Nature Publishing Group UK
Nature Publishing Group
Nature Portfolio
Publisher_xml – name: Nature Publishing Group UK
– name: Nature Publishing Group
– name: Nature Portfolio
References 82455_CR3
W Xiang (82455_CR9) 2024; 1
82455_CR2
Y Qianqian (82455_CR11) 2022; 105
N Bin (82455_CR1) 2019; 41
Z Zhenhai (82455_CR16) 2021; 33
X Xuewen (82455_CR19) 2023; 31
N Changhai (82455_CR5) 2017; 12
Z Zhuo (82455_CR14) 2023; 49
Z Yanpeng (82455_CR12) 2024; 46
Z Yang (82455_CR21) 2022; 33
C Martinez (82455_CR18) 2010; 23
82455_CR20
F Klück (82455_CR10) 2023; 160
L Barruffo (82455_CR6) 2024; 25
Y Zhiming (82455_CR8) 2024; 22
82455_CR15
C Heling (82455_CR13) 2023; 35
82455_CR17
82455_CR7
82455_CR4
References_xml – ident: 82455_CR17
– volume: 33
  start-page: 951
  issue: 4
  year: 2021
  ident: 82455_CR16
  publication-title: J. Syst. Simul.
– ident: 82455_CR2
– volume: 46
  start-page: 84
  issue: 11
  year: 2024
  ident: 82455_CR12
  publication-title: J. China Railw. Soc.
– volume: 35
  start-page: 1
  issue: 8
  year: 2023
  ident: 82455_CR13
  publication-title: J. King Saud Univ. Comput. Inform. Sci.
– volume: 160
  start-page: 107225
  issue: 4
  year: 2023
  ident: 82455_CR10
  publication-title: ‎Inf. Softw. Technol.
  doi: 10.1016/j.infsof.2023.107225
– ident: 82455_CR7
– volume: 22
  start-page: 7943
  issue: 12
  year: 2024
  ident: 82455_CR8
  publication-title: IEEE Trans. Intell. Transp. Syst.
– volume: 23
  start-page: 1776
  issue: 4
  year: 2010
  ident: 82455_CR18
  publication-title: Soc. Ind. Appl. Math.
– volume: 25
  start-page: 5096
  issue: 6
  year: 2024
  ident: 82455_CR6
  publication-title: IEEE Trans. Intell. Transp. Syst.
  doi: 10.1109/TITS.2023.3338295
– ident: 82455_CR4
– ident: 82455_CR3
– volume: 31
  start-page: 2464
  issue: 7
  year: 2023
  ident: 82455_CR19
  publication-title: IEEE Trans. Fuzzy Syst.
  doi: 10.1109/TFUZZ.2022.3227464
– volume: 41
  start-page: 1
  issue: 3
  year: 2019
  ident: 82455_CR1
  publication-title: J. China Railw. Soc.
– volume: 49
  start-page: 3939
  issue: 7
  year: 2023
  ident: 82455_CR14
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2023.3279125
– ident: 82455_CR15
  doi: 10.1155/2020/1091548
– volume: 12
  start-page: 2391
  issue: 20
  year: 2017
  ident: 82455_CR5
  publication-title: China Sciencepap.
– ident: 82455_CR20
– volume: 1
  start-page: 1
  year: 2024
  ident: 82455_CR9
  publication-title: IEEE Trans. Transp. Electrif.
– volume: 33
  start-page: 1551
  issue: 05
  year: 2022
  ident: 82455_CR21
  publication-title: J. Softw.
– volume: 105
  start-page: 930
  issue: 6
  year: 2022
  ident: 82455_CR11
  publication-title: IEICE Trans. Fund. Electron. Commun. Comput. Sci.
SSID ssj0000529419
Score 2.4406695
Snippet When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from being...
Abstract When the combinatorial testing method is used to locate faults in the complex signalling system of high-speed rail in order to prevent the system from...
SourceID doaj
unpaywall
pubmedcentral
proquest
pubmed
crossref
springer
SourceType Open Website
Open Access Repository
Aggregation Database
Index Database
Publisher
StartPage 81
SubjectTerms 639/166/987
639/705/794
Adaptive error locating array
Adaptive particle swarm optimization
Algorithms
Automatic train operation
Combinatorial testing
Fault localization
High speed rail
Humanities and Social Sciences
Localization
Masking effects
multidisciplinary
Science
Science (multidisciplinary)
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3Ni9UwEA-yIOpB_La6SgRvbtk2H21yVPGxCHpyYW9h0qTuwrN9dFuk_72TpO_5Hop68FaatJ3MR-aXJjNDyGunalVZ3uTe1ywXyrpctR6BnG0BWl80MkbIffpcnZ2LjxfyYq_UVzgTltIDJ8adVrqSDY_FKbWwjbSuskzXFmpnhY71hVmh9N5iKmX1ZlqUeomSKbg6vUZPFaLJmMgVE1Lm84Enign7f4cyfz0sudsxvUNuTd0G5u-wXu85pdU9cndBk_RtGsV9csN3D8jNVF9yfkj8Cqb1SKO_WuItKYJUCtPYx1StNFaIoP3GJ0Wgwak5iheICyk42ITZkPphwKfCa8IhaQrDADOF9dd-uBovvz0i56sPX96f5UtdhbwRmo250LZ1rbCgmRMa2gZA1EIrXULJ0aa1U0IXoJHPITWL89Ih0OKutdy6wgn-mBx1feefEmp5LZ0vOPM1rqu4VgjIQmw2yluUIFlG3mx5bDYpfYaJ295cmSQRgxIxUSJmzsi7IIZdz5D6Ot5AhTCLQpi_KURGjrdCNIs9XhtehrkHx4bNr3bNaElhewQ630-pT4g4FDIjT5LMd5TwsOzShc6IOtCGA1IPW7qry5ituyyR4qrGD59sFecnXX_ixclOuf6Bdc_-B-uek9sslDcOf5jYMTkah8m_QMw12pfRvH4AW20nnQ
  priority: 102
  providerName: Directory of Open Access Journals
– databaseName: ProQuest Central
  dbid: BENPR
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3_a9UwEA_zDXH-IH6dT6dE8DdX1iZpm_wg4mSPIfgQcbDfyqVJt8GzrV2L9L83l36ZD2X4W2nS9nr3Se6Sy90R8tbIVCaa54G1KQuE1CaQhXWGnC4AChvmsY-Q-7JOTs_E5_P4fIesp1gYPFY5zYl-ojZVjnvkRzxC9DjEsQ_1zwCrRqF3dSqhAWNpBfPepxi7Q3YZZsZakN3jk_XXb_OuC_q1RKTG6JmQy6Nrp8EwyoyJQDIRx0G_paF8Iv9_WZ9_H6KcPan3yb2urKH_BZvNH8pq9ZA8GK1M-nGAxSOyY8vH5O5Qd7J_QuwKuk1LvR4b4zCpM14pdG3lU7hSXzmCVrUdAEJR2RnqLpy9SMFAjbMktU3jnsLX4OFpCk0DPYXNheNbe_njKTlbnXz_dBqM9RaCXCjWBkLpwhRCg2JGKChyAJEKJVUEEXecV0YKFYLSTGHKFmNj4wwwbgrNtQmN4M_IoqxK-5xQzdPY2JAzm7r1FlfSGWoYs-1wICKI2ZK8m3ic1UNajcy7w7nMBolkTiKZl0jWL8kximHuiSmx_Y2qucjGEZYlKolz7quYKqHzWJvEEZpqSI0WKnKfPJiEmI3j9Dq7QdWSvJmb3QhDtwmUtuqGPhiJKOIl2R9kPlPCcTmmQrUkcgsNW6Rut5RXlz6LdxQ5ipPUffhwAs4NXbfx4nAG13-w7sXtf_2S7DEsaIx7SuyALNqms6-cldXq1-PQ-Q0K1yXu
  priority: 102
  providerName: ProQuest
– databaseName: Scholars Portal Journals: Open Access
  dbid: M48
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELZKEaIcEG8WCjISNxpI_EjsA0KAWFVI5cRKvUXj2GkrLck2TQT594ydB6xYIbhFcWxP5uH5HGdmCHlpVaZSw4vIuYxFQhkbqdIhkDMlQOniQoYIuZMv6fFKfD6Vp3tkKnc0MvBq59bO15NaNevXPy77d2jwb4eQcfXmCp2QDxRjIlJMSBn118h19FTal3I4GeH-kOubaZHoMXZmd9ct_xTS-O_Cnn_-Qjmfo94iN7tqA_13WK9_c1XLO-T2iDHp-0Ep7pI9V90jN4aqk_194pbQrVsavNgYhUkRulLo2jokcKWhbgRFRgzqQb2rsxQvEC1SsLDxayR1TYO9_DD-12kKTQM9hfVZ3Vy0598ekNXy09ePx9FYbSEqhGZtJLQpbSkMaGaFhrIAEJnQSieQcLR0bZXQMWjDtE_YYp20CL-4LQ03NraCPyT7VV25x4QanknrYs5chrstrhXCNB-xjVogEpBsQV5NPM43Q1KNPByGc5UPEslRInmQSN4vyAcvhvlJnxA73Kibs3y0rzzVqSx4qGGqhSmksSkSmhnIrBE6wSkPJyHmk5LlPPErEr4bNr-Ym9G-_KEJVK7uhmd8HKKQC_JokPlMCfebMR3rBVFb2rBF6nZLdXEecngnCVKcZjjx0aQ4v-j6Gy-OZuX6B9Y9-b_Rn5ID5ssb-y9M7JDst03nniHmas3zYEg_AeHXJ50
  priority: 102
  providerName: Scholars Portal
– databaseName: Springer Nature HAS Fully OA
  dbid: AAJSJ
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3di9QwEA_nHqI-iN-unhLBN7fY5qNNHldxORb0RQ_urUya1DvYa5dei_S_d5J2q-VE9K00H53mN5OZdjIzhLy1KlOp4UXkXMYioYyNVOnQkDMlQOniQoYIuc9f0tMzsT2X50dkdYiFmfnvQ-rua1QxPgyMiUgxIWXU3yLHChlTLcjxer39up3-qXivlUj0GBuDw9_fHDzTPyFN_59sy5tHJCc_6T1yp6v20P-A3e43VbR5QO6PNiRdD6A_JEeuekRuD1Ul-8fEbaDbtTRoqTHKkqJpSqFr65CglYa6ELTeuwF-6lWZpXiB1iAFC3u_B1LXNDjKT-OPRlNoGugp7L7XzWV7cfWEnG0-fft4Go3VFKJCaNZGQpvSlsKAZlZoKAsAkQmtdAIJR0nWVgkdgzZM-4Qs1kmL5hW3peHGxlbwp2RR1ZV7TqjhmbQu5sxl-DXFtUIzzEdkI8oiAcmW5N1hjfP9kDQjD85urvIBkRwRyQMieb8kHzwMU0-f8DrcQD7IR_nJU53KgocapVqYQhqbIqGZgcwaoRN85MkBxHyUwuucJ37HwXfD5jdTM8qPd4pA5epu6OPjDIVckmcD5hMl3H9s6VgviZpxw4zUeUt1eRFydCcJUpxm-ODVgXF-0fW3tVhNzPUPS_fi_2Z_Se4yX77Y_0FiJ2TRNp17hTZVa16PovQTaMca6Q
  priority: 102
  providerName: Springer Nature
Title Fault localization for automatic train operation based on the adaptive error locating array algorithm
URI https://link.springer.com/article/10.1038/s41598-024-82455-y
https://www.ncbi.nlm.nih.gov/pubmed/39747909
https://www.proquest.com/docview/3151014002
https://www.proquest.com/docview/3151199845
https://pubmed.ncbi.nlm.nih.gov/PMC11696672
https://www.nature.com/articles/s41598-024-82455-y.pdf
https://doaj.org/article/6965c36673894bc5bd6b297ba7db4912
UnpaywallVersion publishedVersion
Volume 15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVFSB
  databaseName: Free Full-Text Journals in Chemistry
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: HH5
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://abc-chemistry.org/
  providerName: ABC ChemistRy
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: KQ8
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: DOA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVEBS
  databaseName: EBSCOhost Academic Search Ultimate
  customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: ABDBF
  dateStart: 20121221
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn
  providerName: EBSCOhost
– providerCode: PRVBFR
  databaseName: Free Medical Journals
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: DIK
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://www.freemedicaljournals.com
  providerName: Flying Publisher
– providerCode: PRVFQY
  databaseName: GFMER Free Medical Journals
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: GX1
  dateStart: 0
  isFulltext: true
  titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php
  providerName: Geneva Foundation for Medical Education and Research
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVAQN
  databaseName: PubMed Central
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: RPM
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.ncbi.nlm.nih.gov/pmc/
  providerName: National Library of Medicine
– providerCode: PRVAQT
  databaseName: Springer Nature - nature.com Journals - Fully Open Access
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: NAO
  dateStart: 20111201
  isFulltext: true
  titleUrlDefault: https://www.nature.com/siteindex/index.html
  providerName: Nature Publishing
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: 7X7
  dateStart: 20210101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: BENPR
  dateStart: 20210101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVFZP
  databaseName: Scholars Portal Journals: Open Access
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 20250131
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: M48
  dateStart: 20110801
  isFulltext: true
  titleUrlDefault: http://journals.scholarsportal.info
  providerName: Scholars Portal
– providerCode: PRVAVX
  databaseName: Springer Nature HAS Fully OA
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: AAJSJ
  dateStart: 20111201
  isFulltext: true
  titleUrlDefault: https://www.springernature.com
  providerName: Springer Nature
– providerCode: PRVAVX
  databaseName: Springer Nature Open Access Journals (LUT & LAB)
  customDbUrl:
  eissn: 2045-2322
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000529419
  issn: 2045-2322
  databaseCode: C6C
  dateStart: 20111201
  isFulltext: true
  titleUrlDefault: http://www.springeropen.com/
  providerName: Springer Nature
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwELe2Vgh44PujMCoj8cbSJbGd2I9dtWqqtGoCKspTZMfONlGSKkuEyl_P2UkKhQmxlySKnfh8Oft-se8DoXeaxzxSJPWMiUOPcqU9nhkAciqTMjN-ypyH3Nk8Ol3Q2ZIt91DU-cI4o30X0tJN05112NE1KBrrDBZSj4eUMW8zWutsH_UjBhi8h_qL-fn4i80kBxjFA5gQth4yPuE3PLyjhVyw_psQ5t-Gktvd0vvobp2v5ea7XK1-U0jTh-hz15XGDuXrqK7UKP3xR5TH2_f1EXrQYlQ8bmo-Rnsmf4LuNFkrN0-Rmcp6VWGnBVsvTgzQF8u6KlwAWOzyTuBibRrxwlZVagwXgDax1HJt51hsyhKesq-xptdYlqXcYLm6KMqr6vLbM7SYnnyanHpttgYvpSKsPCpUpjOqpAg1FTJLpaQxFVwEMiAwUwjNqfClUKGwAV-0YRrgG9GZIkr7mpLnqJcXuXmJsCIx08YnoYnhb40IDjDPenyDFNFAsnCA3ndfL1k3QTkSt5lOeNIwLwHmJY55yWaAju0H3ta0AbXdjaK8SFqmJ5GIWEpcDlRBVcqUjoDQWMlYKyoCaPKgE4-kHeXXCQnsjAZ9g-K322IYn3bTReamqJs61o-RsgF60UjTlhJif-aELwaI78jZDqm7JfnVpYsBHgRAcRRDw4edSP6i61-8ONyK7X-w7tXtqr9G90KbHtmuUIUHqFeVtXkDmK1SQ7QfL-Mh6o_Hs48zOB-fzM8_wN1JNBm6dRA4nlE-bAfyTydXRHs
linkProvider Unpaywall
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKK1Q4IN4sFDASnGjUxHYS-1AhCq22tF0h1Eq9uXbstEhLsmSzqvLn-G2MnUdZgSouvUVJNp71fPaMPZ75EHpreMoTTbPA2pQEjGsT8NyCI6dzpXIbZrHPkDuaJOMT9uU0Pl1Bv_pcGHessp8T_URtysztkW_RyKEHEEc-zH4GjjXKRVd7Cg3VUSuYbV9irEvsOLDNJSzh5tv7n0Hf7wjZ2z3-NA46loEgY4LUARM6NznTShDDhMozpVjKBBeRiii0JwxnIlRCE-EKlRgbG3A7qMk11SY0jMJ3b6E1RpmAxd_azu7k67dhl8fF0VgkumydkPKtOVhMl9VGWMAJi-OgWbKInjjgX97u34c2h8jtXbS-KGaquVTT6R_Gce8-utd5tfhjC8MHaMUWD9HtlueyeYTsnlpMa-ztZpf3icFZxmpRl75kLPZMFbic2RaQ2BlXg-EC_FOsjJq5WRnbqoJfuc-4w9pYVZVqsJqeg57qix-P0cmN9PwTtFqUhX2GsKZpbGxIiU1hfUcFB8fQ5YgD7likYjJC7_s-lrO2jIf04XfKZasRCRqRXiOyGaEdp4bhTVeC298oq3PZjWiZiCTOqGdNFUxnsTYJCJpqlRrNRARNbvRKlN28MJdXKB6hN8NjGNEuTKMKWy7ad1zmI4tH6Gmr80ES6pZ_IhQjxJfQsCTq8pPi-4WvGh5FIHGSQsObPXCu5LquLzYHcP1H1z2__l-_Ruvj46NDebg_OXiB7hBHpuz2s8gGWq2rhX0JHl6tX3XDCKOzmx65vwFdfWMM
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZKEa8D4s1CASPBiUab2E5sHxACyqqlUHGgUm_Gjp0WaUmWbFZV_hq_jrHzKCtQxaW3KMnGs55vPGPPC6EXVnCRGZpHznESMWFsJAoHhpwptC5cnKchQ-7zQbZ7yD4epUcb6NeQC-PDKoc1MSzUtsr9GfmUJh49gDgyLfqwiC87szeLn5HvIOU9rUM7jQ4i-649he3b8vXeDvD6JSGzD1_f70Z9h4EoZ5I0EZOmsAUzWhLLpC5yrRlnUshEJxTGklYwGWtpiPRFSqxLLZgc1BaGGhtbRuG7l9BlTqn04YT8iI_nO96DxhLZ5-nEVEyXoCt9PhthkSAsTaN2TReGlgH_snP_DtccfbY30LVVudDtqZ7P_1CLs1voZm_P4rcdAG-jDVfeQVe6DpftXeRmejVvcNCYfcYnBjMZ61VThWKxOPSowNXCdVDEXq1aDBdgmWJt9cKvx9jVNfzKf8aHaWNd17rFen4MXGlOftxDhxcy7_fRZlmV7iHChvLUupgSx2FnR6UAk9BnhwPiWKJTMkGvhjlWi66AhwqOdypUxxEFHFGBI6qdoHeeDeObvvh2uFHVx6qXZZXJLM1p6JcqmclTYzMglBvNrWEygSG3BiaqfkVYqjP8TtDz8THIsnfQ6NJVq-4dn_PI0gl60PF8pIT6jZ-M5QSJNTSskbr-pPx-EuqFJwlQnHEYeHsAzhld583F9giu_5i6R-f_62foKsir-rR3sP8YXSe-i7I_yCJbaLOpV-4JmHaNeRpkCKNvFy20vwGfTmCm
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELbKVgg48H4sFGQkbjTbxI_EPhbEqkKi4sCKcrLs2GkrliRKE6Hw6xk7ycJChegtiu14PB57PsfzQOiVFZlIDc0j5zISMWFsJAoHQM4UWhcuznnwkPtwnB6t2PsTfrKD0skXJhjth5CWYZuerMMOLkDReGcwwiJBGOdRv6htcQ3tphww-Aztro4_Hn7xmeQAo0QAE8joIRNTcUnjLS0UgvVfhjD_NpTc3JbeQje6stb9d71e_6aQlnfQ52kogx3K10XXmkX-448oj1cf6110e8So-HCoeQ_tuPI-uj5krewfILfU3brFQQuOXpwYoC_WXVuFALA45J3AVe0G8cJeVVoMD4A2sba69nssdk0DrfxnvOk11k2je6zXp1Vz3p59e4hWy3ef3h5FY7aGKGeStBGTprAFM1oSy6Qucq1ZxqSQiU4o7BTSCiZjLQ2RPuCLddwCfKO2MNTY2DL6CM3KqnRPEDY049bFlLgMTmtUCoB53uMbpIglmpM5ej3NnqqHoBwqXKZToQbmKWCeCsxT_Ry98RO8qekDaocXVXOqRqarVKY8pyEHqmQm58amQGhmdGYNkwl0uTeJhxpX-YWiid_RYGxQ_HJTDOvTX7ro0lXdUMf7MTI-R48HadpQQv1hTsZyjsSWnG2Rul1Snp-FGOBJAhSnGXS8P4nkL7r-xYv9jdj-B-ueXq36M3ST-PTI_g8V2UOztuncc8BsrXkxLtCfBrI9wg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fault+localization+for+automatic+train+operation+based+on+the+adaptive+error+locating+array+algorithm&rft.jtitle=Scientific+reports&rft.au=Zhang%2C+Yanpeng&rft.au=Cao%2C+Yuxiang&rft.date=2025-01-02&rft.pub=Nature+Publishing+Group+UK&rft.eissn=2045-2322&rft.volume=15&rft.issue=1&rft_id=info:doi/10.1038%2Fs41598-024-82455-y&rft.externalDocID=10_1038_s41598_024_82455_y
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2045-2322&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2045-2322&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2045-2322&client=summon