JP5825677B2 - Course control program generation method and computer system - Google Patents

Description

  The present invention relates to a program generation method, and more particularly to a method of generating a program for operating a route control device of a railway operation management system.

  In recent years, in response to problems such as global warming, railways have been reviewed as a mass transport system with high energy efficiency. And in order to operate a railway efficiently, introduction of a railway operation management system is examined in many countries.

  The railway operation management system needs to build a program according to the track wiring. In other words, since the station wiring is diverse, it is necessary to develop a unique program for each line section and each station. In addition, when the track wiring is modified, it is necessary to modify the program. Furthermore, due to the recent complication of track wiring and sophistication of control, programs have become larger, and it has become difficult to secure human resources for building unique programs for each track and station. For this reason, problems such as a decrease in the quality of the program, a prolonged development, and an increase in cost have arisen.

  In the electronic interlocking system which is a subsystem of the railway operation management system, Patent Document 1 checks the rationality that can be performed in units of one route from the line wiring and interlocking table, and generates an interlocking database that can be used by the electronic interlocking system. Technology is disclosed. An electronic interlocking system is a type of railway security device, and is a system that controls a traffic light and a switch that are in an interlocking relationship with each other according to interlocking logic.

JP-A-6-321107

  In such a railway operation management system, there is a demand for a method capable of developing a route control device in common even in a line section or a station with different line wiring. In such a case, it is normally assumed that all design work from line wiring input to setting of control control logic is performed in-house. Therefore, when deploying a railway operation management system overseas, it is necessary to develop it not only in-house but also in cooperation with local vendors. At that time, it may be necessary to publicize design know-how such as control logic arrangement and condition value setting. In the case of distributed development, it is necessary to transmit and receive linear information and design information between development bases. Since these pieces of information are transmitted and received via a network, there is a possibility of information leakage due to communication interception even if the information is encrypted.

  Therefore, an object of the present invention is to prevent the outflow of know-how to the outside when developing software by dividing design work at distributed development bases.

A typical example of the invention disclosed in the present application is as follows. That is, a method for generating a course control program developed by a plurality of developers, wherein the method is a computer system including a computer having a processor that executes the program and a memory that stores the program executed by the processor. Executed by the processor to execute the program and store a calculation result of the program in a memory to realize a means for providing a predetermined function. The computer system includes line information including line shape and blocking. And a control logic that is a component of the route control program, and the method divides the track information stored in the database, the developer disclosure level and skill depending on the level, assigned to the developer the divided line information A first step of storing the allocated line information in said memory, logic assignment means, the clogging and geometric included in the divided line information, assign the control logic stored in the database, the allocation a second step of storing the obtained control logic in the memory, coupling means, have complementary information for coupling the assigned control logic, a third storing the compensated information to said memory And a step.

  According to the present invention, it is possible to prevent outflow of know-how to the outside when developing railway operation management software in a distributed environment.

It is a block diagram which shows the structure of the whole railway operation management system which manages operation of a train. It is a hardware block diagram of a course control program generation master device and a course control program generation subdevice according to an embodiment of the present invention. It is a software block diagram of a course control program generation master device and a course control program generation subdevice of an embodiment of the present invention. It is a figure explaining the structure of the geometry master table of embodiment of this invention. It is a figure explaining the structure of the control logic master table of embodiment of this invention. It is a figure explaining the structure of the developer master table of embodiment of this invention. It is a figure explaining the structure of the track | line element table of embodiment of this invention. It is a figure explaining the structure of the blocking table of embodiment of this invention. It is a figure explaining the structure of the geometric table of embodiment of this invention. It is a figure explaining the structure of the area table of embodiment of this invention. It is a flowchart of the process performed by the track | line shape input part of embodiment of this invention. It is a figure explaining the example of the track shape input screen used by a track shape input part. It is a flowchart of the process performed by the division part of embodiment of this invention. It is a figure explaining the example of the division | segmentation result display screen (at the time of development man-hour reduction priority) of embodiment of this invention. It is a figure explaining the example of the division | segmentation result display screen (at the time of know-how concealment priority) of embodiment of this invention. It is a flowchart of the process performed by the control logic allocation part of embodiment of this invention. It is a figure explaining the example of the control logic allocation screen of embodiment of this invention. It is a flowchart of the process performed by the coupling | bond part of embodiment of this invention. It is a figure explaining the example of the division | segmentation result display screen of embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  In the present embodiment, a course control program generation system in the case where a program is developed by one integrated developer and a plurality of sub-developers will be described. The integrated developer is an internal developer, and the sub-developer is an internal or external developer. The course control program generation system of this embodiment divides the track information input by the summary developer into a plurality of areas, and assigns design work to the sub-developer. The course control program generation system of this embodiment combines the design results of the sub-developer and generates a course control program.

  In the present embodiment, “closure” is a traffic signal protection section, and is a line area from the first inner track circuit to the final inner track circuit installed in the inner section of the traffic signal. Geometry is the relationship between two closures.

  FIG. 1 is a block diagram showing the overall configuration of a railway operation management system that manages train operations.

  The railway operation management system shown in FIG. 1 includes a planning system 11, a route control device 12, a ground device 13, and a ground facility group 15. The route control device 12 acquires the train schedule information determined by the planning system 11 and the state information of the ground facility group 15 collected by the ground device 13 via the network. Then, the route control device 12 refers to the on-line position of the train 14 obtained by the track circuit 151 by the processor executing the route control program, the departure time and the planned route included in the train schedule information, and the train 14 The traffic light 152 and the switch 153 installed on the course of the vehicle are controlled via the ground equipment group 15.

  FIG. 2 is a hardware configuration diagram of the route control program generation master device 1 and the route control program generation subdevice 2 according to the embodiment of this invention.

  The route control program generation master device 1 generates a program for operating the route control device 12 by the method of the present invention.

  The course control program generation master device 1 is a computer used by the summary developer, and the course control program generation sub-device 2 is a computer used by the sub-developer. The course control program generation master device 1 includes a processor (CPU) 21 that executes a program, a memory 22 that stores a program and data necessary for execution of the program, a storage unit 23 that stores data and a program, and inputs such as a keyboard and a mouse. Unit 24, an output unit 25 such as a display device, and a communication unit 26 that is a network interface that communicates with other devices via a network.

  The memory 22 is a high-speed and volatile storage device such as a DRAM (Dynamic Random Access Memory), and stores an operating system (OS) and application programs. When the processor 21 executes the operating system, the basic function of the route control program generation master device 1 is realized, and when the application program is executed, the function provided by the route control program generation master device 1 is realized. The course control program generation master device 1 may include an interface for reading data from a storage medium (CD-ROM, flash memory, etc.).

  The storage unit 23 is a large-capacity nonvolatile storage device such as a magnetic disk device or a flash memory, and stores a program executed by the processor 21 and data used when the program is executed. That is, the program executed by the processor 21 is read from the storage device 23, loaded into the memory, and executed by the processor 21.

  The route control program generation master device 1 and the route control program generation subdevice 2 are connected by a network, and transmit and receive data through the communication unit 26.

  The configuration of the route control program generation master device 1 has been described so far, but the route control program generation sub-device 2 also has the same configuration.

  The route control program generation master device 1 and the route control program generation sub-device 2 are physically constructed on one computer, but are physically constructed on a logical partition configured on one or a plurality of computers. May be.

  The route control program generation master device 1 is connected to the route control device 12 via a network, and transfers the route control program generated by the route control program generation master device 1 to the route control device 12. Note that the route control program generation master device 1 and the route control device 12 do not have to be connected. In this case, the route control program generated by the route control program generation master device 1 is stored in a storage medium. The route control program may be provided to the route control device 12 via the medium.

  FIG. 3 is a configuration diagram of software of the route control program generation master device 1 and the route control program generation subdevice 2 according to the embodiment of the present invention.

  The course control program generation master device 1 includes, as databases, a geometric master table 311 (see FIG. 4), a control logic master table 312 (see FIG. 5), a developer master table 313 (see FIG. 6), and a track element table 321 (see FIG. 7), a closing table 322 (see FIG. 8), a geometry table 323 (see FIG. 9), and an area table 324 (see FIG. 10). These databases are stored in the storage unit 23.

  Further, the route control program generation master device 1 includes a line shape input unit 331, a division unit 332, a coupling unit 333, and a program generation unit 334. The functions of these units are realized by executing predetermined programs by the processor 21.

  Further, the route control program generation master device 1 includes a control logic module 341 and a railway operation management core module 342 as program modules for programs provided to the route control device 12. These program modules are stored in the storage unit 23.

  The route control program generation sub-device 2 has a geometric master table 311 (see FIG. 4), a control logic master table 312 (see FIG. 5), a track element table 321 (see FIG. 7), and a closing table 322 (see FIG. 8) as databases. ) And a geometric table 323 (see FIG. 9). These databases are stored in the storage unit 23.

  The route control program generation sub-device 2 includes a control logic assignment unit 334. The function of the control logic assignment unit 334 is realized by execution of a predetermined program by the processor 21.

  It should be noted that the control logic master table 312 of the route control program generation sub-device 2 is stored in the control logic master table 312 of the route control program generation master device 1 according to the level of disclosure to the sub-developer described later. Among them, control logic other than complicated control logic related to know-how is stored.

  FIG. 4 is a diagram illustrating the configuration of the geometric master table 311 according to the embodiment of this invention.

  The geometry master table 311 is a table for storing geometric definition information that is a relationship between two blocks, the number of overlapping endpoints between the two blocks, the type of overlapping endpoints, the number of endpoints where the block 1 includes the block 2, The type of the end point including the block 1, the number of the end points including the block 1, the type of the end point including the block 1, and the direction relation between the block 1 and the block 2. The geometry type is defined by these pieces of information.

  FIG. 5 is a diagram illustrating the configuration of the control logic master table 312 according to the embodiment of this invention.

  The control logic master table 312 stores control logic definition information associated with blockage or geometry, and includes elements of a judgment type 3121, an assignment target condition 3122, a logic ID 3123, and a disclosure level 3124.

  The judgment type 3121 is a judgment type defined in the control logic master table 312.

  The assignment target condition 3122 represents a block or geometric feature to which a determination is assigned. For example, the allocation target condition 3122 is represented by a geometric type such as “intersection A, intersection B”, a closure type such as “departure signal”, and the like. Note that the allocation target condition 3122 may not be set.

  A disclosure level 3124 indicates a range for disclosing control logic. In the present embodiment, the disclosure level is represented by A, B, and C, and is defined so that the confidentiality of A is the highest and the confidentiality decreases in the order of A, B, and C.

  The control logic master table 312 of the route control program generation sub-device 2 stores only control logic in a range of levels that may be disclosed to a sub-developer who develops using the route control program generation sub-device 2. Is done.

  FIG. 6 is a diagram illustrating the configuration of the developer master table 313 according to the embodiment of this invention.

  The developer master table 313 is a table for storing developer information, and includes elements of a developer ID 3131 for identifying the developer, a developer skill level 3132 and a disclosure level 3133 for the developer.

  The developer ID 3131 is an identifier for uniquely identifying the developer. The developer ID 3131 may be assigned not to the developer but to the organization to which the developer belongs.

  The skill level 3132 indicates the ability of each developer. In general, the skill level of a veteran developer who has been engaged in development for a long period of time is set high, and the skill level of a new developer who is engaged in development is short. In the present embodiment, the skill level is represented by A, B, and C, and is defined so that the skill level of A is the highest and the ability decreases in the order of A, B, and C.

  The disclosure level 3133 is a range of information that may be disclosed to the developer. Generally, the disclosure level of the development manager is set to the highest level, and the disclosure level of the developer who should prevent know-how from being leaked outside the company is set low. In the present embodiment, the disclosure level is represented by A, B, and C, and is defined so that the confidentiality of A is the highest and the confidentiality decreases in the order of A, B, and C. The developer can refer to the disclosure level of the control logic master table 312 that is lower than the disclosure level of the developer master table 313. For example, a developer whose disclosure level is “B” in the developer master table 313 can refer to control logic whose disclosure levels are B and C in the control logic master table 312.

  FIG. 7 is a diagram illustrating the configuration of the line element table 321 according to the embodiment of this invention.

  The line element table 321 holds information on the line elements input to the line shape input unit 331 and includes elements of a line element ID 3211 and coordinates 3212. The line element ID 3211 is an identifier for uniquely identifying the line element. The coordinates 3212 are information on coordinates where the line elements are arranged.

  FIG. 8 is a diagram illustrating the configuration of the blocking table 322 according to the embodiment of this invention.

  The blocking table 322 includes elements of a blocking ID 3221, a blocking type 3222, a starting point 3223, a landing point 3224, a direction 3225, a line element ID 3226, and a logic ID 3227.

  The block ID 3221 is an identifier for uniquely identifying the block. The block type 3222 indicates the block type. For example, the closing type 3222 includes closing an on-site signal for entering a station, closing a departure signal for departure from the station, closing a closing signal between stations, and the like. The block type 3222 is used in the allocation target condition 3122 of the control logic master table 312.

  The starting point 3223 represents the place where the train that enters the block finally passes outside the block. The landing point 3224 represents the place where the train that has advanced from the block passes lastly within the block. A direction 3225 indicates the direction of closing. In this embodiment, it is either up or down. The line element ID 3226 is the line element ID of all the line elements included in the block.

  The logic ID 3227 is an identifier of a control logic for determining whether or not the train may approach in a closed manner when the route control program is executed. A plurality of control logics can be set for one block. The logic ID 3227 is set by the combining unit 333 and the control logic assigning unit 334.

  FIG. 9 is a diagram illustrating the configuration of the geometric table 323 according to the embodiment of this invention.

  The geometry table 323 is a table that stores geometric information that is a relationship between two adjacent blocks, and includes elements of a geometry ID 3231, a geometry type 3232, a block 1 ID 3233, a block 2 ID 3234, and a logic ID 3235.

  The geometry ID 3231 is an identifier for uniquely identifying the geometry. The geometric type 3232 is type information in which the pattern of the relationship between the two closures is classified according to the relationship defined in the geometric master table 311. The block 1 ID 3233 and the block 2 ID 3234 are the block IDs of the two blocks constituting the geometry.

  The logic ID 3235 is a logic ID of a control logic for determining whether the train may enter the blockage with reference to geometric information associated with the blockage when the route control program is operated. A plurality of control logics can be set for one geometry. The logic ID 3235 is set by the combining unit 333 and the control logic assigning unit 334.

  FIG. 10 is a diagram illustrating the configuration of the area table 324 according to the embodiment of this invention.

  The area table 324 is a table that defines an area that is a unit of development assigned to a developer, and includes elements of an area ID 3241, a node ID 3242, a complexity 3243, and a developer ID 3244. An area is defined by a set of closures. Information in the area table 324 is created by the dividing unit 332.

  The area ID 3241 is an identifier for uniquely identifying the area. The block ID 3242 is a block ID that forms an area. The complexity 3243 indicates an indication of the difficulty of area development. In this embodiment, the complexity is represented by A, B, and C, and is defined so that the complexity of A is the highest and the complexity decreases in the order of A, B, and C. The developer ID 3244 is a developer ID of a developer who has become a person in charge of area development.

  FIG. 11 is a flowchart of processing executed by the line shape input unit 331 according to the embodiment of the present invention. FIG. 12 is a diagram illustrating an example of the line shape input screen 41 used by the line shape input unit 331. is there.

  First, the track shape input unit 331 displays the track shape input screen 41 (step 101). In the line shape input screen 41, as shown in FIG. 12, a drawing control window 411 in which information to be input is selected, a line shape input window 412 in which information such as a line element and a block is input, and the definition of the block are input. Includes a block definition 413 and a geometric analysis button 414.

  Next, the line shape input unit 331 prompts the input of the line shape on the line shape input screen 41 (step 102). Specifically, the user selects a line 4111 in the drawing control window 411 of the line shape input screen 41 and inputs a line element in the line shape input window 412. The input line element information is stored in the line element table 321.

  Further, the track shape input unit 331 receives a closing input on the track shape input screen 41 (step 103). Specifically, the user selects the block 4112 in the drawing control window 411 of the line shape input screen 41 and inputs the block in the line shape input window 412. In addition, for each input block, the block type, starting point, landing point, direction, and line element are input to the block definition 413. Information input to the block definition 413 is stored in the block table 322.

  Thereafter, when the line shape input unit 331 detects an operation of the geometric analysis button 414 by the user, the line shape input unit 331 generates geometric information from the relationship between the input blocks (step 104). The line shape input unit 331 refers to the geometric master table 311 from the combination of the blocks registered in the block table 322, analyzes the geometric relationship between the blocks, and determines the geometry type. The determined geometry type is stored in the geometry table 323.

  13 is a flowchart of processing executed by the dividing unit 332 according to the embodiment of this invention, and FIGS. 14 and 15 are diagrams illustrating an example of the division result display screen 42 used by the dividing unit 332. .

  First, the dividing unit 332 receives an input of a dividing policy (Step 111). There are two types of division policies: “priority for reducing development man-hours” and “priority for know-how secrecy”. Coordinating developers can select a split policy from these two.

  Thereafter, the dividing unit 332 determines the input division policy and branches the process (step 112).

  If the input division policy is “prioritize development man-hour reduction”, the process proceeds to step 113, where the division unit 332 divides the line information input to the line shape input unit 331 by the forward connection geometric unit (step 113). ). For example, the division result display screen 42 includes a track shape display window 421 and a track shape graph display window 422 as shown in FIG. The line shape display window 421 displays the line information input to the line shape input unit 331. The line shape graph display window 422 displays the block shape input to the line shape input unit 331 as a round rectangle and the geometry as a connecting line. Of the geometries, the points where the geometric connections are made in the forward direction are indicated by arrows. In the case of “prioritizing development man-hour reduction”, as shown in FIG. 14, the area is generated by dividing the track information at the locations connected only by the forward connection. This is because the number of man-hours for joining the areas can be reduced when the boundaries of the areas are forward geometric connections.

  On the other hand, if the inputted division policy is “priority of know-how concealment”, the process proceeds to step 114, and the division is performed so as to remove complicated blockage and geometry (step 114). The determination as to whether it is complicated can be made based on whether the number of geometries related to one block is a predetermined number or more, or whether specific geometric information is possessed. In addition, you may determine with it being complicated when satisfy | filling both of these two conditions.

  For example, in the division result display screen (FIG. 15) when “priority of know-how concealment” is selected, compared to the division result display screen (FIG. 14) when “prioritization of development man-hour reduction” is selected, the area The closures 4221, 4222 at the bottom of # 3 and the geometry associated with them have been removed. Since the block 4221 has more than a predetermined number of geometric relationships between the blocks, and the block 4222 is a block entering the block 4221, it is removed because it is a complex block. As described above, by removing complicated linearity from the line shape and making it simple, disclosure of know-how such as complicated linear information and control logic set to complex linearity can be limited.

  Thereafter, the dividing unit 332 calculates the complexity of the area (step 115). The complexity is calculated from the block and geometry that make up the area. For example, when the difficulty level is set as a numerical value in the geometric pattern in the geometric master table 311, the points of each area are calculated by “the number of obstructions × the constant value + the total of the difficulty levels of the geometry”, and according to the calculated points Area complexity (A to C) is assigned.

  Next, the dividing unit 332 determines area similarity (step 116). For example, the similarity can be determined based on whether the relationship between the block forming the area and the geometry is the same as the relationship between the block forming the other area and the geometry. More specifically, graph theory is applied using a block as a node and a geometry as an edge. The edge has type information based on the geometric type 3232. At this time, if the graph constituting one area includes the graph constituting the other area, it can be determined that there is similarity.

  Thereafter, the dividing unit 332 assigns a developer in charge of area development (step 117). Specifically, referring to the skill level 3132 and the disclosure level 3133 of the developer master table 313, if the complexity calculated in step 115 is less than both the skill level 3132 and the disclosure level 3133, the area is sub-developed. Assign to a person. When assigning a plurality of areas to one sub-developer, the areas determined to be similar in step 116 may be assigned to the same sub-developer. The assigned result is registered in the developer ID 3244 of the area table 324.

  In the present embodiment, areas are assigned based on the result of comparing a simple difficulty level with a skill level and a disclosure level. However, a specific geometric pattern, a specific combination of patterns, or a specific geometric combination pattern is used. If there is, a rule such as assigning to a developer at disclosure level A may be applied.

  Next, the dividing unit 332 generates information for displaying the allocation result (step 118). The allocation result display screen 42 generated in step 118 includes a track shape display window 421, a track shape graph display window 422, and an area definition window 423, as shown in FIGS.

  The track shape display window 421 and the track shape graph display window 422 display the divided area information. The area definition window 423 displays information on an area ID 3241, a node ID 3242, a complexity 3243, and a developer ID 3244 registered in the area table 324. The summary developer can change the developer of each area as necessary by checking the allocation result and changing the information in the area definition window 423.

  The dividing unit 332 distributes the closing and geometric information to each sub-developer according to the allocation result (step 119). Specifically, the dividing unit 332 includes the track element table 321 related to the block ID 3242 included in the assigned area in the route control program generation sub-device 2 used by the sub-developer registered in the developer ID 3244 of the area table 324. The information of the block table 322 and the geometry table 323 is transmitted.

  FIG. 16 is a flowchart of processing executed by the control logic assigning unit 334 of the route control program generation sub-device 2 used by the sub-developer in the embodiment of the present invention. FIG. It is a figure explaining the example of the control logic allocation screen 43 used.

  First, the control logic assigning unit 334 displays the block and geometry included in the area assigned to this sub developer (step 121). Specifically, the line shape, closure, and geometry information of the area assigned to the sub-developer is displayed in the line shape display window 431 and the line shape graph display window 432 of the control logic assignment screen 43.

  When the control logic assigning unit 334 detects an operation by the sub developer of the automatic assignment button 433 on the control logic assignment screen 43, the control logic assigning unit 334 closes and assigns the control logic to the geometry based on the control logic assignment target condition (step 122). Specifically, the control logic allocation unit 334 refers to the control logic master table 312 and allocates the logic ID 3123 to the block and the geometry in which the allocation target condition 3122 matches. When a plurality of control logics are assigned to one control logic type, no logic is automatically assigned or a predetermined logic ID is assigned. For example, the predetermined logic can be defined in the control logic master table 312 as an attribute of the control logic.

  Next, the control logic assigning unit 334 displays a screen for manually closing and assigning the control logic to the geometry (step 123). When the sub-developer selects a block or geometry in the line shape graph display window 432, the control logic assigning unit 334 displays a control logic setting window 434 for setting a control logic assigned to the selected block and geometry. To do. The control logic setting window 434 displays a list 4341 of control logic assigned to the block or geometry in step 122. Further, in the control logic setting window 434, it is possible to set a condition value (such as a time for holding the determination) used in the control logic. Further, by operating the add button 4342 or the delete button 4243 in the control logic setting window 434, the control logic recorded in the control logic master table 312 is added or deleted.

  Thereafter, the control logic assigning unit 334 stores the control logic assigned to the block and the geometry in Step 122 and Step 123 (Step 124). Specifically, the control logic assigned to the block is stored in the logic ID 3227 of the block table 322, and the control logic assigned to the geometry is stored in the logic ID 3235 of the geometry table 323.

  FIG. 18 is a flowchart of processing executed by the combining unit 333 according to the embodiment of this invention. As described above, the combining unit 333 combines the control logic assignment results designed by the sub-developer to generate railway operation management software.

  First, the combining unit 333 stores the control logic assignment result by each developer (step 131). Specifically, the logic information stored in the closing table 322 and the geometric table 323 of the route control program generation sub-device 2 is acquired, and the acquired logic information is used as the closing table 322 and the geometric table 323 of the route control program generation master device 1. To store.

  Next, the combining unit 333 displays the block and geometry to which control logic is not assigned in a distinguishable manner from the block and geometry to which control logic is assigned (step 132).

  Specifically, when it is determined in step 112 of the process executed by the dividing unit 332 that the input dividing policy is “prioritizing reduction in development man-hours”, the forward connected geometry portion of the area boundary Only the control logic is not assigned.

  On the other hand, when it is determined that the input division policy is “priority of know-how concealment”, as shown in the lower part of area # 3 of the assignment result display screen 42 shown in FIG. Therefore, no control logic is assigned to the removed closure and geometry. Therefore, as shown in FIG. 19, the geometry related to the blocks 4321 and 4322 and the blocks 4321 and 4322 not assigned to the sub-developer is highlighted.

  Thereafter, the combining unit 333 assigns control logic to the block and geometry to which no logic is assigned based on the control logic assignment target condition (step 133). Since this process is the same as step 122 of the process executed by the control logic assigning unit 334, detailed description thereof is omitted.

  Next, the combining unit 333 displays a screen for manually closing the control logic and assigning the geometry to the geometry (step 134). Since this process is the same as step 123 of the process executed by the control logic assigning unit 334, detailed description thereof is omitted.

  Thereafter, the combining unit 333 refers to the closing table 322, the geometric table 323, and the railway operation management core module 342, and combines the logic ID 3227 of the closing table 322 and the control logic module 341 specified by the logic ID 3235 of the geometric table 323, A course control program is generated (step 135).

  As described above, according to the present embodiment, since the design charge range is assigned according to the level of disclosure to the developer, it is possible to prevent the know-how from leaking and reduce the security risk. In other words, control logic settings for complex alignments that have accumulated know-how are made in-house, and control logic settings for simple alignments are ordered outside the company. Can proceed with development work.

  In addition, it is possible for the development developer to manage the area design results while preventing outflow of know-how by generating the area by dividing the track information at the forward connection part so that the relationship between each area becomes independent. It is possible to reduce the work amount for combining the two.

  Furthermore, a design charge range can be assigned according to the skill of the developer.

DESCRIPTION OF SYMBOLS 1 Course control program generation | occurrence | production master apparatus 2 Course control program generation sub-apparatus 11 Planning system 12 Course control apparatus 13 Ground apparatus 14 Train 15 Ground equipment group 151 Track circuit 152 Traffic light 153 Switch machine 21 Processor (CPU)
22 Memory 23 Storage unit 24 Input unit 25 Output unit 26 Communication unit 311 Geometric master table 312 Control logic master table 313 Developer master table 321 Line element table 322 Blocking table 323 Geometric table 324 Area table 331 Line shape input unit 332 Dividing unit 333 Coupling unit 334 Control logic allocation unit

Claims (10)

A method for generating a course control program developed by a plurality of developers,
The method is executed in a computer system including a computer having a processor that executes a program and a memory that stores a program executed by the processor,
The processor executes the program and stores a calculation result of the program in a memory to realize means for providing a predetermined function,
The computer system has a database that stores track information including track shape and block, and control logic that is a component of the route control program,
The method
The dividing means divides the track information stored in the database, and assigns the divided track information to the developer according to the disclosure level and skill level of the developer, and the allocated track information is stored in the memory. A first step of storing ;
A second step in which logic assigning means assigns the control logic stored in the database to the block and geometry included in the divided track information, and stores the assigned control logic in the memory ;
Coupling means, have complementary information for coupling the assigned control logic, the method of generating the route control program the supplemented information, characterized in that it comprises a third step of storing in said memory. The database stores geometric information corresponding to the track shape included in the track information and information on the definition of the block, and information on the disclosure level and skill level of the person in charge of development,
In the first step, the dividing means includes:
Extracting the geometry based on the line shape and closure contained in the line information stored in the database;
Calculating complexity of track information from the blockage and the extracted geometric information;
The route control program generation method according to claim 1, wherein the divided line information is assigned to a developer whose calculated complexity satisfies the disclosure level and the skill level. The method includes the step of accepting a policy for the input means to divide the track information,
3. When the received policy gives priority to the secrecy of know-how, the dividing unit divides the track information after removing a geometry with high complexity and a block related to the geometry. A method for generating a course control program according to claim 1. In the third step, the combining means allocates control logic corresponding to the division point of the line information, and supplements the information by assigning control logic corresponding to the block and geometry removed from the line information at the time of division. The method for generating a course control program according to claim 3. The method includes the step of accepting a policy of dividing track information,
3. The route according to claim 1, wherein, when the accepted policy gives priority to reduction in development man-hours, in the first step, the coupling unit divides the track information only at a point of forward connection. How to generate a control program. A computer system for developing a course control program by a plurality of developers,
The computer system has a first computer and a second computer,
The first and second computers have a processor that executes a program, and a memory that stores a program executed by the processor,
The first calculator is:
A database that stores track information including track shape and block, and control logic that is a component of the route control program;
Dividing the track information stored in the database, assigning the divided track information to the developer according to the disclosure level and skill level of the developer, and assigning the allocated track information and necessary control logic to the first A dividing unit that transmits to the two computers,
The second computer has a control logic assigning unit that assigns a control logic transmitted from the first computer to a block and a geometry included in the divided line information,
The computer system according to claim 1, further comprising: a coupling unit that supplements information for coupling information of the assigned control logic. The database stores geometric information corresponding to the track shape included in the track information and information on the definition of the block, and information on the disclosure level and skill level of the person in charge of development,
The dividing unit is
Extracting the geometry based on the line shape and closure contained in the line information stored in the database;
Calculating complexity of track information from the blockage and the extracted geometric information;
7. The computer system according to claim 6, wherein the divided line information is assigned to a developer whose calculated complexity satisfies the disclosure level and the skill level. The first computer has an input unit that accepts a policy of dividing track information;
8. The division unit according to claim 6 or 7, wherein, when the received policy prioritizes concealment of know-how, the division unit divides the line information after removing a highly complicated geometry and a block related to the geometry. The computer system described in 1.   The coupling unit supplements the information by assigning control logic corresponding to the division part of the line information and assigning control logic corresponding to the block and geometry removed from the line information at the time of division. 9. The computer system according to 8. The first computer has an input unit that accepts a policy of dividing track information;
8. The computer system according to claim 6, wherein the division unit divides the line information only at a forward connection location when the accepted policy gives priority to reduction of development man-hours.

Images