MXPA96004771A - Locking system or rail clutch with logical architecture and its implementation procedure - Google Patents
Locking system or rail clutch with logical architecture and its implementation procedureInfo
- Publication number
- MXPA96004771A MXPA96004771A MXPA/A/1996/004771A MX9604771A MXPA96004771A MX PA96004771 A MXPA96004771 A MX PA96004771A MX 9604771 A MX9604771 A MX 9604771A MX PA96004771 A MXPA96004771 A MX PA96004771A
- Authority
- MX
- Mexico
- Prior art keywords
- rtechk
- trßchk
- blk
- laßt
- eatr
- Prior art date
Links
- 238000000034 method Methods 0.000 title description 12
- 230000000875 corresponding Effects 0.000 claims abstract description 22
- 241001061269 Lestes Species 0.000 claims 22
- 150000002500 ions Chemical class 0.000 claims 20
- 101700043017 NTRK1 Proteins 0.000 claims 12
- 206010024855 Loss of consciousness Diseases 0.000 claims 11
- 241001167018 Aroa Species 0.000 claims 5
- XOOUIPVCVHRTMJ-UHFFFAOYSA-L Zinc stearate Chemical compound [Zn+2].CCCCCCCCCCCCCCCCCC([O-])=O.CCCCCCCCCCCCCCCCCC([O-])=O XOOUIPVCVHRTMJ-UHFFFAOYSA-L 0.000 claims 5
- ZBJWWKFMHOAPNS-UHFFFAOYSA-N Chiniofon Chemical compound C1=CN=C2C(O)=C(I)C=C(S(O)(=O)=O)C2=C1 ZBJWWKFMHOAPNS-UHFFFAOYSA-N 0.000 claims 4
- 241001387976 Pera Species 0.000 claims 3
- 241000220324 Pyrus Species 0.000 claims 3
- 235000014443 Pyrus communis Nutrition 0.000 claims 3
- 230000003111 delayed Effects 0.000 claims 2
- FMKJUUQOYOHLTF-OWOJBTEDSA-N (E)-4-azaniumylbut-2-enoate Chemical compound NC\C=C\C(O)=O FMKJUUQOYOHLTF-OWOJBTEDSA-N 0.000 claims 1
- APVMLVNTOWQOHL-KYRNGWDOSA-M 2-(1,2-diphenylethoxy)ethyl-tris(trideuteriomethyl)azanium;bromide Chemical compound [Br-].C=1C=CC=CC=1C(OCC[N+](C([2H])([2H])[2H])(C([2H])([2H])[2H])C([2H])([2H])[2H])CC1=CC=CC=C1 APVMLVNTOWQOHL-KYRNGWDOSA-M 0.000 claims 1
- 108060000721 ATR Proteins 0.000 claims 1
- 241000180579 Arca Species 0.000 claims 1
- 241000224511 Bodo Species 0.000 claims 1
- 101700000582 CHIA Proteins 0.000 claims 1
- BVKZGUZCCUSVTD-UHFFFAOYSA-N Carbonic acid Chemical compound OC(O)=O BVKZGUZCCUSVTD-UHFFFAOYSA-N 0.000 claims 1
- 210000003467 Cheek Anatomy 0.000 claims 1
- BFPSDSIWYFKGBC-UHFFFAOYSA-N Chlorotrianisene Chemical compound C1=CC(OC)=CC=C1C(Cl)=C(C=1C=CC(OC)=CC=1)C1=CC=C(OC)C=C1 BFPSDSIWYFKGBC-UHFFFAOYSA-N 0.000 claims 1
- 101700001948 F2R Proteins 0.000 claims 1
- 102100001843 FLNB Human genes 0.000 claims 1
- 101700011083 FLNB Proteins 0.000 claims 1
- 241000895880 Ioa Species 0.000 claims 1
- 101710025312 SLC51A Proteins 0.000 claims 1
- 241000490025 Schefflera digitata Species 0.000 claims 1
- 101700022819 Top2 Proteins 0.000 claims 1
- 241001645362 Valsa Species 0.000 claims 1
- 241000282485 Vulpes vulpes Species 0.000 claims 1
- 102100013250 ZMYND8 Human genes 0.000 claims 1
- 101710039437 ZMYND8 Proteins 0.000 claims 1
- 150000001768 cations Chemical class 0.000 claims 1
- 235000015250 liver sausages Nutrition 0.000 claims 1
- 230000000644 propagated Effects 0.000 description 4
- 230000001902 propagating Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000006011 modification reaction Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000737 periodic Effects 0.000 description 1
Abstract
A railway interlocking system is described, which serves to train traffic in security, on a network consisting of a plurality of track equipment, comprising a set of tasks (Trc-AEA, ...) associated respectively with the equipment of which constitute the network. The tasks put into operation a distributed logic of establishment and release of routes by propagation of messages through successions of communication channels (6), which interconnect the tasks following a provision corresponding to a certain geographical topology of the railway network under control. The implementation of the system is done through a computerized processing of a network description file and a library of generic modules that implement each automata in finished states.
Description
SYSTEM OF INTERLOCKING OR RAIL CLUTCH WITH LOGICAL ARCHITECTURE AND ITS IMPLEMENTATION PROCEDURE
DESCRIPTION OF THE INVENTION
The invention relates to rail traffic, security, on a railway network, and more particularly to a railway interlock system based on a logical architecture. Such a system is already known from the European patent application No. 0581281. This system comprises a rule base, an inference engine, and a data model on which the rules for establishing and releasing the itineraries are applied. The data model represents the track equipment that constitutes the network through the classes of the logic gates. Each rule defines the conditions to be verified by a logic gate before the entry of a train on the corresponding track equipment of the network is allowed. This interlocking system has the advantage of being much more flexible than traditional solutions based on relay or relay. In particular, such an interlocking system can be REF: 23320 implemented by means of a computerized processing of a description file of high level of abstraction of the network, and of the base of rules in order to constitute the data model corresponding to the network to control. If the base of rules is conceived in a very generic way, this can be used for the implementation of other interlocking systems, without modification. In spite of its flexibility, this known rail interlock system requires a centralized treatment resource for its execution, which is the base of the rules, the data model and the inference engine. The treatment capabilities of this resource should be all the more important when the railway network under control is complex, since the complexity of the data model grows with that of the network. It is also suggested in the document cited above, to exploit a multiprocessor resource that allows to make certain treatments parallel with the inconvenience of making the maintenance of the system more complex. The object of the invention is to propose a railway interlocking system based on a logical architecture of another conception, and capable of being distributed over a plurality of inexpensive treatment resources, such as microcomputers. In particular, the invention is aimed at providing such a rail interlock system, capable of exploiting the treatment resources already in place in the control / drive facilities of the existing railway networks, and which serves for the acquisition of signals coming from track equipment. For this purpose, the object of the invention is a rail interlock system based on a logical architecture, which serves to train traffic in security over a network consisting of a plurality of track equipment. This system comprises a set of tasks associated respectively with the track equipment that make up the network. The tasks put into operation a distributed logic of establishment and release of itineraries, by means of propagation of messages through the successions of logical communication channels that interconnect the tasks, according to an arrangement corresponding to a certain geographical topology of the railway network under control. In particular, this distributed logic of message propagation is implemented in the tasks in the form of automata in finished states. Automata in finished states interact with each other by propagating messages along the length of logical communication channels. According to this logical architecture, the tasks have an asynchronous behavior. A great complexity of a railway network to be controlled translates into a large number of tasks to be executed. However, in view of the fact that the tasks have an asynchronous behavior, it is not useful to foresee a treatment resource with a very strong capacity for execution, since the tasks can be distributed over a set of treatment resources of low execution capacity, if only a small number of tasks reside in each treatment resource of low capacity, the cost of such a set of treatment resources of low capacity it is also much lower than that of a single treatment resource of equivalent capacity. In addition, the autonomous and asynchronous functioning of the solution tasks according to the invention, allows a simple control of the proper functioning of each task, which contributes to reducing the maintenance costs of the interlocking system. The invention extends to a method for implementing such a railway interlocking system, based on a computerized treatment of a high-level description file of the railway network to be controlled, and a library of generic logic modules that implement each one an automaton in finished states, corresponding to a type of track equipment. The library of generic logic modules can serve, without modification, to implement different interlocking systems to control different corresponding rail networks. An exemplary embodiment of the invention is described below with reference to the figures.
Figure 1 shows schematically an integrated electronic control center, which includes the system according to the invention.
Figure 2 is a synoptic view of a railway network.
Figure 3 illustrates the logical architecture of the system according to the invention, adapted to the railway network shown in Figure 2.
Figure 4 is a diagram illustrating the propagation of waves of messages through the tasks associated with a succession of track equipment, corresponding.
Figure 5 illustrates the procedure for implementing a system according to the invention.
Figure 6 is a synoptic view of a railway network from which a high level abstraction description file of the network is constituted.
In Figure 1, the rail interlock system 1 according to the invention forms part of a more complex assembly (integrated electronic control center) comprising a control station 2 from which an operator supervises the situation on the railway network 3 under the control of the interlocking system. A rail interlock system serves to establish (lock) and free itineraries in such a way as to maintain traffic safety over a network. In particular, it is about avoiding the collision of trains on the network. However, a collision can occur if, for example, the interlocked routes intersect. The interlocking system 1 according to the invention comprises a set of tasks associated respectively with the corresponding track equipment, which constitute the network to be controlled and which communicate with each other by means of messages, asynchronously as described below. More particularly, the tasks implement a distributed logic to establish and release the routes by propagating messages through the successions of logical communication channels, each interconnecting a message output of a task and a message entry of another task. The logical communication channels are implemented between the tasks following a provision corresponding to a certain geographic topology of the network, in such a way that each succession of logical communication channels corresponds in fact to a predefined itinerary of train circulation over the network. In other words, for an itinerary that passes successively through a succession of track equipment, it has a corresponding succession of logical communication channels that interconnect the tasks associated with these equipment.
Figure 2 shows schematically a railway network that serves as an example to explain the invention, and Figure 3 shows the logical architecture of the rail interlock system corresponding to this network example. In Figure 2, the railway network has two routes AE and AB coupled by a bridge or interchange of track, and which manages a station G. This network is constituted, from a functional point of view, a plurality of equipment via, defining the relative arrangement of track equipment, a certain geographical topology of the network. On track AE, a first track circuit called AEA, a second track circuit AEB, a multi-aspect signal MP263 (three-color spotlight for example), a second track circuit (from left to right on Figure 2) are placed in sequence. first bridge of interlock or change of track MP2205B (an electric drive), a second bridge of interlock or change of track MP2206A, a signal of maneuver MP1002 (two-color focus mainly), a third track circuit AED, a second signal of multiple aspects MP265, a fourth track circuit EEA, and a fifth track circuit AEF.
On the track AB, a first circuit of track ABE, a second circuit of track ABG, a first signal of multiple aspects MP262, a third track circuit ABJ, are placed in sequence (from right to left on Figure 2), a first bridge of interlock or change of track MP2206B, a second interlocking bridge MP2205A, a second multi-aspect signal MP261, a fourth ABP track circuit and a fifth track circuit ABR. On this network, trains can print different predefined itineraries that each depart from a multi-aspect signal such as signal MP261, or from a maneuvering signal and passing through different successions of track equipment. By way of example, the itinerary designated R261 on Figure 2, part of the multipath signal MP261 and passes successively by the bridge of interlock or change of track MP2205A, the bridge of interlock MP2206B, the bridge of interlock MP2206A, the circuit of AED path, and finally by MP265 multi-aspect signal. It is understood that the signs do or do not form part of an itinerary that follows its orientation with respect to the direction of movement of the train on the itinerary.
In Figure 3, the logical architecture of the rail interlock system corresponding to the rail network of Figure 2, takes the geographical topology of this network again. On this figure, the tasks are represented by the blocks between which appear logical channels of communication represented by the arrows 6. A logical channel of communication implemented between two tasks, corresponds to a part of an itinerary that passes through the two track equipment associated with these two tasks. If a train can adopt this part of the itinerary in both circulation directions, the corresponding tasks are interconnected by two parallel logical communication channels. This is the case, for example, for the two logical communication channels that interconnect the tasks called dPnt-2205A and dPnt-2206B. For more clarity, the blocks that represent the tasks are presented according to the different forms, depending on the type of track equipment associated with each task, since the tasks associated with the same type of track equipment have an identical logical operation. They are distinguished on Figure 3, tasks Sig-261, Sig-262, Sig-263 and Sig-265, each associated to a signal of multiple aspects, tasks Trc-AEA, Trc-AEB, Trc-AED, Trc-AEE, Trc-AEF, Trc-ABE, Trc-ABG, Trc-ABJ, Trc-ABP and Trc-ABR associated each with a track circuit, a Shi-1002 task associated with a maneuver signal and the tasks dPnt-2205A, dPnt-2005B, dPnt-2206A and dPnt-2206B each associated with an interlocking bridge. The principle of operation of distributed logic by message propagation is described below on the basis of the itinerary R261, and with reference to Figures 3 and 4. The itinerary R261 corresponds to a succession of logical communication channels that interconnect in sequence the tasks Sig-261, dPnt-2005A, dPnt-2006B, dPnt-2005B, Trc-AED and Sig-265 where the corresponding blocks are shown shaded in Figure 3. The entry of the itinerary R261 corresponds to the task Sig-261.
Establishment of itinerary R261
The establishment of an itinerary is required from the checkpoint 1. A request for establishment of this itinerary sent from the checkpoint 1 (symbolized by Sys in Figure 4) is received by the task of entering the itinerary in the form of a input message that includes an itinerary identifier. In the example, the task Sig-261 receives the message Req (R261), the identifier of the itinerary being symbolized by R261. A first process of propagating the itinerary request request message, from the task of entering the itinerary and following a loop or loop through the series of tasks corresponding to this itinerary, and returning to the task of entering the itinerary, It is put into operation by the set of these tasks. In particular, message R261 is propagated by tasks Sig-261, dPnt-2005A, dPnt-2006B, dPnt-2005B, Trc-AED and Sig-265 following a loop called assignment loop, in the course of which each task in Question is assigned for the R261 itinerary after receipt of the Req message (R261), except in the presence of a conflict situation (the task is already assigned to another itinerary). In the case of a conflict situation detected by a task, a message Conf (R261) is traced, from task to task, from the task in question to the task of itinerary entry as the task Sig-261, which transmits this message to the checkpoint. In Figure 4, if all the tasks corresponding to the itinerary R261 are assigned to the itinerary R261, the last task Sig-265 forwards the message Req (R261) to the task Sig-261 of entry of the itinerary R261. The Sig-261 task sends an Alloc message (R261) to the control post for confirmation. This first process guarantees that each task is assigned for a single predefined itinerary where establishment is required. A second process is immediately put into operation by the tasks that are assigned for an itinerary, in order to control that the set of track equipment of the itinerary are placed in a correct position (placement of interlocking bridges or changes of track, mainly) before opening the circulation of a train on the itinerary and, in the case otherwise, he orders them to place themselves in the required position. This second process consists in the propagation of a message Ctrl from task to task, from the task of entering the itinerary and following a loop called command loop or drive. Upon receipt of this message, each task orders the correct positioning of the track equipment to which it is associated, and retrieves in a status signal information relative to the current position occupied by that equipment. In particular, the task Sig-261 on the reception of the message Req (R261) comes from the task Sig-265 that orders the red placement of the signal MP261, retrieves the information relative to the current state of the MP261 signal and propagates this information in an rtechk parameter included in the Ctrl message (R261, rtechk). The message Ctrl (R261, rtechk) is propagated from task to task, while the rtechk parameter is updated for each task, and each track team is ordered to occupy the correct position before the opening of the itinerary. Finally, the task Sig-265 forwards the message Ctrl (R261, rtechk) to the task Sig-261. When the Sig-261 task receives the message Ctrl (R261, rtechk), it performs a treatment to control, based on the information contained in the rtechk parameter, whether the set of track equipment is correctly positioned. If the set of track equipment is not placed correctly, the message Ctrl (R261, rtechk) is propagated again following the drive or order loop. In the case where the track equipment is all placed correctly, the Sig-261 task sends the message Set (R261) to the control post to confirm that the R261 route is now established (or locked), just until the appearance of a condition of liberation. It is possible that the Ctrl message is propagated more times following the order loop before the set of track equipment is correctly positioned, due to the fact that the time required for certain track equipment to change position (change of position of an interlocking bridge) is longer than the time needed to propagate the Ctrl message following the command or drive loop. Upon receipt of the message Ctrl (R261, rtechk), the task Sig-261 begins a process of periodic control of the status of track equipment. This process consists of the propagation of the message Chk (R261, rtechk), from task to task, following a loop called a control loop in the course of which each task retrieves information relative to the current state of the track equipment associated with it, and traces this information in the parameter rtechk via the message Chk (R261, rtechk) to the task of entering the itinerary. The task Sig-265 forwards the message Chk (R261, rtechk) to the task Sig-261 that controls, from the parameter rtechk, the current state of the track equipment, in such a way that a bad functioning of the track equipment of the nailed itinerary, it can easily be detected. This process is put into operation periodically, with a very high frequency.
Automatic release of the established itinerary
When a train commits to the R261 itinerary that has been established, its progression over this itinerary is translated into changes of information in the rtechk parameter of the Chk message. Normally, only the signal of multiple input aspects of the R261 itinerary can evolve in time between the instant where the itinerary is established and the instant where it is released, passing successively in the red, orange and green states. From the moment where the Sig-261 task detects that the train has crossed a certain number of track circuits of the itinerary, by identifying changes in the rtechk parameter in each control loop, it begins a process of releasing the R261 itinerary that it still consists in the propagation of a message, here the Free (R261) message, from task to task following a loop called release loop, in the course of which each task is unassigned for the itinerary upon receipt of the Free message. In the example of Figure 4, when the Sig-261 task receives the Free (R261) message from the Sig-265 task, the task set in the R261 task is unassigned and the Sig-261 task sends this message to the control post for information. From this moment, the circulation on the R261 itinerary is no longer authorized, just until this itinerary is again established. It is understood that this logic of message propagation can be refined, following the aforementioned principle, to also implement features such as the release of itineraries at the request of the operator, the permanent maintenance of an established itinerary,
According to the invention, the logic of propagation of the messages is advantageously constituted by automata in finished states, which are implemented in the tasks. Each automaton of a task is decoupled to the reception of a message in question, it transits from a current state to another state, carrying out a certain treatment and forwards a message in the output. The successive states in each automaton correspond to the successive processes of propagation of the different messages. According to this solution, the implementation of the rail interlock system 1 can be carried out semi-automatically from a computer treatment of a file 5 for the description of a high level of abstraction of the railway network to be controlled, and a library 6 of generic logic modules that each implement automata in finished states that correspond to a type of track equipment. More particularly, Figure 5, from a synoptic 4 of the railway network to be controlled, a technician expresses the characteristics of the network in data of a language of high level of abstraction, these data being consigned in the description file 5. A Example of the content of a high-level abstraction description file for the railway network, shown in Figure 6, is given in Annex 1 (to note that this rail network is analogous to that shown in Figure 2). The content of this description file is analogous to that used to implement the known rail interlock system of European Patent No. 0581281, indicated as prior art. There are different sections in this file (indicated by "Level 0, Level 1, ...") that define the characteristics of the network, catalog the set of track equipment and identify the routes. In this way, in the section called "Level 2A", there is a description of the itinerary R261 that has served as an example for the description of the operation of the distributed logic of message propagation. An example of the source code of a generic logic module that implements a PLC in finished states, corresponding to a multi-aspect signal, is provided in Annex 2. Another example of the source code of a generic module corresponding to a track circuit, is also provided in Annex 3. The source code of each module is given here in a language of high semantic level. This comprises several sections and mainly a declaration section of input messages "Input Messages", a section of declaration of output messages "Output Messages" and a section of declaration of transition states "States". In the declaration sections of incoming or outgoing messages, the sender or the receiver of the message is represented by a generic identifier such as "Sig", "Tim", "Sys", "Up", "Dn", "Back " Annex 4 illustrates the waves of messages Req, Ctrl, Chk, etc. representing the terminology of the messages, used in the source code of the generic modules given in Annexes 2 and 3.
At the time of the computer treatment indicated above with reference to Figure 5, the source code of each task is generated from a source code of a generic module corresponding to the track equipment that must be associated with the task, and the identifiers Generic messages of the sender and receiver of the messages are "replaced" by appropriate task identifiers, retrieved from the network description file to establish the logical communication channels. It will be easily understood that each logical communication channel is a connection that is established, in the source code of each task, by means of a transmission primitive or reception of a point-to-point communication protocol of the first-in-first-out type (FIFO) ). The source code of the tasks is then compiled to obtain the executable tasks communicated by messages of the interlock system according to the invention. It is understood that the treatment units that support the tasks must be connected to each other by means of a physical communication network, of the terrain network genre, which supports a communication protocol as defined hereinbefore.
It is noted that in relation to this date, the best method known to the applicant to carry out the aforementioned invention, is that which is clear from the present description of the invention.
Having described the invention as above, property is claimed as contained in the following:
Claims (5)
1. A railway interlocking system based on a logical architecture, which serves train traffic in security, on a railway network consisting of a plurality of track equipment, characterized the system because it comprises a set of tasks (Trc-AEA, Trc- AEB, ...) associated respectively with the corresponding track equipment (AEA, AEB, ...) that make up the network, and because the tasks implement a distributed logic for the establishment and release of routes by means of message propagation (Req. , Ctrl, Chq, Free) through successions of logical communication channels that each interconnect a message output from a task and a message input from another task, and because the logical communication channels are implemented between tasks, following a disposition corresponding to a certain geographic topology of the network.
2. The system according to claim 1, characterized in that the distributed message propagation logic is constituted by automata in finished states, implemented in the tasks.
3. The system according to claim 1, characterized in that the distributed logic is arranged to propagate the messages through a succession of tasks where the associated track teams define an itinerary, in such a way that these messages follow the logical channels of communication that they interconnect these tasks, according to a loop that starts from the first task of this sequence, passing successively through the other tasks of this sequence, and returning to the first task. . A method for implementing a railway interlocking system according to claim 2, characterized in that it consists of the computerized processing of a high-level description file of the rail network, and of a library of generic logical modules that each implement an automaton in finished states that corresponds to a type of track equipment. SUMMARY OF THE INVENTION A railway interlocking system is described, which serves to train traffic in security, on a network consisting of a plurality of track equipment, comprising a set of tasks (Trc-AEA, ...) associated respectively with the equipment of which constitute the network. The tasks put into operation a distributed logic of establishment and release of itineraries by propagation of messages through successions of logical communication channels (6), which interconnect the tasks following an arrangement corresponding to a certain geographic topology of the railway network under control. The implementation of the system is done through a computerized treatment of a network description file and a library of generic modules that each automata implement in finished states. / • LOL yout Sp "eifie« tlßn • / ••• same HAN M SCHCXC tuSu Uyout 1 02; . { XNTERLOCKINß: MAMAU; VtftSXONs V4.0; D? Tß: ll.DtC.íJ) SOURCB: "B.C. - Confopu to X" your "4 LOL WT Spßc"; LO: 3; Ll: 16; L2A 15; L2B: 3; L2C: 0; L3 ?: 43; L3B: 10; L3C: 0; I tßlt / • L € vol 0 - Nsttwoc • / ttt L0-1 ti LXNC or HAY:: br anchi j. { NOOC 0: «-an« rhß ».tßr_« trport_ «tati © n; NODC ~ l: boundaryl; "» tett Itt L0-2 tt BOUNDAftY:: boundaryl; i LXNC OF VAY: branchl; TCXTT-Tß Hßald Crtßn "; ) tttt ttt LO- 3 tt FE? TURX:: n * nch «sttr alrport station; «LXNC or MAY-LX3T: branchl; TCXT7aManch «st« c Alrport Station ";) tttt / • vil 1 - Track • / «tt Ll-l tt TR? CX:: traekl; (NODC I heard tricenal; NOOC "l: pnl; Lt-NC? B. 2SS. S0YD9J) tttt ttt Ll-2 tt NODC 0: pn2; NODB ~ l: trkoiMU; LDfGTH: 393.25YDS; I tttt ttt Ll-3 tt TRACK:: traek3; (NODB 0: pnl; NODC "l: pn3; LEMCTH: 2II .7SYDS; ) tttt «tt Ll-4 t« TRACK:: traek4; . { NODB 0: pnl; NODB ~ l: pn2; LENGTH: 140.25YDS; ) ßttt ttt Ll-S tt TRACK:: traekS; (NODB 0: pn4; NODB ~ l: pn3; LENGTH: 1H.2SYDS; ) ßttt tßt Ll-6 «« TRACK :: trackß; «NODB 0: pn4; NOde "l: pn2; LENGTH: 1.25YDS; 1 ßttt ttt Ll-7 tt TRACK :: track7; . { NODB 0: pn3; NODB'l: trkbndl; LCNGfN: 1017. SYDS; I tttf ttt Ll-I tt TRACK :: trackt; (NODB 0: trkbndí; NOOB ~ 1: pn4; LSMGTK: 1130.2SYDS; »Tttf ttt Ll-9 tt TRACK CND NODC :: trkondl; (TRACK: traekl;) tttt ß «t Ll-10 tt TRACK CND NODC:: trk« n 2; (TRACK: track2; 1 ßßßß TRACK BOUNDARY NODC :: trkbndl; (TRACK: t rack7; I ßßßß ßßß l- 12 ß «TRACK BOUND? A AND NODC:: t rkbnd2; (K: trackß; eßßß ßßß Ll-13 tt POXNTS NODC :: pnl; (TYPC: CONTROLLCD; PATH 1: Ctrackl, traek3); PATH ~ 2: (traekl, traek4); MACH1NC-LXST: PKF220SB; ßßßßßßßßß- 14 ßt POINTS NODC:: pn2; (TYPE: CONTROLLCD; PATH 1: (trackß, track2); PATH ~ 2: (trackß, track4>; MACHINC-LIST: PMF220SA; ßett ßßt L1-1S tt POXNTS NODC :: pn3; (TYPC: CONTROLLCD; PATH 1: (track7, track3); PATH ~ 2: (track7, trackS); POXNT MACHXNC-LXST: PMP2206A; ) ßßtt ttt Ll-16 tt POINT3 NODC :: pn4; l TYPC: CONTROLLCD », POXNT MACHXNC-LXST: PK» 220βB; »Tttt / * Lovol 2A - Slsnalllng r« atur «a • / ttt L2A-1 tt INTCRLOCKINC :: HANAXR; i NUMBCR: 2; CONTROL CENTER: Mane «at« r Ficcadllly; CC ID: fi »; I 3ECTXON-LIST: ((traekl, 0,1), (track2,0, l), (track3,0, l), (traek4,0, l), (traekS, 0, l), (trackß, 0 , 1), (track7,0,0. «14), (trackß, 0.479, 1)); M SECTION-LIST: ((trackl, trkandl, OYDS, 25ß SYDS), (track2, trkßnd2, OYDS, 393.2SYDS), (tr «ck3, pnl, OYDS, 211.7SYDS), (traek4, pnl, OYDS, 140.2 SYSS), (trackS, pn4, OYDS, llß.2SYDS), (trackß, pn4.0YDS, 41.2SYDS), (track7, pn3, OYDS, «2 .7 SYDS), (trackß, trkbnetf, OYDS, 541.75YDS) ); ßßßt ßßt L2A-2 ßß ROUTE:: R261A (H); (TYPE: MAIN; INTERLOCXINS: KAN AIR; ENTRANCE: SMP2ßl; EXIT: SMP265; OR ERLA ?: OAEC; LENCTH: 921.2 SYDS; SPEED RESTRICTION-LXST: airport atation aroa, airport down; D_I_SECTXON: ((track2 -, 0-.4-1-3 -, - l) -, pn2-), (Crackß, 0, l), pn4), (trackS, 0, l), pn3), (traek7 , 0,0.S «9), trkbndl) |; DM SECTXON: ((tr «ck2, pn2.0YDS, lß2.2SYD3), pn2), (trackß, n4, OYDS, 41.25YDS), pn4), (trackS, pn3, OYDS, llß.2SYDS), pn3), < track7, pn3, OYDS.599. SYDS), trkbndl)); ßttt ttt L2A-3 tt ROUTE :: R261A (S); i TYPE »SHUNT; INTERLOCKINC: HANAXR; ENTRANCB: SMP2ßl; EXXT: SM * 2ßS; LENGTH: 921.2SYDS; ra,. , n, ((traekß, 0, l), pn4), ((track5,0, l), pn3), (< track7,0,0.5 «9), trkbndl)}; D M SCCTXON:. { ((track2, pn2.0YDS, l «2.2SYDS), pn2), ((trackß, pn4, OYDS, 1.2SYDS), pn4), KtrackS, pn3, OYDS, llß.2SYDS), pn3),. { (track7, pn3, OYDS, 599. SYDS), trkbadl)); ) ßß «ß ßßß L2A-4 ßß ROUTE :: R262A (H); (TYPE: MAIN; INTERLOCKING: MANAIR; ENTRANCB: SMP262; EXST: bufstop2; LENGTH: 907. SYDS; SPEED RCSTRICTION-LSST: airport up, airport station ark; D I SECTION: (((trackß, O.S «2, l) 7pn4), ((trackß, 0,1), pn2), ((track2, 0, 1), trk« nd2)); DM SECTION: (((trackß, pn4, OYDS, 473YDS), pn4), ((trackß, pn2, OYDS, 1.25YDS), pn2), ((track2, trk «nd2, OYDS, 393.2SYDS), trktnd2 > );) ßßßßßßßßßßßß L2A-S ßß ROUTE :: R2ß2A (C); (TYPE: CALL ON; INTERLOCKIÑG: MANAXR; ENTRANCE: SMP2ß2; EXIT: buf »top2; LENCTH: 907. SYS; SPEED RESTRICTION-LIST: airport up, airport atation ark; D I SECTION: < ((trackß, O.Sß2, l) 7pn4), ((trackß, 0,1), pn2), ((traek2, 0, 1), trk * nd2)); D M SECTION:. { ((trackß, pn4, OYDS, 473YDS), pn4), ((trackß, n2, OYDS, 41.2SYDS), pn2). ((track2, trka ?? - 2, OYDS, 393.2SYDS), trk »nd2 >); ) ßßtt ttt L2A-6 tt ROUTE :: R2ß2B (M); (TYPB: MAIN; INTERLOCKINß: HANAIR; ENTRANCE: SMP2ß2; EXIT: bufatopl; LCNGTH: 913YDS; SPEED RESTRICTION-LXST: airport up, airport ßtation_ar * a; D X SECTION: (U trackß, 0. S «2. I) 7pn4), < (trackß, 0, l), pn2), ((track4,0, l), pnl), ((trackl, 0, 1), trkandl)); DM SECTION: (((trackß, n4, OYDS, 73YDS), pn4),,,,.,, ((Track4, pnl, OYDS, 140.25YD3), pnl », ((trackl, trkandl, OYDS, 25«. SYDS), trkandl).} Tttt Itt L2A-7 tt ROUTE :: R2ß2B (C); i TYPC: CALL ON; INTBRLOCKIÑG: MANAXR; ENTRANCE: SMP2ß2; EXXT: bufstopl; LENGTH: 913YDS; SPCCD RESTRICTION-LIST: lrport up, airport atation arca; DX SECTION: (((trackß, 0.S02, l) 7pn4), ((trackß, 0,1), pn2), ((track4,0, l), pnl), ((trackl, 0, 1), trkßndl)); DM SECTION: (((trackß, pn4, OYDS, 473YDS), pn4), ((trackß, pn2, OYDS, 41.2SYDS), pn2), (Itrack4, pnl, OYDS, 140.2SYDS), pnl), ((trackl , trkandl, OYDS, 2Sß.SYS), trkondl)); ) ßßßt ßtt L2A-ßtt ROUTC :: R2ß3A (M); I TYPC: MAIN; INTCRLOCKING: MANAXR; ENTRANCE: SMP2ß3; EXIT: SMP2ßS; OVCRLAP: OAEE; LENGTH: 91S.7SYD3; SPEED RESTRICTION-LXST: airport station aroa, airport down; D_I_SECTION: ((((trackl, 0.ß94, l) 7pnl), < ((track3,0, l), pn3), (((track7,0,0.S «9), trkbn41)); D_M_SECTSON : (((Trackl, pnl, OYDS, 27. SYDS), pnl), (((track3, pn3.0YDS, 2ß «.7SYDS), pn3), (((track7, pn3,0YDS, S99.SYD3) , tr) cbndl) |;) ßßßt ßtt L2? -9 tt ROUTE :: R263A (S); (TYPB: SHUNT; INTERLOCKXNG: KANAIR; ENTRANCC: SMP2ß3; EXXTi 3MF26S; LENGTH: 91S.7SYDS; SPECD RCSTRICTION-LIST: airport station ar «a, alrport_down; O X 3BCTIOH: l ((trackl, 0.194, l) 7pnl) »((track3,0, l), pn3), < (tr »ck7,0,0.5« 9), trkbndl)); DM SCCTXON: (((trackl, nl, 0YDS, 27.SYDS), pnl), << track3, pn3, OYDS, 299. SYDS), pn3), ((tr * ck7, pn3, OYDS, 599. SYDS), trkbndl)); ) ßßßß ßtt L2A-10 tt ROUTE :: R1002A (S); I TYPE: SHUNT; INTERLOCKING: KANAXR; ENTRANCE: SKP1002; EXXT: buístop2; LENGTH: S63.7SYDS; 3 PEED RCSTRXCTSON-LSST: airport atation aroa; DS SECTION: (((track7,0, 0.0U) 7pn3), (< track5,0, l), pn4), ((trackß, 0,1), pn2), ((traek2, 0, 1), trk «nd2)); DM SECTION: (((Crack7, pn3, OYDS, 11YDS), pn3), ((trackS, pn4, OYDS, llß.25YDS), pn4), ((trackß, pn2, OYDS, 41.2SYDS), pn2), ( (track2, trk «nd2, OYDS, 393.25YDS), trkßnd2)); I ßßßß? ßß L2A-11 ßß ROUTE :: R1002B (S); < TYPE: SHUNT; INTERLOCKSNG: MANAXR; ENTRANCE: 5MP1002; EXXT: bufstopl; LENGTH: SSß.2SYDS; SPEED RESTRICTIOH-LIST: airport atation aroa; D I SECTSON: (((track7,0,0.011) 7pn3), ((track3,0, l), pnl), ((trackl, 0,1), trkandl)); DM SECTION: (((traek7, pn3, OYDS, 11YDS), pn3), < (traek3, pnl, OYDS, 2ßß.75YDS), pnl), ((traekl, trkßndl, OYDS, 251. SYDS), trktndl) ); ) ßßßß ßßß L2A-12 ßß OVERLAP :: OAEE; (INTERLOCKXNG: KANAIR; SIGNAL: SMP2ßS; TYPE SECTION-LIST: («(TULL, (((track7,0.59S, 0.114), trkbndl)), (((track7, pn3, ßOSYDS, ß27.7SYDS), trkbndl) J ) »I ßßßt ßtt L2? - 3 tt SPEED RESTRXCTXON :: airport station aroa; (TYPE: BX DXRECTSONAL; SPEED-LIST: (ttTTED, 0MFH); X SECTXON: ((trackl, 0,1), (track2,0 , l), (track3,0, l), (track4,0, l), (track5,0, l), (trackß, 0,1), (track7,0,0.15ß), (trackl, 0.751, 1)); M SECTION: ((trackl, trkondl, OYDS, 2S «. SYDS), (track2, pn2, OYDS, 393.23YDS), (traek3.pnl, 0YDS, 2« ß.7SYDS), (track4, pnl, OYDS, 140.23 YDS), (trackS, pn4.0YDS, ll «.23YDS), (trackß, pn4.0YDS, 41.2SY8?, (Rack7, pn3, OYDS, 1 ßO. SYDS), (trackß.pn4, OYDS, 273. SYDS ));) ßßßß ßßß L2? -14 ßt SPEED RB3TRXCTION :: airport dowa; (TYPB: DIRECTSOMAL; SPEED-LIST: (rXTTED.ßOKPH); D S SECTXON: M <track7,0.1Sß, 1), trk * ndl)); D ~ M ~ SECTSON: (< (track7, pn3, IßO.7SYDS, 1017.5YDS), trkbndl)); l ~ "" ßßßß ßßß L2A-1S ßß SPEED RESTRXCTION :: airport up; < TYPE: DSRBCTSON? L; SPEED-LIST: (rXTTCD, ßOMPH); D X SECTXON:. { ((trackl, 0,0.7Sß), pn4)) D ~ M ~ SECTION: (< (trackl, trkbnd2, OYDS, ISß.75YDS), pn4)); ) ~ "ßßßß / * L« v «l 2B - Civil raaturaa • / ßßß L2B-1 tt OVER BRXDGE :: bridal; (I SECTION-LSST: ((trackl.0. 04,0.553) |, ((track2, 0.ß3β, 0.734) 1; M SECTSON-LXST: ((trackl, trkßndl, 10
4. SYDS, 143YDS)), (< track2, trk * nd2, 104. SYDS, 143YDS));) ßßßßßßßßßßßß L2B-2 tt PLATrORM :: platfora2; i rXATURX: aanchostor alrport station; TEXTI "PLATGORM 2" and "X SECTXON: ((trackl, 0.011, 0.194)); K'SBCTXON: ((trackl, rkandl, 2.7SYDS, 231YDS)); tttt ttt L2B-3 tt PLATFORM :: plat fonal; i rEATURB: • broadstreet airport station; TEXT: • PLATrORM l-; "X SECTION: ((track2, 0.413, 0.993)); M'SBCTXOM: ((track2, trk * nd2,2.75YDS, 231YDS)); 1 ~ tttt / • Lovol 2C - Traction "« aturas * / / • Loi / ol 3A - Sl «jnallin < j BajuipaMnt • / ßtt L3A-1 tt SSGKAL :: SM» 2ßl;. {TYPE: CONTROLLED; INTERLOCXSNG: HANAIR; SSI LABEL: S2ßl; ASPECT: NETWORK, YELLON, GRECN, SUBSIDIAR *; 0 I LOCATION: ((track2, 0.413), pn2); D ~ M "LOCATION: ( (track2, trkßnd2,231YDS), pn2); ) "" ßßßt ßtt L3A-2 tt SIGNAL:: SMP262; (TYPE: CONTROLLE0; INTERLOCKING: MANAIR; SSI I-ABEL: S262; ASPECT: RED, YELLON, SUBSXDIARY; MULTI LAMP: R262A (M), R2S2A (C), R2S2B (M), R2S2B (C); D X LOCATXON: ((trackl, 0.582), pn4); D ~ M ~ LOCATION: ((trackl, rkbnd2, ßS7.25YDS), pn4> l "" ßßßß ßßß L3A-3 ßß SSGMAL :: SM? 2ß3; (TYPE: CONTROLLED; INTERLOCKSNG: MANAIR; SSI LABEL: S2ß3; T: ReD, YeLLON, GREEN, SUBSXDXARY; LOCATION: ((trackl, 0.194), pNl); LOCATION: ((trackl, trkandl, 231YDS), pnl); eßßt ttt L3A-4 tt SIGNAL :: SM »2ßS; < TYPE: CONTROLLED; INTERLOCKING: MANAXR; SSI LABEL: 32ßS; ASPECT: RED, YELLON, BELIEVE, and DX LOCATION: ((track7, 0.519), trkbndl); D ~ M ~ LOCATION: ((track7, pn3, 599. SYDS), trkbndl); I "" tttt ttt L3A-S tt SIGNAL :: SMP1002; . { TYPB: SHUNT; XNTERLOCKING: MANAXR; SSX LABEL: S1002; STATE: ON, OPT; D X LOCATXON: ((track7, 0.011), pn3); ) tttt ttt L3? - «tt POINT MACHINE:: PMB220SB; < TYTC: CLAMPLOCK; INTERLOCKING: MANAIR; SSI LABEL: P220SB; NODE: pnl; COMMON: traekl; NORMAL: track3; REVERSE: track4; I ßßßt ßßß L3A-7 tt POINT MACHINE:: PMP220SA; (TYPE: CLAMPLOCK; INTERLOCKING: MANAXR; SS1 LABEL: P220SA; NODE: pn2; COMMON: t rackß; NORMAL: track2; REVERSE: track4;) ßßßt ßßt L3A-I tt POINT MACHINE:: PMF220 &?; I TYPE: CLAMPLOCK; INTERLOCKING: MANAXR; SSI LABEL: P2206A; NODE: pn3; COMMON: track ?; NORMAL: traek3; RSE: trackS; ßett ttt L3A-9 tt POINT MACHINE :: PMP2206B; (TYPE: CLAMPLOCK; INTERLOCKING: MANAXR; SSX LABEL: P220ßB; NODE: pn4; COMMON: trackß; NORMAL: traekt; REVERSE: trackS;) tttt ttt L3A-10 tt TC JOINT :: ibjl; (TYPE: ORDINARY; X LOCATION) (traekl, 0.011); M'LOCATION: (trackl, trkßndl, 2.7SYDS); «Ttt ttt L3? -11 tt TRACK CIRCUIT:: TMPAEA; (TYPE: DC; INTERLOCKING: MANAIR; SSS LABEL: TACA; S SECTION:. (. (Traekl, 0.011, 0.447) |; M ~ SECTION: ((trackl, trkondl, 2.75YDS, 11
5. SYDS)); l ~ ßßßß ßßß L3A-12 ßß TC JOSNT :: ibj2; (TYPE: ORDINARY; I LOCATION: (trackl, 0.447); M ~ L CATION: (trackl, trkondl, 115.5YDS); l ~ ßßßßßßßßß L3A-13 ßß TRACK CIRCUIT :: TMPAEB; (TYPE: DC; SNTERLOCKSNG: MANASR; SSS LABEL: TAEB; S SECTION: ((traekl, 0.447, 0.968) »; M ~ SECTION: { (Trackl, trkandl, 115. SYDS, 250.2SYDS) ); l "ßßßßß ßßß L3A-1 ßß TC JOSNT :: ibj3; (TYPE: ORDSNARY; S LOCATION: (traekl, 0.961); M'LOCATION: (trackl, trkandl, 2S0.2SYDS);)" ßßßßßßßßßßßßßß L3A- 15 ßß TRACX CSRCUST :: TMPABC; (TYPE: DC; SNTERLOCKING: MAKAIR; SSI LABEL: TAEC; X SECTION: ((trackl, 0.968, 1), (trackS, 0.1), (traek4,0,0.49), (trackS, 0.512.1), < track7.0.0.02)); M SECTION: ((trackl, trkandl, 250.2SYDS, 251.SYDS), (track3, pnl, OYDS, 288.75YDS), (traek4, pnl , OYDS, 68.7SYDS), (trackS, pn4, 60. SYDS, 118.2SYDS), < traek7, pn3, OYDS, 5.SYDS)); ) tttl ttt L3A-16 tt TC JOINT :: i; (TYPE: ORDINARY; I LOCATION: < traek7.0.02); M'LOCATION: (traek7, pn3, S.5YDS); ) ~ tttt ßßß L3A-17 ßß TRACK CIRCUIT :: TMPAED; (TYPe: DC; INTCRLOCKXNG: MANAIR; SSI LABEL: TACO; I SECTION: ((track7, 0.02,0.595)); M'seCTION: ((traek7, pn3,5.SYDS, ß05YDS)); ) "ßßßß ßßß L3A-18 ßß TC JOINT :: ibj5; i RDINARY; ION: (track7, 0. S9S); ION: (track7, pn3, 60SYDS); eßßt ßßß L3A-19 ßß TRACK CI RCUIT:: TMPAEE; (TYPE: DC; ING: MANAIR;: TACE;: ((track7, 0.595.0.814) 1;: ((track7, pn3,605YDS, 827.7SYDS)); ßßßßßßßßßßßßßßßß-Lßß-20 ßß TC JOSNT:: ibjß; ( RDINARY; ION: (traek7, 0.814); ION: (track7, pn3, 127.75YDS); eßßt ttt L3A-21 tt TC JOINT ibJ7; ("RY; (trackß, 0.479); (trackl, trkbnd2, 541.75YDS); ßßet ttt L3A-22 tt TRACK CIRCUIT :: TMPABC; (TYPE: DC; tttt ttt L3A-23 ßß TC JOINT :: ibjß; (TYPE: ORDSNARY; X LOCATION: (trackl, 0.584); M'LOCATSON: (traek8, trkbnd2,660YDS); l "tßßß ßßß L3A-24 ßß TRACK CIRCUIT :: TMPABJ; (TYPE: DC; XNC: MANAXR; TABJ;: ((trackß, 0.584, 0.759));: ((trackl, trkbndí, 660YDS, ISIYDS) I; ßßßßßßßßßßßßßßßßß L3A-2S ßß TC JOSNT :: ibJ9; (RDSNARY; ION: (trackl, 0.759); ION: (trackß, trkbnd2.85ßYDS); eßßß ßßß L3A-26 ßß TC JOSNT :: ibJIO; (RDINARY; ION: (trackS, 0.512); ION: (track5, pn4 , 60.SYDS); eßtt ßtt L3A-27 tt TC JOINT :: ibjll; (TYPE: ORDIHAAY; I LOCATXON: (track4, 0.49); M'LOCATXON: (track4, pnl, ««. 7SYDS);! "ßttt ttt L3A-2I tt TRACK CIRCUIT :: TMPABL; (TYPE: DC; TNTERLOCKXNß: MAKAXR; SSX LABEL: TABL; I SECTION: ((traek2, 0.0.406), (traek4, 0.49,1),,,, (trackß , 0.759,1) 1; M seCTION: ((track2, pn2, OYDS, 159. SYDS), (track4, pnl, 6ß.7SYD3,140.2SYDS), (trackS, pn4, OYDS, 60. SYDS), < traek6, pn4, OYDS, 41.25YDS), (trackß, trkbnd2,8SßYDS, 1130.2SYDS)); ) ßßßß ßßß L3A-29 ßß TC JOINT :: ibjl2; (RDINARY; ION: (track2, 0.406); ION: (track2, pn2, 159. SYDS); eßßß ßßß L3A-30 ßß TRACK CIRCUIT :: TMPABP; (TYPE: DC; I TERLOCKING: MANAIR; SSI LABEL: TABP; S SECTION: { (Traek2, 0.406, 0.706) 1; M'SECTSON: ((track2, pn2, 159. SYDS, 277.7SYDS)); ) "ßßßß ßßß LIA-31 ßß TC JOINT :: ibjl3; (TYPe: ORD1NARY; S LOCATION: (traek2, 0.706); M ~ LOCATION: (track2, pn2,277.75YDS);)" ßßßß ßßß L3A-32 ßß TRACK CIRCUIT :: TMPABR; (TYPE: DC; INC: MANAXR;: TABR;: ((traekí, 0.706, 0.993));: ((track2, pn2, 277.7SYDS, 390. SYDS) |; ßßßßßßßßss L3A-33 tt TC JOSNT :: ib l4; (RDSNARY; ION: (track2, 0.993); ION: <track2, pn2, 390. SYDS); eeßß ßßß L3A-34 ßß BUrrXR STOP :: buístopl; ((trackl.0) .trkondl); ((trackl, trkßndl, OYDS), trkandl); ttt L3A-3S tt BUrrER STOP :: bufßtop2; (D I LOCATION: ((track2,0), trkdnnd) / D ~ M ~ LOCATION: ((track2, trk «nd2, OYDS), trkond2); ) ßßßt ßßß L3A-36 ßt AHS EOJIPMENT :: SMP265I; 1 TYPE: DIRECTIONAL; INTERLOCXXNG: MANAIR; SSI LABEL: S26S; D I "LOCATION: ((track7, 0.392), trkbndl); D ~ M ~ LOCATION: ((traek7, pn3, 398.73YDS), trkbndl); I ßßßßßßßßß L3A-37 ßß SSI TrM :: tfaOl; (TYPE: SSGNAL; I ERLOCKXNG: MANAXR; NUMBER: 1; LOC CASE: loc2;) ßßßß INTERLOCKING: MANAIR; NUMBER: 2; LOC CASE: loc2; ) ßßtt ßtt L3A-39 tt SSX TFM :: tfßOS; (TYPE: POSNTS; XNTERLOCKXNG: MANAIR; NUMBER: 5; LOC CASE: loc3; »tttt ttt L3A-40 tt SSI TrM :: tfßOß; (TYPE: POINTS; INTERLOCKING: MANAXR; NUMBCR: 6; LOC CASE: loc4; TYPC: 3IGNAL; INTCRLOCKING: MANAXR; 7; E: loc4; eßeß ßßß L3A-42 ßß SSI TrM :: traOI; (TYPE: 3IGNAL; INTERLOCXSNß: MANAXR; NUMBER: 0; LOC CASE: locS;) ßßßßßßßßßßßß L3A-43 ßß SSS Tr:: trja09; (TYPE: SSGNAL; INTERLOCKING: MANAIR; 9; E: locß; eeßß / * Lo to 3B - Auxiliary Equlpaont V DISTANCE POST :: dpi; (TYPE: MILE; DSSTANCE: OMILES; DI LOCATION: ((traekl, 0), pnl); D ~ M "LCCATION: ((trackl, trkßndl, OYDS), pnl); ) ßßßt ttt L3B-2 tt DISTANCE POST :: dp2; (TYPE: QUARTBR MXLK; 0.2SMILCS; ION: ((track3, 0.629), pn3); I0N: ((trackl, pnl, 181. SYDS), pn3); eßtt ttt L3B-3 tt DISTANCE POST :: dp3; TYPC: -Unit MILC; DXSTANCC: O.SMXLES; DX LOCATXON: ((track7, 0.327), trkbndl); D ~ M ~ LOCATION: (< track7, pn3, 332.7SYDS), trkbndl); ßßßt ttt L3B-4 tt DISTANCB POST :: dp4; (TYPC: • 9UARTCR MXLC; 0.7SMXLCS; ION: ((track7, 0.759), trkbndl); ION: ((track7, pn3, 772.75YDS), rkbndl); ßßße ßßß L3B-S ßß LOC CASE :: loel; ( INTERLOCKXNG: MANAXR; 0M01"; ION: (trackl, 0.039); ION: (trackl, trkßndl, 10YDS); ßßß ßßß L3B-6 ßß LOC CASE:: loc2; (INTERLOCXING: MANAXR; TEXT:" 0M22"; TED M ? TH: tfiaOl, tf 02; SONT (traekl, 0.151); ION: (trackl, trkßndl, 220YDS); ßßß ßßß L3B-7 ßß LOC CASE:: loc3; (SNTERLOCKSNG: MANAIR; TEXT: "0M32"; ASSOCIATED NITH; : tfa.05; I LOCATION "(traek3, 0.213); M'LOCATION: (trackS, pnl, 61. SYDS); l ~ ßßßt ttt L3B-I tt LOC CASE:: loc4; (INTERLOCKING: MANAXR; TEXT!" 0M49-; ASSOCXATCD NITH: tf »06, tfß07; I LOCATION" (traekS, 0.102); M "LOCATSON: (trackS, pnl, 231. SYDS); I" tttt ttt L3B-9 tt LOC CASE :: locS; ( INTERLOCKING: MANAIR; TEXTi "0M90-; ASSOCIATED NITH: tfaOß; _,,.; ) tttt ttt L3B-10 tt LOC CASE :: locß; (XNTERLOCKXNG: MANAIR; TEXT: "0M113"; TED WITH: f «09; ION" (traek7.0.S73); ION: (traek7, pn3, 5I2.7SYDS); eeeß / * Lovßl 3C - Traetion Eßuipawnt * / AUTOHATOI EatSi | Lß | S 3 SB S StBt S SX «B SS« BI «Sa Setß: iat / • Global sot of astoaata Rosto / • Global set ef rostes HOßßtt-fß / • Global sot of aesßafeß • Baek / • Local ßet of astoaata • Intrue »/ • Local set ef rostes • Ent / • Local ßet of reatos • Overlap / • Local ßet of rosteß • Uit / • Local aet of rostes You recorded: / • Sif to the Aunt / • Tiaex S7 »/ • Slpalaaa ßyßti Baek / • Backßtreaa Op / • Opetreaa Da / • Dovastreaa Inpst Meßsagea: iCak [Sij] Croata.ßigckk.filcak) / • Sigaal caocki & (roste) / • Tiae-ost ikoq [Sys 3 (roste) / • Bosta reßseat irrßß [Syß 3 (rosta) / • Bosta roloaao iAaloaso [Syß] (reato) / • Bosta rolßaae! I Come l? Ose [Syß H os o, node) / • Bosta settlsf soda iApp [Dp (reata.trseak) / • Approaca lloq tvp 3 (roete) / o Bosta reasßßt iCtrl [Op 3 (rosto, rtechk) / • Bosta coatrol iCak [Op 3 (roste, rtechk ) / "Bosta cseckia róroo [Op 3 (rosto) / • Bosta caaeßllatißa ilpp [Da (roete, trseak) / • Approack iCoaf [Da 3 (ast, osta, rosto) / • Bosta coafllct iteq [Back3 (roste) / • Bosta reasest íCtrl (B * ck (roste, rteehk) / • leste control i Cal [Back] (roste, rtechk) / • leste cheekxag íFreß [Beck] (roste) / • leste caacollatioa Oetput Heßeageo: oCtrl [Sig 3 (rostß. ßigetrl) / • Follow control oOa CTia] (roste. Tiaß) / • Ti-sßr o oBad [Syß 3 (aeßß) / • Bad neßßago oilloc [Syß (roste) / • leste allocated oSet [Syss (roste) / • leste ßet oFree [Sys 3 (roste) / • Bosta released oCoaf [Syß 3 (ast, roste roste) / • Boato coailict oMode [Syß 3 (roste.aode) / • lóate ßettiag aode oApp COp 3 (roste, trßchk) / • Approech oCoai [Up 3 (aat, roste, oste) / • coaffliet oipp [Da 3 (roste, trßchk) / • Appreach oteo. CDs 3 (roste) / • loato reqseet oCtrl CE * 3 (roste, rtechk) / • leste eoatrol oChk [Ds 3 (roste, rtechk) / • loato chßckiaf oFrßß [DB 3 (rosto) / • lóate reléase o? Eq [ back (rosto) / • leste reqaeßt oCtrl [back3 (roste, rtechk) / • leste coatrol oChk Cback (rosto .rtechk) / • Boato chockiaf oFroe. [back3 (rosto) / • loato roleaaß Easaerata: • Node < Ai.ro > / • Boato aodo eSigCtrl < lo4.T1.6a > / • Follow the coatrol eSigChk. { led.n .ßa) / • Follow the chockiaf eFilChk. { TlGa.Tl .Ga > / • rilaaßat checkiag eEzSif < ail.lßd.TlGa > / • Bxit ßigaal ePatChk < 0E, I0E > / • Poiata checkiag eTrsChk < 0B.I0B > / o Traek soctioa checkiag / • EzSig PatChk BlkTrs FßtTrc SecTrc eltoChk eEzSig x oPatChk z oTrßChk z oTraCak z eTrsChk Fsactioas: get.t-ae (routss) ia Iaor / • Tiaer aa &ager get_b «ek (ronte) iaBack / • Back aaaager Conitut valse : ItßChklnat (ail .OX.OX.OX.OE) ia elteChk / • leste cheekiag KteCfekOX? Ed (led .OK.OK.OX.OX) ia ektoCak / • leste checkiag BtßQLkOXTlßa (TlGa.OX.OK.OX.OX ) ia olteChk / • leste eheckiag AppTrßOX OX ia oTrßCak / • Approach checkiag AppTrßlOX I0X ia oTrßChk / • Approaeh checkiag State niñee: Eatr ail ia. { ail > U sEatraaca / • l ate ideatifier Exit í > iacladed ia alzlt / • leste ideatifier Otßr iacladed iaOverlap / • leste idaatifier Laßt O iaclsded ia ßLaßt / • lóate idaatifier Rodo Al ia oKode / • Aatosatic roleaße ExSig led ia eExSig / • Bxit ß gaal S.gChk led ia oSigChk / • Follow checkiag FilChk rich ia eFilChk / • Filaaeat eheckiag Stetoß: aaiet reqaeßt íreß-rßqußßt coatrol íreß-eontrol cheekiag checked iret-track ßecoad-track caaeelled caacellatioa dolayod P OGIAB Local: aat • ail ia < ail > 0 Aat rtß • ail ia < ail > 0 read aeoa «all ia. { ail} 0 Reseagß back * ail ia. { ail > U ßBack ßatr X ail ia. { nil } 0 sEatraace • Zlt s nil ia. { ail} 0 ßExit oter s nil ia. { ail} 0 eOverlap laßt s nil ia. { ail} 0 ßLaßt aodß to Al ia eKode ezßig * led ia oEzSig ßigchk * Network ia eSigChk filchk s TI5a ia eFilChk pate &ka 01 ia ePatChk trßchi X OX ia eTrßCak ítrechk s OX ia eTrßCak • trccii 3 OX ia eTrßCak rteehh s RtßChklait ia e? teChk FOE EVE1T STATt: recsipt: iApp [Dp 3 (rtß, trßchk) ßondiag: oipp [Da 3 (rte, trßchk) reeipt: iipp [Da 3 (rtß, trecha) ßeadiag: oipp [Op 3 (rte, trßchk) receipt: ileq [Op 3 (ezit) condition: ezit aot ia ßLaßt ezec: add (ezit.Ezit) • endiag: oleq [Da 3 (ezit) recei.pt: ileq [Op 3 (over) coaditioa: over aot ia ßLaßt oxee: add (ovßr.Ovßr) eeadiag: oleq [Da 3 (ovar) receipt: ilo *) [Dp 3 (laßt) oxee: adi (laßt.Laat) back «get.back (laat) śsadiag: oloq Cback3 (last ) receipt: iCtrl [Op 3 (exit, rtechk) coaditloa: ezlt aot ia ßLaßt ezlt La Bzit oxee: rtechk. exßlg • KxSlg śsadiag: oCtrl [Da 3 (ßzit, rtechk) receipt: iCtrl COp 3 (or »ßr, rtßcal) coaditioa: over to the eLaet over ia Over ßendiag: oCtrl [Da 3 (over, rtechk) recsipt: iCtrl [ Op 3 (laßt techk) conditioa: laßt ia Laßt laßt ia ßtxit • zec: baek * get.baek (laßt) rtechk. ezßig • ExSig sen iag: oCtrl [back) (laßt, rtßehk) receipt: iCtrl [Op (laßt, rtechk) conditioa: laßt ia Laßt laßt aot ia ßExit • zec: back * get.back (laßt) ßend ag: oCtrl [ baek3 (last, rtacak) receipt: iChk [Op (ßxit, rtechk) condit o: exit aot ia ß Laßt ezit ia Ixit ezec: rtechk. ezßlg «ExSig ßen i-Og: oChk [Da 3 (exit. rtechk) receipt: iChk [Op 3 (over, rtechk) coad tioa: over a ia ß Laßt over ia Over ßendiag: oChk [Da 3 (over, rtechk) receipt : iChk [Op (laßt, rtechk) conditioa: laßt ia Laßt laßt ia ßtzit ezec: back • get.back (laat) rtechk. exßig • ExSig śsadiag: oChk [backXlaat.rtocak) roceipt: iCak [Op 3 (last, rtechk) coadi loa: laat ia Laat laat aot ia Exit oxee: back * get.back (last) ßsadiag: oChk [back3 (laßt. rtechk) recoipt: iFroß '[Op 3 (exit) coaditioa: exit aot ia ßLaßt oxit ia bit oxee: ßab (ßxit.Bzit) ßeadiag: oFree CDa 3 (exit) receipt: iFroe [Op (over) conditioa: over aot xa ßLaßt over) reeeipt: iFree [Op 3 (laat) t ia Laßt •• nding: oFre recß p: iCoaí [Da 3 (aat, rte. • zit) condit o: • zit aot ia ß Laßt •• nding: oCoaf [Op 3 (aat, rte,, exit) receipt: iCoaf [Da 3 (ast.rtß, , ovßr) eoaditioa: over aia ßLaßt over ia Over • zec: • sb (over, over) • «ndiag: oCoaf COp 3 (aat, rto, ßvßr) rsca pt: iFree [Back] (rte) •• nding: oFree [Syß 3 (rte) ELSE STATE aaßet IIITIAL: Batr s ail reeeipt: iCak [Sig 3 (Batr, led.filchk) oxee: ExSig «lad SlgCak * lad FilChk > filchk recoipt: iChk [Sig (Eatr.ßigchh.filchk) eoaditioa: ßigehk! * lod exec: ExSig - led SigCak "ßigchk FilChk» filchk • eadiag: oCtrl [Slg (Batr.led) r «c« ipt: íleq [Syß 3 (ßatr) • z «e: Eatr * eatr trujen: reqseßt •• ndiag: oleq [Da 3 (Eatr) reeeipt: aoßß •• nding: oBad [Syß 3 (aeßß) STATE rßqueßt recaipt: iChk [Sig 3 (Eatr.led.filchk) • zec: ExSig > led SigChk * led FilCak »filchk reeeipt: iChk [Sig 3 (Eatr.ßigchk.Ilchk) coaditioa: ßigchk!» led • zec: EzSig > led SigChk • ßigchk FilChk «filchk • ead ag: oCtrl [Next 3 (£ atr.led) recaipt: iFree [Syß 3 (Eatr) traaßit: free-roquoßt receipt: iRodo [Sya] (Entr.ßodß) • zec: Rodo * aode ßeadiag: oHode [Syß 3 (Eatr.aodo) receipt: iCoaí [Da 3 (Batr) traaait: saßet ßeadiag: oCoai [Sya 3 (Xatr) receipt: ileq [Back3 (Eatr) traaait: coatrol ßeadiag: iAlloc [Syß (Eatr) oCtrl [Da 3 (latr, ltßCakIait) receipt: aeßß eeadiag: olad [Syß 3 (aeßß) STATE frßß-requeßt: rßcßipt: iChk (.Sig) (Eatr.led. ilchk) ezee: ExSig > Led SigChk > lod FilChk «filchk recsipt: iChk [Sig 3 (Eatr. ßigchl.filchk) conditioa: ßigchk! * led • zec: ExSig * led SigChk * ßigehk FilChk« filchk •• ndiag: oCtrl [Sig 3 (Eatr.led) recßipt: iCoaf [Da] (ant.rtß, Eatr) traaßit: saßet ßeadiag: oFreo [Sys 3 (Batr) receipt: ileq [Back] (Eatr) traasit: saßet •• n mg: oFree CDa 3 (Eatr) receipt: aeßß eeadiag: oBad [Syß 3 (asee) STATX coatrol: receipt: iChl [Sig 3 (Eatr.le .íilchk) ezec: ExSig > lod SigChk • led FilCak * fllcak receipt: iChh [Next 3 (Batr.ßigchk.filchk) coaditloa: ßigchk! • lad ezec: EzSig > lod SigChk - ßigchk FilCak • fllehk šisteadiag: © Ctrl [Sig 3 (Batr.lad) receipt: iFree [Syß 3 (Batr) traaalt: free-coatrol receipt: iHode [Syß K? atr.aode] • zee: Rodo * aode •• ndiag: oRode [Syß 3 (Eatr, Bodo) rocoipt: iCtrl [Baek3 (Eatr.rtßcak) eonditioa: rtechk. exßig «• ail traaßit: saßet •• nding: oFree [Da 3 (Eatr) r« ee pt: iCtr 1 [Back] (Eat rtachk) cond tion: rtechk. ezßig! «ail rtechk. patchk »» OX traaßit: cheekod ßand ag: oSet [Syß 3 (Eatr) oCtrl [Sig 3 (Led Eatr) r «ee pt: iCtrl [Back3 (Eatr. rtechk) condition: rtechk. ezßig! «ail •• ndiag: oCtrl Da 3 (Eatr, lteCakSait) rßccipt: aeßß •• a ag: olad [Syß 3 (aeßß) STATE freß-eontrol: racßipt: iChk [Next 3 (Eatr, led.filehk) • zee: ExSig * led SigCak * led FilCak • filchk recoipt: i Chk [Next 3 (Eatr. ßigchk. Filchk) coaditioa: ßigchk! «Lad oxee: ExSig * led SigCak • ßigchk FilCak > filchk • eadiag: oCtrl [Sig 3 (Eatr, led) receipt: i Ctrl [Baek3 (Eatr, rtßchk) traaait: saaet •• ndiag: oFroe Cfia 3 (Eatr) receipt: aeoß •• ndiag: oled [Syß 3 (aeßß) STATE chßexßd: raca pt: i Chk [Sig 3 (Eatr, led, filcak) • Z * c: ExSig * led SigChk * led FilChk • filchk traaßit: checkiag •• nding: oChk [Da 3 (Eatr, lteChkIait) r «c«? Pt: iChk [Sig 3 (Eatr. ßigchk. Filchk) cond tioa : • gchk! «Led • Z« c: EzSig «TICa SigChk * ßigchk FilChk * filchk trt-üiit: checkiag i endiag: oChk [Da 3 (Eat. It eChkXait) rßee pt: iFree [Syß Hiatr) traaß t: caacellatioa •• nding: oCtrl [Sig 3 (Satr.led) oipp [Op Eatr.AppTrßOX) racaipt: Hoae [Syß 3 (Eatr.aode) •• nd ng: oHode [ Syß 3 (Eatr, aode) reeeipt: BOßß •• ad af: oBad [Syß 3 (aeaß) STATX checkiag: receipt: iChk [Next] (Eatr.led.filchk) ezec: ExSig «led SigCak • led FilChk • filchk receipt: iChk [Slg 3 (Batr. ßigchk. Ilchk) coadltioa: ßigchk!« Lad ezec: ExSig * TIGa SigChk * ßigchk FilChk «filchk rßcaipt: iFree [Syß J (Eatr) traaßit: cαacelled •• nd ag: oCtrl [Next 3 (Eatr.led.}. Reeeipt: iHode [Syß] (Eatr.Bodß) • zee: Rode * aode •• nding: oHode [Syß (Eatr. Aode) reeßipt: Chk [Back3 (Eatr.ltaChkOKTlGa) conditioa: FilChk «» TI traaß t: eheeked •• nding: oCtrl [Next] (Eatr, TI) rßeßipt: iChk [Back (Eatr.IteCakOXTlGa) condit o: FilChk '. * TI traaß t: ehßcked • eadiag: oCtrl [Sig 3 (Eatr.Ga) reeeipt: iChk [Back] (Eatr.lteCakOX? Ed) condition: SigChk »« ßa traaßit: ehackod taadiag: oCtrl [Sig] (Ent r, led ) r «c * ipt: iChk [Back) (Eatr .lteChkOXled) conditioa: SigChk!« Ga traaßit: chaeked •• nding: oCtrl [Sig 3 (Eatr.Tl) receipt: Chk [Back] (Eatr. rtßehk) eoaditioa : rtechk! * IteChkOZTlGa rtechk! > IteCakOSBod rteehk .: ftrc * • OB traaalt: chockod ßeadiag: oCtrl [Next (Led battery) receipt: IChk [Back] (Eatr. Rtechk) eoaditioa: rtechk. ftrc «* IQX Rodo» »Al traaßit: firßt.track • eadiag: oCtrl [Sig 3 (Eatr. receipt: aeßß ßeadiag: olad [Sys 3 (B0ße) STATE firßt.track: rßeßipt: iChk [Sig 3 (Eatr, led, filchk) • zec: EzSig * led SigChk > Led FilChk > filchk tanding: oChk [Da] (Eatr.ltßChklnit) rßc.ipt: iChk [Sig 3 (Eatr, ßigchk.filchk) cond t on: ßigchk! * led • z «e: ExSig» led SigChk = ßigchk FilChk > filchk •• nding: oCtrl [Next] (Eatr, lod) receipt: ilolease [Syß 3 (Eatr) traaß t: saßet •• ndag: oFree [Da 3 (Eatr) receipt: iFree [Syß] (Eatr) reeeipt: iChk [Back] (Eatr, rteehk) conditioa: rtechk. (ftre.ßtrc) «« (I0X.I0K) traaßit: ßecoad.traek •• nding: oChk [Da] (Eatr.lteChklait) r «c *? t: iChk [Baek] (Eatr.rteehk) condition: rtßehk. (ftrc.ßtrc)! »(IOX.I0X) • endiag: oChk [Da] (Eatr.lteChkSait) receipt: aeßß ßeadiag: oled [Sya 3 (asea) STATE ßecoad.track: roceipt: IChk CSíg 3 (Eatr.led.filchk) oxee: ExSig * led SigChk • led FilChk * filchk receipt: iChk [Next] (Eatr.ßigchk.file conditioa: ßigchk! »Led ezec: ExSig >Led SigChk * ßigchk FilChk * filchk •• nding: oCtrl [Next] (Eatr.led) receipt: ileleaße [Syß 3 (Eatr) traaß t: saßet •• nding: oFree [Da 3 (Eatr) rßeßipt: iFrßß [Syß 3 (Eatr) raceipt: iChk [Back] (Eatr. techk) conditioa: rtßehk. (ftre.ßtrc) * • (0X.10X) traaß t: naßet • andiag: oFree [Da] (tatr) r «ceipt: i hk [Back3 (Eatr, rtechk) coaditioa: rtechk. (ftre.ßtrc)! • (OX.IOX) •• ndiag: oChk [Da] (Eatr.ltßChklait) reeeipt: aaaß •• nda-ng: oBad [Syß] (Beeß) STATE caaeelled: recaipt: i Chk [Sig 3 (Eatr. Lod.filchk) azec: EzSig * led SigChk * led FilChk • filchk receipt: iChk [Next] (Eatr. ßigchk, íilcak) coadi loa: aigcak! • lad oxee: ExSlg • lad SigChk - ßigchk FilChk - filchk ßeadiag: oCtrl [Sig 3 (Eatr, led) reeeipt: i Chk [Baek3 (Eatr.rtochk) traaait: caacellatioa ßeadiag: oApp [Op) (tr, AppTrßaX) receipt: aeßß ßeadiag: oBad [Syß 3 (aeaa) STATE eueellatioa: reeipt: iChk [Sig 3 (Eatr.led.filchk) ezec: EzSig «led SigChk to led F lChk to fllchk reeßipt- iChk [Next (Eatr.ßigchk. filchk) condition: ugehk • «led • zec: EzSig a lod SigChk to ßigchk FilChk filchk • ane-ng: oCtrl [Sig 3 (Eatr, led) rßcßipt: iipp COp 3 (Eatr.AppTrßOB) conditioa: SigChk »« led traaß t: aaaet • eadiag: oFrßß [Da 3 (Eatr) raceipt: ilpp COp 3 (aatr.AppTrßOE) coadit o: SigChk! * led • endiag: or App [Op 3 (Eatr.AppTrßOE) r «ce pt: iApp [Op 3 (Eatr.AppTrßI0X) condit o: SigCak« »led tr & aßit: delayed •• nding: oOa [Aunt] (Eatr got.ti * ß (Eatr)) receipt: iApp COp 3 (Batr, AppTrßIOE) coaditioa: SigCak! > lad • ead ag: oApp COp 3 (-atr.AppTrß0) receipt: aeeß ßeadiag: oBad [Syß 3 (aeßß) STATE delayed: receipt: iCak CSig 3 (Batr.led.filchk) oxee: ExSlf "l * d SigCak • lad FilCak" filchk rßeßipt: iChk [Sig] (Eatr. ßigchk. Filchk) condit o: • gehk < s Rad • z * c: EzSig to Xed SigChk to ßlgChk FilChk to filchk • eadiag: oCtrl [Sig 3 (Eatr.led) receipt: iOst [Aunt 3 (Eatr) trineit: snßßt •• nding: oFree [DB 3 (Eatr) reeeipt: aeßß •• adiag: oBad [Syß 3 (aeßß) EID PX0G1AJI ACTCRATOI BlkßßvLog ::::::: tl »? L? P? U Aot / • Global aat of astoaata Xoate / • Global ßet of rosteß Haßsage / • Global ßet of aeßßagaß • App / • Local ßet of rosteß • B-oez / • Local ßet of roßtoß • Firßt / • Local ßet ef rostee • Sßcond / • Local ßet of rostes • Berth / • Local ßot of rosteß ßOvßrlap / • Local ßet of rosteß • Laßt / • Local ßet of rosteß • Buífer / • Local ßet of rostes • Back / • Local ßet of rosteß Conßtaatß: Dev- / • Device Sy. / • Sigaalaaa ßyßtt Op / • Opßtreaa Da / • Dotaßtrßßa Inpst H «* ßageß: iChk [Dev] (roste, evchk.trßchk) / • Device checkiag ileleaßee [Syß 3 (roste) / • leste reread! Varniag iApp [Op] (roste, trßchk) / • Approach iloq COp 3 (roste) / • lóate reqseßt iCtrl [Op 3 (roatß, rtßchk) / • lóate coatrol iChk (Op 3 (reato, rtechk) / • leste checkiag iFree [Op 3 (roste) / • caacellatioa iApp [Da 3 (roste, rßchk) / e Approach iCoaí CDa 3 (ast, roste, rosto) / • lóate eoaflict Ostpst Reßßagea: oCtrl CDev] (roste.dßvctrl) / • Devicß cobatrol oBad CSyß] (»•••) / • Bad aeßsage oApp [Up] (roste, trßchk) / • Approach oConf Cüp] (aut, roste, roste) / • leste coaflict oApp [Da] (rottte, trßchk) / • Approach oXeq [Da 3 (roste) / • Go back reqsßßt oCtrl [Da (roste, rtechk) / • leste coatrol oChk [Da] (rotte, rtoehk) / • checkat oFree [Da] (roste) / • leste relßaßß oXeq [baek (roste) / • leste reqseßt oCtrl [bac k] (roste, rtechk) / • leste coatrol oChk [back3 (roste, rtechk) / • leste checkiag oFreß [bac k] (roste) / • leste relßaße Ennaerate oDßvCtrl * (leßt.Pera) / • Devico ceatrol • DavChk « { OX.IOX.}. / • Device checkiag • ExSig. { ail.led.TlGa} / • Exit ßigaal • PatChk. { OK.IOK } / • Poatß checkiag • TriChk. { OX.IOX} / • Track ßectioa checkiag EzSig Pat BlkTrß FßtTrc SecTrc •? T »Chk * eEzS g z ePatChk z« TrßChk z eTrßChk x eTrßChk Fsact oaß: ßet. rtechk (rte, rtechk) ia elChk / • check out aaaager get.rteehk (roat) ia elteChk / • checkat aaaager get.back (roste) ia ßlack / • Back aaaager Coaßtaat valsa: AppTrßOX «OE ia eTrßChk / • Approach chßckiag AppTrßlQX to BOX ia eTrßChk / • Approach checkiag State valsee: Blk «or iacladed i) dock / • ideate ide Over ». { > iiaaeellssddeedd iia eOverlap / • ideate Laßt - or iacladed i. ? »T / • late ideatifiar leqseßt«. { > / • Set of roatea Coatrol «o / • Set of rosette Coatrollad a. { } / • Sßt ef rosteß Caßckiag a. { } / • Set of rostes Cb «ck« d a. { } / • Set of roste? «L« to »« «(.}. / • Set of rosteß DevChk to I0X ia eDevCak / • Deviee checkiag TrßChk I0X ia eTrßChk / • Track ßectioa checkiag Stateß: aaßet control controlled chßckiag chacked reltase P10G1AI BU •. { > Oaßßt »ßSlock 0 ßOvorlap Xeqseet •. { } Control • . { ) Controlled •. { ) Checking •. { ) Chßcked > • { )? elaeße < • { } OevChk < . tai TrßChk > > I0X Local: aat • > ail ia. { ail} 0 Aat rte i > ail ia. { ail} 0 late aeeß • ail ia. { ail} 0 Heßßage app «> ail ia. { ail} 0 aApp blk • > ail ia. { sil) 0 ßllock over 'ail ia. { ail) 0 ßOvßrlap laßt «ail ia. { ail} 0 ßLast back «ail ia. { ail} 0 ßBack patchk > OX ia ßPatChk cuts «OX ia eTrßCak ftrcchk« OX ia eTrßChk ßtrcehk * OX B eTrßChk FOX EVEXT STATE: receipt: iApp [Op 3 (rtß, AppTrßOX) condition: TrßChk «» ax ßending: oApp [Da 3 (rtß, AppTrsOX) rßsciptpt: iApp [Op 3 (rt, AppTrßOX) coadit o: TrßChk »» 101 •• ndmg: oApp [Da 3 (rte, AppTrslOX) receipt: iApp [Op 3 (rte.AppTrsI0X) •• ndag: oApp [Da 3 (rte.AppTrßIQI) receipt: iApp [Da] (rtß.AppTrßOX) coaditioa: TrßChk «QX εadiag: oApp [Op] (rtß.AppTrßOX) raetipt: iApp [Da] (rte.AppTrßOX) coaditioa: TrßChk« »BOX •• nding: oApp [ Give 3 (rtß.lppTrßlQX) ELSE STATE saset IIITIAL: receipt: iCbk [Dev) (rtß.dßvchk. Trßchk) oxee: DevChk * devehk TrßChk • trßchk «receipt: ileq COp 3 (blk) coaditioa: blk aot ia ßLaat oxee: add (blk.Blk) traaait: raqaeßt (blk) ßeadiag: oleq [Da 3 (blk) receipt: ileq [Op (over) coaditioa: over aot ia ßLaßt oxee: add (over, Ovar) traaait: roqseat (over) ηsadiag: oleq [Da (ovßr) recoipt : ileq COp 3 (laßt) •• nding: (] () reeeipt: aeßß •• ndiag: oBad [Syß] (aeßß) STATE rßqueßt (blk): receipt: iChk [Dßv) (blk. Evchk.trßchk) • zec: DevChk »dßvchk TrßChk • trßchk raeßipt: iCtrl [Op 3 (blk, rtechk) coadit o: DevChk «» QX • zec: • et.rtßchk (blk, rtechk) traaßit: control (blk) śsadia: oCtrl [Dßv) (blk.leßt) rßsc: iCtrl COp 3 (blk. Rtechk) conditioa: DevChk "BOX TrßChk * < I0X • z" c: • • t.rteehk (blk, rtechk) traaßit: coatrol (blk) • endiag: oCtrl [Dev] (blk.leet) reeeipt: iCtrl [Op 3 (blk. rtechk) coaditioa: DevChk • «I0X conditioa: TrßChk •» OX oxee: ßßt.rtßchk (blk.rtßchk) traasit: coatrol (blk) ßeadiag: oCtrl CDßv 3 (blk. receipt: iFree COp 3 (blk) oxee: • ab (blk.Blk) traaait: saßet (blk) ßeadiag: oFreß [Da) (blh) receipt: ICoaf CDa] (blk) oxee: ßab (blk.Blk) traaait: saßet (blk) eeadiag: oCoaf COp 3 (blk) rßcßipt: aeßß •• nding: oßad [Syß 3 (aeßß) STATE rßqueßt (over): r «c * ipt: iChk [Dev 3 (over, devchk.trßchk) • xße: DßvChk * devehk TrßChk • trßchk r «e« pt: íCtrl [Op) (over, rtechk) coad tioa: DevChk »» OX • zec: • et.rtechk (over, rtechk) traaßit: coatrol (over) •• ad ag: oCtrl [Dev 3 ( ever, leßt) rßeeipt: iCtrl [Op 3 (over, rtechk) conditioa: DevChk «» BOX TrßChk «BOX • Z« C: ßet. techk (over, rtechk) tranßit: eoatrol (over) •• nding: oCtrl [Dev 3 (over, leßt) r * c «ipt: iCtrl [Op 3 (over, rtechk) condition: DevChk« BOX conditioa: TrßChk «OX • z * c: ßßt. rtechk (over, rtechk) traaßit: coatrol (over) •• nding: oCtrl [Dev 3 (over, Pear) receipt: i-Free COp 3 (ovor) ezec: ßab (over, Over) traaßlt: saaßt (over) •• ndiag: oFree [Da 3 (over) receipt: iCoaf [Da 3 (over) ezec: ßab (over, Over) traaßit: sae (over) şesadiag: oCoaf COp (over) receipt: BOßß ßead ag: oBad [Syß 3 (aeßß) STATE rßqseßt (laßt): r «e« ipt: iChk [Dev] (laßt, ßvchk, trßchk) • z: DevChk * dßvchk TrßChk * trßchk reeeipt: ICtri Lup Jiießt.rteca * / condition: DevChk «« OX • zac: ßßt.rtßchkdaßt .rtachk) traaßit: coatrol (laßt) •• nd ag: oCtrl [Dev] (laat, leßt) rßeßipt: iCtrl [Op] (laßt, rtechk) coad t a: DevChk • «IOX TrßChk« »BOX ezec: ßet.rtechkdaßt.rtßcak) traaßit: coatrol (last) ßendiag: oCtrl [Dov] (laat, keßt) rßcßipt: iCtrl [Op 3 (laßt , rtechk) coaditioa: DßvChk »» BOX conditioa: TrßCak »» OX exec: ßet.rtechk (laat, rtechk) traaßit: control (laßt) • end ag: oCtrl [Dev 3 (laßt, Pear) aßt) traaßit: saßet (laßt) exec: back > get.back (laat) ßeadiag: oFrßß [baca] (laßt) receipt: iCoax CDa 3 (laßt) ezec: ßsb (laßt, Laßt) traaßit: saßet (laßt) ßoadiag: oCoaf COp 3 (laßt) receipt: aeßß ßeadlag: oBad [Syß 3 (aeßß) STATE control (blk): rßceipt: íChk [Dev] (blk, evchk.trßchk) eondit a: blk the ßF rßt • xac: DevChk * dßvchk TrßChk * trßchk rtßchk 'get .rtechk (blk) rt «chk. patchk * «dßvchk rtechk. blktrß ft * trßchk rtßehk.fßttrc * • trßchk traaß t: eoatrolled (blk) •• nding: oCtrl [Da] (blk, rtechk) receipt: iChk [Dev 3 (blk, evchk.trßchk) coad tioa: blk the ßSecoad • zec: DßvChk to devchk TrßChk «trßchk rtechk * get.rtochk (blk) rtechk. patchk * • devchk rtechk. blktrß ft «trßchk rtechk. ßadtre ft »trßchk traaßit: eoatrolled (blk) • eadiag: oCtrl CDa] (blk. rtßchk) receipt: a «ßß •• nding: oBad [Syß 3 (aeßß) STATE coatrol (ovar): receipt: hk [Dßv 3 (ovar, devchk, trßchk) • zec: DevChk * devchk TrßChk * trßchk rtechk «get.rtechk (over) rtechk. patchk ft "devchk traaßit: coatrolled (over) śsadiag: © Ctrl CDa (over. rtechk) receipt: ßoßß ßeadiag: © Bad [Sya 3 (aeeß) STATE coatrol (laat): receipt: i hk [Dev 3 (laßt, devchk, trßchk) conditioa: laßt ia Blk laßt ia ßBaffer aXac: DevChk • devchk TrßChk * trßehk rteehk * get.rtechk (laat) rtßchk. exßig * «led rtechk. patehk ft * devehk k tranßit: eoatrolled (laßt) • • ndmg: oCtrl [back] (laßt, rtßchk) r * c «? pt: iChk [Dev 3 (laßt, devehk, trßchk) cond thioa: laßt ia Blk laßt aot ia ßBsifer • z «c: DevChk * devchk TrßChk * trßchk rtechk * get.rtechkdaat) rtechk. patchk ft * devchk rtechk. blktrß ft * trßchk back * gßt.back (laat) traaßit: śsadiag: oCtrl Cback3 (lajt, rtechk) receipt: iChk CDov (laat, devcak, trseak) coad t: laßt aot ia Blk • xac: DßvChk * devchk TrßChk * trßchk rtechk * get.rtechk (laßt) rtechk. patehk ft * dßvchk traaait: •• nding: receipt: aeßß ßeadiag: oBad [Syß 3 (aeeß) STATE coatrolled (blk): receipt: iChk CDev 3 (blk, devchk, trßchk) exec: DevChk * devchk TrßChk • trßchk receipt: lCtrl [Op 3 (blk. rtechk) eoaditioa: DevChk * • OX ßßt.rtà © hkÃblk.rteehk) • zee: traaßit: control (blk) •• nding: oCtrl [Dßv) (blk.lßßt) rßeeipt: iCtrl [Op 3 (blk. rtechk) eonditioa: DßvChk * »IOX TrßChk ** IOX ßßt.rtßchkíbU, rtßchk) • zec: traaßit: coatrol (blk) •• a iag: oCtrl CDßv 3 (blk.lßßt) r «c ipt: iCtrl COp 3 (blk. rtßchk) conditioa: DßvChk ** XOX TrßChk ** OX • zec: •• t.rtechk (blk. rtßchk) traaßit: control (blk) •• adiag: oCtrl CDßv (blk, Pear) reeßipt: iChk COp 3 (blk.rtßchk) ßet.rtechk (blk.rtßchk) ßzec: traaßit: checkiag (blk) ßeadiag: oCtrl CDev 3 (blk.leßt) receipt: BOßß ßeadiag: oBad [Sys 3 (aeßß) STATE coatrolled (ovßr): receipt: iChk CDßv] (ovßr.dßvchk.trßchk) exec: DevChk * devchk TrßChk * trßchk receipt: iCtrl COp 3 (o-ßr.rtßcah) coaditioa: DevChk •• OX exec: •• t.rtechk (over, rtechk) traaßit: eoatrol (over) aßndiag: oCtrl COav 3 (ß »ßr.leßt) receipt: iCtrl [Op 3 (ovßr, rtßchk) conditioa: Da Chk «BOX TrßChk ** BOX • xee: • ßt.rtßehk (over. rtechk) tratit: coatrel (over) • and ing: oCtrl [Dev] (ovßr, Xßßt) rßeßipt: iCtrl [Op 3 (ovor, rtechk) coaditioa: DßvChk »« BOX TrßChk ** OX azec: ß «t.rtechk (over. rtechk) traaßit: coatrol (over) •• nding: oCtrl CDßv 3 (over, Pera ) receipt: iChk [Op] (ovßr, rtßchk) • zec: ßßt.rtechk (over, rtechk) traaßit: checkiag (over) здесь: Ctrl [Dßv 3 (over, leßt) receipt: iFreß COp 3 (over) exec: ßsb (ever.Over) traaßit: ueßet (over) •• adiag: oFrße [DB 3 (over) rßceipt: Bßßß •• nding: oBad [Syß 3 (aeßß) STATE coatrollßd (laßt): receipt: iChk CDßv) (last, dßvchk.trßehk) exec: DevChk * devchk TrßChk * trßchk recoipt: iCtrl [Op) (laet. rtßchk) coaditioa: DßvChk • * OX exec: • ßt.rtßchk (laßt.rtßcak) traasit: coatrol (laßt) eeadiaf: © Ctrl CDev 3 (laa .laßt) receipt: iCtrl COp 3 (laßt, rtechk) coaditioa: DevChk * • BOX TrßChk ** BOX exec: ßßt.rtßchk (laßt.rtßcak) traaait: costrol (laßt) sßadiag: oCtrl [Dev] (laßt, leßt) rßeßipt: iCtrl COp 3 (laßt, rtechk) conditioa: DevChk * • BOX TrßChk • * OX ßzee: ßßt.rtechk (laßt, rtechk) traaßit: coatrol (laßt) •• nding: oCtrl CDßv 3 (laßt, Pera) receipt: iChk COp] (laßt, rtßchk) ßzße: ßet.rtochkOaet, techk) traaß t: coatrol (laßt) ßßndiag: oCtrl [Dßv 3 (laßt.lßßt) rßcßipt: iFreo [Op 3 (laßt) ßzße: traaßit: saaet (laat) • endiag: oFrßese [back] (laßt) recßipt: Bßßß • ßnd ag: oBad [Syß 3 (aßßß) STATE cheek ag (blk): receipt: i Chk CDev] (blk, devchk. Trßchk) eonditioa: blk ia ßFirßt ezec: DevChk * devchk TrßChk * trßchk rtechk * get.rteehk (blk) rtechk. atchk ft * devchk rtechk. blktrß ft * trßchk rtechk. fottrc ft * trßchk traaait: chßcked (blh) śsadiag: © Chk CDa) (blk. rtßchk) roceipt: iCak CDev) (blk, ßvchk. rßchk) coaditioa: blk ia ß Secoad exec: DevChk "devchk TrßChk * trßchk rtechk • get. rtechk (blk) rtechk.patehk ft * devchk rtechk.blktrß ft * trseak rtßehk.ßadtrc ft * trßchk tranßit: Chßekßd (blk) •• ßding: © Chk [Da 3 (blk, rtßchk) rßeßipt: aßßß •• ndiag: oBad [Syß 3 (aeßß) STATE eaeckiag (over): r «e« pt: iChk CDßv] (ovßr, dßvchk. Trschk) • tac: DevChk * devehk TrßChk * trßchk rtßchk • get.rtechk (over) rtßchk. patchk ft * devchk traaslt: chacked (over) • eadiag: oChk [Da 3 (or »ßr, rtßchk) rßeß pt: aeßß STATt chßck? Ag (laßt): reeß pt: iChk [Dev] (laßt.dßvchk. Trßchk) coadltloa: laßt ia Blk laßt ia ßBsffer osee: DevChk * devehk TrßChk * trßchk rtechk * gßt.rtßchk (laßt) rtßchk. ezßig í «led rtechk. patchk ft * devchk rtechk. blktrß ft * trßchk traaßlt: śsadiag: rßcelpt: iChk CDev 3 (laat, devchk. trßchk) coadi loa: laßt ia Blk laßt aot ia ßBsffer ezec: DßvChk * devchk TrßChk * trßchk rtechk • get.rteehk (laat) rtechk. patchk ft * dßvchk rtechk. blktrß ft * trßchk traaait: •• nding: oChk [back] (laßt, rtßchk) racß pt: iChk [Dßv 3 (laßt, devchk, rßchk) conditioa: laßt aot the Blk ßzec: DevChk * devchk TrßChk * trßchk rteehk * get .rtechk (laßt) rtßchk. atehk ft * dßvchk back * gßt.baek (laßt) traaß t: •• nding: oChk [back] (laßt, rtßchk) raeßipt: aeßß ßßndiag: oBad [Syß 3 (aßßß) STATE chßcked (blk): receipt: i hk CDev 3 (blk, devehk, trßchk) ßzec: DßvChk * devehk TrßChk * trßchk. raeßipt: iChk COp 3 (blk. rtechk) • zec. ßet. rtechk (blk, rtßchk) traaeif check? ag (blk) ßßnding- oCtrl CDev 3 (blk, leßt) rsceipt: iFreo COp 3 (blk) coadi ioa: blk ia traaßit alert: rßleeßß (blh) ßeadiag: iae (blk)) roceipt: iFrßß COp] (blk) coaditioa: blk aot ia ßBerth traaßit: rßlßaßß (blk) ßeadiag: © Ctrl [Dßv] (blk.leet) receipt: aeea ßeadiag: oBad [Syß 3 (aeßß) STATE caßekßd (ovßr): rßeaipt: iChk CDev] (over, ßvchk, rßchk) • zec: DevChk * devehk TrßChk * trßchk rßceipt: íChk [Op 3 (over, rtechk) • xßc: • et.rtechk (ever, rtßchk) trat t: chßckiag (over) •• adiag: oCtrl [Dßv) (evßr.leßt) rßeaipt: ßßßß •• adu-g: oBad [Syß] (aeßß) STATE ehßeked (laßt): rßceipt: iChk CDev) (laßt, evchk, trßchk) • zec: DßvChk * dßvchk TrßChk • trßehk receipt: iCak COp 3 (laat.rtecak) exoc: ßßt.rtßchkClaßt, rtßchk) traaalt: eheckiag (laßt) æsadag: © Ctrl Dos Hlßßt.lßßt) receipt: iFree COp) (laat) coadltloa: laat ia ßllock traaeit: releaßee (laßt) ßesadiag: oCtrl CDev 3 (laat, laßt) receipt: iFreß COp 3 (laat) coaeUtloa: laat ia aOverlap exec: ßsb (laßt.Laßt) baek * gßt.back (laßt) traaßit: ßaadiag: oFree Cback) (last) •• adiag: oBad [Syß 3 (ßßßß) STATE relßaßß (blk): rssceipt: i hk CDev 3 (blk, devchk, trßchk) eoaditioa: trßchk ** BOX • zec: DevChk * devchk TrßChk * trßchk traaßit: release (blk) • ßndiag: oCtrl CDev] (blk.leet ) r «csipt: iChk CDev 3 (blk, devchk.trßehk) eondit or: trßchk ** OX • zec: DevChk • devehk chk traaßit: saaßt (blk) ßeadiag: oPrße CDa 3 (blk) reeeipt: iOst [Tia 3 (blk) ezßc: ßsb (blk.Blk) traaßit: saeet (blk) ßßndiag: oFrße CDa 3 (blk) receipt: ileleaaeCSyß (blk) ezec: ßßb (blk.llk) traaßit: saßet (blk) ßßadiag: oPrßa CDa] (blk) receipt: aeßß ßeadiag: elad [Syß 3 (aeßß) STATE rßlßaßß (laßt): receipt: iChk CDa * 3 (last.devchk. Rßchk) coaditioa: trßchk •• IOX exec: DevChk * devchk TrßChk * trßchk traaalt: release (laat) ißadiag: oCtrl CDev] (last, Íest) rßess : iChk [Dev 3 (laßt, dßvchk, trßchk) conditioa: trßchk ** OX • z «e: DevChk * devchk k traaßit: saßßt (laßt) ißadiag: oFroe [Da 3 (laßt) rßcßipt: ikeleaßeCSyß 3 (laßt) back «get.back (laßt) tranßit: sßadiag: oFree [back3 (laßt) rßcßipt: aßaß •• ndiag: oBad [Syß 3 (aßßß) EXD PROClAIt
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR9512026 | 1995-10-13 | ||
FR9512026A FR2739824B1 (en) | 1995-10-13 | 1995-10-13 | RAIL INTERLOCKING SYSTEM WITH SOFTWARE ARCHITECTURE AND ITS IMPLEMENTATION METHOD |
Publications (2)
Publication Number | Publication Date |
---|---|
MXPA96004771A true MXPA96004771A (en) | 1997-08-01 |
MX9604771A MX9604771A (en) | 1997-08-30 |
Family
ID=9483497
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
MX9604771A MX9604771A (en) | 1995-10-13 | 1996-10-11 | Railroad interlocking or clutching system with logical architecture, and implementation process therefor. |
Country Status (12)
Country | Link |
---|---|
EP (1) | EP0773155A1 (en) |
JP (1) | JPH09123912A (en) |
KR (1) | KR970020825A (en) |
CN (1) | CN1158803A (en) |
AU (1) | AU6815596A (en) |
BR (1) | BR9605136A (en) |
CA (1) | CA2187817A1 (en) |
FR (1) | FR2739824B1 (en) |
MX (1) | MX9604771A (en) |
NO (1) | NO964327L (en) |
TW (1) | TW381198B (en) |
ZA (1) | ZA968654B (en) |
Families Citing this family (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE19725320A1 (en) * | 1997-06-10 | 1998-12-17 | Siemens Ag | Device for controlling level crossings |
EP1109709B1 (en) * | 1998-08-19 | 2002-11-27 | Siemens Schweiz AG | Method and device for controlling a traffic installation |
FR2826921B1 (en) * | 2001-07-05 | 2004-07-09 | Cit Alcatel | METHOD FOR TRAINING AND MANAGING ROUTES AND NETWORK IMPLEMENTING SUCH A METHOD |
ITSV20020056A1 (en) * | 2002-11-14 | 2004-05-15 | Alstom Transp Spa | DEVICE AND METHOD OF VERIFICATION OF LOGIC SOFTWARE MOTORS TO COMMAND RAILWAY SYSTEMS, IN PARTICULAR OF STATION SYSTEMS |
US9003039B2 (en) * | 2012-11-29 | 2015-04-07 | Thales Canada Inc. | Method and apparatus of resource allocation or resource release |
WO2015101610A1 (en) * | 2013-12-30 | 2015-07-09 | Ineo Urban Transportation Solutions | Computerised method and device for interlocking a railway route |
EP3258400A1 (en) | 2016-06-14 | 2017-12-20 | ALSTOM Transport Technologies | Method and designing system for designing an interlocking control system |
CN114030511B (en) * | 2021-12-22 | 2022-09-13 | 北京交通大学 | Train dispatching operation danger prediction method and system based on operation verification |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR1350263A (en) * | 1963-03-01 | 1964-01-24 | Ericsson Telefon Ab L M | Signal transmission arrangement |
FR1408405A (en) * | 1964-07-10 | 1965-08-13 | Ericsson Telefon Ab L M | Arrangement for finding a route on a railway installation |
DE3232308C2 (en) * | 1982-08-31 | 1984-10-31 | Standard Elektrik Lorenz Ag, 7000 Stuttgart | Device for the decentralized selection of routes in a track plan signal box |
DE3922620C1 (en) * | 1989-07-10 | 1991-02-28 | Ivv Ingenieurgesellschaft Fuer Verkehrsplanung Und Verkehrssicherung Gmbh, 3300 Braunschweig, De | |
DE4406924A1 (en) * | 1994-02-28 | 1995-08-31 | Siemens Ag | Method for the synchronized operation of a distributed data processing system consisting of several computers and device for applying the method |
-
1995
- 1995-10-13 FR FR9512026A patent/FR2739824B1/en not_active Expired - Fee Related
-
1996
- 1996-10-07 EP EP96402126A patent/EP0773155A1/en not_active Withdrawn
- 1996-10-11 CN CN96119279A patent/CN1158803A/en active Pending
- 1996-10-11 MX MX9604771A patent/MX9604771A/en unknown
- 1996-10-11 CA CA002187817A patent/CA2187817A1/en not_active Abandoned
- 1996-10-11 NO NO964327A patent/NO964327L/en unknown
- 1996-10-14 KR KR1019960045645A patent/KR970020825A/en not_active Application Discontinuation
- 1996-10-14 AU AU68155/96A patent/AU6815596A/en not_active Abandoned
- 1996-10-14 BR BR9605136A patent/BR9605136A/en active Search and Examination
- 1996-10-14 JP JP8271214A patent/JPH09123912A/en active Pending
- 1996-10-14 ZA ZA968654A patent/ZA968654B/en unknown
- 1996-10-29 TW TW085113171A patent/TW381198B/en active
Similar Documents
Publication | Publication Date | Title |
---|---|---|
MXPA96004771A (en) | Locking system or rail clutch with logical architecture and its implementation procedure | |
CA1279396C (en) | Communicating vital control signals | |
US20130344802A1 (en) | System and method for multi-tier automatic transit system updating | |
EP0552794A2 (en) | Efficient and reliable large-amount data transmission method and system | |
FR2475770A1 (en) | METHOD AND SYSTEM FOR COMMUNICATING CONTROL INFORMATION THROUGH A COMMON LINE OF SIGNAL TRANSMISSION | |
EP1233573A3 (en) | Network management system | |
US3539924A (en) | Zoned mobile radio telephone system | |
CN106921591A (en) | Key business burst processing method in a kind of airborne avionics network | |
CN106394615A (en) | Distributed type station train number tracing logical method | |
US5381410A (en) | Transit switch for an asynchronous network, notably an ATM network | |
CN106455075A (en) | Communication method and system during train crossing | |
EP0761054A1 (en) | Method for preventing circular routing in a telecommunication network | |
ZA835847B (en) | Automatic railway control system | |
CA1273679A (en) | Telesignalling method and device for a bidirectional digital transmission link | |
JPH09123912A (en) | Software architecture type railway locking system and execution method thereof | |
JP2001151114A (en) | Railroad operation management system | |
FR2463561A1 (en) | METHOD AND TIME SWITCHING CIRCUIT FOR TELECOMMUNICATIONS NETWORK | |
EP0582418A2 (en) | Signalling network management | |
US20040023648A1 (en) | Satellite telecommunication method and system and terminal therefor | |
US2474438A (en) | Communication and posting system | |
AU2021103317A4 (en) | A system for blockchain linked internet of things-based railway digital display reader | |
DE59506422D1 (en) | INFLUENCING DEVICE | |
JPH11275003A (en) | Method for sure conducting of communication between two mobile objects and its related transmitter | |
FI63901C (en) | ANORDINATION FOR INFORMATIONSOEVERFOERING MELLAN EN STYRCENTRAL OCH SPAORBUNDNA FAERDMEDEL | |
CA2039059C (en) | Communication network node |