<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">61525</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.061525</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A Hierarchical Security Situation Assessment Approach for Train Control System under Cyber Attacks</article-title>
<alt-title alt-title-type="left-running-head">A Hierarchical Security Situation Assessment Approach for Train Control System under Cyber Attacks</alt-title>
<alt-title alt-title-type="right-running-head">A Hierarchical Security Situation Assessment Approach for Train Control System under Cyber Attacks</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Li</surname><given-names>Qichang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref><xref rid="cor1" ref-type="corresp">&#x002A;</xref><email>liqichang@rails.cn</email></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Bu</surname><given-names>Bing</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Zhao</surname><given-names>Junyi</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<aff id="aff-1"><label>1</label><institution>State Key Laboratory of Advanced Rail Autonomous Operation, Beijing Jiaotong University</institution>, <addr-line>Beijing, 100044</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Signal and Communication Research Institute, China Academy of Railway Sciences</institution>, <addr-line>Beijing, 100081</addr-line>, <country>China</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Qichang Li. Email: <email>liqichang@rails.cn</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>19</day><month>05</month><year>2025</year>
</pub-date>
<volume>83</volume>
<issue>3</issue>
<fpage>4281</fpage>
<lpage>4313</lpage>
<history>
<date date-type="received">
<day>26</day>
<month>11</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>27</day>
<month>2</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_61525.pdf"></self-uri>
<abstract>
<p>With the integration of informatization and intelligence into the Communication-Based Train Control (CBTC) systems, the system is facing an increasing number of information security threats. As an important method of characterizing the system security status, the security situation assessment is used to analyze the system security situation. However, existing situation assessment methods fail to integrate the coupling relationship between the physical layer and the information layer of the CBTC systems, and cannot dynamically characterize the real-time security situation changes under cyber attacks. In this paper, a hierarchical security situation assessment approach is proposed to address the security challenges of CBTC systems, which can perceive cyber attacks, quantify the security situation, and characterize the security situation changes under cyber attacks. Specifically, for the physical layer of CBTC systems, the impact of cyber attacks is evaluated with the train punctuality rate and train departure interval indicators. For the information layer of CBTC systems, the system vulnerabilities and system threats are selected as static level indicators, and the critical network characteristics are selected as dynamic level indicators to quantify the real-time security situation. Finally, the comprehensive security situation assessment value of the CBTC systems is obtained by integrating the physical and information layer indicators. Simulation results illustrate that the proposed approach can dynamically characterize the real-time security situation of CBTC systems, enhancing the ability to perceive and assess information security risks.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Transportation</kwd>
<kwd>train control system</kwd>
<kwd>cyber security</kwd>
<kwd>hierarchical security situation assessment</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>State Key Laboratory of Advanced Rail Autonomous Operation</funding-source>
<award-id>RAO2023ZZ004</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Beijing Natural Science Foundation-Fengtai Rail Transit Frontier Research Joint Fund</funding-source>
<award-id>L211002</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Foundation of China State Railway Group Corporation Limited</funding-source>
<award-id>L2021G003</award-id>
</award-group>
<award-group id="awg4">
<funding-source>Scientific and Technical Research Fund of China Academy of Railway Sciences Corporation Limited</funding-source>
<award-id>2021YJ094</award-id>
<award-id>I23L00200</award-id>
<award-id>I24F00010</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>Nowadays, more and more attention has been paid to the research on information security of train control system [<xref ref-type="bibr" rid="ref-1">1</xref>,<xref ref-type="bibr" rid="ref-2">2</xref>]. With the deep integration of urban rail transit informatization and intelligence, the threats faced by the train control system are gradually increasing, heightening the risk of information security. The train control system adopts the universal TCP/IP protocol stack, rendering them vulnerable to cyber attacks such as data spoofing and flood attacks. Moreover, it is difficult to achieve complete enclosed interconnection between the train control system and other information service systems, thus increasing the information security risks associated with train control system [<xref ref-type="bibr" rid="ref-3">3</xref>]. The occurrence of information security incidents could significantly impact critical infrastructure, including urban rail transit [<xref ref-type="bibr" rid="ref-4">4</xref>].</p>
<p>Situation awareness technology is a proactive information security technology that can identify potential information security threats and protect the CBTC systems from serious damage. Different from intrusion detection technology [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>], situation awareness technology includes not only the detection of cyber attack, but also the assessment of system security status and the prediction of system security evolution trends [<xref ref-type="bibr" rid="ref-7">7</xref>]. Assessing the security situation of the system is the key to the application of situation awareness technology [<xref ref-type="bibr" rid="ref-8">8</xref>]. However, traditional situation assessment methods suffer from two main drawbacks. First, current situation awareness methods mainly establish static models to assess the system situation (e.g., assess the current security situation), but cannot dynamically characterize real-time situation variations under cyber attacks. Second, the network situation assessment methods do not take advantage of the coupling relationship between the physical layer and the information layer of the CBTC systems, and some inherent characteristics of the CBTC systems are not considered, such as redundant network structures and fail-safe mechanisms [<xref ref-type="bibr" rid="ref-9">9</xref>]. For instance, the system operates with a fixed line cycle, resulting in stable data characteristics. And the system operates 24/7 without interruption, leaving no extra time to update the situation assessment model. Besides, the fail-safe mechanisms will cover up the equipment failures caused by the cyber attacks, making it impossible to assess the real security situation.</p>
<p>Therefore, this paper proposes the hierarchical security situation assessment approach to address the situation assessment challenges within CBTC systems. The proposed assessment approach can dynamically characterize the information security situation from both the information and physical layers of CBTC systems, and utilize the inherent coupling relationship between the two layers to achieve a comprehensive security situation assessment. To the best of our knowledge, this is the first work discussing the application of a hierarchical security situation assessment approach for CBTC systems. The contributions of the paper are as follows:
<list list-type="bullet">
<list-item>
<p>In view of the challenges faced by current situation assessment methods, a hierarchical security situation assessment approach is proposed. The hierarchical security situation assessment approach can perceive cyber attacks in real-time and characterize the security situation changes under cyber attacks. Specifically, by analyzing the impact of cyber attacks on the physical layer of the train control system, quantifying the changes in the situation indicators of the information layer under cyber attacks, integrating the situation assessment indicators of the physical layer and information layer of the CBTC systems, the coupling relationship between the assessment indicators is established, and the comprehensive security situation assessment value is obtained.</p></list-item>
<list-item>
<p>In order to dynamically perceive the cyber attacks and reflect the real-time situation variations of CBTC systems, an improved generative adversarial network based artificial immune system (GAN-AIS) is exploited by our approach. Specifically, the changes in antibody concentration of GAN-AIS are used to characterize the dynamic security situation variations of the CBTC systems. The network characteristics are used for immune learning and self-updating, and the GAN neural network is used to balance the antibody population and rapidly clone effective antibodies.</p></list-item>
</list></p>
<p>The rest of this paper is organized as follows. <xref ref-type="sec" rid="s2">Section 2</xref> provides the research background and related studies of the situation assessment approach. <xref ref-type="sec" rid="s3">Section 3</xref> describes the comprehensive architecture and the detailed mechanism design. The performance of the proposed approach is simulated and verified in <xref ref-type="sec" rid="s4">Section 4</xref>. The results and discussion are introduced in <xref ref-type="sec" rid="s5">Section 5</xref>. And the conclusion is described in <xref ref-type="sec" rid="s6">Section 6</xref>.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Background and Literature Review</title>
<p>This section provides background knowledge on artificial immune system and GAN neural network. Moreover, the related works for situation assessment are also discussed.</p>
<sec id="s2_1">
<label>2.1</label>
<title>Artificial Immune System</title>
<p>Artificial immunity is an advanced technology inspired by the theory of natural immunity and follows the principle of natural immunity. It has made remarkable achievements in the field of information security and cyber attack recognition [<xref ref-type="bibr" rid="ref-10">10</xref>]. Artificial immune system can achieve the system security situation awareness without prior knowledge, and continuously enhance its perception performance by the designed evolutionary mutation mechanisms, to perceive the security situation dynamically and accurately, and ensure the safe operation of the system.</p>
<p>The artificial immune system possesses the characteristics of self-learning, self-organization, self-adaptation, highly distributed and long-term memory [<xref ref-type="bibr" rid="ref-11">11</xref>]. Generally, the immune mechanism can be divided into three main stages. The first is the process of immune cells from immaturity to maturity, known as self-tolerance. The second is the process of immune response, in which immune cells match with antigens and form immune memory. The third is the immune feedback process, the specific antibodies are generated and the immune process can be regulated.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>GAN</title>
<p>GAN is a deep neural network that has been widely used in the field of data learning and data generation [<xref ref-type="bibr" rid="ref-12">12</xref>]. The standard GAN is composed of generator <italic>G</italic> and discriminator <italic>D</italic>, the instance samples are generated by the generator and mixed with the real samples, and then randomly sent to the discriminator to distinguish whether the data is real or comes from <italic>G</italic>. Similar to the adversarial mechanism, optimization objectives, and the dynamic learning process of reinforcement learning [<xref ref-type="bibr" rid="ref-13">13</xref>,<xref ref-type="bibr" rid="ref-14">14</xref>], the core of the GAN network is the adversarial process between the generator <italic>G</italic> and the discriminator <italic>D</italic>. For the training process of GAN, the purpose of the generator is to fit the distribution of real samples, so that the discriminator cannot discern real samples or fake data. Through iterative training and optimization, the Nash balance is achieved. During the training process, the parameters of the generator <italic>G</italic> and the discriminator <italic>D</italic> are continuously adjusted to achieve better generation effects through dynamic learning. The objective function of GAN can be expressed as
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:munder><mml:mrow><mml:mo form="prefix">min</mml:mo></mml:mrow><mml:mi>G</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:munder><mml:mrow><mml:mo form="prefix">max</mml:mo></mml:mrow><mml:mi>D</mml:mi></mml:munder><mml:mo>&#x2061;</mml:mo><mml:mi>V</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>G</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x223C;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>D</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>z</mml:mi><mml:mo>&#x223C;</mml:mo><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>D</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>where <italic>D</italic> and <italic>G</italic> are discriminator and generator, respectively. <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:mi>x</mml:mi></mml:math></inline-formula> is the sample data, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:mi>z</mml:mi></mml:math></inline-formula> is the random noise. <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the real data distribution, and <inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the latent space distribution.</p>
<p>By learning the distribution of real data, GAN can be used to solve the problem of imbalanced data distribution and data generation. In an artificial immune system, the clone selection of specific antibodies is critical for the evolution and variation of antibody populations. Based on the GAN model, the mature antibody vectors are selected and learned, then the generated antibodies are added to the antibody population, enabling the artificial immune system to benefit from a richer population.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Literature Review</title>
<p>For the IT network, Yu [<xref ref-type="bibr" rid="ref-15">15</xref>] propose a multi-objective decision method for network security situation grade assessment. The method first defines membership functions of attribute eigenvalue grades, trust transmission methods, multi-path trust integration, and further establishes a multi-objective decision grade assessment optimization model to obtain the network security situation grades. Wang et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] propose a network security information analysis and network security situation (NSS) model based on data mining, the model cannot only detect network security threats but also evaluate the network security situation with system security indicators. Specifically, the threat data are classified and the risk measurement is conducted. Then the security of each type of threat is measured according to the information characteristics of network attacks. Finally, according to different attack motivations, different evaluation methods are used to obtain comprehensive situation assessment results. Du et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] propose a network security situation assessment model in the SDN environment. The situation elements are mapped to the layers of back propagation (BP) neural network, and the weights and thresholds of the BP neural network are optimized by the cuckoo search algorithm. Specifically, the situation indicators are used as the input data for the BP neural network, and the value of the output layer is the result of the evaluation. Guo et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] propose a defensive random game model, which first analyzes the threat propagation process, establishes the threat propagation-access relationship network, and then designs a random game model of the threat action and protection strategy game. The random game model is used to quantify the network security situation. Yang et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] propose a situation assessment model based on unsupervised learning. The paper applies the variational autoencoder (VAE) and GAN for data feature information extracting and error threshold calculation. Then the situation value is calculated based on the threat probability and threat impact. Specifically, the threat probability is obtained from the test results of each test, and the threat impact is defined by the Common Vulnerability Scoring System (CVSS). Wang et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] propose a network security situation assessment framework based on analytic hierarchy process (AHP). The indicators of basic operation, threat, vulnerability, and asset breakage are considered to establish the assessment model. Three indexes of risk situation, the system operation, and the damage degree are discussed, and the weight factors of the evaluation index are assigned by the AHP process. In the aforementioned research, mathematical models are established to assess the network security situation. However, most of these models adopt subjective evaluation methods or neural network models. Such models are heavily weighted towards subjective factors and lack interpretability. Furthermore, these models analyze the impact of cyber attacks from the network perspective, such as assessing the security risks of the system and obtaining the network security situation value. However, these models do not consider the impact of attacks on the industrial systems operation and cannot be directly applied to train control systems.</p>
<p>For the industrial control systems, Zhang et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] propose a new security situation awareness method for the power grid. First, the power grid security situation evaluation indicators are selected, and then the power grid security situation risks are quantified and divided into different security risk levels. Finally, the power grid security situation prediction model based on deep learning is constructed and the security situation awareness prediction results are verified. Zhang et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] propose a combination active-passive risk source identification method for the terminal area control system, which includes 19 secondary indicators and 3 primary indicators. Then the sparrow search algorithm (ISSA)-extreme learning machine (ELM) framework is used for risk probability prediction. Finally, the overall risk probability obtained by the Bayesian theory and evaluation weight are used to obtain the overall situation assessment value. Zhao et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] propose a wavelet neural network analysis method to obtain the security situation value. The network and control characteristics such as security monitoring, security alarms, security analysis, security audits, and security verification information are selected as indicators. Then the indicators are selected as the sampled dataset to train the wavelet neural network model, and the security situation value of the power control system is set as the output. Li et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] propose a network security situation assessment method for industrial control networks. The information in the sparse data is extracted by the stack autoencoder and the data dimensionality is reduced. The nonlinear mapping relationship of the network status is fitted through the RBF network, and the security situation assessment value of the industrial control network is calculated. However, the above methods do not consider how the security situation of the industrial control system changes when cyber attacks are introduced. Lei et al. [<xref ref-type="bibr" rid="ref-25">25</xref>] propose a smart grid security situation awareness algorithm based on deep reinforcement learning. The situation elements such as network port traffic information, alarm events in the system logs, node vulnerabilities, and known attacks are acquired for situation assessment. The integrated edge computing and deep reinforcement learning method can minimize processing costs on the premise of minimizing attack detection error rates. However, the proposed algorithm evaluates the system security situation solely based on detection metrics, such as detection rate and false alarm rate. Real-time dynamic security situation assessment methods still require further optimization and research.</p>
<p>For the cyber-physical transportation systems (CTS), Yu et al. [<xref ref-type="bibr" rid="ref-26">26</xref>] conducted a comprehensive analysis of the security threats, attack mechanisms, and defense measures of cyber-physical systems from three dimensions: physical domain, cyber domain, and cyber-physical domain. Cyber-physical systems is an important part of Industry 4.0 and faces many security threats, the article discusses the challenges and future directions of current research. Alsulami et al. [<xref ref-type="bibr" rid="ref-27">27</xref>] propose a transfer learning based intelligent intrusion detection system for autonomous vehicle-cyber physical systems. The actual position and actual speed of the autonomous vehicle, the actual position and actual speed of the preceding vehicle, these one-dimensional data are converted into two-dimensional images for input into the pre-trained convolutional neural network (CNN) model. Then the intelligent intrusion detection system using the CNN model to detect the cyberattacks targeting the physical components of an autonomous vehicle through controller area network (CAN). Abdo et al. [<xref ref-type="bibr" rid="ref-28">28</xref>] propose a comprehensive connected and automated transportation system (CATS) cybersecurity research framework that covers multiple levels from individual vehicles to transportation networks, and emphasizes the importance of threat analysis and risk assessment (TARA) tools in cybersecurity research. Specifically, TARA assesses the likelihood and impact of cyber attacks and combines them to derive the CATS risks. The TARA method includes both qualitative and quantitative methods, the qualitative method relies on expert experience to assess network risk, while the quantitative method is based on probability theory and statistical models to assess the likelihood of threats and risks. The above studies introduced the security issues and security assessment methods faced by different transportation modes. However, some security assessment methods are highly subjective and lack a dynamic security assessment process to deal with cyber threats.</p>
<p>In recent years, there have been few studies on situation assessment for CBTC systems. Lu et al. [<xref ref-type="bibr" rid="ref-29">29</xref>] propose a resilience-based security assessment method based on structural information entropy to measure the security level of CBTC systems. The two-dimensional structure entropy is used to evaluate the performance of the cyber domain, and the impact of cyber attacks on the physical domain of the CBTC systems is calculated according to the timetable and running states. The resilience metrics considering both the cyber domain and physical domain are used to analyze the security level of CBTC systems. Kang et al. [<xref ref-type="bibr" rid="ref-30">30</xref>] propose a multi-dimensional Gaussian hidden Markov model approach to quantify the situation awareness value of CBTC systems. The information features, including CPU usage, RAM usage, disk access rate, and network rate, are considered, and an integrated situation awareness value for CBTC systems is derived using entropy weights. However, the research does not closely integrate with the characteristics of the CBTC systems, and it fails to explore the changes in the information security situation when the system suffered cyber attacks. In this paper, we propose a hierarchical security situation assessment approach that combines physical layer and information layer indicators to quantify the security situation under cyber attacks, and the real-time comprehensive security situation assessment value is calculated through the evaluation indicators from both dynamic and static aspects.</p>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Hierarchical Security Situation Assessment Approach</title>
<p>In this section, we first provide the general structure of our hierarchical security situation assessment approach. Then, we describe the situation assessment approach in detail.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Overall Architecture</title>
<p>As a typical cyber-physical system, CBTC systems integrate physical processes with computing systems, incorporating controllers, actuators, and sensors. Train operations in the physical environment are governed by a computing and communication network, which relies on multi-source sensors for data acquisition. The CBTC architecture is generally divided into two primary layers: the physical layer and the information layer [<xref ref-type="bibr" rid="ref-31">31</xref>]. As depicted in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the physical layer encompasses the state and actions of trains, components, devices, and sensors. The information layer achieves communication and control signal exchange between critical devices such as the zone controller (ZC), computer interlocking (CI), automatic train supervision (ATS), database storage unit (DSU), access point (AP), and vehicle onboard controller (VOBC). This hierarchical structure ensures efficient interaction between the physical and information layers of the system.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>The general structure of CBTC systems</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-1.tif"/>
</fig>
<p>The purpose of CBTC systems is to ensure the safe and efficient operation of trains. The physical layer primarily focuses on the acceleration, speed, and location of the train, as well as the observation of the physical characteristics such as train speed and train location. The information layer is mainly concerned with communication and information exchange between the train and the ground. For example, the ZC calculates the correct movement authorization (MA) and sends it to the VOBC of the train through the train-ground network. Cyber attacks do not directly damage the physical characteristics of trains but can indirectly disrupt normal operations through the communication network. For instance, a DoS attack can obstruct the normal communication between trains and the ground, while a data tampering attack can manipulate MA information transmitted between trains and the ground. The results of cyber attacks may lead to anomalies in the physical layer of the system. Therefore, when conducting situation assessment, it is not only necessary to quantify security situation of the information layer under cyber attacks but also consider its impact on the physical layer of the system.</p>
<p>The general structure of the hierarchical security situation assessment approach is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>. For the physical layer, the impact of cyber attacks on the system is discussed. Specifically, the train punctuality rate and train departure interval are used to evaluate the impact of cyber attacks on the physical layer. For the information layer, the system vulnerabilities, system threats and network characteristics are the main aspects that need to be assessed and quantified. The specific indicators for each aspect are listed and discussed later.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>The general structure of hierarchical security situation assessment approach</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-2.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Situation Assessment for the Physical Layer of CBTC Systems</title>
<p>In this section, the train control model is established and the Kalman filter method is used to obtain train state observations. The classical Kalman filter method has uncertain observation errors under cyber attacks. Therefore, we first establish the attack model and then introduce the unscented Kalman filter to estimate the train state under cyber attacks. Then, we calculate the changes in the train punctuality rate and departure interval based on the train state observations. Finally, the quantitative impact of cyber attacks on the physical layer of the train control system can be calculated.</p>
<sec id="s3_2_1">
<label>3.2.1</label>
<title>Train Control Model</title>
<p>We assume that the train control system is discrete and linear time-invariant, and the control model can be expressed as
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the train state vector, <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the system input vector, <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the system observation vector. <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mrow><mml:msub><mml:mi>W</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x223C;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mi>Q</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is zero-mean Gaussian random process noise. <italic>A</italic> and <italic>B</italic> are the system parameter matrix, <italic>C</italic> is the feedback gain matrix. The parameter matrix <italic>A</italic>, <italic>B</italic>, and <italic>C</italic> can be calculated according to the train dynamics equation.</p>
<p>The train dynamics equation can be expressed as
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>u</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:math></inline-formula>, <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:math></inline-formula>, and <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mi>i</mml:mi></mml:msubsup></mml:math></inline-formula> represent the location, velocity, and acceleration of the <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>i</mml:mi></mml:math></inline-formula>th train at the time <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>k</mml:mi></mml:math></inline-formula>, respectively, <italic>T</italic> is the data transmission cycle of VBOC and ZC.</p>
<p>The train state vector <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and system input vector <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can be expressed as
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>x</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is the state vector of train <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>i</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> are the deviation of tracking interval and train speed, respectively. <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:mrow><mml:msup><mml:mi>V</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> represent the optimal tracking interval and train speed. <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is the acceleration generated by train traction and braking of train <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>i</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>n</mml:mi></mml:math></inline-formula> is the number of trains.</p>
<p>Then the train dynamics equation can be rewritten as
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>s</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>&#x03B4;</mml:mi><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msubsup><mml:mi>u</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>According the <xref ref-type="disp-formula" rid="eqn-4">Eqs. (4)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-9">(9)</xref>, the parameter matrix <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>B</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>, and <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> can be calculated as
<disp-formula id="eqn-10a"><label>(10a)</label><mml:math id="mml-eqn-10a" display="block"><mml:mrow><mml:msub><mml:mi>a</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>T</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mi>T</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-10b"><label>(10b)</label><mml:math id="mml-eqn-10b" display="block"><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
<disp-formula id="eqn-10c"><label>(10c)</label><mml:math id="mml-eqn-10c" display="block"><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:msup><mml:mrow><mml:mtext mathvariant="bold">c</mml:mtext></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mtext mathvariant="bold">i</mml:mtext></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">0</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">c</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the control output generated based on the distance to train <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>i</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> and the speed of train <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>i</mml:mi></mml:math></inline-formula>.</p>
<p>According to the principle of train dynamics, the observation equation can be expressed as
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>y</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi>y</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mrow><mml:mrow><mml:mtext>T</mml:mtext></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the system observation vector, and <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:msubsup><mml:mi>y</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>v</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula> is the observed position and speed information of the train. The measurement matrix <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:mi>H</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mtext mathvariant="bold">R</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is a block diagonal matrix and <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></inline-formula>. <inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x223C;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:msup><mml:mi>&#x03C3;</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is zero-mean Gaussian random observation noise.</p>
</sec>
<sec id="s3_2_2">
<label>3.2.2</label>
<title>The Train State Observation</title>
<p>The CBTC systems can be regarded as a discrete-time linear dynamic system and its noise term conforms to the Gaussian distribution. Under the premise that the system is observable, the Kalman filter is the optimal linear estimator that can minimize the mean square state error. The Kalman filter is an online estimator, and each iteration consists of a prediction step and a measurement value update step.</p>
<p>The first stage of the Kalman filter is the prediction stage, which estimates the current state based on the state estimate and input at the previous moment. This stage mainly calculates the state prediction and error covariance prediction, where the state prediction can be expressed as
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the state at time <inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:mi>k</mml:mi></mml:math></inline-formula> predicted based on the estimated state value <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> at time <inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> and the input <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>The error covariance prediction <inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> can be expressed as
<disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mi>A</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mi>Q</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the predicted state estimation error covariance, represents the uncertainty of the predicted state <inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, and <italic>Q</italic> represents the process noise covariance.</p>
<p>The second stage is the update stage. After obtaining the observation value <inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the predicted state and the actual observation are combined in the update stage to obtain a more accurate posterior state estimate. The Kalman gain can be expressed as
<disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msup><mml:mi>H</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mi>R</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> determines the weight between the predicted state and the observation. The larger <inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is, the greater the importance of the observation. The smaller <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is, the greater the importance of the prediction. <italic>H</italic> is the observation matrix, and <italic>R</italic> is the observation noise covariance.</p>
<p>The state update <inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> can be expressed as
<disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represents the error between the observed value and the predicted value, and <inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the updated state estimate.</p>
<p>The error covariance update can be expressed as
<disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>I</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <italic>I</italic> is the unit matrix. <inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> reflects the uncertainty of the updated state. After the update, the error covariance decreases because the introduction of the observed value reduces the uncertainty of the state.</p>
</sec>
<sec id="s3_2_3">
<label>3.2.3</label>
<title>The Unscented Kalman Filter</title>
<p>When the train control system is suffered by a cyber attack, the system observation equation may deviate. For example, a deviation in the observed position of the train may lead to inaccurate calculation of the movement authorization, resulting in emergency braking or stopping of the train. In that case, the classical Kalman filter will overestimate or underestimate the covariance matrix of the system, causing the state estimate to deviate from the actual value, and making it difficult for the classical Kalman filter to provide accurate state estimation. Therefore, the unscented Kalman filter (UKF) is introduced to estimate the train state under cyber attack.</p>
<p>The unscented Kalman filter is a nonlinear filtering method that nonlinearly maps the distribution of the state (approximately represented by the Sigma point) to the observation space through the observation equation to obtain the approximate statistical characteristics of the observation distribution. The calculation steps can be expressed as
<list list-type="order">
<list-item>
<p><italic>Initialization</italic> We initialize the state vector <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and state error covariance matrix <inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, which can be denoted as
<disp-formula id="eqn-17"><label>(17)</label><mml:math id="mml-eqn-17" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-18"><label>(18)</label><mml:math id="mml-eqn-18" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>E</mml:mi><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</list-item>
<list-item>
<p><italic>Sigma point generation</italic> At time <inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:mi>t</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mn>2</mml:mn><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> Sigma points are generated for the state vector <inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and covariance <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. It can be denoted as
<disp-formula id="eqn-19"><label>(19)</label><mml:math id="mml-eqn-19" display="block"><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msqrt></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mi>N</mml:mi></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msqrt><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:msqrt></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
And the weights of each Sigma point can be expressed as
<disp-formula id="eqn-20"><label>(20)</label><mml:math id="mml-eqn-20" display="block"><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mstyle></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mstyle displaystyle="true" scriptlevel="0"><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>2</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo>,</mml:mo></mml:mstyle></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mi>N</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:math></disp-formula>
where <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>n</mml:mi></mml:math></inline-formula> is the state dimension and <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is the scaling parameter.</p></list-item>
<list-item>
<p><italic>State prediction</italic> For each Sigma point, the Sigma point at the next moment is predicted by the state equation, that is
<disp-formula id="eqn-21"><label>(21)</label><mml:math id="mml-eqn-21" display="block"><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mi>B</mml:mi><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>
Then the state prediction value and covariance are
<disp-formula id="eqn-22"><label>(22)</label><mml:math id="mml-eqn-22" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-23"><label>(23)</label><mml:math id="mml-eqn-23" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>Q</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
<list-item>
<p><italic>Observation prediction</italic> The observation value of the Sigma point is predicted by the observation equation, that is
<disp-formula id="eqn-24"><label>(24)</label><mml:math id="mml-eqn-24" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>Y</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-25"><label>(25)</label><mml:math id="mml-eqn-25" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>Y</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>Y</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>R</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-26"><label>(26)</label><mml:math id="mml-eqn-26" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:msubsup><mml:mi>Y</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
<list-item>
<p><italic>State estimate update</italic> The state estimate can beupdated using Kalman gain, which can be expressed as
<disp-formula id="eqn-27"><label>(27)</label><mml:math id="mml-eqn-27" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-28"><label>(28)</label><mml:math id="mml-eqn-28" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-29"><label>(29)</label><mml:math id="mml-eqn-29" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>K</mml:mi><mml:mi>k</mml:mi><mml:mi>T</mml:mi></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p></list-item>
</list></p>
</sec>
<sec id="s3_2_4">
<label>3.2.4</label>
<title>The Train State Observation under Cyber Attacks</title>
<p>If a data tampering attack is launched at time <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>, the system observation equation can be modeled as
<disp-formula id="eqn-30"><label>(30)</label><mml:math id="mml-eqn-30" display="block"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>b</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> represents the bias term caused by the data tampering attack, and <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the indicator function, indicating that the tampering attack is triggered at time <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>.</p>
<p>If a denial of service (DoS) attack occurs at time <inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>, the system observation equation can be modeled as
<disp-formula id="eqn-31"><label>(31)</label><mml:math id="mml-eqn-31" display="block"><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:msub><mml:mi>D</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mtext>diag</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents a diagonal matrix of <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mn>0</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:mn>1</mml:mn></mml:math></inline-formula>. If an attack occurs, <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, indicating that the corresponding observation is invalid, and the associated communication channel is interrupted. Otherwise, <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. Note that at time <inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:mi>k</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mi>D</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>.</p>
<p>In the case of data tampering attack, the Sigma points in the state space of the system are projected into the observation space through the observation equation, generating a set of Sigma points corresponding to the observation space. This can be expressed as
<disp-formula id="eqn-32"><label>(32)</label><mml:math id="mml-eqn-32" display="block"><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mi>H</mml:mi><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mrow><mml:mtext>I</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula></p>
<p>Thus, the observation equation can be expressed as
<disp-formula id="eqn-33"><label>(33)</label><mml:math id="mml-eqn-33" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>The observation error covariance and state-observation covariance are
<disp-formula id="eqn-34"><label>(34)</label><mml:math id="mml-eqn-34" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>R</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-35"><label>(35)</label><mml:math id="mml-eqn-35" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The state estimation can be updated using the Kalman gain, that is
<disp-formula id="eqn-36"><label>(36)</label><mml:math id="mml-eqn-36" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:msubsup><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-37"><label>(37)</label><mml:math id="mml-eqn-37" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-38"><label>(38)</label><mml:math id="mml-eqn-38" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:msubsup><mml:mi>K</mml:mi><mml:mi>k</mml:mi><mml:mi>T</mml:mi></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>In the case of denial-of-service (DoS) attack, the Sigma points of the system state, that is, the sample points in the state space, can be projected into the observation space through the observation equation, generating a set of Sigma points corresponding to the observation space. That is
<disp-formula id="eqn-39"><label>(39)</label><mml:math id="mml-eqn-39" display="block"><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>H</mml:mi><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>Thus, the observation equation can be expressed as
<disp-formula id="eqn-40"><label>(40)</label><mml:math id="mml-eqn-40" display="block"><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup></mml:math></disp-formula></p>
<p>The observation error covariance and state-observation covariance are denoted as
<disp-formula id="eqn-41"><label>(41)</label><mml:math id="mml-eqn-41" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup><mml:mo>+</mml:mo><mml:msub><mml:mi>D</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>R</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msubsup><mml:mi>D</mml:mi><mml:mi>k</mml:mi><mml:mi>T</mml:mi></mml:msubsup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-42"><label>(42)</label><mml:math id="mml-eqn-42" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:msub><mml:mi>Y</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>n</mml:mi></mml:mrow></mml:munderover><mml:msubsup><mml:mi>&#x03C9;</mml:mi><mml:mi>m</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03C7;</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:msubsup><mml:mi>&#x03B3;</mml:mi><mml:mi>k</mml:mi><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>i</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msubsup><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>Y</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>Similarly, the state estimate <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> can be updated using the Kalman gain <inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>.</p>
</sec>
<sec id="s3_2_5">
<label>3.2.5</label>
<title>The Impact of Cyber Attacks on the Physical Layer</title>
<p>The state estimate <inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> obtained using the unscented Kalman filter can be used to calculate the actual running time of the train. The train state deviation under cyber attack is defined as the difference between the estimated state and the true state, that is
<disp-formula id="eqn-43"><label>(43)</label><mml:math id="mml-eqn-43" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>X</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:msub><mml:mrow><mml:mover><mml:mi>v</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>The components of the state deviation <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> are the position deviation <inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> and the velocity deviation <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, which can be expressed as
<disp-formula id="eqn-44"><label>(44)</label><mml:math id="mml-eqn-44" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>s</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-45"><label>(45)</label><mml:math id="mml-eqn-45" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>v</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>k</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The train delay time caused by the attack can be expressed as
<disp-formula id="eqn-46"><label>(46)</label><mml:math id="mml-eqn-46" display="block"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>k</mml:mi></mml:math></inline-formula> represents the time steps and <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:msub><mml:mi>N</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> represents the sum of the time steps of the train operation. That is, the time required for a train to travel from one station to the next is divided into <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:msub><mml:mi>N</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula> discrete time steps.</p>
<p>Based on the train delay time, the train punctuality rate and the train departure interval can be calculated, which are key indicators for analyzing the system&#x2019;s availability. The train control system relies on a large amount of real-time data (such as train location, speed, signal status, etc.) to dispatch and control train operations. Once the train control system suffers from a cyber attack, train data may be tampered with or lost, causing train delays and reducing train punctuality. The train punctuality rate can be defined as
<disp-formula id="eqn-47"><label>(47)</label><mml:math id="mml-eqn-47" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:msub><mml:mi>N</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mn>100</mml:mn><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-48"><label>(48)</label><mml:math id="mml-eqn-48" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mfrac><mml:mrow><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mfrac><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-84"><mml:math id="mml-ieqn-84"><mml:mo fence="false" stretchy="false">&#x230A;</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo fence="false" stretchy="false">&#x230B;</mml:mo></mml:math></inline-formula> represents the floor function (rounding down). <inline-formula id="ieqn-85"><mml:math id="mml-ieqn-85"><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>o</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the threshold for determining delays, usually set to 3 min. <inline-formula id="ieqn-86"><mml:math id="mml-ieqn-86"><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:math></inline-formula> represents the number of delays exceeding the threshold, determined as the number of delayed trains. <inline-formula id="ieqn-87"><mml:math id="mml-ieqn-87"><mml:msub><mml:mi>N</mml:mi><mml:mi>z</mml:mi></mml:msub></mml:math></inline-formula> represents the total number of trains operated.</p>
<p>The train departure interval is an important indicator to measure the efficiency of train services. Once a train suffers from a cyber attack, the train will be delayed and the train departure interval will increase, thus affecting the overall information security of the train control system. The train departure interval can be defined as
<disp-formula id="eqn-49"><label>(49)</label><mml:math id="mml-eqn-49" display="block"><mml:mi>I</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>t</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:munderover><mml:mrow><mml:mo>|</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>|</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-88"><mml:math id="mml-ieqn-88"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> indicates the departure time of train <inline-formula id="ieqn-89"><mml:math id="mml-ieqn-89"><mml:mi>k</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> in the train timetable, <inline-formula id="ieqn-90"><mml:math id="mml-ieqn-90"><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> represents the departure time of train <inline-formula id="ieqn-91"><mml:math id="mml-ieqn-91"><mml:mi>i</mml:mi></mml:math></inline-formula> in the train timetable, <inline-formula id="ieqn-92"><mml:math id="mml-ieqn-92"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>T</mml:mi><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the delay time of the current train <inline-formula id="ieqn-93"><mml:math id="mml-ieqn-93"><mml:mi>i</mml:mi></mml:math></inline-formula>. <inline-formula id="ieqn-94"><mml:math id="mml-ieqn-94"><mml:msub><mml:mi>N</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:math></inline-formula> represents the total number of trains observed within the statistical period.</p>
<p>In summary, from the perspective of the physical layer, the total impact of cyber attack <inline-formula id="ieqn-95"><mml:math id="mml-ieqn-95"><mml:msub><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:math></inline-formula>, which consists of <italic>R</italic> and <italic>I</italic>, can be expressed as
<disp-formula id="eqn-50"><label>(50)</label><mml:math id="mml-eqn-50" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>R</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22C5;</mml:mo><mml:mi>I</mml:mi></mml:math></disp-formula>where <inline-formula id="ieqn-96"><mml:math id="mml-ieqn-96"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-97"><mml:math id="mml-ieqn-97"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> represent the weights of train punctuality rate and train departure interval, respectively.</p>
</sec>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Situation Assessment for the Information Layer of CBTC Systems</title>
<p>In our hierarchical security situation assessment approach, system vulnerabilities, system threats, and network characteristics are used to quantify the security situation of the information layer. The specific indicators are discussed in detail.</p>
<sec id="s3_3_1">
<label>3.3.1</label>
<title>System Vulnerability Analysis</title>
<p>The vulnerability analysis is to assess the changes in the security situation caused by the exposure of system vulnerabilities. Vulnerabilities exist in both the host nodes and system services, and attackers can exploit these vulnerabilities to launch attacks. Specifically, known and unknown vulnerabilities are discussed separately, and an integrated vulnerability evaluation method is proposed.</p>
<p>The probability of successfully implementing an attack is considered to be the probability that the vulnerability is exploited [<xref ref-type="bibr" rid="ref-32">32</xref>]. And the probability of successful exploitation of a vulnerability can be described from the aspects of attack vector (<inline-formula id="ieqn-98"><mml:math id="mml-ieqn-98"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi></mml:math></inline-formula>), attack complexity (<inline-formula id="ieqn-99"><mml:math id="mml-ieqn-99"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula>), privileges required (<inline-formula id="ieqn-100"><mml:math id="mml-ieqn-100"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi></mml:math></inline-formula>), user interaction (<inline-formula id="ieqn-101"><mml:math id="mml-ieqn-101"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>U</mml:mi><mml:mi>I</mml:mi></mml:math></inline-formula>), and <inline-formula id="ieqn-102"><mml:math id="mml-ieqn-102"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>x</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. It can be denoted as
<disp-formula id="eqn-51"><label>(51)</label><mml:math id="mml-eqn-51" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>U</mml:mi><mml:mi>I</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-52"><label>(52)</label><mml:math id="mml-eqn-52" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msup><mml:mi>k</mml:mi><mml:mi>&#x03B1;</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mi>&#x03B1;</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-103"><mml:math id="mml-ieqn-103"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-104"><mml:math id="mml-ieqn-104"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-105"><mml:math id="mml-ieqn-105"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-106"><mml:math id="mml-ieqn-106"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>U</mml:mi><mml:mi>I</mml:mi></mml:math></inline-formula> are the exploitability subscores obtained from CVSS, respectively. <inline-formula id="ieqn-107"><mml:math id="mml-ieqn-107"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the statistical distribution of vulnerability exploit probability, characterized by the Pareto distribution [<xref ref-type="bibr" rid="ref-33">33</xref>]. <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>x</mml:mi></mml:math></inline-formula> denotes the age of vulnerability <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and both <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>k</mml:mi><mml:mo>=</mml:mo><mml:mn>0.00161</mml:mn></mml:math></inline-formula> and <inline-formula id="ieqn-111"><mml:math id="mml-ieqn-111"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.26</mml:mn></mml:math></inline-formula> are constants.</p>
<p>The severity of system host and service vulnerabilities depends on when the vulnerabilities are discovered. Generally, the longer the vulnerability exists, the smaller the impact weights, because these vulnerabilities can be analyzed and patched over time. For the known vulnerabilities, the Common Vulnerability Scoring System (CVSS) is introduced to quantify the vulnerability impact, and the natural logarithm is used to control the magnitude of variables. The vulnerability impact degree of known vulnerabilities is expressed as
<disp-formula id="eqn-53"><label>(53)</label><mml:math id="mml-eqn-53" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>10</mml:mn><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>V</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>A</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-112"><mml:math id="mml-ieqn-112"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>V</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the total number of known vulnerabilities, <inline-formula id="ieqn-113"><mml:math id="mml-ieqn-113"><mml:mrow><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the parameter that controls how fast the factor decays, <inline-formula id="ieqn-114"><mml:math id="mml-ieqn-114"><mml:mi>A</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x22C5;</mml:mo><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the time (days) of vulnerabilities existence, <inline-formula id="ieqn-115"><mml:math id="mml-ieqn-115"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the CVSS scores of vulnerability <inline-formula id="ieqn-116"><mml:math id="mml-ieqn-116"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>.</p>
<p>The unknown vulnerabilities are those that already exist but have not been exposed. For the unknown vulnerabilities, the probability of vulnerability exposure can be estimated [<xref ref-type="bibr" rid="ref-34">34</xref>]. Generally, the more vulnerabilities there are in a period, the greater the probability of vulnerabilities in the later period. The Bayesian theorem is used to calculate the probability of unknown vulnerability exposure according to the statistical probability of vulnerability exposure over a certain period of time [<xref ref-type="bibr" rid="ref-35">35</xref>]. The calculation is expressed as
<disp-formula id="eqn-54"><label>(54)</label><mml:math id="mml-eqn-54" display="block"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>B</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-117"><mml:math id="mml-ieqn-117"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the statistical average probability of industry vulnerability exposure, <inline-formula id="ieqn-118"><mml:math id="mml-ieqn-118"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>B</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the probability of vulnerability exposure statistics in the past period, <inline-formula id="ieqn-119"><mml:math id="mml-ieqn-119"><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>B</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the statistical probability of new vulnerabilities caused by previous vulnerabilities [<xref ref-type="bibr" rid="ref-36">36</xref>].</p>
<p>The threat impact degree of unknown vulnerabilities can be calculated with
<disp-formula id="eqn-55"><label>(55)</label><mml:math id="mml-eqn-55" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-120"><mml:math id="mml-ieqn-120"><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the unknown vulnerability exposure probability obtained on the premise that the vulnerability exposure probability is known over a period of time <inline-formula id="ieqn-121"><mml:math id="mml-ieqn-121"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>e</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>Although some unknown vulnerabilities may have no relationship with the previously exposed vulnerabilities. Without losing generality, the probability of new vulnerabilities can still be estimated using vulnerability probability statistics to describe the overall impact of system vulnerabilities on security status. The impact of the system vulnerabilities can be expressed as
<disp-formula id="eqn-56"><label>(56)</label><mml:math id="mml-eqn-56" display="block"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-122"><mml:math id="mml-ieqn-122"><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-123"><mml:math id="mml-ieqn-123"><mml:mrow><mml:msub><mml:mi>&#x03B1;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are the vulnerability evaluation weights of known and unknown vulnerabilities, respectively.</p>
</sec>
<sec id="s3_3_2">
<label>3.3.2</label>
<title>System Threat Analysis</title>
<p>Threat situation refers to the real-time quantification of the number of alerts and their severity in train control systems. Generally, threats are defined as potential attack behaviors that may harm the train control system. The train control systems face security threats that may compromise the availability, integrity, and confidentiality of devices, networks, and data. These threats, which can originate internally or externally, primarily include malware, resource attacks, content attacks, insider threats, identity and access control threats, and data breaches.
<list list-type="bullet">
<list-item>
<p><bold>Malware</bold> Malicious software such as viruses and worms can spread through train control networks, infecting computers and network devices in the system. This can lead to system paralysis, data loss, or theft, directly endangering train operation safety.</p></list-item>
<list-item>
<p><bold>Resource Attacks</bold> Resource attacks target the computational or network resources of the train control system. Examples include consuming excessive system computing power or occupying communication bandwidth. Denial-of-Service (DoS) attacks or Distributed Denial-of-Service (DDoS) attacks, for instance, exhaust system resources by sending massive amounts of fake requests, rendering the system unable to operate normally.</p></list-item>
<list-item>
<p><bold>Content Attacks</bold> The target of the content attack is the content of information exchange in the train control system, and the sensitive data of the train control system is obtained or tampered with by means of monitoring, deletion, tampering and deception. For example, communication data is intercepted and tampered with a man-in-the-middle attack (MITM), impersonating a legitimate communication object, resulting in incorrect train control instructions or data tampering.</p></list-item>
<list-item>
<p><bold>Insider Threats</bold> Malicious actions from insider personnel exploit their privileges to perform malicious operations, such as modifying control commands or leaking sensitive information. Unauthorized access by insiders can lead to system damage or data theft, causing train operation interruptions or severe accidents such as collisions.</p></list-item>
<list-item>
<p><bold>Ientity and Access Control Threats</bold> Administrator credentials are stolen, allowing attackers to access the system without authorization and conduct privilege escalation attacks. Additionally, lax internal access control can lead to permission misuse or unauthorized access, allowing illegal operations or data tampering within the system.</p></list-item>
<list-item>
<p><bold>Data Breaches</bold> There is a large amount of business data and operation data in the train control system, including sensitive information such as train location and running speed. Once this data is leaked, it will lead to privacy exposure or security risks, or even be used for malicious purposes, which may cause serious train safety accidents.</p></list-item>
</list></p>
<p>The impact of attacks with varying levels of severity on the system differs; attacks with higher severity indices pose greater threats than those with lower indices. By referencing the SNORT manual, the attack severity is introduced to quantify the cyber attacks. Alert priorities are categorized into High, Medium, Low, and Very Low, corresponding to severity quantification values 4, 3, 2, 1, respectively. High-priority alerts indicate the most severe attacks, while low-priority ones represent the least severe. Additionally, undetected anomalies in system sessions are considered potential risks with very low attack severity and are included in the threat landscape quantification. Typical network attacks faced by train control systems and their corresponding severity indices are listed in <xref ref-type="table" rid="table-1">Table 1</xref>.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>The severity value of attacks</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>The typical cyber attacks</th>
<th>Attack severity</th>
<th><inline-formula id="ieqn-124"><mml:math id="mml-ieqn-124"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td>Content attacks, malware, privilege escalation attacks</td>
<td>High</td>
<td>4</td>
</tr>
<tr>
<td>DoS attacks, leakage attacks</td>
<td>Medium</td>
<td>3</td>
</tr>
<tr>
<td>Probe, Scan</td>
<td>Low</td>
<td>2</td>
</tr>
<tr>
<td>Sessions</td>
<td>Very low</td>
<td>1</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Note that the high-severity attacks have greater threat impact than low-severity attacks, the exponent calculation is introduced to represent the impact of attacks with different severities. The impact of system threats can be described as
<disp-formula id="eqn-57"><label>(57)</label><mml:math id="mml-eqn-57" display="block"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mn>10</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow><mml:mo>&#x00D7;</mml:mo><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-125"><mml:math id="mml-ieqn-125"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> represents the number of alert categories, <inline-formula id="ieqn-126"><mml:math id="mml-ieqn-126"><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the alert numbers of the <inline-formula id="ieqn-127"><mml:math id="mml-ieqn-127"><mml:mi>j</mml:mi></mml:math></inline-formula>th category generated at time <inline-formula id="ieqn-128"><mml:math id="mml-ieqn-128"><mml:mi>t</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-129"><mml:math id="mml-ieqn-129"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> represents the severity of different types of attacks, <inline-formula id="ieqn-130"><mml:math id="mml-ieqn-130"><mml:mrow><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the time decay factor, <inline-formula id="ieqn-131"><mml:math id="mml-ieqn-131"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is the adjustment parameter, and <inline-formula id="ieqn-132"><mml:math id="mml-ieqn-132"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> is the initial time of the alert.</p>
<p>The purpose of adding the time decay factor is to make the threat situation quantification meet the real-time requirements of the train control system. The time decay factor can dynamically update the threat situation to ensure that the threat situation value can reflect the current threat situation without accumulating a large amount of outdated alarm information, thus avoiding the excessive impact of past alarms on the current train control status.</p>
</sec>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Network Characteristics Analysis Using the GAN-AIS</title>
<p>The characteristic of CBTC systems operation is that it operates on a specific line in a fixed direction according to the train operating diagram, and its information interaction and data flow are stable. The artificial immune system can take advantage of the stable data flow to self-learn the data characteristics of the CBTC systems under normal operation, train the immune system model without prior knowledge or data labels, and realize cyber attack perception and security situation assessment.</p>
<p>In AIS, the antigen is the feature vector of network characteristics data. Let the antigen set be <inline-formula id="ieqn-133"><mml:math id="mml-ieqn-133"><mml:mi>A</mml:mi><mml:mi>g</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mi>l</mml:mi></mml:msup></mml:mrow></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula id="ieqn-134"><mml:math id="mml-ieqn-134"><mml:mrow><mml:msup><mml:mi>S</mml:mi><mml:mi>l</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is the shape space, <inline-formula id="ieqn-135"><mml:math id="mml-ieqn-135"><mml:mi>l</mml:mi></mml:math></inline-formula> represents the dimension of feature strings, including source/destination IP address, source/destination port, protocol type, time, features, traffic, sessions, and so on. The antibody is the detector that recognizes specific antigens. The detector simulates the main functions of immune cells and realizes the main functions such as self-tolerance, cell cloning, and mutation evolution. Let the detector set be
<disp-formula id="eqn-58"><label>(58)</label><mml:math id="mml-eqn-58" display="block"><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mo>&#x003C;</mml:mo><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&gt;</mml:mo><mml:mtext>&#x00A0;</mml:mtext><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mtext>&#x00A0;</mml:mtext><mml:mi>d</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi mathvariant="double-struck">N</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi mathvariant="double-struck">N</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow><mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-136"><mml:math id="mml-ieqn-136"><mml:mi>d</mml:mi></mml:math></inline-formula> represents the detector, <inline-formula id="ieqn-137"><mml:math id="mml-ieqn-137"><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula> represents the sum of antigens matched by the detector, <inline-formula id="ieqn-138"><mml:math id="mml-ieqn-138"><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula> represents the age of detectors, <inline-formula id="ieqn-139"><mml:math id="mml-ieqn-139"><mml:mi>&#x03C1;</mml:mi></mml:math></inline-formula> represents the concentration of detectors, <inline-formula id="ieqn-140"><mml:math id="mml-ieqn-140"><mml:mrow><mml:mi mathvariant="double-struck">N</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-141"><mml:math id="mml-ieqn-141"><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:math></inline-formula> represent the natural number and real number set.</p>
<sec id="s3_4_1">
<label>3.4.1</label>
<title>The Mature Process of Detectors</title>
<p>Generally, the purpose of the immune mechanism is to identify unknown foreign antigens and protect the body, and the process of identifying antigens is the process of calculating the affinity between antigens and antibodies. The affinity for the new antigen is the measure of the matching degree between the antibody and the antigen. For the detector with <inline-formula id="ieqn-142"><mml:math id="mml-ieqn-142"><mml:mi>l</mml:mi></mml:math></inline-formula>-dimensional feature vectors, the Minkowski distance is used to calculate the affinity, which can be denoted as
<disp-formula id="eqn-59"><label>(59)</label><mml:math id="mml-eqn-59" display="block"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>l</mml:mi></mml:munderover><mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>a</mml:mi><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow><mml:mi>&#x03BB;</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>&#x03BB;</mml:mi></mml:mfrac></mml:mrow></mml:msup></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-143"><mml:math id="mml-ieqn-143"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is the parameter of Minkowski distance. When <inline-formula id="ieqn-144"><mml:math id="mml-ieqn-144"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, it is the Manhattan distance and when <inline-formula id="ieqn-145"><mml:math id="mml-ieqn-145"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:math></inline-formula>, it is the Euclidean distance.</p>
<p>The affinity can be calculated as
<disp-formula id="eqn-60"><label>(60)</label><mml:math id="mml-eqn-60" display="block"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>f</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B5;</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-146"><mml:math id="mml-ieqn-146"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula> is a small constant. The closer the Minkowski distance between the antigen and the detector, the greater the affinity. When the affinity is greater than the threshold, the antigen is matched to the detector.</p>
<p>The maturation process of the detector needs to experience self-tolerance. The self-tolerance is an immune response in which the detector does not react to the autoantigens. Let <inline-formula id="ieqn-147"><mml:math id="mml-ieqn-147"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2282;</mml:mo><mml:mi>A</mml:mi><mml:mi>g</mml:mi></mml:math></inline-formula> represents the set of normal network characteristics, <inline-formula id="ieqn-148"><mml:math id="mml-ieqn-148"><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2282;</mml:mo><mml:mi>A</mml:mi><mml:mi>g</mml:mi></mml:math></inline-formula> represents the set of abnormal network characteristics, and <inline-formula id="ieqn-149"><mml:math id="mml-ieqn-149"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x222A;</mml:mo><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mi>A</mml:mi><mml:mi>g</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-150"><mml:math id="mml-ieqn-150"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2229;</mml:mo><mml:mi>N</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mi mathvariant="normal">&#x2205;</mml:mi></mml:math></inline-formula>. The self-tolerance process can be described as
<disp-formula id="eqn-61"><label>(61)</label><mml:math id="mml-eqn-61" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi mathvariant="normal">&#x2203;</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-62"><label>(62)</label><mml:math id="mml-eqn-62" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left center" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&gt;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-151"><mml:math id="mml-ieqn-151"><mml:mi>s</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-152"><mml:math id="mml-ieqn-152"><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the threshold of affinity.</p>
<p>When the detector <inline-formula id="ieqn-153"><mml:math id="mml-ieqn-153"><mml:mi>d</mml:mi></mml:math></inline-formula> cannot match each self <inline-formula id="ieqn-154"><mml:math id="mml-ieqn-154"><mml:mi>s</mml:mi></mml:math></inline-formula> of the self-set <inline-formula id="ieqn-155"><mml:math id="mml-ieqn-155"><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi></mml:math></inline-formula>, that is <inline-formula id="ieqn-156"><mml:math id="mml-ieqn-156"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>, the process can be denoted as the self-tolerance process. When <inline-formula id="ieqn-157"><mml:math id="mml-ieqn-157"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, it means that the self-tolerance process of the detector has failed, and the detector will be removed. Then the other detectors turn into the mature detectors <inline-formula id="ieqn-158"><mml:math id="mml-ieqn-158"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>. It can be denoted as
<disp-formula id="eqn-63"><label>(63)</label><mml:math id="mml-eqn-63" display="block"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>D</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula></p>
</sec>
<sec id="s3_4_2">
<label>3.4.2</label>
<title>The Immune Response of Detectors</title>
<p>In AIS, the immune response is the process of identifying and detecting cyber attacks. Similar to the self-tolerance process, the detection of attack is judged by calculating the affinity of the mature detectors to the antigen. If the affinity between the mature detector and antigen is greater than the preset threshold <inline-formula id="ieqn-159"><mml:math id="mml-ieqn-159"><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, an attack can be detected. If a mature detector can continuously detect cyber attacks, and the cumulative number of matches reaches the threshold <inline-formula id="ieqn-160"><mml:math id="mml-ieqn-160"><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:math></inline-formula>, the mature detector turns into the memory detector <inline-formula id="ieqn-161"><mml:math id="mml-ieqn-161"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. It can be denoted as
<disp-formula id="eqn-64"><label>(64)</label><mml:math id="mml-eqn-64" display="block"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2264;</mml:mo><mml:mi>L</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-162"><mml:math id="mml-ieqn-162"><mml:mi>c</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula> is the sum of antigens matched by the detector, <inline-formula id="ieqn-163"><mml:math id="mml-ieqn-163"><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi></mml:math></inline-formula> is the life generations of detectors, <italic>L</italic> is the life cycle of memory detectors. The memory detectors have higher detection priority and do not need to go through the maturation process again. However, the memory detector is limited by the life cycle <italic>L</italic>. When the memory detector reaches the life cycle <italic>L</italic>, it will be removed from the detector set.</p>
</sec>
<sec id="s3_4_3">
<label>3.4.3</label>
<title>The Mutation Evolution of Detectors</title>
<p>The evolutionary mutation process of detectors is an important way to maintain the diversity of detectors and improve the quality of detectors. The clone selection algorithm (CSA) [<xref ref-type="bibr" rid="ref-37">37</xref>] is used to realize the cloning and mutation process of the detector. In the CSA, the memory detectors with high affinity are selected for the cloning process. The selected detectors are stimulated to mutate according to the mutation mechanism, and the mutated detectors are classified into the immature detector set to start a new life cycle. When applying the traditional mutation algorithm to attack detection, certain challenges may arise. For instance, in the event of a singular type of attack, the diversity within the detector population might be insufficient, leading to limited effectiveness in the cloning and mutation processes. Additionally, the random mutation pattern may fail to maintain the dominant gene generation, resulting in an extended maturation process for mutated detectors.</p>
<p>The GAN simulates the cloning process of mature detectors by learning the characteristics of mature detectors and generating detectors with a small number of detector samples. The GAN can also simulate the mutation process of the detector by generating a large amount of synthetic data [<xref ref-type="bibr" rid="ref-38">38</xref>]. In the mutation process, a certain number of dominant features can be preserved by training the GAN model, and new feature communities can be generated to enrich the diversity of detector features. Specifically, the generator <italic>G</italic> and discriminator <italic>D</italic> are used for detector generation and detector discrimination, respectively. The mutated mature detectors <inline-formula id="ieqn-164"><mml:math id="mml-ieqn-164"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> can be denoted as
<disp-formula id="eqn-65"><label>(65)</label><mml:math id="mml-eqn-65" display="block"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x222A;</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>,</mml:mo><mml:mi mathvariant="normal">&#x2200;</mml:mi><mml:mi>s</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mo>&#x2227;</mml:mo><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>s</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-165"><mml:math id="mml-ieqn-165"><mml:mi>z</mml:mi></mml:math></inline-formula> is the random noise, <inline-formula id="ieqn-166"><mml:math id="mml-ieqn-166"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the mature detector generator of the GAN that achieves Nash equilibrium.</p>
<p>The goal of the generator <italic>G</italic> is to generate detector profiles that closely resemble the real detector profiles, while the purpose of the discriminator <italic>D</italic> is to accurately detect the real detector profiles from the generated ones. With a period of training, the generator has a stronger ability to generate realistic detector profiles. The discriminator is more sensitive to the difference between the real and the generated detector profiles. The competitive relationship between the generator <italic>G</italic> and discriminator <italic>D</italic> promotes mutual evolution. With the GAN-based artificial immune system, the diversity of the detector population is enriched, and the convergence process after population mutation is accelerated. The cloned and mutated detectors re-enter the collection of immature detectors and start a new life cycle.</p>
</sec>
<sec id="s3_4_4">
<label>3.4.4</label>
<title>The Concentration Representation of Detectors</title>
<p>In the human immune system, the human body will trigger an immune response to the invasion of viruses. The body immune system cannot only detect the virus but also reflect the severity of the virus infection, for example, by the number of white blood cells. Due to the different severity of virus infection, the human body will trigger different degrees of immune response, and the intensity of immune response will change with the degree of infection. This process can be characterized by the concentration of antibodies.</p>
<p>Similar to body immunity, our proposed GAN-AIS method cannot only perceive cyber attacks, but also characterize the current security situation of the system. Because of the redundant structure of the train control system, isolated attacks may not affect the operation of the system, but the detector concentration can still be used to reflect the security situation of the system, thus characterizing potential cyber-attacks. The ratio of the number of detectors satisfying the threshold of affinity between detectors to the number of all detectors is defined as the detector concentration. The calculation process can be described as
<disp-formula id="eqn-66"><label>(66)</label><mml:math id="mml-eqn-66" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mrow><mml:msub><mml:mi>&#x03C1;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:munder><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mfrac><mml:mo>,</mml:mo><mml:mi>i</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>S</mml:mi></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-67"><label>(67)</label><mml:math id="mml-eqn-67" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>d</mml:mi><mml:mrow><mml:msub><mml:mi>s</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable columnalign="left left" rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:mi>f</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>|</mml:mo></mml:mrow><mml:mo>&#x2264;</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>&#x03B5;</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-68"><label>(68)</label><mml:math id="mml-eqn-68" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>u</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <inline-formula id="ieqn-167"><mml:math id="mml-ieqn-167"><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>&#x03B5;</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:math></inline-formula> is the affinity threshold between detectors, <inline-formula id="ieqn-168"><mml:math id="mml-ieqn-168"><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:math></inline-formula> is the total number of the detectors, <italic>S</italic> is the set of useful detectors, <inline-formula id="ieqn-169"><mml:math id="mml-ieqn-169"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2227;</mml:mo><mml:mi>d</mml:mi><mml:mo>.</mml:mo><mml:mi>a</mml:mi><mml:mi>g</mml:mi><mml:mi>e</mml:mi><mml:mo>&gt;</mml:mo><mml:mi>L</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:math></inline-formula> is the detectors that reach the end of life.</p>
</sec>
<sec id="s3_4_5">
<label>3.4.5</label>
<title>The Analysis of Network Characteristics</title>
<p>The data interaction and information communication are the basis for supporting the business functions of CBTC systems. The analysis of network characteristics can quickly and accurately perceive various attacks and characterize the current network security situation of the system. The mathematical description of the network security situation can be expressed as
<disp-formula id="eqn-69"><label>(69)</label><mml:math id="mml-eqn-69" display="block"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>ln</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>c</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:munderover><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow></mml:munderover><mml:mrow><mml:mrow><mml:msub><mml:mi>&#x03C1;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-170"><mml:math id="mml-ieqn-170"><mml:mi>c</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is the adjustment factor, <inline-formula id="ieqn-171"><mml:math id="mml-ieqn-171"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the number of detectors in the set <italic>S</italic> that are judged by the affinity between detectors, and the detector concentration is not equal to zero (the concentration of some isolated detectors is 0), <inline-formula id="ieqn-172"><mml:math id="mml-ieqn-172"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the classification of cyber attacks.</p>
</sec>
<sec id="s3_4_6">
<label>3.4.6</label>
<title>Computational Complexity Analysis of GAN-AIS</title>
<p>In this section, we will analyze the computational complexity of the GAN-AIS approach. For the mature process of detectors, assuming that there are <inline-formula id="ieqn-173"><mml:math id="mml-ieqn-173"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> detectors and <inline-formula id="ieqn-174"><mml:math id="mml-ieqn-174"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> antigens, and the number of detectors undergoing self-tolerance is <italic>M</italic>, then the computational complexity of the detector maturation stage can be expressed as <inline-formula id="ieqn-175"><mml:math id="mml-ieqn-175"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. For the immune process of detectors, assuming the number of mature detectors is <inline-formula id="ieqn-176"><mml:math id="mml-ieqn-176"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, then the computational complexity of the immune response stage can be expressed as <inline-formula id="ieqn-177"><mml:math id="mml-ieqn-177"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. For the mutation evaluation process of detectors, the mutation detectors are generated by a generative adversarial network (GAN). In the generator training phase, assuming the number of iterations is <inline-formula id="ieqn-178"><mml:math id="mml-ieqn-178"><mml:mi>k</mml:mi></mml:math></inline-formula>, the computational complexity of each iteration is <inline-formula id="ieqn-179"><mml:math id="mml-ieqn-179"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. In the discriminator training phase, assuming the number of iterations is <inline-formula id="ieqn-180"><mml:math id="mml-ieqn-180"><mml:mi>k</mml:mi></mml:math></inline-formula>, the computational complexity of each iteration is <inline-formula id="ieqn-181"><mml:math id="mml-ieqn-181"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Then the complexity of generating the mutation detector is <inline-formula id="ieqn-182"><mml:math id="mml-ieqn-182"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The computational complexity of the mutation stage is <inline-formula id="ieqn-183"><mml:math id="mml-ieqn-183"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mi>k</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. For the concentration calculation process of detectors, assuming that the number of useful detectors is <inline-formula id="ieqn-184"><mml:math id="mml-ieqn-184"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, then the computational complexity of the detector concentration calculation stage is <inline-formula id="ieqn-185"><mml:math id="mml-ieqn-185"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. The computational complexity of the network characteristics analysis stage is <inline-formula id="ieqn-186"><mml:math id="mml-ieqn-186"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>. Therefore, the total computational complexity of the GAN-AIS approach is <inline-formula id="ieqn-187"><mml:math id="mml-ieqn-187"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mi>M</mml:mi></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>a</mml:mi><mml:mi>g</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>u</mml:mi></mml:msub></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
</sec>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>The Information Security Situation of the Information Layer</title>
<p>The system vulnerabilities, security threats, and network characteristics indicators are used to quantify the information security situation of the information layer. Specifically, the information security situation is composed of <inline-formula id="ieqn-188"><mml:math id="mml-ieqn-188"><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-189"><mml:math id="mml-ieqn-189"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-190"><mml:math id="mml-ieqn-190"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. It can be expressed as
<disp-formula id="eqn-70"><label>(70)</label><mml:math id="mml-eqn-70" display="block"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>I</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-191"><mml:math id="mml-ieqn-191"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula id="ieqn-192"><mml:math id="mml-ieqn-192"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-193"><mml:math id="mml-ieqn-193"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the weights of three indicators, respectively. The detailed algorithm is formulated in Algorithm 1.</p>
<fig id="fig-12">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-12.tif"/>
</fig>
</sec>
<sec id="s3_6">
<label>3.6</label>
<title>The Situation Assessment for CBTC Systems</title>
<p>Both physical layer and information layer indicators are used for the hierarchical security situation assessment approach. For the physical layer, the main focus is on the impact of cyber attacks on the operation of the CBTC systems, and the total cost is measured from the perspective of time delay and economic loss. For the information layer, changes in system situation are analyzed and characterized from aspects of static and dynamic indicators. The comprehensive situation assessment value <italic>SA</italic> can be expressed as
<disp-formula id="eqn-71"><label>(71)</label><mml:math id="mml-eqn-71" display="block"><mml:mi>S</mml:mi><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>where <inline-formula id="ieqn-219"><mml:math id="mml-ieqn-219"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-220"><mml:math id="mml-ieqn-220"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are the weights of two indicators, respectively.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Experiments and Evaluation</title>
<p>In this section, we present our simulation experiments from the perspective of experimental design, attack description, as well as data preprocessing and performance metrics.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Experimental Design and Attack Description</title>
<p>The simulation experiments are conducted on the security simulation platform of the National Key Laboratory. As shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, the simulation platform is built with simulation software and real signal equipment, and supports both wired and wireless train-ground communication modes. The real line data of Beijing Metro Line 7 are used to simulate the tracking operation of multiple trains. In addition, the platform can simulate cyber attacks such as DoS attacks and data spoofing attacks, and restore the operating scenarios and operating status of the system under cyber attacks.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>The security simulation platform</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-3.tif"/>
</fig>
<p>The experimental parameters of the hierarchical security situation assessment approach are listed in <xref ref-type="table" rid="table-2">Table 2</xref>. According to the parameters, the overall impact of cyber attacks on the physical layer <inline-formula id="ieqn-221"><mml:math id="mml-ieqn-221"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the security situation of information layer <inline-formula id="ieqn-222"><mml:math id="mml-ieqn-222"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and the comprehensive situation assessment value <italic>SA</italic> can be calculated by <xref ref-type="disp-formula" rid="eqn-50">Eqs. (50)</xref>, <xref ref-type="disp-formula" rid="eqn-70">(70)</xref> and <xref ref-type="disp-formula" rid="eqn-71">(71)</xref>, respectively.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>The experimental parameters of hierarchical security situation assessment approach</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Symbol</th>
<th>Values</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-223"><mml:math id="mml-ieqn-223"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>t</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>5</td>
<td>The number of trains</td>
</tr>
<tr>
<td><inline-formula id="ieqn-224"><mml:math id="mml-ieqn-224"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>15</td>
<td>The number of stations</td>
</tr>
<tr>
<td><inline-formula id="ieqn-225"><mml:math id="mml-ieqn-225"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>10</td>
<td>Number of known vulnerabilities</td>
</tr>
<tr>
<td><inline-formula id="ieqn-226"><mml:math id="mml-ieqn-226"><mml:msub><mml:mi>&#x03B2;</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>0.1</td>
<td>The decay factor</td>
</tr>
<tr>
<td><inline-formula id="ieqn-227"><mml:math id="mml-ieqn-227"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>e</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>90</td>
<td>Observation period (days) for unknown vulnerabilities</td>
</tr>
<tr>
<td><inline-formula id="ieqn-228"><mml:math id="mml-ieqn-228"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.5</td>
<td>Weight indicators of train punctuality rate</td>
</tr>
<tr>
<td><inline-formula id="ieqn-229"><mml:math id="mml-ieqn-229"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.5</td>
<td>Weight indicators of train departure interval</td>
</tr>
<tr>
<td><inline-formula id="ieqn-230"><mml:math id="mml-ieqn-230"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.8</td>
<td>Weight indicators of known vulnerabilities</td>
</tr>
<tr>
<td><inline-formula id="ieqn-231"><mml:math id="mml-ieqn-231"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.2</td>
<td>Weight indicators of unknown vulnerabilities</td>
</tr>
<tr>
<td><inline-formula id="ieqn-232"><mml:math id="mml-ieqn-232"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.3</td>
<td>Weight indicators of <inline-formula id="ieqn-233"><mml:math id="mml-ieqn-233"><mml:mrow><mml:msub><mml:mi>V</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-234"><mml:math id="mml-ieqn-234"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.3</td>
<td>Weight indicators of <inline-formula id="ieqn-235"><mml:math id="mml-ieqn-235"><mml:mrow><mml:msub><mml:mi>T</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-236"><mml:math id="mml-ieqn-236"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mrow><mml:mi>c</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.4</td>
<td>Weight indicators of <inline-formula id="ieqn-237"><mml:math id="mml-ieqn-237"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-238"><mml:math id="mml-ieqn-238"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.5</td>
<td>Weight indicators of <inline-formula id="ieqn-239"><mml:math id="mml-ieqn-239"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-240"><mml:math id="mml-ieqn-240"><mml:mrow><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.5</td>
<td>Weight indicators of <inline-formula id="ieqn-241"><mml:math id="mml-ieqn-241"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Cyber attacks are introduced to verify the effectiveness of our approach. The CBTC systems mainly suffer two types of attacks: DoS attack and data spoofing attack [<xref ref-type="bibr" rid="ref-39">39</xref>]. The DoS attack may infiltrate the CBTC network, and occupy excessive service resources with seemingly legitimate service requests, thus obstructing the system normal operation. The primary objective of the data spoofing attack is to manipulate the payload content within data packets, aiming to disrupt the functionality of CBTC physical equipment.</p>
<p>In the case of a DoS attack, the primary targets are the communication link between the ground wireless AP and VOBC. The authentication attack on the wireless network, known as an authentication DoS, is launched by using the Mdk3 wireless attack tool. This tool depletes AP authentication request resources by simulating randomly generated MAC addresses and sending a large number of authentication requests to the target AP. Consequently, the AP becomes unable to respond to legitimate communication requests. Meanwhile, the TCP DoS attack on wired backbone networks, specifically a TCP SYN Flood, is launched using the LOIC DoS attack tool. The attack floods the service connection queue with TCP data packets, causing network congestion. As a result, devices are unable to respond properly, disrupting the normal operation of trains.</p>
<p>In the case of a data spoofing attack, the payload contents of data packets are modified with the intent of disrupting train operations. The communication link between the ground wireless access point (AP) and VOBC in CBTC systems is used to transmit control commands and train status information. If this communication data is tampered with, it can compromise the safe operation of the train. A typical example is a Man-in-the-Middle (MitM) attack, where an attacker intercepts and modifies data packets between the targeted parties by setting up forwarding on a middleman device. In this paper, the Bettercap attack tool is employed to intercept and tamper with the communication data. By deploying lightweight Bettercap modules, the attacker manipulates MAC address tables and redirects communication, allowing them to act as middlemen to monitor or modify data between the target host and the gateway.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Data Preprocessing and Performance Metrics</title>
<p>The method in [<xref ref-type="bibr" rid="ref-40">40</xref>] is used to extract the features from the security feature data set. Since each situation indicator had a different value range, the Min-Max Normalization method is used for normalization, which can be expressed as
<disp-formula id="eqn-72"><label>(72)</label><mml:math id="mml-eqn-72" display="block"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where <inline-formula id="ieqn-242"><mml:math id="mml-ieqn-242"><mml:mrow><mml:msup><mml:mi>x</mml:mi><mml:mo>&#x2217;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> is the normalized value of the situation indicator, <inline-formula id="ieqn-243"><mml:math id="mml-ieqn-243"><mml:mi>x</mml:mi></mml:math></inline-formula> is the original value, <inline-formula id="ieqn-244"><mml:math id="mml-ieqn-244"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">max</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula id="ieqn-245"><mml:math id="mml-ieqn-245"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mo movablelimits="true" form="prefix">min</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are the maximum and minimum values of the situation indicator, respectively.</p>
<p>The detection rate (DR), false alarm rate (FR) and F1_score are introduced to evaluate the effectiveness of perceiving cyber attacks, which can be described as
<disp-formula id="eqn-73"><label>(73)</label><mml:math id="mml-eqn-73" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>D</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac><mml:mo>,</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-74"><label>(74)</label><mml:math id="mml-eqn-74" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>F</mml:mi><mml:mi>R</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p><disp-formula id="eqn-75"><label>(75)</label><mml:math id="mml-eqn-75" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:mi>R</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where <italic>TP</italic> represents the number of cyber attacks that are sensed and actually launched, <italic>FP</italic> represents the number of cyber attacks that are sensed but no actually launched, <italic>TN</italic> represents the number of cyber attacks that are neither sensed nor actually launched, <italic>FN</italic> represents the number of cyber attacks that actually launched but not sensed.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Results and Discussion</title>
<p>In this section, comparative experiments are conducted to evaluate the proposed approach. When the system suffers from different types of attacks, both the physical layer and information layer indicators are used to reflect the changes in the system security situation.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Experiments for Perceiving DoS Attack</title>
<p>First, we present the performance evaluation of the approach for perceiving DoS attacks. The batch size, epochs and noise dimension of the GAN model are 256, 100 and 100, respectively. The loss function and optimizer of the GAN model are binary<inline-formula id="ieqn-246"><mml:math id="mml-ieqn-246"><mml:mi mathvariant="normal">&#x005F;</mml:mi></mml:math></inline-formula>crossentropy and Adam, respectively. The activation functions of the GAN model generator <italic>G</italic> and discriminator <italic>D</italic> are tanh and sigmoid, respectively. The experimental parameters are listed in <xref ref-type="table" rid="table-3">Table 3</xref>.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>The experimental parameters for perceiving DoS attacks</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Symbol</th>
<th>Values</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-247"><mml:math id="mml-ieqn-247"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula></td>
<td>2</td>
<td>Parameter of Minkowski distance</td>
</tr>
<tr>
<td><inline-formula id="ieqn-248"><mml:math id="mml-ieqn-248"><mml:mi>&#x03B5;</mml:mi></mml:math></inline-formula></td>
<td>0.001</td>
<td>Constant of affinity calculation</td>
</tr>
<tr>
<td><inline-formula id="ieqn-249"><mml:math id="mml-ieqn-249"><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>a</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.75</td>
<td>Affinity threshold of self-tolerance process</td>
</tr>
<tr>
<td><inline-formula id="ieqn-250"><mml:math id="mml-ieqn-250"><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.25</td>
<td>Affinity threshold of immune response process</td>
</tr>
<tr>
<td><inline-formula id="ieqn-251"><mml:math id="mml-ieqn-251"><mml:mrow><mml:msub><mml:mi>&#x03B3;</mml:mi><mml:mi>&#x03B5;</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>0.5</td>
<td>Affinity threshold between detectors</td>
</tr>
<tr>
<td><inline-formula id="ieqn-252"><mml:math id="mml-ieqn-252"><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></td>
<td>5</td>
<td>Matching number of detectors</td>
</tr>
<tr>
<td><inline-formula id="ieqn-253"><mml:math id="mml-ieqn-253"><mml:mi>c</mml:mi></mml:math></inline-formula></td>
<td>2</td>
<td>Adjustment factor</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The detection rate and false alarm rate for perceiving the authentication DoS attacks are shown in <xref ref-type="fig" rid="fig-4">Fig. 4</xref>. With the increase of the detector life cycle, the detection rate increases gradually, the false positive rate increases at first and then decreases. When the life cycle of the detector is set to 5 generations, the detection rate is 64.84<inline-formula id="ieqn-254"><mml:math id="mml-ieqn-254"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and the false alarm rate is 0.08<inline-formula id="ieqn-255"><mml:math id="mml-ieqn-255"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>. When the life cycle of the detector is set to 25 generations, the detection rate is increased to 96.83<inline-formula id="ieqn-256"><mml:math id="mml-ieqn-256"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and the false alarm rate is 0.16<inline-formula id="ieqn-257"><mml:math id="mml-ieqn-257"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>. When the life cycle of the detector is set to 50 generations, the detection rate is increased to 97.09<inline-formula id="ieqn-258"><mml:math id="mml-ieqn-258"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and the false alarm rate is 0.06<inline-formula id="ieqn-259"><mml:math id="mml-ieqn-259"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>. The detection rate of the detector with a life cycle of 25 generations is similar to that of 50 generations, and the false alarm rate is maintained at a low level. It can be noted that the time required for the maturity and evolution of the detectors with a life cycle of 25 generations is significantly lower than that of 50 generations. Therefore, it is considered that the detector with a life cycle of 25 generations is the optimal detector, and the performance of the detector is the best.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>The detection rate and false alarm rate for perceiving the authentication DoS attacks</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-4.tif"/>
</fig>
<p>The detection rate and false alarm rate for perceiving the TCP SYN Flood attacks are shown in <xref ref-type="fig" rid="fig-5">Fig. 5</xref>. It can be seen that when the life cycle of the detector is short, the false alarm rate is low. With the increase of the detector life cycle, the detection rate increases gradually, and the false positive rate increases at first and then decreases. The overall change trend is similar to the result of perceiving authentication DoS attack. When the life cycle of the detector is set to 25 generations, the detection rate is 98.59<inline-formula id="ieqn-260"><mml:math id="mml-ieqn-260"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and the false alarm rate is 1.08<inline-formula id="ieqn-261"><mml:math id="mml-ieqn-261"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>. It has a high detection rate and a low false alarm rate. It can be considered that the detector with a life cycle of 25 generations is the optimal detector.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>The detection rate and false alarm rate for perceiving the TCP SYN Flood attacks</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-5.tif"/>
</fig>
<p>As shown in <xref ref-type="table" rid="table-4">Table 4</xref>, the different methods are introduced to compare the ability to perceive the TCP SYN Flood attack. The GAN-AIS method is compared with unsupervised learning methods such as AIS [<xref ref-type="bibr" rid="ref-41">41</xref>], convolutional autoencoder and one-class SVM (CAE-OCSVM) [<xref ref-type="bibr" rid="ref-42">42</xref>], synthetic minority oversampling technique and Random Forest (SMOTE-RF) [<xref ref-type="bibr" rid="ref-43">43</xref>], principal component analysis and K-means clustering (PCA-K-Means) [<xref ref-type="bibr" rid="ref-44">44</xref>] and variational autoencoder (VAE) [<xref ref-type="bibr" rid="ref-45">45</xref>] in terms of the detection rate, false alarm rate, F1_score and computation time indicators.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Performance comparison of DR, FR, F1_score and computation time</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Method</th>
<th>Detection rate (%)</th>
<th>False alarm rate (%)</th>
<th>F1_score</th>
<th>Computation time (s)</th>
</tr>
</thead>
<tbody>
<tr>
<td>GAN-AIS</td>
<td>98.59</td>
<td>1.08</td>
<td>0.9921</td>
<td>490</td>
</tr>
<tr>
<td>AIS</td>
<td>97.09</td>
<td>1.90</td>
<td>0.9841</td>
<td>428</td>
</tr>
<tr>
<td>CAE-OCSVM</td>
<td>84.89</td>
<td>4.36</td>
<td>0.8969</td>
<td>821</td>
</tr>
<tr>
<td>SMOTE-RF</td>
<td>90.90</td>
<td>0.48</td>
<td>0.9499</td>
<td>796</td>
</tr>
<tr>
<td>PCA-K-means</td>
<td>92.45</td>
<td>1.94</td>
<td>0.9585</td>
<td>413</td>
</tr>
<tr>
<td>VAE</td>
<td>95.09</td>
<td>1.10</td>
<td>0.9575</td>
<td>923</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>It can be seen from <xref ref-type="table" rid="table-4">Table 4</xref>, the detection rate of GAN-AIS is 98.59<inline-formula id="ieqn-262"><mml:math id="mml-ieqn-262"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, the false alarm rate is 1.08<inline-formula id="ieqn-263"><mml:math id="mml-ieqn-263"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and the F1_score is 0.9921. It has the highest detection rate, a relatively low false alarm rate, and a high F1_score. The reason is that the GAN-AIS approach cannot only learn the network characteristics of the train control system but also further optimize and enrich the detector population through the GAN model. A higher detection rate usually increases the probability of false alarms. However, the proposed GAN-AIS approach can keep the false alarm rate within a relatively low range and maintain a high F1_score value. In addition, compared with other methods, the GAN-AIS approach has a relatively short computation time. Especially when compared with the variational autoencoder (VAE) method, which has a relatively close detection rate, the computation time of GAN-AIS can be reduced by nearly half. Moreover, compared with methods that have a similar computation time, GAN-AIS has a higher detection accuracy. To sum up, the GAN-AIS approach has outstanding comprehensive perception performance.</p>

</sec>
<sec id="s5_2">
<label>5.2</label>
<title>The Experiments of Situation Assessment under DoS Attack</title>
<p>We assume that due to the redundancy and security mechanism of the system, the DoS attacks will not impact the normal operation of the train, the comprehensive situation assessment value <italic>SA</italic> can be calculated without considering the impact of cyber attacks on the physical layer. Limited by the relatively closed environment, the CBTC systems are rarely updated and upgraded. Therefore, most of the existing vulnerabilities are outdated, but these vulnerabilities can still reflect the security situation of the system. In our experiments, the system vulnerabilities are scanned through Nessus software, and the reference date for vulnerability age calculation is 31 December 2019. The CVSS information of 10 typical vulnerabilities and the corresponding attack severity are listed in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>The CVSS information of vulnerabilities and the corresponding attack severity</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>No.</th>
<th>Vulnerabilities</th>
<th>CVSS score</th>
<th><inline-formula id="ieqn-264"><mml:math id="mml-ieqn-264"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>V</mml:mi></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-265"><mml:math id="mml-ieqn-265"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>A</mml:mi><mml:mi>C</mml:mi></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-266"><mml:math id="mml-ieqn-266"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>P</mml:mi><mml:mi>R</mml:mi></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-267"><mml:math id="mml-ieqn-267"><mml:mi>S</mml:mi><mml:mi mathvariant="normal">&#x005F;</mml:mi><mml:mi>U</mml:mi><mml:mi>I</mml:mi></mml:math></inline-formula></th>
<th><inline-formula id="ieqn-268"><mml:math id="mml-ieqn-268"><mml:mrow><mml:msub><mml:mi>g</mml:mi><mml:mi>s</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></th>
<th>Release date</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-269"><mml:math id="mml-ieqn-269"><mml:mn>1</mml:mn></mml:math></inline-formula></td>
<td>CVE-2019-2518</td>
<td>7.5</td>
<td>0.85</td>
<td>0.44</td>
<td>0.62</td>
<td>0.85</td>
<td>4</td>
<td><inline-formula id="ieqn-270"><mml:math id="mml-ieqn-270"><mml:mn>23</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>04</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2019</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-271"><mml:math id="mml-ieqn-271"><mml:mn>2</mml:mn></mml:math></inline-formula></td>
<td>CVE-2019-0708</td>
<td>9.8</td>
<td>0.85</td>
<td>0.77</td>
<td>0.85</td>
<td>0.85</td>
<td>4</td>
<td><inline-formula id="ieqn-272"><mml:math id="mml-ieqn-272"><mml:mn>06</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>05</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2019</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-273"><mml:math id="mml-ieqn-273"><mml:mn>3</mml:mn></mml:math></inline-formula></td>
<td>CVE-2018-17190</td>
<td>7.5</td>
<td>0.85</td>
<td>0.44</td>
<td>0.62</td>
<td>0.85</td>
<td>4</td>
<td><inline-formula id="ieqn-274"><mml:math id="mml-ieqn-274"><mml:mn>19</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>12</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2018</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-275"><mml:math id="mml-ieqn-275"><mml:mn>4</mml:mn></mml:math></inline-formula></td>
<td>CVE-2016-8735</td>
<td>9.8</td>
<td>0.85</td>
<td>0.77</td>
<td>0.85</td>
<td>0.85</td>
<td>4</td>
<td><inline-formula id="ieqn-276"><mml:math id="mml-ieqn-276"><mml:mn>06</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>04</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2017</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-277"><mml:math id="mml-ieqn-277"><mml:mn>5</mml:mn></mml:math></inline-formula></td>
<td>CVE-2016-0714</td>
<td>8.8</td>
<td>0.85</td>
<td>0.77</td>
<td>0.62</td>
<td>0.85</td>
<td>4</td>
<td><inline-formula id="ieqn-278"><mml:math id="mml-ieqn-278"><mml:mn>25</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>02</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2016</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-279"><mml:math id="mml-ieqn-279"><mml:mn>6</mml:mn></mml:math></inline-formula></td>
<td>CVE-2019-2753</td>
<td>4.6</td>
<td>0.85</td>
<td>0.77</td>
<td>0.62</td>
<td>0.62</td>
<td>3</td>
<td><inline-formula id="ieqn-280"><mml:math id="mml-ieqn-280"><mml:mn>23</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>07</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2019</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-281"><mml:math id="mml-ieqn-281"><mml:mn>7</mml:mn></mml:math></inline-formula></td>
<td>CVE-2019-0199</td>
<td>7.5</td>
<td>0.85</td>
<td>0.77</td>
<td>0.85</td>
<td>0.85</td>
<td>3</td>
<td><inline-formula id="ieqn-282"><mml:math id="mml-ieqn-282"><mml:mn>10</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>04</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2019</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-283"><mml:math id="mml-ieqn-283"><mml:mn>8</mml:mn></mml:math></inline-formula></td>
<td>CVE-2018-3299</td>
<td>8.2</td>
<td>0.85</td>
<td>0.77</td>
<td>0.85</td>
<td>0.62</td>
<td>3</td>
<td><inline-formula id="ieqn-284"><mml:math id="mml-ieqn-284"><mml:mn>16</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>10</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2018</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-285"><mml:math id="mml-ieqn-285"><mml:mn>9</mml:mn></mml:math></inline-formula></td>
<td>CVE-2019-17052</td>
<td>3.3</td>
<td>0.55</td>
<td>0.77</td>
<td>0.62</td>
<td>0.85</td>
<td>2</td>
<td><inline-formula id="ieqn-286"><mml:math id="mml-ieqn-286"><mml:mn>01</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>10</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2019</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-287"><mml:math id="mml-ieqn-287"><mml:mn>10</mml:mn></mml:math></inline-formula></td>
<td>CVE-2018-8207</td>
<td>4.7</td>
<td>0.55</td>
<td>0.44</td>
<td>0.62</td>
<td>0.85</td>
<td>2</td>
<td><inline-formula id="ieqn-288"><mml:math id="mml-ieqn-288"><mml:mn>14</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>06</mml:mn><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:mn>2018</mml:mn></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The change in authentication DoS attack during the 90-s observation period is simulated, and the intensity of the authentication DoS attack and the corresponding security situation are shown in <xref ref-type="fig" rid="fig-6">Fig. 6</xref>. With the intensity of the attack changes, the security situation of the CBTC systems information layer changes, affecting the comprehensive security situation of the CBTC systems. The attack intensity is set from 0.6 M/s to 2.0 M/s, and the security situation value varies from 0.1 to 0.78. The trend of the security situation value curve is similar to that of the attack intensity curve. The greater the intensity of the DoS attack, the higher the security situation value, and vice versa. Moreover, due to the existence of memory detectors, when the same attack persists, the change in situation assessment values is more drastic than that of attack intensity.</p>
<fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>The changes in the intensity of authentication DoS attack and the corresponding security situation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-6.tif"/>
</fig>
<p>As shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, the TCP DoS attack intensity ranges from 2.9 to 3.8 M/s, and the security situation value varies from 0.1 to 0.92. The trend of the security situation value curve is similar to that of the attack intensity curve. It can be concluded that the security situation curve can characterize the dynamic changes in the security situation in real-time.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>The changes in the intensity of TCP DoS attack and the corresponding security situation</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-7.tif"/>
</fig>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>The Experiments of Situation Assessment under Data Tampering Attack</title>
<p>In the simulation experiment, the MitM data tampering attack disrupts the train operation by tampering with the data of the normal operation of the train. Due to the fail-safe mechanism of the CBTC systems, if the data received by the train fails to pass verification, the train will initiate an emergency braking procedure. A total of 15 stations and 5 trains are used to simulate the train operation process. The train tracking interval is set to 3 min to simulate train operation during the morning rush period, and the station stop time is set to 30 s. To simplify the experiment, only the upward trains are considered. The data tampering attack is executed during the train operation, and the train operation diagram is affected. The train operation diagram under the cyber attack and the change of situation assessment value are shown in <xref ref-type="fig" rid="fig-8">Figs. 8</xref> and <xref ref-type="fig" rid="fig-9">9</xref>, respectively.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>The train operation diagram during morning rush period under a cyber attack</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-8.tif"/>
</fig><fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>The change of situation assessment value with multiple trains affected by a cyber attack</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-9.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="fig-8">Fig. 8</xref>, the first two trains ran normally according to the train schedule, while the third train suffered a cyber attack when it was running on the track between Station 7 and Station 8. Due to the necessary remedial measures (e.g., equipment restarts and patch upgrades), the third train resumed normal operation 3 min later. But it still affects the normal operation of subsequent trains. The impact of cyber attacks on the physical layer of the train control system can be characterized through the quantitative value of situation assessment. As shown in <xref ref-type="fig" rid="fig-9">Fig. 9</xref>, the situation assessment value is kept at a low value at first. At the 40th second of the observation period, the train control system suffered a cyber attack, and the system situation value increased significantly. The reason is that the attack had an impact on the physical layer of the train control system, resulting in the time delay and economic losses of several successive trains, which led to the increases of situation assessment value. With the subsequent mitigation or elimination measures taken, the situation becomes stable. However, as the departure interval of the trains is very short, subsequent trains continue to be affected, and the security situation remains at a high level.</p>
<p>For comparison, another experiment is conducted. The train tracking interval is set to 8 min to simulate the train operation in the off-peak period, and the other experiment settings are the same. The train operation diagram under cyber attack and the change of situation assessment value is shown in <xref ref-type="fig" rid="fig-10">Figs. 10</xref> and <xref ref-type="fig" rid="fig-11">11</xref>, respectively.</p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>The train operation diagram during flat peak period under a cyber attack</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-10.tif"/>
</fig><fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>The change of situation assessment value with a single train affected by a cyber attack</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_61525-fig-11.tif"/>
</fig>
<p>It can be seen from <xref ref-type="fig" rid="fig-10">Fig. 10</xref>, the first two trains run according to the train schedule, while the third train suffered a cyber attack when running on the track between Station 7 and Station 8. Due to the large train operation interval, the subsequent trains are not affected by the third train, and the third train also resumes normal operation 3 min later. As shown in <xref ref-type="fig" rid="fig-11">Fig. 11</xref>, the situation assessment value initially remains at a low value. At the 40th second of the observation period, the physical layer of the train control system suffered a cyber attack, and the system situation value increased significantly. With the mitigation of the cyber attack, the train operation returned to normal. The security situation value of the train control system decreased to the normal level.</p>
<p>By comparison, it can be concluded that attacks on the train system during the morning peak and off-peak periods have different impacts on the system security situation. During the morning peak, an attack affects a larger number of subsequent trains, resulting in a sustained high security situation value. In contrast, during off-peak periods, the attack causes delays to a single train without affecting the operation of subsequent trains. This is reflected in the security situation, where the situation value initially rises but then returns to normal.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>This paper proposed a hierarchical security situation assessment approach for CBTC systems, enabling the detection of cyber attacks and evaluating of security situations from the information and physical layers. Specifically, the security situation of the physical layer was assessed from the perspective of the impact of cyber attacks, with train punctuality rate and train departure interval serving as key indicators to quantify the security situation under cyber attacks. Meanwhile, the security situation of the information layer was evaluated at both static and dynamic levels, with system vulnerabilities and system threats acting as static indicators, and network characteristics of CBTC systems serving as dynamic indicators. By integrating the evaluation results from both the information and physical layers, a comprehensive security situation assessment value was obtained.</p>
<p>Experimental results demonstrate that for DoS attacks, the proposed approach achieved the highest detection rate, a low false alarm rate, and a high F1_score, with a detection rate of 98.59<inline-formula id="ieqn-289"><mml:math id="mml-ieqn-289"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, a false alarm rate of 1.08<inline-formula id="ieqn-290"><mml:math id="mml-ieqn-290"><mml:mi mathvariant="normal">&#x0025;</mml:mi></mml:math></inline-formula>, and an F1_score of 0.9921. Additionally, the antibody concentration of the GAN-AIS model was used to dynamically characterize the security situation of CBTC systems in real-time. The higher the attack intensity, the greater the antibody concentration and the higher the security situation value. For the data tampering attack, when the trains were running during the morning rush period, the data tampering attack would affect the state of multiple trains, causing the system security situation value to change from low to high and remain at a high level. In contrast, when the trains were running during the off-peak period, the data tampering attack primarily affected the operation state of a single train, the security situation value initially increased and then gradually decreased with the mitigation of the cyber attack. There are still some limitations in our study. The evaluation was conducted using a limited number of cyber attack scenarios, with relatively simple train operation modes and simulated attack conditions. Future research could explore more sophisticated adversarial attacks or combined cyber-physical attack strategies to further enhance the robustness of the proposed approach.</p>
</sec>
</body>
<back>
<ack>
<p>The authors thank anonymous reviewers for their comments and requirements that have helped to improve the paper.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was supported in part by the project of the State Key Laboratory of Advanced Rail Autonomous Operation (RAO2023ZZ004), in part by the Beijing Natural Science Foundation-Fengtai Rail Transit Frontier Research Joint Fund (L211002), in part by the Foundation of China State Railway Group Corporation Limited under Grant L2021G003, in part by the Scientific and Technical Research Fund of China Academy of Railway Sciences Corporation Limited under Grant 2021YJ094, and in part by the Project I23L00200 and Project I24F00010.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm contribution to the paper as follows: study conception and design: Qichang Li, Bing Bu; data collection: Qichang Li, Junyi Zhao; analysis and interpretation of results: Qichang Li, Bing Bu, Junyi Zhao; draft manuscript preparation: Qichang Li, Bing Bu. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>Data available on request from the authors.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest to report regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>F</given-names></string-name></person-group>. <article-title>Security of railway control systems: a survey, research issues and challenges</article-title>. <source>High-speed Railway</source>. <year>2023</year>;<volume>1</volume>(<issue>1</issue>):<fpage>6</fpage>&#x2013;<lpage>17</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.hspr.2022.12.001</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Soderi</surname> <given-names>S</given-names></string-name>, <string-name><surname>Masti</surname> <given-names>D</given-names></string-name>, <string-name><surname>H&#x00E4;m&#x00E4;l&#x00E4;inen</surname> <given-names>M</given-names></string-name>, <string-name><surname>Iinatti</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Cybersecurity considerations for communication based train control</article-title>. <source>IEEE Access</source>. <year>2023</year>;<volume>11</volume>:<fpage>92312</fpage>&#x2013;<lpage>21</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2023.3309005</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kour</surname> <given-names>R</given-names></string-name>, <string-name><surname>Patwardhan</surname> <given-names>A</given-names></string-name>, <string-name><surname>Thaduri</surname> <given-names>A</given-names></string-name>, <string-name><surname>Karim</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A review on cybersecurity in railways</article-title>. <source>Proc Institut Mech Eng Part F: J Rail Rapid Transit</source>. <year>2023</year>;<volume>237</volume>(<issue>1</issue>):<fpage>3</fpage>&#x2013;<lpage>20</lpage>. doi:<pub-id pub-id-type="doi">10.1177/09544097221089389</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>W</given-names></string-name>, <string-name><surname>Bu</surname> <given-names>B</given-names></string-name></person-group>. <article-title>Security analysis for CBTC systems under attack-defense confrontation</article-title>. <source>Electronics</source>. <year>2019</year>;<volume>8</volume>(<issue>9</issue>):<fpage>991</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics8090991</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Muneer</surname> <given-names>S</given-names></string-name>, <string-name><surname>Farooq</surname> <given-names>U</given-names></string-name>, <string-name><surname>Athar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ahsan Raza</surname> <given-names>M</given-names></string-name>, <string-name><surname>Ghazal</surname> <given-names>TM</given-names></string-name>, <string-name><surname>Sakib</surname> <given-names>S</given-names></string-name></person-group>. <article-title>A critical review of artificial intelligence based approaches in intrusion detection: a comprehensive analysis</article-title>. <source>J Eng</source>. <year>2024</year>;<volume>2024</volume>(<issue>1</issue>):<fpage>3909173</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2024/3909173</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Roshan</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zafar</surname> <given-names>A</given-names></string-name>, <string-name><surname>Haque</surname> <given-names>SBU</given-names></string-name></person-group>. <article-title>Untargeted white-box adversarial attack with heuristic defence methods in real-time deep learning based network intrusion detection system</article-title>. <source>Comput Commun</source>. <year>2024</year>;<volume>218</volume>:<fpage>97</fpage>&#x2013;<lpage>113</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comcom.2023.09.030</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>H</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Survey of technology in network security situation awareness</article-title>. <source>Sensors</source>. <year>2023</year>;<volume>23</volume>(<issue>5</issue>):<fpage>2608</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s23052608</pub-id>; <pub-id pub-id-type="pmid">36904812</pub-id></mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>L</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Network security situation assessment with network attack behavior classification</article-title>. <source>Int J Intell Syst</source>. <year>2022</year>;<volume>37</volume>(<issue>10</issue>):<fpage>6909</fpage>&#x2013;<lpage>27</lpage>. doi:<pub-id pub-id-type="doi">10.1002/int.22867</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>E</given-names></string-name>, <string-name><surname>Bu</surname> <given-names>B</given-names></string-name></person-group>. <article-title>CBTC systems resilience evaluation based on resource state model under DoS attacks</article-title>. In: <conf-name>2021 7th Annual International Conference on Network and Information Systems for Computers (ICNISC)</conf-name>; <year>2021</year>; <conf-loc>Guiyang, China</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>451</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Ning</surname> <given-names>H</given-names></string-name>, <string-name><surname>Shi</surname> <given-names>F</given-names></string-name>, <string-name><surname>Farha</surname> <given-names>F</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>J</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Artificial intelligence in cyber security: research advances, challenges, and opportunities</article-title>. <source>Artif Intell Rev</source>. <year>2022</year>:<volume>55</volume>;<fpage>1029</fpage>&#x2013;<lpage>53</lpage>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Bejoy</surname> <given-names>B</given-names></string-name>, <string-name><surname>Raju</surname> <given-names>G</given-names></string-name>, <string-name><surname>Swain</surname> <given-names>D</given-names></string-name>, <string-name><surname>Acharya</surname> <given-names>B</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>YC</given-names></string-name></person-group>. <article-title>A generic cyber immune framework for anomaly detection using artificial immune systems</article-title>. <source>Appl Soft Comput</source>. <year>2022</year>;<volume>130</volume>:<fpage>109680</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.asoc.2022.109680</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>V</given-names></string-name>, <string-name><surname>Sinha</surname> <given-names>D</given-names></string-name></person-group>. <article-title>Synthetic attack data generation model applying generative adversarial network for intrusion detection</article-title>. <source>Comput Secur</source>. <year>2023</year>;<volume>125</volume>:<fpage>103054</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cose.2022.103054</pub-id>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>W</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>P</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Letaief</surname> <given-names>KB</given-names></string-name></person-group>. <article-title>Cooperative edge caching based on elastic federated and multi-agent deep reinforcement learning in next-generation networks</article-title>. <source>IEEE Trans Netw Serv Manag</source>. <year>2024</year>;<volume>21</volume>(<issue>4</issue>):<fpage>4179</fpage>&#x2013;<lpage>96</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TNSM.2024.3403842</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>P</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>N</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Semantic-aware spectrum sharing in internet of vehicles based on deep reinforcement learning</article-title>. <source>IEEE Internet Things J</source>. <year>2024</year>;<volume>11</volume>(<issue>23</issue>):<fpage>38521</fpage>&#x2013;<lpage>36</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2024.3448538</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>GF</given-names></string-name></person-group>. <article-title>A multi-objective decision method for the network security situation grade assessment under multi-source information</article-title>. <source>Inf Fusion</source>. <year>2024</year>;<volume>102</volume>:<fpage>102066</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.inffus.2023.102066</pub-id>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Li</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Network awareness of security situation information security measurement method based on data mining</article-title>. <source>J Intell Fuzzy Syst</source>. <year>2024</year>;<volume>46</volume>:<fpage>209</fpage>&#x2013;<lpage>19</lpage>. doi:<pub-id pub-id-type="doi">10.3233/JIFS-233390</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Du</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Fu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Ren</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Network situation assessment method based on improved BP neural network</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>3</issue>):<fpage>483</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12030483</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>X</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Gang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Research on network security situation awareness and dynamic game based on deep Q learning network</article-title>. <source>J Internet Technol</source>. <year>2023</year>;<volume>24</volume>(<issue>2</issue>):<fpage>549</fpage>&#x2013;<lpage>63</lpage>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Yang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>R</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>F</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name></person-group>. <chapter-title>An unsupervised learning-based network threat situation assessment model for internet of things</chapter-title>. In: <source>Security and communication networks</source>. <publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>John Wiley &#x0026; Sons, Inc</publisher-name>. <year>2020</year>. doi:<pub-id pub-id-type="doi">10.1155/2020/6656066</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Di</surname> <given-names>X</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>J</given-names></string-name>, <etal>et al.</etal></person-group> <article-title>Research on network security situation assessment and quantification method based on analytic hierarchy process</article-title>. <source>Wirel Pers Commun</source>. <year>2018</year>;<volume>102</volume>:<fpage>1401</fpage>&#x2013;<lpage>20</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11277-017-5202-3</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Jie</surname> <given-names>SLBD</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>R</given-names></string-name>, <string-name><surname>Lang</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>LBD</given-names></string-name></person-group>. <article-title>Power Grid Security Situation Awareness Method based on Deep Learning</article-title>. In: <conf-name>2023 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing &#x0026; Communications (GreenCom) and IEEE Cyber, Physical &#x0026; Social Computing (CPSCom) and IEEE Smart Data (SmartData) and IEEE Congress on Cybermatics (Cybermatics)</conf-name>; <year>2023</year>; <conf-loc>Danzhou, China</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>776</fpage>&#x2013;<lpage>80</lpage>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Security situation assessment for terminal area control system operation based on BN-ISSA-ELM</article-title>. <source>Appl Sci</source>. <year>2024</year>;<volume>14</volume>(<issue>23</issue>):<fpage>11384</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app142311384</pub-id>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="book"><person-group person-group-type="author"><string-name><surname>Zhao</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Yan</surname> <given-names>J</given-names></string-name>, <string-name><surname>Li</surname> <given-names>C</given-names></string-name></person-group>. <chapter-title>Analysis and application of intelligent power control system cyber security situation awareness based on wavelet neural network</chapter-title>. In: <source>Journal of Physics: Conference Series</source>; <year>2021</year>; <conf-loc>Wuxi, China</conf-loc>: <publisher-name>IOP Publishing</publisher-name>. vol. <volume>2078</volume>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name></person-group>. <article-title>Industrial control network security situation assessment based on SAE-RBF</article-title>. In: <conf-name>2022 11th International Conference of Information and Communication Technology (ICTech)</conf-name>; <year>2022</year>; <conf-loc>Wuhan, China</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>43</fpage>&#x2013;<lpage>7</lpage>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lei</surname> <given-names>W</given-names></string-name>, <string-name><surname>Wen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Hou</surname> <given-names>W</given-names></string-name></person-group>. <article-title>MADDPG-based security situational awareness for smart grid with intelligent edge</article-title>. <source>Appl Sci</source>. <year>2021</year>;<volume>11</volume>(<issue>7</issue>):<fpage>3101</fpage>. doi:<pub-id pub-id-type="doi">10.3390/app11073101</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>H</given-names></string-name>, <string-name><surname>Cong</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>N</given-names></string-name>, <string-name><surname>Song</surname> <given-names>HH</given-names></string-name></person-group>. <article-title>A survey on cyber-physical systems security</article-title>. <source>IEEE Internet Things J</source>. <year>2023</year>;<volume>10</volume>(<issue>24</issue>):<fpage>21670</fpage>&#x2013;<lpage>86</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JIOT.2023.3289625</pub-id>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Alsulami</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Al-Haija</surname> <given-names>QA</given-names></string-name>, <string-name><surname>Alturki</surname> <given-names>B</given-names></string-name>, <string-name><surname>Alqahtani</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alsini</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Security strategy for autonomous vehicle cyber-physical systems using transfer learning</article-title>. <source>J Cloud Comput</source>. <year>2023</year>;<volume>12</volume>(<issue>1</issue>):<fpage>181</fpage>. doi:<pub-id pub-id-type="doi">10.1186/s13677-023-00564-x</pub-id>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Abdo</surname> <given-names>A</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>X</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Feng</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Cybersecurity on connected and automated transportation systems: a survey</article-title>. <source>IEEE Trans Intell Vehicles</source>. <year>2024</year>;<volume>9</volume>(<issue>1</issue>):<fpage>1382</fpage>&#x2013;<lpage>401</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIV.2023.3326736</pub-id>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Lu</surname> <given-names>R</given-names></string-name>, <string-name><surname>Dong</surname> <given-names>H</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Cui</surname> <given-names>D</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>A resilience-based security assessment approach for CBTC systems</article-title>. <source>Complexity</source>. <year>2021</year>;<volume>2021</volume>(<issue>1</issue>):<fpage>2175780</fpage>. doi:<pub-id pub-id-type="doi">10.1155/2021/2175780</pub-id>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Kanghao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Hongwei</surname> <given-names>W</given-names></string-name>, <string-name><surname>Dongliang</surname> <given-names>C</given-names></string-name></person-group>. <article-title>A quantitative situation awareness approach for cbtc systems based on multi-dimensional Gaussian hidden Markov model</article-title>. In: <conf-name>2020 Chinese Automation Congress (CAC)</conf-name>; <year>2020</year>; <conf-loc>Shanghai, China</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>3488</fpage>&#x2013;<lpage>92</lpage>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yu</surname> <given-names>FR</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>A cross-layer defense scheme for edge intelligence-enabled CBTC systems against MitM attacks</article-title>. <source>IEEE Trans Intell Transp Syst</source>. <year>2020</year>;<volume>22</volume>(<issue>4</issue>):<fpage>2286</fpage>&#x2013;<lpage>98</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TITS.2020.3030496</pub-id>.</mixed-citation></ref>
<ref id="ref-32"><label>[32]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>C</given-names></string-name>, <string-name><surname>Tian</surname> <given-names>YC</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Assessing the physical impact of cyberattacks on industrial cyber-physical systems</article-title>. <source>IEEE Trans Ind Electron</source>. <year>2018</year>;<volume>65</volume>(<issue>10</issue>):<fpage>8153</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TIE.2018.2798605</pub-id>.</mixed-citation></ref>
<ref id="ref-33"><label>[33]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Yan</surname> <given-names>K</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Qin</surname> <given-names>F</given-names></string-name></person-group>. <article-title>A cyber-physical power system risk assessment model against cyberattacks</article-title>. <source>IEEE Syst J</source>. <year>2022</year>;<volume>17</volume>(<issue>2</issue>):<fpage>2018</fpage>&#x2013;<lpage>28</lpage>. doi:<pub-id pub-id-type="doi">10.1109/JSYST.2022.3215591</pub-id>.</mixed-citation></ref>
<ref id="ref-34"><label>[34]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Ahmed</surname> <given-names>MS</given-names></string-name>, <string-name><surname>Al-Shaer</surname> <given-names>E</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>L</given-names></string-name></person-group>. <article-title>A novel quantitative approach for measuring network security</article-title>. In: <conf-name>IEEE INFOCOM 2008&#x2014;The 27th Conference on Computer Communications</conf-name>; <year>2008</year>; <conf-loc>Phoenix, AZ, USA</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>1957</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="ref-35"><label>[35]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Feng</surname> <given-names>N</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>HJ</given-names></string-name>, <string-name><surname>Li</surname> <given-names>M</given-names></string-name></person-group>. <article-title>A security risk analysis model for information systems: causal relationships of risk factors and vulnerability propagation analysis</article-title>. <source>Inf Sci</source>. <year>2014</year>;<volume>256</volume>:<fpage>57</fpage>&#x2013;<lpage>73</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ins.2013.02.036</pub-id>.</mixed-citation></ref>
<ref id="ref-36"><label>[36]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>XQ</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>JY</given-names></string-name>, <string-name><surname>Gu</surname> <given-names>CH</given-names></string-name></person-group>. <article-title>Information security vulnerability association analysis based on ontology technology</article-title>. <source>J East China Univ Sci Technol</source>. <year>2015</year>;<volume>40</volume>(<issue>1</issue>):<fpage>125</fpage>&#x2013;<lpage>31</lpage>.</mixed-citation></ref>
<ref id="ref-37"><label>[37]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Batur &#x015E;ahin</surname> <given-names>C</given-names></string-name>, <string-name><surname>Abualigah</surname> <given-names>L</given-names></string-name></person-group>. <article-title>A novel deep learning-based feature selection model for improving the static analysis of vulnerability detection</article-title>. <source>Neural Comput Appl</source>. <year>2021</year>;<volume>33</volume>(<issue>20</issue>):<fpage>14049</fpage>&#x2013;<lpage>67</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s00521-021-06047-x</pub-id>.</mixed-citation></ref>
<ref id="ref-38"><label>[38]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Creswell</surname> <given-names>A</given-names></string-name>, <string-name><surname>White</surname> <given-names>T</given-names></string-name>, <string-name><surname>Dumoulin</surname> <given-names>V</given-names></string-name>, <string-name><surname>Arulkumaran</surname> <given-names>K</given-names></string-name>, <string-name><surname>Sengupta</surname> <given-names>B</given-names></string-name>, <string-name><surname>Bharath</surname> <given-names>AA</given-names></string-name></person-group>. <article-title>Generative adversarial networks: an overview</article-title>. <source>IEEE Signal Process Mag</source>. <year>2018</year>;<volume>35</volume>(<issue>1</issue>):<fpage>53</fpage>&#x2013;<lpage>65</lpage>.</mixed-citation></ref>
<ref id="ref-39"><label>[39]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Yin</surname> <given-names>B</given-names></string-name>, <string-name><surname>Bu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Gao</surname> <given-names>B</given-names></string-name>, <string-name><surname>Li</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>A hybrid intrusion detection method using improved stacking ensemble algorithm and false positive elimination strategy for CBTC</article-title>. In: <conf-name>2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC)</conf-name>; <year>2022</year>; <conf-loc>Macau, China</conf-loc>: <publisher-name>IEEE</publisher-name>. p. <fpage>4253</fpage>&#x2013;<lpage>8</lpage>.</mixed-citation></ref>
<ref id="ref-40"><label>[40]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Li</surname> <given-names>Q</given-names></string-name>, <string-name><surname>Bu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>J</given-names></string-name></person-group>. <article-title>A novel hierarchical situation awareness model for CBTC using SVD entropy and GRU with PRD algorithms</article-title>. <source>IEEE Access</source>. <year>2021</year>;<volume>9</volume>:<fpage>132290</fpage>&#x2013;<lpage>300</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2021.3112166</pub-id>.</mixed-citation></ref>
<ref id="ref-41"><label>[41]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Shi</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>T</given-names></string-name>, <string-name><surname>Li</surname> <given-names>R</given-names></string-name>, <string-name><surname>Peng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Tang</surname> <given-names>P</given-names></string-name></person-group>. <article-title>An immunity-based IOT environment security situation awareness model</article-title>. <source>J Comput Commun</source>. <year>2017</year>;<volume>5</volume>(<issue>7</issue>):<fpage>182</fpage>. doi:<pub-id pub-id-type="doi">10.4236/jcc.2017.57016</pub-id>.</mixed-citation></ref>
<ref id="ref-42"><label>[42]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Binbusayyis</surname> <given-names>A</given-names></string-name>, <string-name><surname>Vaiyapuri</surname> <given-names>T</given-names></string-name></person-group>. <article-title>Unsupervised deep learning approach for network intrusion detection combining convolutional autoencoder and one-class SVM</article-title>. <source>Appl Intell</source>. <year>2021</year>;<volume>51</volume>(<issue>10</issue>):<fpage>7094</fpage>&#x2013;<lpage>108</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s10489-021-02205-9</pub-id>.</mixed-citation></ref>
<ref id="ref-43"><label>[43]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wu</surname> <given-names>T</given-names></string-name>, <string-name><surname>Fan</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>H</given-names></string-name>, <string-name><surname>You</surname> <given-names>C</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>H</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Intrusion detection system combined enhanced random forest with SMOTE algorithm</article-title>. <source>EURASIP J Adv Signal Process</source>. <year>2022</year>;<volume>2022</volume>(<issue>1</issue>):<fpage>39</fpage>. doi:<pub-id pub-id-type="doi">10.1186/s13634-022-00871-6</pub-id>.</mixed-citation></ref>
<ref id="ref-44"><label>[44]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Chapagain</surname> <given-names>P</given-names></string-name>, <string-name><surname>Timalsina</surname> <given-names>A</given-names></string-name>, <string-name><surname>Bhandari</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chitrakar</surname> <given-names>R</given-names></string-name></person-group>. <article-title>Intrusion detection based on PCA with improved K-means</article-title>. In: <conf-name>International Conference on Electrical and Electronics Engineering</conf-name>; <year>2022</year>; <conf-loc>Singapore</conf-loc>: <publisher-name>Springer</publisher-name>. p. <fpage>13</fpage>&#x2013;<lpage>27</lpage>.</mixed-citation></ref>
<ref id="ref-45"><label>[45]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Talaei Khoei</surname> <given-names>T</given-names></string-name>, <string-name><surname>Kaabouch</surname> <given-names>N</given-names></string-name></person-group>. <article-title>A comparative analysis of supervised and unsupervised models for detecting attacks on the intrusion detection systems</article-title>. <source>Information</source>. <year>2023</year>;<volume>14</volume>(<issue>2</issue>):<fpage>103</fpage>. doi:<pub-id pub-id-type="doi">10.3390/info14020103</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>