Abstract:
The invention relates to a decision procedure in combinational logic which requires a computing time of n for determining the congestion of a railway track system. The railway track system supports n trains, each with a route length of m itineraries. Prior to setting a requested route segment for a given train, a query is performed to check train positions and whether the given train is allowed to travel on the track sectors to be used for the requested route segment, without causing a possibility that the track system may become congested. The processing steps can be reduced. a) verification of whether a train can reach the next immediate track sector of a route; b) verification for a two-train variation whether a reference position of the first train prevents the second train from traveling on its route; c) new dependencies are created using transitivity and for combinations of two trains, a verification is made whether a cogent sequence exists. Step c) is iterated until no new dependencies occur or no train can reach its destination.

Description:
CROSS-REFERENCE TO RELATED APPLICATION  
       [0001]    This application is a continuation of copending International Application No. PCT/EP01/01476, filed Feb. 10, 2001, which designated the United States and which was not published in English. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    Field of the Invention  
           [0003]    The present invention lies in the field of railborne track vehicle management. More specifically, the invention relates to a method and a system for preventing the overfilling of a track system which is divided into track sectors and which is modeled in a route level with routes and a signal tower level with route segments. The levels are connected in order to request the setting of a route segment and to signal train positions, and a train position is determined by a train identifier, which identifies a train, and a track sector.  
           [0004]    The expedient and reliable setting up and release of route segments for track-bound vehicles, referred to below as trains, are brought about by train services using operative methods. The selection of the track for the formation of route segments is affected by real operating conditions in a variety of ways. Examples of this are: operational effects, the composition of trains and in particular their length, the failure of track sectors due to defects.  
           [0005]    The safety devices, referred to below as signal towers, which are used in the setting-up process ensure that only route segments that cannot lead to the traveling trains being put at risk are set up. However, the signal towers do not prevent route segments being set up which can impede or block trains from traveling onward. In such a case the track system is overfilled. Overfilling can be eliminated only by moving a train in reverse. This gives rise to time-consuming maneuvers with corresponding undesirable consequences for the timetable and the commercial operations.  
           [0006]    In modern operative operational control centers, powerful control systems are increasingly performing routine control operations of the train service. In a control system, a unique train identifier that is used once throughout the timetable and an associated individual route through the track system are programmed for each traveling train, the train identifier usually being recorded as a train number. The train control system detects, as part of the control system, the respective position of the train and automatically sets up the next route segment for the onward travel of the respective train. The stimulus for the setting up of the route segment is given by the traveling train itself. Its position is continuously registered in the control system. In this way, the sequence of the route segments that are set up is directly dependent on the current trains journey. When there are unfavorable chronological conditions, the setting up of routes can lead to blocking owing to overfilling. So that the advantages of automatic train control can be utilized in all situations, the train control system must be able to foresee possible blockages and not set up the corresponding route segments, or set them up after a delay.  
           [0007]    Before a route segment is set up, i.e. before a setup request is output to a signal tower, the train control system must check the effects in terms of overfilling of the track system. FIG. 1 illustrates a route level I: a view of the train control system; and a switchgear level or signal tower level II: view of the signal tower equipment. So that the route segments continue to be set up in good time, it must be possible to make the decision about the reliability of a route segment without delay.  
           [0008]    A decision method which has a simple combinatory logic and which simulates the possible sequences of the train journeys requires a very large number of working steps. The trains and the track topology have to be taken into account completely in such a method.  
           [0009]    Given n trains with a route length of m route segments each, a computational expenditure of the order of magnitude of n m×n  process steps is necessary.  
         SUMMARY OF THE INVENTION  
         [0010]    It is accordingly an object of the invention to provide a congestion prevention system and method, which overcome the above-mentioned disadvantages of the heretofore-known devices and methods of this general type and which provides a method which detects, with a smaller degree of computational expenditure, possible congestion, i.e., overfilling, before route segments are securely set up in terms of signaling equipment.  
           [0011]    With the foregoing and other objects in view there is provided, in accordance with the invention, and in the context of a track system organized with track sectors and having a route level with routes and a switchgear level with route segments, the route level and the switchgear level being coupled for requesting a setting of a route segment and to signal train positions, a congestion prevention method for preventing an overfilling of the track system. The novel method comprises the following steps:  
           [0012]    defining train positions of trains on the track system with a train identifier and a track sector; and  
           [0013]    prior to setting a requested route segment for a given train, querying the route level to determine, by checking train positions, whether the given train is allowed to travel on the track sectors to be used for the requested route segment, without the track system becoming congested.  
           [0014]    The method according to the invention has the following advantages, inter alia:  
           [0015]    In the track system which is to be protected against overfilling, the automatic setting up of route segments is permitted only if the track system is not overfilled as a result, i.e. all the trains can reach their programmed destination.  
           [0016]    The method according to the invention indirectly contributes to the safety of the railway traffic in that unusual maneuvers for disentangling trains are avoided.  
           [0017]    The small number of working steps required to assess the situation permits the use of the method in control systems in a relatively large track system to be protected without disadvantageous effects on the prompt setting up of the route segments.  
           [0018]    In accordance with an added feature of the invention, the step of checking a train position comprises the following substeps, to be performed in the route level:  
           [0019]    a) storing a first dependency according to which a new train position cannot be reached until the train has reached a track sector that directly precedes the route, the first dependency being defined as a compulsory sequence of two train positions;  
           [0020]    b) checking, for a variation of two trains, whether a reference location of a first train prevents the route of a second train being traveled on resulting in a second dependency, and storing the second dependency;  
           [0021]    c1) generating, for all the trains, new dependencies by applying a transitivity from the stored dependencies, and storing the new dependencies; and  
           [0022]    c2) checking the new dependencies whether a compulsory sequence according to which the first train must travel to a first track sector before the second train can travel to a second track sector.  
           [0023]    In accordance with an additional feature of the invention, steps c1) and c2) are repeatedly executed for all trains until no further new dependencies can be generated or until no train can reach a destination predefined by its route.  
           [0024]    In accordance with another feature of the invention, there is located a reference location of a train with respect to another train between a signaled position and a next controlling track sector on a route thereof, and defining a controlling track sector as a start of a route segment requested from the route level.  
           [0025]    In accordance with a further feature of the invention, the method comprises:  
           [0026]    carrying out step a) for all the trains; and  
           [0027]    carrying out step b) for all possible variations of two trains.  
           [0028]    In accordance with again an added feature of the invention, the method comprises:  
           [0029]    storing timetable dependencies of the trains and predefined train sequences as dependencies; and  
           [0030]    inserting the stored dependencies for the respective trains before performing step c).  
           [0031]    With the above and other objects in view there is also provided, in accordance with the invention, a congestion prevention system for preventing an overfilling of the track system. The congestion prevention system comprises:  
           [0032]    a process module containing means for querying the route level to determine train positions in the track system, and upon receiving a request for setting a given route segment for a given train, to determine whether the given train is allowed to travel on the track sectors to be used for the requested route segment, without causing the track system to become congested.  
           [0033]    In accordance with yet an added feature of the invention, the process module, for checking the train positions in/the route level, contains:  
           [0034]    a first sequence module for storing a dependency according to which a new train position cannot be reached until the train has reached a directly preceding track sector on the route, the dependency being defined as a compulsory sequence of two train positions;  
           [0035]    a relation module for checking for two trains whether a reference location of a first train prevents the route of a second train from being traveled on and for storing a result as a dependency;  
           [0036]    a transitivity module for generating and storing new dependencies by applying a transitivity from stored dependencies; and  
           [0037]    a second sequence module connected to the transitivity module for checking whether there is a compulsory sequence according to which the first train must travel to a first track sector before the second train is allowed to travel to the second track sector.  
           [0038]    In accordance with yet an additional feature of the invention, there is provided an iteration module, superordinate to the transitivity module and the second sequence module, for repeatedly carrying out an iteration for all the trains until no further new dependencies can be generated or until no train can reach the destination predefined by its route.  
           [0039]    In accordance with yet another feature of the invention, the reference location is defined in the relation module, according to which the reference location of a train with respect to another train is located between the signaled position and the next controlling track sector on a route thereof, and a controlling track sector is defined as the start of a route segment requested from the route level.  
           [0040]    In accordance with yet a further feature of the invention, the system includes a second iteration module, superordinate to the first sequence module, for carrying out an iteration for all the trains, and a third iteration module, superordinate to the relation module, for carrying out an iteration for all the variations of two trains.  
           [0041]    In accordance with a concomitant feature of the invention, there is provided a data module that stores timetable dependencies of trains and predefined train sequences as dependencies, and a deployment module that inserts the stored dependencies for respective trains and feeds the stored dependencies to the transitivity module.  
           [0042]    Other features which are considered as characteristic for the invention are set forth in the appended claims.  
           [0043]    Although the invention is illustrated and described herein as embodied in a method and a system for preventing overfilling of a track system, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.  
           [0044]    The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0045]    [0045]FIG. 1 is a diagrammatic perspective view of a track system with a route level I and a switchgear level (signal tower level) II;  
         [0046]    [0046]FIG. 2 is a block diagram showing an example of a congestion prevention system (CPS) area with three trains;  
         [0047]    [0047]FIG. 3 is a structogram showing a method according to the invention for preventing overfilling;  
         [0048]    [0048]FIG. 4 is a block diagram showing an example of a CPS area with three trains in order to explain method rules;  
         [0049]    [0049]FIG. 5 is a graphic representation of dependencies;  
         [0050]    [0050]FIG. 6 is a block diagram of an example of a CPS area that contains excessively short track sectors; and  
         [0051]    [0051]FIG. 7 is a block diagram of an example of a CPS area in which in each case three trains approach two passing stations from each side on a single-track section. 
     
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0052]    Before delving into the specifics of the exemplary embodiments of the invention, the following provides a list of specific terms used herein and their definitions.  
         [0053]    A “route segment” is the smallest unit of a route which is protected by a signal tower or switchgear unit and which can be set up for a train.  
         [0054]    A “track sector” (also referred to as a track field) is the starting point or destination point of a route segment.  
         [0055]    A “controlling track sector” is a track area at a start of a route segment that is requested by the track control system.  
         [0056]    A “track system” is a configuration of track sectors.  
         [0057]    A “route” (also referred to as an itinerary) is route of a train through a track system over successive track sectors.  
         [0058]    A “setup request” is an inquiry by the track control system to an congestion prevention system as to whether a specific route segment can be set up.  
         [0059]    A “request” is a request for setting up a route segment order from the track control system to the signal tower equipment, that is, to the switchgear system.  
         [0060]    “Congestion” of a track system (also referred to as overfilling) occurs in the track system if trains obstruct each other&#39;s routes in such a way that at least one train cannot reach its destination on its programmed route, that is, according to its itinerary.  
         [0061]    The congestion prevention system, referred to below by the acronym “CPS”, as part of the train control system decides on the setting up of a route segment after the arrival of the setup request. For this purpose, the method according to the invention supplies, as part of the CPS, the indication of which trains can reach their programmed destination.  
         [0062]    The behavior of the congestion prevention system and the embedding of the method according to the invention into the CPS are explained below with reference to FIG. 2. In FIG. 2, the track system to be monitored, what is referred to as an overfilling area, is illustrated with a rectangle which is represented by dashed lines.  
         [0063]    The location of the trains with the train numbers ZN  123 , ZN  456  and ZN  789 :  
         [0064]    ZN( 123 )  101   
         [0065]    ZN( 456 ) B 2   
         [0066]    ZN( 789 ) A 1   
         [0067]    Routes:  
         [0068]    ZN( 123 )  101 - 202 -B 2   
         [0069]    ZN( 456 ) B 2 - 202 - 201 -A 2   
         [0070]    ZN( 789 ) A 1 - 101 - 102 -B 1   
         [0071]    A setup request for ZN( 123 ) from  101  to  202  is signaled to the CPS.  
         [0072]    The result of the method with the setup request for ZN( 123 ) is:  
         [0073]    ZN( 123 ) and ZN( 456 ) can no longer reach their destination.  
         [0074]    Decision of the CPS:  
         [0075]    The setting up of the route segment for ZN( 123 ) is not permitted.  
         [0076]    A setup request for ZN( 789 ) from the track sector Al to the track sector  101  is signaled to the CPS.  
         [0077]    The result of the method with the setup request for ZN( 789 ) is:  
         [0078]    All the trains can reach their destination.  
         [0079]    Decision of the CPS:  
         [0080]    The CPS permits the setting up of the route segment for the train ZN( 789 ).  
         [0081]    For signaling equipment reasons, the route segment is not implemented.  
         [0082]    A setup request for ZN( 456 ) from the track sector B 2  to the track sector  202  is signaled to the CPS.  
         [0083]    The result of the method with the setup request for ZN( 456 ) is:  
         [0084]    All the trains can reach their destination.  
         [0085]    Decision of the CPS:  
         [0086]    The CPS permits the setting up of the route segment for ZN( 456 ).  
         [0087]    As soon as the route segment is implemented, the CPS reevaluates the situation.  
         [0088]    The result of the method with the setup request for ZN( 123 ) is:  
         [0089]    All the trains can reach their destination.  
         [0090]    Decision of the CPS:  
         [0091]    The CPS permits the setting up of the route segment for ZN( 123 ).  
         [0092]    After this explanation, there is then a formal description of the method according to the invention. Whether a train reaches its destination depends on the position and the routes of other trains. The dependencies are described in this algorithm with a graph represented in FIG. 5 or formally in the following notation:  
         [0093]    A current train position, or a train position to be reached, is represented by an ordered pair containing the train number and track sector:  
         [0094]    Train number/track sector.  
         [0095]    A dependence of two train positions is expressed by a relation symbol:  
         [0096]    X/ 103 →Y/ 102 .  
         [0097]    The semantics of this notation X/ 103 →Y/ 102  stand for:  
         [0098]    There is a compulsory sequence, whether of a commercial or deployment type or of a type relating to the prevention of overfilling, that a first train X must travel to the track sector  103  before a second train Y can travel to the track sector  102 .  
         [0099]    The notation and semantics which are introduced above are also appropriate for the case X=Y, for example for the train ZN( 789 ) in FIG. 2:  789 / 101 → 789 / 102 .  
         [0100]    This introduced relation is transitive: if train X has to be routed to A before train Y can travel onward to B, and if train Y has to be routed to B before train Z can travel onward to C, then train X must be routed to A before train Z can travel onward to C. Using the notation just introduced, the following is obtained:  
         [0101]    X/A→Y/B and Y/B→Z/C         X/A→Z/C. The symbol         stands for an implication. This dependence can also be written as:  
         [0102]    X/A→Y/B→Z/C.  
         [0103]    If the case X/A→Y/B→ . . . →X/A occurs, this results in that the train X must first be routed onward to A before train Y can be routed onward to B. In this way, a blockage in the CPS area to be checked becomes apparent. In an associated graph of the type according to FIG. 5, a cycle occurs.  
         [0104]    The method according to the invention is preferably implemented with the structogram given in FIG. 3. The signaling of train numbers and track sector occupation to the route level is carried out according to prior art solutions, as specified for example in Swiss Patent CH PS 613 419. The method rules (referred to below simply as “rule”) specified by use of R 1 , R 2  and R 3  in FIG. 3 are as follows:  
         [0105]    Rule 1  
         [0106]    Before a train Z 1  can travel to a track sector G 2 , it must reach a track sector G 1  that is directly preceding on the route (commercial request).  
         [0107]    Rule 2  
         [0108]    The train Z 1  whose reference location with respect to another train Z 2  prevents the route of the train Z 2  being traveled on leads to additional dependencies.  
         [0109]    Track sector A designates the destination of the first route segment on the programmed route of the train Z 2  which cannot be implemented owing to train Z 1 .  
         [0110]    Track sector B designates the first position of train Z 1  at which the destination of the first route segment on the programmed route of train Z 2  which cannot be implemented because of train Z 1  is no longer track sector A.  
         [0111]    Track sector C designates the first position of train Z 1  at which all the route segments of train Z 2  could be implemented.  
         [0112]    Rule 2a—If the track sector B corresponds to the track sector C, train Z 1  must first travel to track sector B before train Z 2  can travel to track sector A (operational requirement).  
         [0113]    Rule 2b—If the track sector B does not correspond to the track sector C and if all the route segments of the route from train Z 2  to track sector A could be implemented if train Z 1  were to be switched onward to track sector B, train Z 1  must first travel to track sector B before train Z 2  can travel to track sector A (operational requirement). Rule 2 must be applied once more, with track sector B as the reference location of train Z 1 .  
         [0114]    Rule 2c—If the track sector B does not correspond to the track sector C and if it would not be possible to implement all the route segments of the route from train Z 2  to track sector A if train Z 1  were to be switched onward to track sector B, train Z 1  must travel to track sector C before train Z 2  can travel into the first track sector in which train Z 2  prevents the implementation of at least one route segment on the route from the current position of train Z 1  to track sector C (overfilling-preventing requirement).  
         [0115]    The reference location of a train Z 1  with respect to another train Z 2  is located between the signaled position and the next controlling track sector on its route.  
         [0116]    If the train Z 1  is located at a controlling track sector and has not signaled a setup request, the reference location corresponds to the train position.  
         [0117]    The reference location is determined as follows:  
         [0118]    A. if train Z 2  has signaled a setup request whose route segment could be implemented, the destination of the route segment is considered to be a train position for the further working steps;  
         [0119]    B. if train Z 1  has signaled a setup request whose route could be implemented, the destination of the route segment is considered to be a train position for the further working steps;  
         [0120]    C. if the position of train Z 1  is a controlling track sector, the reference location corresponds to the train position;  
         [0121]    D. if the position of train Z 1  is a non-controlling track sector and it prevents the route being traveled on by train Z 2 , the reference location corresponds to the train position;  
         [0122]    E. if the position of train Z 1  is a non-controlling track sector, does not prevent the route being traveled on by train Z 2  and the route segment to the next destination on the programmed route cannot be implemented because of train Z 2 , the reference location corresponds to the train position; and  
         [0123]    F. otherwise, the next track sector on the programmed route is considered to be the train position for the further working steps and the system is continued at number  3  above.  
         [0124]    Rule 3  
         [0125]    If there is a compulsory sequence that the first train Z 1  must travel to the track sector A before train Z 2  can travel to the track sector B. and if train Z 1  in the track sector A prevents the implementation of at least one route segment on the route from the current train position of train Z 2  to the track sector B, then train Z 1  must travel into the first track sector after the track sector A on its programmed route, in which first track sector it no longer prevents the route being traveled on from the actual position of train Z 2  to the track sector B (operational requirement).  
         [0126]    The iterations and method steps indicated in FIG. 3 are explained below. The term variation which is specified below stands here for a configuration of m=2 elements of a set of n elements taking into account the sequence. The calculation of the number of variations is carried out according to V n   m =n!/(n−m)!.  
         [0127]    CYC 1 : Iteration for all Trains:  
         [0128]    ST 1 :R 1 : Insert and store dependencies according to Rule 1.  
         [0129]    CYC 2 : Iteration for all Variations of Two Trains Z 1 , Z 2 :  
         [0130]    ST 2 :R 2  Insert and store relations according to Rule 2.  
         [0131]    ST 3 : Take into account deployment dependencies, for example timetabled connections and programmed train sequences.  
         [0132]    CYC 3 : Iteration for all Trains:  
         [0133]    ST 4 : Generate and store dependencies by applying transitivity.  
         [0134]    ST 5 :R 3  Insert and store dependencies produced according to Rule 3.  
         [0135]    CYC 4 : Iteration until no further dependencies are added or no train can reach its destination.  
         [0136]    A congestion prevention system for preventing overfilling of a track system that is divided into track sectors is divided into modules. The train control system assigned to a route level I contains a congestion prevention module, which itself has a process module. The process module is divided into:  
         [0137]    a) a first sequence module which contains an implementation of Rule 1;  
         [0138]    b) a relation module which contains an implementation of Rule 2;  
         [0139]    c1) a transitivity module which contains an implementation of the transitivity of train positions, according to the notation X/A→Y/B and Y/B→Z/C         X/A→Z/C introduced above; and  
         [0140]    c2) a second sequence module which contains an implementation of Rule 3.  
         [0141]    In a particular embodiment, it is possible to superimpose on the transitivity module and the second sequence module an iteration module which repeatedly carries out an iteration for all the trains until no further new dependencies can be generated or until no train can reach the destination predefined by its route. Likewise, it is possible to superimpose on the first sequence module a second iteration module which contains an implementation of the iteration CYC 1 . In addition, it is possible to superimpose on the relation module a third iteration module which contains an implementation of the iteration CYC 2 .  
         [0142]    The timetable dependencies or specific predefined train sequences—referred to as deployments—are stored in a data module corresponding to the notation given above.  
         [0143]    A deployment module contains an implementation of the method step ST 3 .  
         [0144]    The method according to the invention will be explained by reference to FIG. 4 with three trains  1 ,  2  and  3 :  
         [0145]    Location of the trains:  
         [0146]    ZN( 1 )  101   
         [0147]    ZN( 2 )  102   
         [0148]    ZN( 3 )  103   
         [0149]    Routes:  
         [0150]    ZN( 1 )  101 - 102 - 103   
         [0151]    ZN( 2 )  102 - 203   
         [0152]    ZN( 3 )  103 - 102 - 101   
         [0153]    The three routes lead to the following train positions:  
         [0154]    [0154] 1 / 101   2 / 102   3 / 103  current train positions;  
         [0155]    [0155] 1 / 102   2 / 203   3 / 102  train positions to be reached; and  
         [0156]    [0156] 1 / 103   3 / 101  train positions to be reached.  
         [0157]    An application of the Rule 1 for the step ST 1 :R 1  yields:  
         [0158]    [0158] 1 / 101 → 1 / 102 ;  1 / 102 → 1 / 103 ;  
         [0159]    [0159] 2 / 102 → 2 / 203 ; and  
         [0160]    [0160] 3 / 103 → 3 / 102 ;  3 / 102 → 3 / 101 .  
         [0161]    Six variations are obtained for CYC 2 . An application of the Rule 2 yields the following dependencies for the step ST 2 :R 2 , two of the six variations leading to no dependencies:  
         [0162]    Train  2 -Train 1:  
         [0163]    Rule 2a):  2 / 203 → 1 / 102   
         [0164]    Train  3 -Train  1 :  
         [0165]    Rule 2c):  3 / 101 → 1 / 102   
         [0166]    Train  1 -Train  3 :  
         [0167]    Rule 2c):  1 / 103 → 3 / 102   
         [0168]    Train  2 -Train  3 :  
         [0169]    Rule 2a):  2 / 203 → 3 / 102   
         [0170]    Step ST 3  does not yield any new dependencies in this example.  
         [0171]    CYC 4 : In the present case according to FIG. 4, no new dependencies arise from the step ST 5 :R 3  and the iteration is exited.  
         [0172]    The result can be seen in FIG. 4: train  1  and train  3  cannot reach their destination. Train  2  can reach its destination.  
         [0173]    [0173]FIG. 6 is formally based on the case of excessively long trains or excessively short track sectors. It is assumed that a track sector A 2  is too short to completely accommodate the train  2 . This results in that a train that has traveled in from the track sector  102  to the track sector A 2  prevents a train in track sector A 1  moving out to the right.  
         [0174]    Location of the Trains:  
         [0175]    ZN( 1 )  101   
         [0176]    ZN( 2 ) A 2   
         [0177]    Routes:  
         [0178]    ZN( 1 )  101 -A 1 - 102   
         [0179]    ZN( 2 )  102 -A 2 - 101   
         [0180]    According to Rule 2a), the dependence comes about that train  2  must first travel to  101  before train  1  can be released to  102 . According to Rules 1 and 2, the following dependencies are produced:  
         [0181]    [0181] 1 / 101 → 1 /A 1 → 1 / 102   
         [0182]    [0182] 2 /A 2 → 2 / 101   
         [0183]    [0183] 1 /A 1 → 2 / 101   
         [0184]    [0184] 2 / 101 → 1 / 102   
         [0185]    In this case, according to Rule 3 no new dependencies are produced.  
         [0186]    Result: train  1  and train  2  can reach their destination.  
         [0187]    All three rules are applied only in relatively complex initial situations. In this respect the following example is given, but is explained using the rules only to the extent that the invention can be implemented. In each case three trains are traveling on a single-track section from both sides toward two passing stations, in this respect see the configuration according to FIG. 7.  
         [0188]    Location of the Trains:  
         [0189]    ZN( 1 )  101   
         [0190]    ZN( 2 )  102   
         [0191]    ZN( 3 ) A 2   
         [0192]    ZN( 4 ) B 3   
         [0193]    ZN( 5 )  105   
         [0194]    ZN( 6 )  106   
         [0195]    Routes:  
         [0196]    ZN( 1 )  101 - 102 -A 2 - 103 - 104 -B 2 - 105 - 106   
         [0197]    ZN( 2 )  101 -A 2 - 103 - 104 -B 2 - 105 - 106  (*)  
         [0198]    ZN( 3 ) A 2 - 103 - 104 -B 2 - 105 - 106   
         [0199]    ZN( 4 ) B 3 - 104 - 103 -A 3 - 102 - 101  (**)  
         [0200]    ZN( 5 )  105 -B 3 - 104 - 103 -A 3 - 102 - 101   
         [0201]    ZN( 6 )  106 - 105 -B 3 - 104 - 103 -A 3 - 102 - 101   
         [0202]    The application of Rule 1 is not represented here.  
         [0203]    Rule 2 yields inter alia:  
         [0204]    [0204] 2 / 103 → 1 /A 2  (***)  
         [0205]    [0205] 1 /A 2 → 4 / 102   
         [0206]    [0206] 5 / 104 → 6 /B 3   
         [0207]    [0207] 6 /B 3 → 3 / 105   
         [0208]    [0208] 3 / 105 → 2 /B 2   
         [0209]    [0209] 4 / 102 → 5 /A 3   
         [0210]    The dependency  2 / 103 → 1 /A 2  according to line (***) is produced as follows: the blocking of ZN( 1 ) by ZN( 2 ) leads, according to Rule 2, to dependencies:  
         [0211]    Train Z 1 =ZN( 2 ), train Z 2 =ZN( 1 )  
         [0212]    The reference location of Z 1  with respect to Z 2  is track sector  102 .  
         [0213]    Z 2  cannot reach the track sector  102  because of Z 1 ; from which it follows that:  
         [0214]    Track sector A= 102  see line (*) in this respect.  
         [0215]    Only when Z 1  is in track sector A 2  can the first route segment be set up by Z 2  ( 101 - 102 ); from this there follows:  
         [0216]    Track sector B=A 2 .  
         [0217]    Only if Z 1  has exited the track system to be protected can all the route segments be set up by Z 2 ; from this there follows:  
         [0218]    Track sector C= 106 .  
         [0219]    As track sector B does not correspond to track sector C, and Z 2  can travel to track sector A if Z 2  is in track sector B, Rule 2b comes into force.  
         [0220]    This yields the result given in the line (***)  
         [0221]    The transitivity yields:  
         [0222]    [0222] 2 / 103 → 1 /A 2  and  1 /A 2 → 4 / 102  leads to  2 / 103 → 4 / 102 .  
         [0223]    According to Rule 3 the dependence  2 /B 2 → 4 / 102  is produced.  
         [0224]    This dependence  2 /B 2 → 4 / 102  results from the dependence  2 / 103 → 4 / 102  as follows:  
         [0225]    Train  2  is the first train Z 1  according to Rule 3.  
         [0226]    Train  4  is the second train Z 2  according to Rule 3. Routes for train  2  and train  4 :  
         [0227]    ZN( 2 )  102 -A 2 - 103 - 104 -B 2 - 105 - 106  (*)  
         [0228]    ZN( 4 ) B 3 - 104 - 103 -A 3 - 102 - 101  (**)  
         [0229]    The track sector  103  prevents the implementation of the route segment  103 -A 3 - 102  by train  4  from the route for train  2  in the line designated by (*), in this respect see line (**). Rule 3 then requires, with respect to the first train—train  2  here—that train  2  must first be moved onward to B 2 ; moving onward to track sector  104  is not sufficient as train  2  prevents the implementation of the route segment  104 - 103 -A 3 - 102  by train  4  with the track sector  104 , resulting in, as already mentioned above:  
         [0230]    [0230] 2 /B 2 → 4 / 102   
         [0231]    The transitivity yields:  
         [0232]    [0232] 5 / 104 → 6 /B 3  and  6 /B 3 → 3 / 105  leads to  5 / 104 → 3 / 105 .  
         [0233]    According to Rule 3 the dependence  5 /A 3 → 3 / 105  is produced.  
         [0234]    This results in the cycle  3 / 105 → 2 /B 2 → 4 / 102 → 5 /A 3 → 3 / 105 . As  2 / 2 B→ 1 / 104  and  5 /A 3 → 6 / 103 , no train can reach its destination.  
         [0235]    Deployment requests can also be handled by the method according to the invention. For a station with the track configuration according to FIG. 6 with sufficiently long track sectors it will be assumed that a timetabled location for changing between trains is provided for two trains traveling in the same direction: the express  1  overtakes a local train  2  and as a result ensures a connection between the trains (these trains are not represented in FIG. 6).  
         [0236]    Location of the Trains:  
         [0237]    ZN( 1 ) A 2   
         [0238]    ZN( 2 )  101   
         [0239]    Routes:  
         [0240]    ZN( 1 )  101 -A 2 - 102   
         [0241]    ZN( 2 )  101 -A 1 - 102   
         [0242]    According to Rule 2 no new dependence is produced. Train  1  can only travel onward to track sector  102  if train  2  has previously traveled into track sector A 1 ; the following deployment dependence is thus produced in the introduced notation:  
         [0243]    [0243] 2 /A 1 → 1 / 102 .  
         [0244]    According to Rule 3 no new dependence is produced.  
         [0245]    Result:  
         [0246]    Train  1  and train  2  can reach their destination.  
         [0247]    Implementations of the Rules 1, 2a-2c and 3 which are based on another structogram according to FIG. 3 are possible.