<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.4 20241031//EN" "JATS-journalpublishing1-4.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article" dtd-version="1.4" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">ica</journal-id>
      <journal-title-group>
        <journal-title>Intelligent Control and Automation</journal-title>
      </journal-title-group>
      <issn pub-type="epub">2153-0661</issn>
      <issn pub-type="ppub">2153-0653</issn>
      <publisher>
        <publisher-name>Scientific Research Publishing</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.4236/ica.2026.174011</article-id>
      <article-id pub-id-type="publisher-id">ica-155138</article-id>
      <article-categories>
        <subj-group>
          <subject>Article</subject>
        </subj-group>
        <subj-group>
          <subject>Computer Science</subject>
          <subject>Communications</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Mathematical Model for Signal Control and State Monitoring in a Relay Interlocking System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Boltayev</surname>
            <given-names>Sunnatillo Tuymurodovich</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Rakhmonov</surname>
            <given-names>Bobomurod Bakhtiyorovich</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <name name-style="western">
            <surname>Aripova</surname>
            <given-names>Charos Murodjon qizi</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="aff1"><label>1</label> Tashkent State Transport University, Tashkent, Uzbekistan </aff>
      <author-notes>
        <fn fn-type="conflict" id="fn-conflict">
          <p>The authors declare no conflicts of interest regarding the publication of this paper.</p>
        </fn>
      </author-notes>
      <pub-date pub-type="epub">
        <day>03</day>
        <month>11</month>
        <year>2026</year>
      </pub-date>
      <pub-date pub-type="collection">
        <month>11</month>
        <year>2026</year>
      </pub-date>
      <volume>17</volume>
      <issue>04</issue>
      <fpage>225</fpage>
      <lpage>234</lpage>
      <history>
        <date date-type="received">
          <day>11</day>
          <month>10</month>
          <year>2026</year>
        </date>
        <date date-type="accepted">
          <day>03</day>
          <month>11</month>
          <year>2026</year>
        </date>
        <date date-type="published">
          <day>06</day>
          <month>11</month>
          <year>2026</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2026 by the authors and Scientific Research Publishing Inc.</copyright-statement>
        <copyright-year>2026</copyright-year>
        <license license-type="open-access">
          <license-p> This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">https://creativecommons.org/licenses/by/4.0/</ext-link> ). </license-p>
        </license>
      </permissions>
      <self-uri content-type="doi" xlink:href="https://doi.org/10.4236/ica.2026.174011">https://doi.org/10.4236/ica.2026.174011</self-uri>
      <abstract>
        <p>This paper addresses the formalization of entrance and exit signal monitoring information when a relay interlocking system is integrated with the station duty officer’s automated workstation (SDO AW). Discrete input signals, state codes, and the update function of a finite-state automaton are defined using the supplied state tables. The 16 entrance signal input combinations are classified into five states, and Boolean expressions are derived for these states. The exit signal table is shown to map eight combinations to only two states and to be incomplete with respect to the other state definitions. A procedure is proposed for processing information quality, timestamps, and the signal identifier together with the state code. Functional dependencies of entrance, exit, and shunting signals, route authorization conditions, the command execution confirmation loop, and verification scenarios are examined.</p>
      </abstract>
      <kwd-group kwd-group-type="author-generated" xml:lang="en">
        <kwd>Relay Interlocking</kwd>
        <kwd>Entrance Signal</kwd>
        <kwd>Exit Signal</kwd>
        <kwd>Station Duty Officer’s Automated Workstation</kwd>
        <kwd>Finite-State Automaton</kwd>
        <kwd>Boolean Function</kwd>
        <kwd>Monitoring Information</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec1">
      <title>1. Introduction</title>
      <p>When relay interlocking equipment is connected to a computer interface, signal states must be identified unambiguously from feedback signals [<xref ref-type="bibr" rid="B1">1</xref>]. The indication displayed on SDO AW should represent the monitoring result received from the controlled object rather than merely indicate that a command has been sent. Distinguishing commands from indications forms the signal-related part of the closed command-execution-confirmation-indication loop.</p>
    </sec>
    <sec id="sec2">
      <title>2. Source Data and Modelling Method</title>
      <p>For the entrance signal, the source specifies a lamp proving relay (<italic>O</italic>), a calling-on relay (<italic>PS</italic>), and red (<italic>K</italic>) and green (<italic>Ya</italic>) signals. For the exit signal, it specifies a lamp proving relay (<italic>O</italic>), a signal relay (<italic>S</italic>), and a shunting signal (<italic>MS</italic>) [<xref ref-type="bibr" rid="B1">1</xref>]-[<xref ref-type="bibr" rid="B3">3</xref>].</p>
      <disp-formula id="FD1">
        <label>(1)</label>
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>A</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Q</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:mi>Σ</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:mi>δ</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>,</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mi>i</mml:mi>
            <mml:mo>∉</mml:mo>
            <mml:mrow>
              <mml:mo>{</mml:mo>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mi>n</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>o</mml:mi>
                <mml:mi>u</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:mrow>
              <mml:mo>}</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Here, <italic>Q</italic><italic><sub>i</sub></italic> is the set of states, Σ<italic><sub>i</sub></italic> is the set of input combinations, and <italic>δ</italic><italic><sub>i</sub></italic> is the state update function. The model classifies current information as follows:</p>
      <disp-formula id="FD2">
        <label>(2)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>q</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>t</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:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>δ</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>q</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>t</mml:mi>
                      <mml:mi>k</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:mi>x</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>t</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:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>f</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>x</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>t</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:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>If the input combination remains unchanged, the state is retained. When the combination changes, the new state is determined from the table. Such a transition represents a change in monitoring information; it does not replace the algorithm that authorizes signal clearance. The interlocking safety logic is retained separately.</p>
    </sec>
    <sec id="sec3">
      <title>3. Mathematical Model of Entrance Signal States</title>
      <disp-formula id="FD3">
        <label>(3)</label>
        <mml:math>
          <mml:mrow>
            <mml:msub>
              <mml:mi>x</mml:mi>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mi>n</mml:mi>
              </mml:mrow>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>O</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>P</mml:mi>
                <mml:mi>S</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>K</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>Y</mml:mi>
                <mml:mi>a</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>∉</mml:mo>
            <mml:msup>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>{</mml:mo>
                  <mml:mrow>
                    <mml:mn>0</mml:mn>
                    <mml:mo>,</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mo>}</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mn>4</mml:mn>
            </mml:msup>
            <mml:mo>,</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mrow>
              <mml:mo>|</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Σ</mml:mi>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mi>n</mml:mi>
                  </mml:mrow>
                </mml:msub>
              </mml:mrow>
              <mml:mo>|</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msup>
              <mml:mn>2</mml:mn>
              <mml:mn>4</mml:mn>
            </mml:msup>
            <mml:mo>=</mml:mo>
            <mml:mn>16</mml:mn>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>The combinations are denoted by <italic>X</italic><sub>0</sub> - <italic>X</italic><sub>15</sub>. The index is determined from the binary value of the signal vector:</p>
      <disp-formula id="FD4">
        <label>(4)</label>
        <mml:math>
          <mml:mrow>
            <mml:mi>j</mml:mi>
            <mml:mo>=</mml:mo>
            <mml:mn>8</mml:mn>
            <mml:mi>O</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:mn>4</mml:mn>
            <mml:mi>P</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:mn>2</mml:mn>
            <mml:mi>K</mml:mi>
            <mml:mo>+</mml:mo>
            <mml:mi>Y</mml:mi>
            <mml:mi>a</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Table 1. Entrance signal input combinations and states.</p>
      <table-wrap id="tbl1">
        <label>Table 1</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Code</bold>
              </td>
              <td>
                <italic>
                  <bold>O</bold>
                </italic>
              </td>
              <td>
                <italic>
                  <bold>PS</bold>
                </italic>
              </td>
              <td>
                <italic>
                  <bold>K</bold>
                </italic>
              </td>
              <td>
                <italic>
                  <bold>Ya</bold>
                </italic>
              </td>
              <td>
                <bold>State</bold>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>0</sub>
              </td>
              <td>0</td>
              <td>0</td>
              <td>0</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>4</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>1</sub>
              </td>
              <td>0</td>
              <td>0</td>
              <td>0</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>2</sub>
              </td>
              <td>0</td>
              <td>0</td>
              <td>1</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>3</sub>
              </td>
              <td>0</td>
              <td>0</td>
              <td>1</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>4</sub>
              </td>
              <td>0</td>
              <td>1</td>
              <td>0</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>5</sub>
              </td>
              <td>0</td>
              <td>1</td>
              <td>0</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>6</sub>
              </td>
              <td>0</td>
              <td>1</td>
              <td>1</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>7</sub>
              </td>
              <td>0</td>
              <td>1</td>
              <td>1</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>8</sub>
              </td>
              <td>1</td>
              <td>0</td>
              <td>0</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>4</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>9</sub>
              </td>
              <td>1</td>
              <td>0</td>
              <td>0</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>2</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>10</sub>
              </td>
              <td>1</td>
              <td>0</td>
              <td>1</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>11</sub>
              </td>
              <td>1</td>
              <td>0</td>
              <td>1</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>5</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>12</sub>
              </td>
              <td>1</td>
              <td>1</td>
              <td>0</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>3</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>13</sub>
              </td>
              <td>1</td>
              <td>1</td>
              <td>0</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>5</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>14</sub>
              </td>
              <td>1</td>
              <td>1</td>
              <td>1</td>
              <td>0</td>
              <td>
                <italic>S</italic>
                <sub>3</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>15</sub>
              </td>
              <td>1</td>
              <td>1</td>
              <td>1</td>
              <td>1</td>
              <td>
                <italic>S</italic>
                <sub>5</sub>
              </td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>The states are defined as follows: <italic>S</italic><sub>1</sub>, red; <italic>S</italic><sub>2</sub>, green; <italic>S</italic><sub>3</sub>, red and white; <italic>S</italic><sub>4</sub>, no information; and <italic>S</italic><sub>5</sub>, an inadmissible combination. The original designation of <italic>S</italic><sub>5</sub> as “non-existent” does not mean that the signal is physically absent. In this paper, it is interpreted as a diagnostic state indicating an input combination not admitted by the model [<xref ref-type="bibr" rid="B4">4</xref>]. <bold>Table 1</bold> provides the complete mapping.</p>
      <p>Grouping the combinations in <bold>Table 1</bold> yields an indicator function for each state. <italic>C</italic><italic><sub>i</sub></italic> = 1 means that the current combination belongs to state <italic>S</italic><italic><sub>i</sub></italic>. The symbols ¬, <inline-formula><mml:math display="inline"><mml:mo> ∧ </mml:mo></mml:math></inline-formula> , and <inline-formula><mml:math display="inline"><mml:mo> ∨ </mml:mo></mml:math></inline-formula> denote logical NOT, AND, and OR, respectively.</p>
      <disp-formula id="FD5">
        <label>(5)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>1</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mo>¬</mml:mo>
                <mml:mi>O</mml:mi>
                <mml:mo>∧</mml:mo>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mrow>
                    <mml:mi>P</mml:mi>
                    <mml:mi>S</mml:mi>
                    <mml:mo>∨</mml:mo>
                    <mml:mi>K</mml:mi>
                    <mml:mo>∨</mml:mo>
                    <mml:mi>Y</mml:mi>
                    <mml:mi>a</mml:mi>
                  </mml:mrow>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>∨</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>O</mml:mi>
                <mml:mo>∧</mml:mo>
                <mml:mo>¬</mml:mo>
                <mml:mi>P</mml:mi>
                <mml:mi>S</mml:mi>
                <mml:mo>∧</mml:mo>
                <mml:mi>K</mml:mi>
                <mml:mo>∧</mml:mo>
                <mml:mo>¬</mml:mo>
                <mml:mi>Y</mml:mi>
                <mml:mi>a</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <disp-formula id="FD6">
        <label>(6)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>2</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>O</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>P</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>K</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mi>Y</mml:mi>
            <mml:mi>a</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <disp-formula id="FD7">
        <label>(7)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>3</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>O</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mi>P</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>Y</mml:mi>
            <mml:mi>a</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <disp-formula id="FD8">
        <label>(8)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>4</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>P</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>K</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>Y</mml:mi>
            <mml:mi>a</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <disp-formula id="FD9">
        <label>(9)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>5</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>O</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mi>Y</mml:mi>
            <mml:mi>a</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>P</mml:mi>
                <mml:mi>S</mml:mi>
                <mml:mo>∨</mml:mo>
                <mml:mi>K</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><italic>C</italic><sub>1</sub> covers <italic>X</italic><sub>1</sub> - <italic>X</italic><sub>7</sub> and <italic>X</italic><sub>10</sub>; <italic>C</italic><sub>2</sub> equals one only for <italic>X</italic><sub>9</sub>; <italic>C</italic><sub>3</sub> for <italic>X</italic><sub>12</sub> and <italic>X</italic><sub>14</sub>; <italic>C</italic><sub>4</sub> for <italic>X</italic><sub>0</sub> and <italic>X</italic><sub>8</sub>; and <italic>C</italic><sub>5</sub> for <italic>X</italic><sub>11</sub>, <italic>X</italic><sub>13</sub>, and <italic>X</italic><sub>15</sub>. Each combination in the table belongs to exactly one state [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B6">6</xref>]:</p>
      <disp-formula id="FD10">
        <label>(10)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>1</mml:mn>
            </mml:msub>
            <mml:mo>∨</mml:mo>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>2</mml:mn>
            </mml:msub>
            <mml:mo>∨</mml:mo>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>3</mml:mn>
            </mml:msub>
            <mml:mo>∨</mml:mo>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>4</mml:mn>
            </mml:msub>
            <mml:mo>∨</mml:mo>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mn>5</mml:mn>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mn>1</mml:mn>
            <mml:mo>;</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mo>∧</mml:mo>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mi>j</mml:mi>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mn>0</mml:mn>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>i</mml:mi>
                <mml:mo>≠</mml:mo>
                <mml:mi>j</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p><xref ref-type="fig" rid="fig1">Figure 1</xref> illustrates the entrance signal state identification rule. The next state is determined by the current input group, independently of the previous state. Arrow colours identify the destination states and their associated input groups.</p>
      <fig id="fig1">
        <label>Figure 1</label>
        <graphic xlink:href="https://html.scirp.org/file/7900811-rId39.jpeg?20261106095435" />
      </fig>
      <p>Figure 1. Mapping entrance signal input combinations to states.</p>
      <p>For example, receiving <italic>X</italic><sub>9</sub> = (1, 0, 0, 1) identifies <italic>S</italic><sub>2</sub>. If <italic>K</italic> changes from 0 to 1, <italic>X</italic><sub>11</sub> = (1, 0, 1, 1) is obtained and the transition <italic>S</italic><sub>2</sub> → <italic>S</italic><sub>5</sub> is recorded. This represents a transition from the state designated as permissive to a diagnostic state. When Ya changes from 1 to 0, <italic>X</italic><sub>10</sub> = (1, 0, 1, 0) is obtained and the automaton identifies S<sub>1</sub>. These examples are table-based calculations rather than physical operational tests.</p>
    </sec>
    <sec id="sec4">
      <title>4. Exit Signal Model and Data Consistency</title>
      <disp-formula id="FD11">
        <label>(11)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>x</mml:mi>
              <mml:mrow>
                <mml:mi>o</mml:mi>
                <mml:mi>u</mml:mi>
                <mml:mi>t</mml:mi>
              </mml:mrow>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:mi>O</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>S</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mi>M</mml:mi>
                <mml:mi>S</mml:mi>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>∈</mml:mo>
            <mml:msup>
              <mml:mrow>
                <mml:mrow>
                  <mml:mo>{</mml:mo>
                  <mml:mrow>
                    <mml:mn>0</mml:mn>
                    <mml:mo>,</mml:mo>
                    <mml:mn>1</mml:mn>
                  </mml:mrow>
                  <mml:mo>}</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mn>3</mml:mn>
            </mml:msup>
            <mml:mo>;</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mrow>
              <mml:mo>|</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>Σ</mml:mi>
                  <mml:mrow>
                    <mml:mi>o</mml:mi>
                    <mml:mi>u</mml:mi>
                    <mml:mi>t</mml:mi>
                  </mml:mrow>
                </mml:msub>
              </mml:mrow>
              <mml:mo>|</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mn>8</mml:mn>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>For the exit signal, the states are defined as <italic>S</italic><sub>1</sub>, red; <italic>S</italic><sub>2</sub>, white; <italic>S</italic><sub>3</sub>, extinguished; <italic>S</italic><sub>4</sub>, flashing white; and <italic>S</italic><sub>5</sub>, a non-existent state (<bold>Table 2</bold>).</p>
      <p>Table 2. Mapping actually specified in the exit signal table.</p>
      <table-wrap id="tbl2">
        <label>Table 2</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>Combinations</bold>
              </td>
              <td>
                <bold>Logical condition</bold>
              </td>
              <td>
                <bold>State</bold>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>0</sub>
              </td>
              <td>
                <italic>O</italic>
                = 0,
                <italic>S</italic>
                = 0,
                <italic>MS</italic>
                = 0
              </td>
              <td>
                <italic>S</italic>
                <sub>4</sub>
              </td>
            </tr>
            <tr>
              <td>
                <italic>X</italic>
                <sub>1</sub>
                -
                <italic>X</italic>
                <sub>7</sub>
              </td>
              <td>
                <inline-formula>
                  <mml:math display="inline">
                    <mml:mrow>
                      <mml:mi>O</mml:mi>
                      <mml:mo>∨</mml:mo>
                      <mml:mi>S</mml:mi>
                      <mml:mo>∨</mml:mo>
                      <mml:mi>M</mml:mi>
                      <mml:mi>S</mml:mi>
                      <mml:mo>=</mml:mo>
                      <mml:mn>1</mml:mn>
                    </mml:mrow>
                  </mml:math>
                </inline-formula>
              </td>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
            </tr>
            <tr>
              <td>Not specified</td>
              <td>No combination specified in the table</td>
              <td>
                <italic>S</italic>
                <sub>2</sub>
                ,
                <italic>S</italic>
                <sub>3</sub>
                ,
                <italic>S</italic>
                <sub>5</sub>
              </td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <disp-formula id="FD12">
        <label>(12)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mrow>
                <mml:mi>o</mml:mi>
                <mml:mi>u</mml:mi>
                <mml:mi>t</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mn>4</mml:mn>
              </mml:mrow>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>O</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>S</mml:mi>
            <mml:mo>∧</mml:mo>
            <mml:mo>¬</mml:mo>
            <mml:mi>M</mml:mi>
            <mml:mi>S</mml:mi>
            <mml:mo>;</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:msub>
              <mml:mi>C</mml:mi>
              <mml:mrow>
                <mml:mi>o</mml:mi>
                <mml:mi>u</mml:mi>
                <mml:mi>t</mml:mi>
                <mml:mo>,</mml:mo>
                <mml:mn>1</mml:mn>
              </mml:mrow>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mi>O</mml:mi>
            <mml:mo>∨</mml:mo>
            <mml:mi>S</mml:mi>
            <mml:mo>∨</mml:mo>
            <mml:mi>M</mml:mi>
            <mml:mi>S</mml:mi>
          </mml:mrow>
        </mml:math>
      </disp-formula>
    </sec>
    <sec id="sec5">
      <title>5. Signal Monitoring on SDO AW</title>
      <p>The signal state is associated with an object identifier. A monitoring record may be structured as follows [<xref ref-type="bibr" rid="B7">7</xref>][<xref ref-type="bibr" rid="B8">8</xref>]:</p>
      <disp-formula id="FD13">
        <label>(13)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>R</mml:mi>
              <mml:mrow>
                <mml:mi>s</mml:mi>
                <mml:mi>i</mml:mi>
                <mml:mi>g</mml:mi>
              </mml:mrow>
            </mml:msub>
            <mml:mo>=</mml:mo>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Object</mml:mtext>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:mtext>ID</mml:mtext>
                  </mml:mrow>
                </mml:msub>
                <mml:mo>,</mml:mo>
                <mml:msub>
                  <mml:mrow>
                    <mml:mtext>Object</mml:mtext>
                  </mml:mrow>
                  <mml:mrow>
                    <mml:mtext>Type</mml:mtext>
                  </mml:mrow>
                </mml:msub>
                <mml:mo>,</mml:mo>
                <mml:mtext>State</mml:mtext>
                <mml:mo>,</mml:mo>
                <mml:mtext>Timestamp</mml:mtext>
                <mml:mo>,</mml:mo>
                <mml:mtext>Quality</mml:mtext>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>Object<sub>ID</sub> identifies the particular signal; Object<sub>Type</sub> specifies its type; State contains the calculated state; Timestamp records the time of the monitoring information; and Quality indicates data quality. Here, <italic>R</italic><italic><sub>sig</sub></italic> is a monitoring record and is not equivalent to a control authorization in the interlocking system.</p>
      <p>Information validity is assessed separately using <italic>v</italic>(<italic>t</italic>). It jointly represents communication availability, reception of signals within a consistent time interval, and compliance with the specified data freshness requirement. The freshness threshold must be established from the requirements of the actual system. The indication rule is written as follows:</p>
      <disp-formula id="FD14">
        <label>(14)</label>
        <mml:math display="inline">
          <mml:mrow>
            <mml:msub>
              <mml:mi>I</mml:mi>
              <mml:mrow>
                <mml:mi>s</mml:mi>
                <mml:mi>i</mml:mi>
                <mml:mi>g</mml:mi>
              </mml:mrow>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>t</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:msub>
              <mml:mi>f</mml:mi>
              <mml:mi>i</mml:mi>
            </mml:msub>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mrow>
                <mml:msub>
                  <mml:mi>x</mml:mi>
                  <mml:mi>i</mml:mi>
                </mml:msub>
                <mml:mrow>
                  <mml:mo>(</mml:mo>
                  <mml:mi>t</mml:mi>
                  <mml:mo>)</mml:mo>
                </mml:mrow>
              </mml:mrow>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>if</mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mi>v</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>t</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mn>1</mml:mn>
            <mml:mo>;</mml:mo>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>unknown</mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mtext>if</mml:mtext>
            <mml:mtext>
               
            </mml:mtext>
            <mml:mi>v</mml:mi>
            <mml:mrow>
              <mml:mo>(</mml:mo>
              <mml:mi>t</mml:mi>
              <mml:mo>)</mml:mo>
            </mml:mrow>
            <mml:mo>=</mml:mo>
            <mml:mn>0</mml:mn>
          </mml:mrow>
        </mml:math>
      </disp-formula>
      <p>The “unknown” indication denotes a communication or data quality problem. In contrast, <italic>S</italic><sub>4</sub> in the entrance model is a table-defined state associated with particular zero-valued input combinations. Keeping these concepts separate prevents valid zero signals from being confused with communication loss. When <italic>S</italic><sub>5</sub> is received, the combination, signal identifier, and timestamp are recorded in the diagnostic log [<xref ref-type="bibr" rid="B9">9</xref>]-[<xref ref-type="bibr" rid="B11">11</xref>].</p>
      <p>The monitoring process comprises receiving signal feedback, associating it with the object, checking time and quality, identifying the state using the relevant table, distinguishing diagnostic states, and updating the indication and log. The outcome of a control command is assessed from confirmed feedback received from the signal. Transmission of a command does not establish that it has been executed.</p>
      <sec id="sec5dot1">
        <title>5.1. Functional Signal States and Operational Dependencies</title>
        <p>The functional signal model relates the current state to the operator command, route, points, track sections, and interlocking conditions [<xref ref-type="bibr" rid="B12">12</xref>][<xref ref-type="bibr" rid="B13">13</xref>]. This approach supplements the monitoring decoder with a control model: the decoder identifies the monitoring information received, whereas the functional model determines which signal state may be established under the specified conditions [<xref ref-type="bibr" rid="B14">14</xref>][<xref ref-type="bibr" rid="B15">15</xref>]. These two tasks should be represented by separate mathematical functions.</p>
        <disp-formula id="FD15">
          <label>(15)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>S</mml:mi>
                <mml:mrow>
                  <mml:mi>s</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>g</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>t</mml:mi>
                  <mml:mo>+</mml:mo>
                  <mml:mn>1</mml:mn>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>F</mml:mi>
                <mml:mrow>
                  <mml:mi>s</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>g</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mrow>
                      <mml:mi>s</mml:mi>
                      <mml:mi>i</mml:mi>
                      <mml:mi>g</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>U</mml:mi>
                    <mml:mrow>
                      <mml:mi>s</mml:mi>
                      <mml:mi>i</mml:mi>
                      <mml:mi>g</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mi>R</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mi>J</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mi>W</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                  <mml:mo>,</mml:mo>
                  <mml:mi>B</mml:mi>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Here, <italic>S</italic><italic><sub>sig</sub></italic> is the signal aspect, <italic>U</italic><italic><sub>sig</sub></italic> is the control command, <italic>R</italic> indicates route selection, <italic>J</italic> represents the required and proved point positions, <italic>W</italic> describes the relevant track section states, and <italic>B</italic> represents safety and interlocking conditions. <italic>F</italic><italic><sub>sig</sub></italic> expresses the operational logic of the existing interlocking system. It must not be equated with a function that changes graphical symbols on the workstation.</p>
        <p>The functional states of entrance, exit, and shunting signals are summarized in <bold>Table 3</bold>. The entrance decoder codes <italic>S</italic><sub>1</sub> - <italic>S</italic><sub>5</sub> are not identical to the set of functional signal aspects: for example, the decoder includes diagnostic and no-information states, while the functional model distinguishes yellow aspects. Their complete correspondence is established using the signalling and monitoring circuitry [<xref ref-type="bibr" rid="B5">5</xref>].</p>
        <p>Table 3. Comparison of the functional signal models in the article.</p>
        <table-wrap id="tbl3">
          <label>Table 3</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Object</bold>
                </td>
                <td>
                  <bold>Functional states</bold>
                </td>
                <td>
                  <bold>Dependencies checked</bold>
                </td>
              </tr>
              <tr>
                <td>Entrance signal</td>
                <td>Red; yellow; green; two yellow lights; lunar white in a special calling-on mode</td>
                <td>Reception route, track vacancy, point proving and locking, conflicting movements</td>
              </tr>
              <tr>
                <td>Exit signal</td>
                <td>Red; yellow; green; lunar white in shunting mode</td>
                <td>Departure route, block conditions, point and track monitoring</td>
              </tr>
              <tr>
                <td>Shunting signal</td>
                <td>Blue; lunar white</td>
                <td>Shunting route, track and point monitoring, interlocking</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p>An entrance signal may display the relevant permissive aspect when the train reception route is ready. Selection of yellow or green is associated with the conditions for further movement, while two yellow lights relate to a separate reception direction. The lunar-white calling-on signal does not replace the permissive aspect of an ordinary reception route; its conditions are treated as a special mode. This distinction must also be maintained in the command type and outcome indication on the workstation.</p>
        <p>For an exit signal, departure from a station track to the block section is assessed jointly with route readiness and block information. Lunar white belongs to a separate shunting mode and must not be confused with the green or yellow aspect of a train departure route. For a shunting signal, lunar white authorizes shunting movement and blue prohibits it [<xref ref-type="bibr" rid="B3">3</xref>].</p>
        <p>The combined vector represents signals with different functions within one information structure without making their aspect meanings identical. The restrictive aspect of entrance and exit signals is red, whereas that of a shunting signal is blue. A permissive aspect is not established when the operational conditions are unconfirmed. If communication is lost, the workstation does not assume that the physical signal is red; instead, the interface displays “monitoring state unknown”.</p>
      </sec>
      <sec id="sec5dot2">
        <title>5.2. Closed Loop for Confirming Signal Command Execution</title>
        <p>The operator request, adaptation of the command to the interlocking interface, execution, feedback, and workstation indication are treated as separate stages of one process. A signal request is represented as follows [<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>]:</p>
        <disp-formula id="FD16">
          <label>(16)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>C</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:mi>I</mml:mi>
                  <mml:msub>
                    <mml:mi>D</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>O</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:mn>0</mml:mn>
                      <mml:mo>,</mml:mo>
                      <mml:mi>j</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>;</mml:mo>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:mtext>
                 
              </mml:mtext>
              <mml:msub>
                <mml:mi>U</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>C</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><italic>ID</italic><italic><sub>j</sub></italic> is the request identifier, <italic>O</italic><italic><sub>j</sub></italic> is the signal or its associated route, <italic>A</italic><italic><sub>j</sub></italic> is the required action, and <italic>t</italic><sub>0,</sub><italic><sub>j</sub></italic> is the request time. <italic>T</italic><italic><sub>k</sub></italic> is the adaptation function for an interlocking interface of type <italic>k</italic>. If the relay interface does not transmit the identifier, <italic>ID</italic><italic><sub>j</sub></italic> is not interpreted as an internal interlocking signal; it links log records in the workstation and integration facility.</p>
        <disp-formula id="FD17">
          <label>(17)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>Z</mml:mi>
                <mml:mi>i</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>H</mml:mi>
                <mml:mi>k</mml:mi>
              </mml:msub>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>Y</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:mi>γ</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>κ</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>O</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>S</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>t</mml:mi>
                    <mml:mrow>
                      <mml:mi>γ</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>κ</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><italic>Y</italic><italic><sub>i</sub></italic> is the raw feedback signal, <italic>H</italic><italic><sub>k</sub></italic> converts it into an object state,<italic>Ŝ</italic><italic><sub>i</sub></italic> is the identified state, <italic>t</italic><italic><sub>γ</sub></italic><sub>,</sub><italic><sub>i</sub></italic> is the recording time, and <italic>κ</italic><italic><sub>i</sub></italic> is information quality. The quality indicator <italic>κ</italic><italic><sub>i</sub></italic> is distinguished from the automaton state <italic>q</italic><italic><sub>i</sub></italic>(<italic>t</italic>) in Equation (2). Separate State and Quality fields are used in the software implementation. <xref ref-type="fig" rid="fig2">Figure 2</xref> shows the command and feedback paths.</p>
        <fig id="fig2">
          <label>Figure 2</label>
          <graphic xlink:href="https://html.scirp.org/file/7900811-rId56.jpeg?20261106095435" />
        </fig>
        <p>Figure 2. Closed loop for signal commands and state monitoring.</p>
        <p>Table 4. Indication of signal control request outcomes.</p>
        <table-wrap id="tbl4">
          <label>Table 4</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Outcome</bold>
                </td>
                <td>
                  <bold>Assessment condition</bold>
                </td>
              </tr>
              <tr>
                <td>Confirmed</td>
                <td>The required state is proved by valid feedback and matches the current request</td>
              </tr>
              <tr>
                <td>Rejected</td>
                <td>A rejection response is received from the interlocking for the specific request</td>
              </tr>
              <tr>
                <td>Pending</td>
                <td>The request is accepted; confirmation has not yet arrived within the specified interval</td>
              </tr>
              <tr>
                <td>Unconfirmed</td>
                <td>The time limit has expired, or feedback is absent, stale, contradictory, or inconsistent with the request</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <p><bold>Table 4</bold> presents the command outcome separately from the physical signal aspect. For example, “pending” is a state of the operator request rather than a new signal colour. This distinction prevents command acceptance from being confused with command execution in the interface.</p>
        <disp-formula id="FD18">
          <label>(18)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>P</mml:mi>
                <mml:mrow>
                  <mml:mi>c</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>f</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:mrow>
                <mml:mo>[</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>S</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>=</mml:mo>
                  <mml:mtext>
                  </mml:mtext>
                  <mml:msub>
                    <mml:mi>S</mml:mi>
                    <mml:mrow>
                      <mml:mi>r</mml:mi>
                      <mml:mi>e</mml:mi>
                      <mml:mi>q</mml:mi>
                      <mml:mo>,</mml:mo>
                      <mml:mi>i</mml:mi>
                    </mml:mrow>
                  </mml:msub>
                  <mml:mrow>
                    <mml:mo>(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>C</mml:mi>
                        <mml:mi>j</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>]</mml:mo>
              </mml:mrow>
              <mml:mo>∧</mml:mo>
              <mml:msub>
                <mml:mi>Q</mml:mi>
                <mml:mrow>
                  <mml:mi>v</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>l</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>d</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>i</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>∧</mml:mo>
              <mml:mi>M</mml:mi>
              <mml:mrow>
                <mml:mo>(</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>O</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>,</mml:mo>
                  <mml:msub>
                    <mml:mi>C</mml:mi>
                    <mml:mi>j</mml:mi>
                  </mml:msub>
                </mml:mrow>
                <mml:mo>)</mml:mo>
              </mml:mrow>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p>Here, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi> S </mml:mi><mml:mo> ^ </mml:mo></mml:mover><mml:mi> i </mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the identified feedback state of object i, S<sub>req,i</sub>(C<sub>j</sub>) is the state required for that object by request C<sub>j</sub>, and Q<sub>valid,i</sub> indicates that the feedback is valid and current.</p>
        <p>The matching condition <italic>M</italic> checks the object address, required state, and assessment interval of the current request. If the relay interface does not return a command ID, temporal proximity alone is insufficient to associate execution with that command. The sequence of outstanding requests for one object must be monitored, and an old message must not be used to confirm a new request. Loss of feedback alone is not classified as “rejected”; without a rejection response, the outcome is “unconfirmed”.</p>
      </sec>
      <sec id="sec5dot3">
        <title>5.3. Model Verification Scenarios and Timing Criteria</title>
        <p>Under the modelling methodology, signal monitoring is checked through route selection, identification of operational conditions, recording of initial states, submission of the request, observation of execution and feedback, and comparison of indications [<xref ref-type="bibr" rid="B5">5</xref>][<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>]. The verification scenarios and expected monitoring outcomes are summarized in <bold>Table 5</bold>. </p>
        <p>Table 5. Verification scenarios for the signal model.</p>
        <table-wrap id="tbl5">
          <label>Table 5</label>
          <table>
            <tbody>
              <tr>
                <td>
                  <bold>Scenario</bold>
                </td>
                <td>
                  <bold>Input situation</bold>
                </td>
                <td>
                  <bold>Expected monitoring outcome</bold>
                </td>
              </tr>
              <tr>
                <td>Normal reception</td>
                <td>Route conditions confirmed; valid feedback</td>
                <td>The N signal state is displayed from feedback; the request is confirmed</td>
              </tr>
              <tr>
                <td>Occupied section</td>
                <td>A relevant section is occupied or its monitoring is faulty</td>
                <td>Normal reception authorization is not established; readiness is not confirmed</td>
              </tr>
              <tr>
                <td>Point proving lost</td>
                <td>The required position is not proved</td>
                <td>The condition for a permissive aspect is recorded as unmet</td>
              </tr>
              <tr>
                <td>Conflicting route</td>
                <td>A conflicting opposing movement exists</td>
                <td>A new ordinary movement authorization is not established</td>
              </tr>
              <tr>
                <td>Delayed confirmation</td>
                <td>Feedback has not arrived within the specified interval</td>
                <td>Initially pending; unconfirmed after the time limit</td>
              </tr>
              <tr>
                <td>Communication loss</td>
                <td>Invalid monitoring information</td>
                <td>State indicated as unknown; the last colour is not treated as current confirmation</td>
              </tr>
              <tr>
                <td>Contradictory combination</td>
                <td>
                  X
                  <sub>11</sub>
                  , X
                  <sub>13</sub>
                  , or X
                  <sub>15</sub>
                  in the entrance decoder
                </td>
                <td>
                  S
                  <sub>5</sub>
                  diagnostic state and log entry
                </td>
              </tr>
              <tr>
                <td>Shunting mode</td>
                <td>Separate shunting conditions for a shunting or exit signal</td>
                <td>Lunar-white proving is not equated with train movement authorization</td>
              </tr>
            </tbody>
          </table>
        </table-wrap>
        <disp-formula id="FD19">
          <label>(19)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>t</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>d</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>−</mml:mo>
              <mml:msub>
                <mml:mi>t</mml:mi>
                <mml:mrow>
                  <mml:mn>0</mml:mn>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <disp-formula id="FD20">
          <label>(20)</label>
          <mml:math display="inline">
            <mml:mrow>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>=</mml:mo>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mrow>
                  <mml:mi>a</mml:mi>
                  <mml:mi>d</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>p</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mtext>-</mml:mtext>
                  <mml:mi>t</mml:mi>
                  <mml:mi>r</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>s</mml:mi>
                  <mml:mi>m</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mrow>
                  <mml:mi>I</mml:mi>
                  <mml:mi>L</mml:mi>
                  <mml:mtext>-</mml:mtext>
                  <mml:mi>f</mml:mi>
                  <mml:mi>e</mml:mi>
                  <mml:mi>e</mml:mi>
                  <mml:mi>d</mml:mi>
                  <mml:mi>b</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>c</mml:mi>
                  <mml:mi>k</mml:mi>
                  <mml:mo>,</mml:mo>
                </mml:mrow>
              </mml:msub>
              <mml:msub>
                <mml:mrow>
                </mml:mrow>
                <mml:mi>j</mml:mi>
              </mml:msub>
              <mml:mo>+</mml:mo>
              <mml:msub>
                <mml:mi>T</mml:mi>
                <mml:mrow>
                  <mml:mi>i</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mi>d</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>c</mml:mi>
                  <mml:mi>a</mml:mi>
                  <mml:mi>t</mml:mi>
                  <mml:mi>i</mml:mi>
                  <mml:mi>o</mml:mi>
                  <mml:mi>n</mml:mi>
                  <mml:mo>,</mml:mo>
                  <mml:mi>j</mml:mi>
                </mml:mrow>
              </mml:msub>
            </mml:mrow>
          </mml:math>
        </disp-formula>
        <p><italic>t</italic><italic><sub>ind</sub></italic><sub>,</sub><italic><sub>j</sub></italic> is the time at which the confirmed outcome is displayed on the workstation. The components are calculated from sequential, non-overlapping log intervals. The operator’s decision time before the request is not automatically included in this sum. The outcome type is recorded separately for rejected or unconfirmed requests; these requests are not included in the statistics of confirmed execution times.</p>
      </sec>
    </sec>
    <sec id="sec6">
      <title>6. Logical Verification Results and Discussion</title>
      <p>An exhaustive combinational check was performed for the entrance signal: each of the 16 binary vectors was evaluated using Equations (5)-(9) and compared with <bold>Table 1</bold>. The results are summarized in <bold>Table 6</bold>. This calculation establishes internal model consistency; it does not measure the reliability or safety level of the actual equipment [<xref ref-type="bibr" rid="B8">8</xref>][<xref ref-type="bibr" rid="B9">9</xref>].</p>
      <p>Table 6. Distribution of combinations in the entrance model.</p>
      <table-wrap id="tbl6">
        <label>Table 6</label>
        <table>
          <tbody>
            <tr>
              <td>
                <bold>State</bold>
              </td>
              <td>
                <bold>Combinations</bold>
              </td>
              <td>
                <bold>Count</bold>
              </td>
            </tr>
            <tr>
              <td>
                <italic>S</italic>
                <sub>1</sub>
              </td>
              <td>
                <italic>X</italic>
                <sub>1</sub>
                -
                <italic>X</italic>
                <sub>7</sub>
                ,
                <italic>X</italic>
                <sub>10</sub>
              </td>
              <td>8</td>
            </tr>
            <tr>
              <td>
                <italic>S</italic>
                <sub>2</sub>
              </td>
              <td>
                <italic>X</italic>
                <sub>9</sub>
              </td>
              <td>1</td>
            </tr>
            <tr>
              <td>
                <italic>S</italic>
                <sub>3</sub>
              </td>
              <td>
                <italic>X</italic>
                <sub>12</sub>
                ,
                <italic>X</italic>
                <sub>14</sub>
              </td>
              <td>2</td>
            </tr>
            <tr>
              <td>
                <italic>S</italic>
                <sub>4</sub>
              </td>
              <td>
                <italic>X</italic>
                <sub>0</sub>
                ,
                <italic>X</italic>
                <sub>8</sub>
              </td>
              <td>2</td>
            </tr>
            <tr>
              <td>
                <italic>S</italic>
                <sub>5</sub>
              </td>
              <td>
                <italic>X</italic>
                <sub>11</sub>
                ,
                <italic>X</italic>
                <sub>13</sub>
                ,
                <italic>X</italic>
                <sub>15</sub>
              </td>
              <td>3</td>
            </tr>
            <tr>
              <td>Total</td>
              <td>
                <italic>X</italic>
                <sub>0</sub>
                -
                <italic>X</italic>
                <sub>15</sub>
              </td>
              <td>16</td>
            </tr>
          </tbody>
        </table>
      </table-wrap>
      <p>The calculated combinations are mutually exclusive and cover the entire input domain. The distinction between functional aspects and monitoring codes is important: diagnostic state <italic>S</italic><sub>5</sub> must not be interpreted as a fifth physical signal aspect. The functional model represents operational dependencies, whereas the decoder interprets feedback information. In the corrected entrance signal graph (<xref ref-type="fig" rid="fig1">Figure 1</xref>), the input group associated with S1 is X1 - X7 and X10; X12 belongs to S3.</p>
      <p>The exit model table contains all eight combinations but covers only states <italic>S</italic><sub>1</sub> and <italic>S</italic><sub>4</sub>. Thus, completeness of the combinations does not imply completeness of the state definitions. The practical outcome of the logical verification is a consistent rule for the entrance signal decoder and identification of the exit signal dependencies that require clarification.</p>
    </sec>
    <sec id="sec7">
      <title>7. Conclusions</title>
      <p>Information relating to entrance, exit, and shunting signals was extracted, and separate mathematical expressions were formulated for entrance and exit signals. For the entrance signal, 16 combinations were mapped unambiguously to five states; completeness and mutual exclusivity of the state indicators were verified by combinational calculation.</p>
      <p>The exit-table incompleteness is a substantive limitation of the supplied data and remains honestly stated. Resolving it requires the author-approved exit signal relay truth table; no unsupported new states or experimental claims were added.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <title>References</title>
      <ref id="B1">
        <label>1.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Rules for the Technical Operation of Railways of the Republic of Uzbekistan (2001) Approved in Coordination with the Ministry of Justice of the Republic of Uzbekistan, August 27, No. 20-15-205/11. http://lex.uz</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Uzbekistan, A</string-name>
            </person-group>
            <year>2001</year>
            <article-title>Approved in Coordination with the Ministry of Justice of the Republic of Uzbekistan, August 27, No</article-title>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B2">
        <label>2.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Boltayev, S.T., Abdullaev, R.B., Ergashov, B.G. and Hasanov, B.Q. (2022) Simulation of a Safe Train Traffic Management System at the Stations. 2022 <italic>Conference of Russian Young Researchers in Electrical and Electronic Engineering</italic> ( <italic>ElConRus</italic>), Saint Petersburg, 25-28 January 2022, 566-571. https://doi.org/10.1109/elconrus54750.2022.9755616 <pub-id pub-id-type="doi">10.1109/elconrus54750.2022.9755616</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/elconrus54750.2022.9755616">https://doi.org/10.1109/elconrus54750.2022.9755616</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Boltayev, S.T.</string-name>
              <string-name>Abdullaev, R.B.</string-name>
              <string-name>Ergashov, B.G.</string-name>
              <string-name>Hasanov, B.Q.</string-name>
            </person-group>
            <year>2022</year>
            <article-title>Simulation of a Safe Train Traffic Management System at the Stations</article-title>
            <source>2022 Conference of Russian Young Researchers in Electrical and Electronic Engineering (ElConRus)</source>
            <volume>25</volume>
            <pub-id pub-id-type="doi">10.1109/elconrus54750.2022.9755616</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B3">
        <label>3.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Mukhiddinov, O., Boltayev, S., Yunusova, G., Khidirov, E. and Yoldashev, I. (2024) Development of a Route Setting Model in the Dispatching Centralization System. <italic>E</italic>3 <italic>S Web of Conferences</italic>, 515, Article No. 01011. https://doi.org/10.1051/e3sconf/202451501011 <pub-id pub-id-type="doi">10.1051/e3sconf/202451501011</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1051/e3sconf/202451501011">https://doi.org/10.1051/e3sconf/202451501011</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Mukhiddinov, O.</string-name>
              <string-name>Boltayev, S.</string-name>
              <string-name>Yunusova, G.</string-name>
              <string-name>Khidirov, E.</string-name>
              <string-name>Yoldashev, I.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Development of a Route Setting Model in the Dispatching Centralization System</article-title>
            <source>E3S Web of Conferences</source>
            <volume>515</volume>
            <elocation-id>No</elocation-id>
            <pub-id pub-id-type="doi">10.1051/e3sconf/202451501011</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B4">
        <label>4.</label>
        <citation-alternatives>
          <mixed-citation publication-type="web">Boltayev, S. (2024) Functions of the Interlocking System on Mixed Traffic Lines. <italic>E</italic>3 <italic>S Web of Conferences</italic>, 515, Article No. 01012 https://www.e3s-conferences.org/articles/e3sconf/ref/2024/45/e3sconf_tt21c-2024_01012/e3sconf_tt21c-2024_01012.html</mixed-citation>
          <element-citation publication-type="web">
            <person-group person-group-type="author">
              <string-name>Boltayev, S.</string-name>
            </person-group>
            <year>2024</year>
            <article-title>Functions of the Interlocking System on Mixed Traffic Lines</article-title>
            <source>E3S Web of Conferences</source>
            <volume>515</volume>
            <elocation-id>No</elocation-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B5">
        <label>5.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Nasedkin, O., Vasil’ev, D.A. and Butuzov, M. (2025) The System of Automatic Testing of the Technological Software of Microprocessor Centralization Systems. <italic>Intellectual Technologies on Transport</italic>, 93-102. https://doi.org/10.20295/2413-2527-2025-242-93-102 <pub-id pub-id-type="doi">10.20295/2413-2527-2025-242-93-102</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.20295/2413-2527-2025-242-93-102">https://doi.org/10.20295/2413-2527-2025-242-93-102</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Nasedkin, O.</string-name>
              <string-name>Butuzov, M.</string-name>
            </person-group>
            <year>2025</year>
            <article-title>The System of Automatic Testing of the Technological Software of Microprocessor Centralization Systems</article-title>
            <source>Intellectual Technologies on Transport</source>
            <volume>93</volume>
            <pub-id pub-id-type="doi">10.20295/2413-2527-2025-242-93-102</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B6">
        <label>6.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Wu, W.M., Su, H.Y. and Chu, J. (2002) Supervisory Control of Discrete Event Systems Using Enabling Arc Petri Nets. <italic>Proceedings</italic> 2002 <italic>IEEE International Conference on Robotics and Automation</italic>, Vol. 2, 1913-1918. https://doi.org/10.1109/robot.2002.1014820 <pub-id pub-id-type="doi">10.1109/robot.2002.1014820</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/robot.2002.1014820">https://doi.org/10.1109/robot.2002.1014820</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Wu, W.M.</string-name>
              <string-name>Su, H.Y.</string-name>
              <string-name>Chu, J.</string-name>
              <string-name>Automation, V</string-name>
            </person-group>
            <year>2002</year>
            <article-title>Supervisory Control of Discrete Event Systems Using Enabling Arc Petri Nets</article-title>
            <source>Proceedings 2002 IEEE International Conference on Robotics and Automation</source>
            <volume>1913</volume>
            <pub-id pub-id-type="doi">10.1109/robot.2002.1014820</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B7">
        <label>7.</label>
        <citation-alternatives>
          <mixed-citation publication-type="other">Zhou, M.C. and Twiss, E. (1998) Design of Industrial Automated Systems via Relay Ladder Logic Programming and Petri Nets. <italic>IEEE Transactions on Systems</italic>, <italic>Man and Cybernetics</italic>, <italic>Part C</italic>( <italic>Applications and Reviews</italic>), 28, 137-150. https://doi.org/10.1109/5326.661096 <pub-id pub-id-type="doi">10.1109/5326.661096</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/5326.661096">https://doi.org/10.1109/5326.661096</ext-link></mixed-citation>
          <element-citation publication-type="other">
            <person-group person-group-type="author">
              <string-name>Zhou, M.C.</string-name>
              <string-name>Twiss, E.</string-name>
              <string-name>Systems, M</string-name>
              <string-name>Cybernetics, P</string-name>
            </person-group>
            <year>1998</year>
            <article-title>Design of Industrial Automated Systems via Relay Ladder Logic Programming and Petri Nets</article-title>
            <source>IEEE Transactions on Systems</source>
            <volume>28</volume>
            <pub-id pub-id-type="doi">10.1109/5326.661096</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B8">
        <label>8.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Mutlu, I., Ovatman, T., Soylemez, M.T. and Sumer, L.G. (2011) A New Test Environment for PLC Based Interlocking Systems. <italic>Proceedings</italic> 2011 <italic>International Conference on Transportation</italic>, <italic>Mechanical</italic>, <italic>and Electrical Engineering</italic> ( <italic>TMEE</italic>), Changchun, 16-18 December 2011, 686-690. https://doi.org/10.1109/tmee.2011.6199295 <pub-id pub-id-type="doi">10.1109/tmee.2011.6199295</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/tmee.2011.6199295">https://doi.org/10.1109/tmee.2011.6199295</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Mutlu, I.</string-name>
              <string-name>Ovatman, T.</string-name>
              <string-name>Soylemez, M.T.</string-name>
              <string-name>Sumer, L.G.</string-name>
              <string-name>Transportation, M</string-name>
            </person-group>
            <year>2011</year>
            <article-title>A New Test Environment for PLC Based Interlocking Systems</article-title>
            <source>Proceedings 2011 International Conference on Transportation</source>
            <volume>16</volume>
            <pub-id pub-id-type="doi">10.1109/tmee.2011.6199295</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B9">
        <label>9.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Durmus, M.S. and Soylemez, M.T. (2009) Railway Signalization and Interlocking Design via Automation Petri Nets. 2009 7 <italic>th Asian Control Conference</italic>, 27-29 August 2009, 1558-1563. https://ieeexplore.ieee.org/document/5276227</mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Durmus, M.S.</string-name>
              <string-name>Soylemez, M.T.</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Railway Signalization and Interlocking Design via Automation Petri Nets</article-title>
            <source>2009 7th Asian Control Conference</source>
            <volume>27</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B10">
        <label>10.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Lujiang, H. (2020) The Application of Data Mining in Fault Location of Computer Interlocking System in Railway Signaling. 2020 <italic>IEEE</italic> 5 <italic>th International Conference on Cloud Computing and Big Data Analytics</italic> ( <italic>ICCCBDA</italic>), Chengdu, 10-13 April 2020, 331-335. https://doi.org/10.1109/icccbda49378.2020.9095590 <pub-id pub-id-type="doi">10.1109/icccbda49378.2020.9095590</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icccbda49378.2020.9095590">https://doi.org/10.1109/icccbda49378.2020.9095590</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Lujiang, H.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>The Application of Data Mining in Fault Location of Computer Interlocking System in Railway Signaling</article-title>
            <source>2020 IEEE 5th International Conference on Cloud Computing and Big Data Analytics (ICCCBDA)</source>
            <volume>10</volume>
            <pub-id pub-id-type="doi">10.1109/icccbda49378.2020.9095590</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B11">
        <label>11.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Huang, L. (2020) The Past, Present and Future of Railway Interlocking System. 2020 <italic>IEEE</italic> 5 <italic>th International Conference on Intelligent Transportation Engineering</italic>( <italic>ICITE</italic>), Beijing, 11-13 September 2020, 170-174. https://doi.org/10.1109/icite50838.2020.9231438 <pub-id pub-id-type="doi">10.1109/icite50838.2020.9231438</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/icite50838.2020.9231438">https://doi.org/10.1109/icite50838.2020.9231438</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Huang, L.</string-name>
              <string-name>Past, P</string-name>
            </person-group>
            <year>2020</year>
            <article-title>The Past, Present and Future of Railway Interlocking System</article-title>
            <source>2020 IEEE 5th International Conference on Intelligent Transportation Engineering (ICITE)</source>
            <volume>11</volume>
            <pub-id pub-id-type="doi">10.1109/icite50838.2020.9231438</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B12">
        <label>12.</label>
        <citation-alternatives>
          <mixed-citation publication-type="journal">Su, H.S. and Wen, J. (2015) Research on Modeling of Dynamic Fault Tree in Regional Computer Interlocking System Safety Analysis. <italic>Journal of the China Railway Society</italic>, 37, 46-53.</mixed-citation>
          <element-citation publication-type="journal">
            <person-group person-group-type="author">
              <string-name>Su, H.S.</string-name>
              <string-name>Wen, J.</string-name>
            </person-group>
            <year>2015</year>
            <article-title>Research on Modeling of Dynamic Fault Tree in Regional Computer Interlocking System Safety Analysis</article-title>
            <source>Journal of the China Railway Society</source>
            <volume>37</volume>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B13">
        <label>13.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Antoni, M. (2009) Formal Validation Method for Computerized Railway Interlocking Systems. 2009 <italic>International Conference on Computers &amp; Industrial Engineering</italic>, Troyes, 6-9 July 2009, 1532-1541. https://doi.org/10.1109/iccie.2009.5223968 <pub-id pub-id-type="doi">10.1109/iccie.2009.5223968</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/iccie.2009.5223968">https://doi.org/10.1109/iccie.2009.5223968</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Antoni, M.</string-name>
              <string-name>Engineering, T</string-name>
            </person-group>
            <year>2009</year>
            <article-title>Formal Validation Method for Computerized Railway Interlocking Systems</article-title>
            <source>2009 International Conference on Computers &amp; Industrial Engineering</source>
            <volume>6</volume>
            <pub-id pub-id-type="doi">10.1109/iccie.2009.5223968</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B14">
        <label>14.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Efanov, D., Lykov, A. and Osadchy, G. (2017) Testing of Relay-Contact Circuits of Railway Signalling and Interlocking. 2017 <italic>IEEE East</italic>- <italic>West Design &amp; Test Symposium</italic> ( <italic>EWDTS</italic>), Novi Sad, 29 September-2 October 2017, 1-7. https://doi.org/10.1109/ewdts.2017.8110095 <pub-id pub-id-type="doi">10.1109/ewdts.2017.8110095</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ewdts.2017.8110095">https://doi.org/10.1109/ewdts.2017.8110095</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Efanov, D.</string-name>
              <string-name>Lykov, A.</string-name>
              <string-name>Osadchy, G.</string-name>
            </person-group>
            <year>2017</year>
            <article-title>Testing of Relay-Contact Circuits of Railway Signalling and Interlocking</article-title>
            <source>2017 IEEE East-West Design &amp; Test Symposium (EWDTS)</source>
            <volume>29</volume>
            <pub-id pub-id-type="doi">10.1109/ewdts.2017.8110095</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
      <ref id="B15">
        <label>15.</label>
        <citation-alternatives>
          <mixed-citation publication-type="confproc">Song, Z. and Li, G. (2020) Interlocking Train Control Integrated System Modeling Design Based on AADL. <italic>Journal of Physics</italic>: <italic>Conference Series</italic>, 1453, Article ID: 012128. https://doi.org/10.1088/1742-6596/1453/1/012128 <pub-id pub-id-type="doi">10.1088/1742-6596/1453/1/012128</pub-id><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1088/1742-6596/1453/1/012128">https://doi.org/10.1088/1742-6596/1453/1/012128</ext-link></mixed-citation>
          <element-citation publication-type="confproc">
            <person-group person-group-type="author">
              <string-name>Song, Z.</string-name>
              <string-name>Li, G.</string-name>
            </person-group>
            <year>2020</year>
            <article-title>Interlocking Train Control Integrated System Modeling Design Based on AADL</article-title>
            <source>Journal of Physics: Conference Series</source>
            <volume>1453</volume>
            <fpage>012128</fpage>
            <elocation-id>ID</elocation-id>
            <pub-id pub-id-type="doi">10.1088/1742-6596/1453/1/012128</pub-id>
          </element-citation>
        </citation-alternatives>
      </ref>
    </ref-list>
  </back>
</article>