CN109558634B - Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic - Google Patents
Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic Download PDFInfo
- Publication number
- CN109558634B CN109558634B CN201811268865.0A CN201811268865A CN109558634B CN 109558634 B CN109558634 B CN 109558634B CN 201811268865 A CN201811268865 A CN 201811268865A CN 109558634 B CN109558634 B CN 109558634B
- Authority
- CN
- China
- Prior art keywords
- module
- interlocking
- data
- equipment
- expression
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
Abstract
The invention discloses an interlocking Boolean logic dynamic generation system and a dynamic generation method in the field of urban rail transit. And the data encryption module is used for encrypting and rearranging data according to the generated logic data to generate a Boolean logic file. The file is prevented from being modified by mistake in the later period, and the data safety is ensured. According to the technical scheme, the interlocking logic is analyzed and dynamically generated and output in a context-free LL (K) mode, an interlocking developer only needs to modify the interlocking logic according to a preset grammar rule in the later stage, the latest Boolean logic can be dynamically generated in real time, any code does not need to be changed, the rule and the generated decoupling are realized, the workload of a signal technician is greatly reduced, the safety of logic data is ensured due to the introduction of an encryption technology, the reliability is high, and the working efficiency is improved.
Description
Technical Field
The invention relates to the field of urban rail transit signal control, in particular to a system for generating Boolean logic of an interlocking system.
Background
The correct and stable operation of the interlocking device is the precondition of healthy and orderly operation of rail transit, which directly influences the safe operation of trains and even the personal and property safety of passengers. The interlocking Boolean logic BA (Boolean Algebra) is a group of expressions for ensuring stable and ordered cooperation between interlocking devices, and the operation result is the guarantee and the basis of the safe operation of the interlocking devices.
Because the coupling relationship between the interlocking devices is complex, the conventional method is to arrange and calculate the linkage relationship of each device by experienced signal professionals and manually write BA. However, the manual programming brings problems of large BA error amount and low operation reliability.
With the introduction of computer technology into interlocking systems, tools have emerged to automatically generate BAs. The essence is that the manual writing BA is replaced by computer generation, but cannot be freely modified. Once a logical change occurs, the underlying program needs to be modified. The system coupling and the adhesion are strong; is too complex and heavy; the flexibility and the usability are low, the maintenance cost is high, and the error quantity of the BA generated after the change is high.
In view of the above, a new solution is needed to solve the above problems.
Disclosure of Invention
The invention aims to: the invention provides a dynamic generation system based on LL (K) Boolean logic. And the rule is customized by adopting a semantic rule module, and the BA is analyzed and dynamically generated by an LL (K) method, so that the rule establishment and the generation of the BA are separated. Logic change only needs to modify an independent rule base, and does not need to modify a bottom program, so that the system coupling is greatly reduced, and the flexibility is improved. Meanwhile, the safety of logic data is ensured by using a secret key technology, the usability and the safety of BA are improved while the development efficiency is improved, and the system maintenance cost is reduced.
The invention also provides a dynamic generation method based on the system.
The technical scheme is as follows: in order to achieve the purpose, the dynamic generation system based on the LL (K) interlocking Boolean logic can adopt the following technical scheme:
a LL (K) -based interlocking boolean logic dynamic generation system comprising:
the system comprises a component deployment module, a communication module and a communication module, wherein the component deployment module is used for a developer to deploy each basic interlocking device on a station yard graph and establish the connection relation among the devices;
the interlocking tabulation module is used for searching and creating an access interlocking table through station yard data provided for a station yard topological information graph based on a depth-first search algorithm of the graph;
the semantic rule module is used for customizing a BA generation rule by a developer to form an SRL;
the logic generation module is used for analyzing the SRL based on a context-free LL (K) method, searching target equipment by using a method indicated by SRL keywords, and dynamically generating BA together with operators and free variable radicals provided by the SRL;
and the data encryption module is used for encrypting the BA data to generate a key and an encrypted file.
Further, the component deployment module provides a device component of a site map, comprising: the system comprises a signal machine, a turnout, a section, a platform, a car bumper, a shaft counter, a loop, an intersection controller and a turnout controller; the component deployment module provides deployment for each component and determines a component connection relation, and the method comprises the following steps: left connection, right connection and side connection.
Furthermore, the interlocking tabulation module extracts the equipment information in the station yard topology information graph and searches all routes through a depth-first algorithm based on the graph.
Furthermore, the semantic rule module is based on a predefined grammar rule. On the basis that a signal developer follows a preset rule, a module allows the developer to freely edit an expression template, and edited data are stored in a semantic rule base; semantic rules specify the parts necessary to construct an expression, including: keywords, specific operators, free variable radicals.
Further, the logic generation module adopts a context-free LL (k) mode to identify keywords of the expression, and analyzes and outputs Boolean logic data; and the logic generation module dynamically generates the latest Boolean logic data according to the defined logic rule base.
Further, the data encryption module performs data rearrangement encryption on the generated Boolean logic data to generate an encrypted file and a key.
Has the beneficial effects that:
the Boolean logic dynamic generation system provided by the technology generates the station yard information graph through component deployment, and further extracts the station yard information graph to generate the route interlocking table; and analyzing and generating the BA according to a generation rule defined by a developer, and finally encrypting data of the BA. And outputting a Boolean logic file which can be identified by the interlocking equipment. If the BA logic is changed, only the generation rule needs to be modified, and the system dynamically generates the Boolean logic. Therefore, the rule customization and the generation decoupling are realized, and the flexibility of the system is improved. Meanwhile, the logic data is encrypted, and the data security is ensured. And finally, the BA safety is ensured, the development efficiency is improved, and the system maintenance cost is reduced.
The dynamic generation method provided by the invention can adopt the following technical scheme.
A logic dynamic generation method based on the LL (K) interlocking Boolean logic dynamic generation system comprises the following steps:
generating a station yard graph through a component deployment module, extracting station yard primitive data by a system, and automatically generating a station yard route interlocking table by using an interlocking table making module; and finally, the system rearranges and encrypts the data in the encryption module according to the analyzed semantic data to generate an unchangeable Boolean logic file.
Further, the interlocking tabulation module has the following processing flow steps:
p201: the interlocking tabulation module reads in TDM or data with equipment information and connection relation;
p202: the module checks the validity of the data, and if the data is not TDM or equipment information with a connection relation, the module throws an information invalid exception;
p203: the module extracts the name, type, equipment direction, line direction, left, right and side equipment information of the station equipment from the input data;
p204: extracting equipment information by a module to be stored as a linked list data structure;
p205: the module sets the searching direction in order to search the route in different directions;
p206: the module starts to search the equipment, judges whether the equipment is a signal machine at the initial end, and returns to the P204 to restart the search if the equipment is not at the initial end;
p207: circularly recording the searched equipment information until a terminal signal machine or a vehicle stop is met;
p208: and judging whether the current equipment is a turnout in the searching process, and if so, proving that the current route comprises a new branch route. Then a new route is established and the P207 is returned to continue to search circularly;
p209: and judging whether the current equipment is a vehicle bumper or an insulation section. If the equipment is found to prove that the route terminal is found; when the search is finished, the route does not exist as a real route;
p210: judging whether the current equipment is a terminal annunciator, if so, stopping searching, forming a complete route from all the equipment from the starting end to the terminal, and storing the route into a data structure;
p211: after one search is finished, judging whether equipment which is not searched exists; if yes, returning to P204 to start the next route search; if not, directly outputting the route interlocking table.
Further, the processing flow of the logic generation module is as follows.
P301: after reading in the semantic rule base and the route interlocking table, the module scans each rule defined by the semantic rule base line by line for processing;
p302: searching whether a next unprocessed expression still exists, if the next expression does not exist, completely analyzing the semantic rule base, and outputting a Boolean logic file;
p303: taking out the current expression;
p304: checking whether the expression is complete, namely whether keywords, operators, free variable radicals and expression terminal characters exist; if not, throwing out the structural integrity exception, returning to the P302 for re-execution;
p305: character-by-character analysis is carried out on the semantic expression by adopting a context-free LL (K) mode;
p306: judging whether the analyzed character is a keyword or not;
p307: if the key word is the key word, indicating to search the Dev object of the interlocking device;
p308: judging whether the keyword method is successfully executed; if the method is successfully executed, saving the searched equipment; if the method fails to be executed, the method execution exception is thrown, and the P302 is returned to be executed again;
p309: judging whether the current character is a free variable radical or not, and if the current character meets the condition, combining the searched equipment with the free variable radical;
p310: judging whether the current character is an operator; if the conditions are met, combining the operators into the expression;
p311: judging whether the current character is an expression terminal character; if the condition is not met, the expression is not ended, and the execution returns to the P305 again;
p312: and when the expression terminal is reached, the semantic expression is analyzed.
Has the advantages that:
the invention separates the rule customization and the generation of the Boolean logic, thereby well solving the problems of inflexible Boolean logic generation and difficult later-stage change and maintenance. The introduction of the encryption technology better solves the problem of Boolean logic data security. Therefore, under the condition of ensuring data safety, the system maintenance cost is reduced, and the development efficiency is improved.
Drawings
FIG. 1 is a schematic diagram of a Boolean logic dynamic generation system including modules in an embodiment.
FIG. 2 is a flow diagram of a method for dynamically generating interlocking Boolean logic in an example embodiment.
FIG. 3 is a schematic flow diagram of an interlocking tabulation module in an embodiment example.
FIG. 4 is a schematic diagram of a typical ladder for interlocking Boolean logic in an example implementation.
FIG. 5 is a schematic flow diagram of a logic generation module in an implementation example.
Detailed Description
Referring to fig. 1, the present invention provides an interlocking boolean logic dynamic generation system, including:
m1: and a module for component Deployment (primative Deployment) is used for signal personnel to rapidly draw a basic station information graph on the interface. The component deployment module provides a plant component of a site map, comprising: the system comprises a signal machine, a turnout, a section, a platform, a car bumper, a shaft counter, a loop, an intersection controller and a turnout controller; the component deployment module provides deployment for each component and determines a component connection relation, and the method comprises the following steps: left connection, right connection and side connection.
And M2: and the Interlocking table (Generation of Interlocking table) module is used for extracting the drawn and formed station information graph information, converting the station information graph information into Interlocking data required in the system and outputting the route Interlocking table. And the interlocking tabulation module extracts the equipment information in the station yard topology information graph and searches all routes through a depth-first algorithm based on the graph.
And M3: a semantic Rule (Syntax Rule) module, which allows developers to freely write Boolean logic generation rules in compliance with a given Syntax. The semantic rule module is based on predefined grammar rules. On the basis that a signal developer follows a preset rule, a module allows the developer to freely edit an expression template, and edited data are stored in a semantic rule base; semantic rules specify the parts necessary to construct an expression, including: keywords, specific operators, free variable radicals.
M4: and a logic generation (Parser for Boolean Algebra) module analyzes the generation rule and dynamically generates Boolean logic data. The logic generation module carries out keyword recognition on the expression in a context-free LL (k) mode, and analyzes and outputs Boolean logic data; and the logic generation module dynamically generates the latest Boolean logic data according to the defined logic rule base.
M5: and the Data Encryption (Data Encryption) module is used for encrypting and rearranging the Data according to the generated logic Data to generate a Boolean logic file.
The data encryption module carries out data rearrangement encryption on the generated Boolean logic data to generate an encrypted file and a key.
Fig. 2 is a generating method based on the generating system described in fig. 1.
FIG. 3 is a schematic flow diagram of an interlocking tabulation module having the main processing steps of:
p201: the interlocking tabulation module reads in TDM or data with equipment information and connection relation.
P202: the module checks the validity of the data. And if the data is not TDM or equipment information with connection relation, throwing an information invalidation exception.
P203: the module extracts the name, type, equipment direction, line direction, left, right and side equipment information and the like of the station equipment from the input data.
P204: the module extracts the device information and stores the device information as a linked list data structure.
P205: the module sets the searching direction in sequence to search the routes in different directions.
P206: the module starts to search the device, determines whether the device is a start-end annunciator, and returns to P204 to start searching again if the device is not a start-end annunciator.
P207: and circularly recording the searched equipment information until a terminal signal or a vehicle bumper is met.
P208: and judging whether the current equipment is a turnout in the searching process, and if so, proving that the current route comprises a new branch route. A new route is created and the loop returns to P207 to continue the loop search.
P209: and judging whether the current equipment is a vehicle bumper or an insulation section. If the equipment is found, the route terminal is found. This search is completed and the route does not exist as a true route.
P210: and judging whether the current equipment is a terminal annunciator or. If so, the search is stopped. All the devices from the starting end to the terminal end form a complete route. The route is saved to a data structure.
P211: after one search is finished, whether equipment which is not searched yet exists is judged. If yes, go back to P204 to start the next route search. If not, directly outputting the route interlocking table.
FIG. 4 is an exemplary schematic diagram of an interlocking Boolean logic ladder. In the figure, D1 and D2 are respectively schematic codes of adjacent interlocking objects. A, B and C are radical symbols. The generation rules may be defined for the interlock logic of FIG. 4 as: (< Dev >. A + < Self >. B) (< Adj >. C) + < Self >. A + < Adj >. B = < Adj >. B. Wherein < Dev >, < Self > are keywords; "+", "-" are operators; "A", "B" and "C" are free variable radicals.
FIG. 5 is a schematic flow diagram of a logic generation module. The processing flow of fig. 5 will be further described with reference to fig. 2 and 4.
P301: after the semantic rule base and the route interlocking table are read in, the module scans each rule defined by the semantic rule base line by line for processing.
P302: and searching whether the next unprocessed expression still exists, and if the next expression does not exist, completely analyzing the semantic rule base. And outputting the Boolean logic file.
P303: the current expression is taken out, corresponding to the defined (< Dev >. A + < Self >. B) (< Adj >. C) + < Self >. A + < Adj >. B = < Adj >.
P304: and (4) checking whether the expression is complete, namely whether keywords, operators, free variable radicals and expression terminals exist. If not, the structural integrity exception is thrown, and the process returns to P302 for re-execution.
P305: the semantic expression is parsed character by adopting a context-free LL (K) mode.
P306: and judging whether the analyzed character is a keyword or not.
P307: if it is a key word, e.g., < Dev >, a key word method is performed indicating that the Dev object of the interlock device is sought.
P308: and judging whether the keyword method is successfully executed. And if the method is successfully executed, saving the searched equipment. If the method fails to execute, the method execution exception is thrown, and the P302 is returned to execute again.
P309: and judging whether the current character is a free variable radical or not, and combining the searched equipment (D1 in figure 4) and the free variable radical (A in figure 4) into D1.A if the current character meets the condition.
P310: and judging whether the current character is an operator or not. If the condition is met, the operators ("+", "-") are combined into the expression.
P311: and judging whether the current character is an expression terminator. If the condition is not met, the expression is not finished, and the execution returns to the P305 again.
P312: and when the expression terminal is reached, the semantic expression is analyzed. Generating the final Boolean logic of the single Boolean logic correspondence definition: (D1. A + D1. B) (-D2. C) + D1.A + D2.B = D2.B, and then returning to P302 for analyzing the next semantic rule.
The invention separates the rule customization and the generation of the Boolean logic, and well solves the problems of inflexibility of Boolean logic generation and difficult later-stage change and maintenance. The introduction of the encryption technology also better solves the problem of Boolean logic data security. Therefore, under the condition of ensuring data safety, the system maintenance cost is reduced, and the development efficiency is improved.
The invention is operational with numerous general purpose or special purpose computing system environments or configurations, such as: personal computers, server computers, multi-processing systems, and the like.
The foregoing is illustrative of the present invention and it will be appreciated by those skilled in the art that various modifications and adaptations can be made without departing from the principles of the invention and should be considered as within the scope of the invention.
Claims (9)
1. An LL (K) -based interlocking boolean logic dynamic generation system, characterized by comprising:
the system comprises a component deployment module, a site topology information graph and a site topology information graph, wherein the component deployment module is used for developers to deploy basic interlocking equipment on the site graph and establish the connection relation among the equipment;
the interlocking tabulation module is used for searching and creating an access interlocking table through station yard data provided for a station yard topological information graph based on a depth-first search algorithm of the graph;
a semantic Rule module, which is used for a developer to customize the generation Rule of BA and form SRL (Syntax Rule Library);
the logic generation module is used for analyzing the SRL based on a context-free LL (K) method, searching target equipment by using a method indicated by SRL keywords, and dynamically generating BA together with operators and free variable radicals provided by the SRL;
and the data encryption module is used for encrypting the BA data to generate a key and an encrypted file.
2. The LL (K) -based interlocking boolean logic dynamic generation system according to claim 1, characterized in that the component deployment module provides device components of a site graph, comprising: a signal machine, a turnout, a section, a platform, a car bumper, a counting shaft, a loop, an intersection controller and a turnout controller; the component deployment module provides deployment for each component and determines a component connection relation, and the method comprises the following steps: left connected, right connected, side connected.
3. The LL (K) -based interlocking boolean logic dynamic generation system according to claim 2, characterized in that the interlocking tabulation module extracts the device information in the yard topology information graph and searches all the routes through a graph-based depth-first algorithm.
4. The LL (K) -based interlocking boolean logic dynamic generation system according to claim 1, characterized in that the semantic rules module is based on predefined grammar rules; on the basis that a signal developer follows a preset rule, a module allows the developer to freely edit an expression template, and edited data are stored in a semantic rule base; semantic rules specify the parts necessary to construct an expression, including: keywords, specific operators, free variable radicals.
5. The LL (K) -based interlocking Boolean logic dynamic generation system according to claim 1, wherein the logic generation module performs keyword recognition on the expression in a context-free LL (K) mode, and analyzes and outputs Boolean logic data; and the logic generation module dynamically generates the latest Boolean logic data according to the defined logic rule base.
6. The LL (K) -based interlocking boolean logic dynamic generation system according to claim 1, characterized in that a data encryption module performs a data rearrangement encryption on the generated boolean logic data, resulting in an encrypted file and a key.
7. A dynamic logic generation method based on LL (K) interlocking boolean logic dynamic generation system according to any of the claims 1 to 6, characterized in that:
the station yard graph is generated through the component deployment module, the system extracts station yard primitive data and automatically generates a station yard access interlocking table through the interlocking table making module; and finally, the system rearranges and encrypts the data in the encryption module according to the analyzed semantic data to generate an unchangeable Boolean logic file.
8. The dynamic generation method of claim 7, wherein the interlocking tabulation module process flow steps are as follows:
p201: the interlocking tabulation module reads TDM (Topo direct Map) or data with equipment information and connection relation;
p202: the module checks the validity of the data, and if the data is not TDM or equipment information with a connection relation, the module throws an information invalidity exception;
p203: the module extracts the name, type, equipment direction, line direction of the station equipment and equipment information of left connection, right connection and side connection with the station equipment from input data;
p204: extracting equipment information by a module to be stored as a linked list data structure;
p205: the module sequentially sets searching directions in order to search the routes in different directions;
and P206: the module starts to search equipment, judges whether the equipment is a starting end annunciator or, and returns to P204 to start searching again if the equipment is not the starting end annunciator;
p207: circularly recording the searched equipment information until a terminal signal machine or a vehicle stop is met;
p208: judging whether the current equipment is a turnout in the searching process, and if so, proving that the current route comprises a new branch route; then a new route is established and the P207 is returned to continue the circular search;
and P209: judging whether the current equipment is a vehicle bumper or an insulation section; if the equipment is found, the route terminal is found; the search is finished, and the route does not exist as a real route;
p210: judging whether the current equipment is a terminal annunciator, if so, stopping searching, forming a complete route from all the equipment from the starting end to the terminal, and storing the route into a data structure;
p211: after one-time searching is finished, judging whether equipment which is not searched exists; if yes, returning to P204 to start the next route searching; if not, directly outputting the route interlocking table.
9. The dynamic generation method of claim 7 or 8, wherein the logic generation module comprises the following steps
P301: after reading in the semantic rule base and the route interlocking table, the module scans each rule defined by the semantic rule base line by line for processing;
p302: searching whether the next unprocessed expression still exists, if the next expression does not exist, completely analyzing the semantic rule base, and outputting a Boolean logic file;
p303: taking out the current expression;
p304: checking whether the expression is complete, namely whether keywords, operators, free variable radicals and expression terminal characters exist; if not, throwing out the structural integrity exception, returning to the P302 for re-execution;
p305: character-by-character analysis is carried out on the semantic expression by adopting a context-free LL (K) mode;
p306: judging whether the analyzed character is a keyword or not;
p307: if the key word is the key word, indicating to search the Dev object of the interlocking device;
p308: judging whether the keyword method is successfully executed; if the method is successfully executed, saving the searched equipment; if the method fails to be executed, the method execution exception is thrown, and the P302 is returned to be executed again;
p309: judging whether the current character is a free variable radical or not, and if the current character meets the condition, combining the searched equipment with the free variable radical;
p310: judging whether the current character is an operator or not; if the conditions are met, combining the operators into the expression;
p311: judging whether the current character is an expression terminal character or not; if the condition is not met, the expression is not ended, and the execution returns to the P305 again;
p312: and when the expression terminal is reached, the semantic expression is analyzed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811268865.0A CN109558634B (en) | 2018-10-29 | 2018-10-29 | Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811268865.0A CN109558634B (en) | 2018-10-29 | 2018-10-29 | Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109558634A CN109558634A (en) | 2019-04-02 |
| CN109558634B true CN109558634B (en) | 2022-11-18 |
Family
ID=65865605
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811268865.0A Active CN109558634B (en) | 2018-10-29 | 2018-10-29 | Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109558634B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112231884A (en) * | 2019-06-28 | 2021-01-15 | 比亚迪股份有限公司 | Method and apparatus for drawing station yard graph, and storage medium |
| CN110674191B (en) * | 2019-10-08 | 2022-07-26 | 卡斯柯信号(成都)有限公司 | Universal interlocking logic searching method and device |
| CN112208586B (en) * | 2020-09-08 | 2022-10-18 | 通号城市轨道交通技术有限公司 | Interlocking table generation method and device and readable storage medium |
| CN113268455B (en) * | 2021-04-26 | 2022-07-26 | 卡斯柯信号(成都)有限公司 | Boolean logic-based automatic configuration method and system for interlocking data |
| CN113807078B (en) * | 2021-10-09 | 2023-03-10 | 杭州路信科技有限公司 | Signal interlocking system control method and device, electronic equipment and storage medium |
| CN113696935B (en) * | 2021-10-28 | 2022-04-08 | 北京全路通信信号研究设计院集团有限公司 | Signal equipment primitive data model establishing method and system |
| CN113704839A (en) * | 2021-10-28 | 2021-11-26 | 北京全路通信信号研究设计院集团有限公司 | Method and system for automatically generating route information table based on depth priority |
| CN115257881A (en) * | 2022-07-12 | 2022-11-01 | 中铁第四勘察设计院集团有限公司 | Basic route selection algorithm and equipment based on depth-first and conflict monitoring algorithm |
| CN115366944B (en) * | 2022-09-20 | 2024-04-16 | 中南大学 | Rail transit vehicle and route control method and system thereof |
| CN116702665B (en) * | 2023-08-04 | 2023-10-27 | 山东启芯软件科技有限公司 | Large-scale integrated circuit design optimization method based on common sub-expression |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2194656B1 (en) * | 2008-12-03 | 2014-06-25 | ABB Research Ltd. | Electrical power network management system |
| CN103440349A (en) * | 2013-09-16 | 2013-12-11 | 国电南瑞科技股份有限公司 | Urban rail traffic station data validation method |
| US9112550B1 (en) * | 2014-06-25 | 2015-08-18 | Kandou Labs, SA | Multilevel driver for high speed chip-to-chip communications |
-
2018
- 2018-10-29 CN CN201811268865.0A patent/CN109558634B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN109558634A (en) | 2019-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109558634B (en) | Dynamic generation system and dynamic generation method based on LL (K) interlocking Boolean logic | |
| US5101424A (en) | Method for generating a monitor program for monitoring text streams and executing actions when pre-defined patterns, are matched using an English to AWK language translator | |
| CN106156186B (en) | Data model management device, server and data processing method | |
| CN100515843C (en) | Method and device of generating logic control units for railroad station-based vital computer apparatuses | |
| Sinnamon et al. | Improved accuracy in quantitative fault tree analysis | |
| CN103823666A (en) | Smart substation equipment visualized programming method | |
| CN112765020A (en) | Automatic testing method of computer interlocking system | |
| Wu et al. | Scenario-based system design with colored petri nets: an application to train control systems | |
| US11853721B2 (en) | Interrupt-driven system verification method based on interrupt sequence diagram | |
| CN109933786B (en) | Method for constructing responder message tool based on compiling rule | |
| CN101719921B (en) | Method for generating routing protocol component in software development of reconfigurable router | |
| Matsuno et al. | An implementation of GSN community standard | |
| Iliasov et al. | Formal verification of signalling programs with SafeCap | |
| CN112269566B (en) | Script generation processing method, device, equipment and system | |
| Svendsen et al. | The future of train signaling | |
| CN111176992B (en) | Flow engine testing method and device, computer equipment and storage medium | |
| US20090064092A1 (en) | Visual programming language optimization | |
| US20230072988A1 (en) | System and a method for automatic generation of smart contracts across blockchain platforms | |
| CN115794067A (en) | Industrial software generation method and device, electronic equipment and readable storage medium | |
| Norman et al. | Model checking the probabilistic pi-calculus | |
| CN114385649A (en) | Automatic updating system and method for interlocking logic rule configuration file | |
| US20140143261A1 (en) | Automated semantic enrichment of data | |
| CN112988120A (en) | Satellite telemetering downlink scheduling parameter dynamic online binding method and system for Ada language | |
| Danelutto et al. | Towards gcm re-configuration-extending specification by norms | |
| Liu et al. | MVDLite: A Light-weight Representation of Model View Definition with Fast Validation for BIM Applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |