CN115630090A - Task state conversion system - Google Patents
Task state conversion system Download PDFInfo
- Publication number
- CN115630090A CN115630090A CN202211638554.5A CN202211638554A CN115630090A CN 115630090 A CN115630090 A CN 115630090A CN 202211638554 A CN202211638554 A CN 202211638554A CN 115630090 A CN115630090 A CN 115630090A
- Authority
- CN
- China
- Prior art keywords
- state
- state transition
- conversion
- task
- mapping
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
- G06F16/24532—Query optimisation of parallel queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2282—Tablespace storage structures; Management thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/284—Relational databases
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computational Linguistics (AREA)
- Software Systems (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
The invention relates to the technical field of computers, in particular to a task state conversion system, which comprises: a database, a processor and a memory for storing computer programs, wherein the database comprises state converters tr, tr is bound with t entities, the t entities have t state conversion mapping tables, the state conversion mapping table M of the qth entity q Comprises n mapping relations m, wherein the p-th mapping relation m in m p Is the p-th current state st p 、st p Trigger event te of p Trigger condition tc p And the next state tt p A set of (a); tr is according to st p And te p And/or tc p Calling a query function to query the mapping relation in the state converter to obtain st p Tt is a second order state p (ii) a The invention stores the mapping relation of the nodes in the state conversion task into the database, can obtain the next state of the current state in the database only by a simple query function, and has simple realization of the query function and strong reusability.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a task state conversion system.
Background
When a computer executes a plurality of state transition tasks, each state transition task is provided with a plurality of nodes, and the state transition tasks include the transition of a large number of nodes in the execution process; the state conversion machine can be used for realizing the efficient execution of the state conversion task and correctly returning to the next state under the current state and condition.
The existing finite state conversion machine finishes state conversion through a state conversion function, the input of the state conversion function is a current state, a trigger event and a trigger condition, the output result is a secondary state and an action, an internal program of the state conversion function configures a judgment condition and a state conversion relation configured when the corresponding condition is met, wherein the judgment condition comprises the judgment of the current state of a current node, the judgment of the trigger condition and the trigger event, and the configured state conversion relation comprises the relation of the current state being converted into the secondary state and the execution of the next action, so that the current state of a state conversion task is converted into the secondary state under the specific trigger event and the trigger condition; however, the above prior art has the following technical problems:
firstly, mapping relations among the current states, the conversion conditions, the trigger events and the secondary states of all nodes in the state transition diagram are realized through a state transition function, but the realization of the state transition function is complex, the generated state transition function has high complexity, and the probability of program faults is high;
secondly, when the trigger condition and/or the trigger event in the state transition diagram need to be modified or the state needs to be increased, the source program of the state transition function needs to be modified, and the modification difficulty of the source program is high;
thirdly, the state transition function is generated for the state transition diagram of a certain task, when a new task is added, a new state transition function needs to be generated according to the new state transition diagram, the multiplexing rate of the state transition function in the prior art is low, and a large amount of manpower and hardware resources need to be consumed in the process of adding the new task.
Disclosure of Invention
Aiming at the technical problem, the technical scheme adopted by the invention is as follows: a task state transition system, the system comprising a database, a processor and a memory storing a computer program, wherein the database comprises a stateThe state converters tr, tr are bound to t entities, t entities having t state conversion mapping tables { M } 1 ,M 2 ,…,M q ,…,M t }，M q A state conversion mapping table for the qth entity, wherein the value range of q is 1 to t, M q Comprising n mapping relationships m = { m 1 ,m 2 ,…,m p ,…,m n In which m is p The value range of p is 1 to n, and n is the number of the mapping relations; m is p ={st p ,te p ,tc p ,tt p Where st is p Is the p current state, te, of the q entity p Is st p Trigger event, tc, for a state transition p Is st p Trigger condition for occurrence of state transition, tt p Is st p The secondary state after the state conversion is one of n current states; when executed by a processor, the computer program performs the steps of:
s100, obtaining the current state st of the qth entity p 。
S200, when st p Trigger event te for occurrence of state transition p And/or trigger conditions tc p When triggered, according to st p And te p And/or tc p Calling a query function Pft to query the mapping relation in the state converter tr to obtain st p Converted sub-state tt p 。
The invention has at least the following beneficial effects:
firstly, acquiring a state transition diagram of a state transition task, configuring a mapping relation among a current state, a trigger condition, a transition event, a secondary state and an action corresponding to each node according to the state transition diagram to generate a mapping table, and storing the mapping table in a database; generating a query function, wherein the query function is used for querying a mapping table, and after the current state, the conversion event and the trigger condition are obtained by the query function, the secondary state and the action of the current state which meet the conversion event and the trigger condition and are stored in the mapping table can be queried through the query function, so that the conversion between task states is realized; the invention configures and generates the mapping table according to the state transition diagram, only needs simple query function to query the mapping table to obtain the secondary state of the current state, has simple implementation of the query function and strong reusability, only needs to modify the mapping table and does not need to modify the query function when the state transition relationship is changed, and simplifies the operation of the system for realizing the state transition.
Secondly, one state converter can be bound with a plurality of entities, each entity is provided with a corresponding mapping table, when a new state conversion task is added, the mapping table is generated according to a new preset conversion map, and the new state conversion task can be realized only by storing the new mapping table into a database; the state conversion can be realized by multiplexing the same query function query mapping table, a large amount of system resources are saved, the state conversion tasks do not have a dependency relationship, the parallel operation of a plurality of state conversion tasks can be realized, and the task conversion efficiency is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flowchart of a task state transition method provided by an embodiment of the present invention;
FIG. 2 is a state flow diagram of a user ordering process;
FIG. 3 is a state flow diagram of a maintenance service flow.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The embodiment of the invention provides a task state conversion systemThe system comprises a database, a processor and a memory storing a computer program, wherein the database comprises state converters tr, tr is bound with t entities, and the t entities are provided with t state conversion mapping tables { M } 1 ,M 2 ,…,M q ,…,M t }，M q A state conversion mapping table of the qth entity is provided, and the value range of q is 1 to t; m is a group of q Comprises n mapping relations m = { m = } 1 ,m 2 ,…,m p ,…,m n In which m is p The value range of p is 1 to n, and n is the number of the mapping relations; m is p ={st p ,te p ,tc p ,tt p Where st is p Is the p current state, te p Is st p Trigger event, tc, for a state transition p Is st p Trigger condition for occurrence of state transition, tt p Is st p The secondary state after the state conversion is one of the n current states.
The state converter tr is configured to store a mapping relationship among a current state, a trigger event, a trigger condition, a secondary state, and an action of each node generated according to the state transition diagram.
Wherein the current state st p The current state of the state transition task in the execution process; in particular, the current state st p Trigger condition tc p And a triggering event te p The mapping relationship between them is pre-configured.
It should be noted that the current state st p Sub-state tt after occurrence of state transition p May be st p By itself, i.e. albeit triggered by a corresponding trigger condition tc p And/or trigger event te p Triggered, but the state has not changed.
Wherein a trigger event te p Is to cause the task being executed to go from the current state st p Transition to the secondary state tt p Control information of (2); in particular, a trigger event te p For the preset click operation performed on the control, optionally, the control is a determination button, a radio button, or a check button, and each control has an event represented by itself, for example: control memberThe represented event is the loading of a frame, a single click, a double click or a text box to change the text.
Wherein the trigger condition tc p For state transition task at current state st p To the second state tt p The conversion rule during conversion, specifically, the trigger condition is customized according to the state conversion diagram, for example: the user has performed a login operation, a certain value reaches a preset value, or a preset signal is in an ascending state, etc.
Wherein, the mapping relation m p Further comprising an action ff p ，ff p For the current state st p Conversion to tt p The next operation to be executed later; specifically, the action is not required, and no action may be performed when the trigger condition and the trigger event are satisfied, and only the current state is converted to the next state.
Optionally, the state conversion task executed by the task state conversion system is a user order; optionally, the state transition task executed by the task state transition system is to provide maintenance service.
The state transition task has a pre-configured state transition diagram, and the mapping relation m comprises all state transition mapping relations in the state transition diagram; the state transition diagram comprises n nodes { pn 1 ,pn 2 ,…,pn p ,…,pn n In which pn p The value range of p is 1 to n for the p-th node; pn-N complex p Is m in a state of p The p-th current state st in p 。
The state transition diagram is used for describing the current state, the trigger condition and the trigger event and the transition between task states triggered by the trigger condition and the trigger event; the state transition diagram represents the behavior of the state transition task by describing the state of the task and the triggering conditions and triggering events which cause the state transition; specifically, in the state transition diagram, each node represents a state.
Specifically, fig. 2 shows a state transition diagram when the state transition task is ordering for the user, and the nodes of the state transition diagram are not ordering, not paying for the ordered order, paid, shipped and not received, and received, respectively; for example: the first node is not placed, the corresponding first current state is not placed, and the next state of the current state is that the placed order is not paid; FIG. 3 illustrates a state transition diagram when the state transition task is to provide service, the nodes of the state transition diagram being unscheduled, reserved unanswered, accepted order unaffiliated service, entered service and paid, respectively; for example: the third node is the connected list and is not repaired, the corresponding third current state is the connected list and is not repaired, and the next state of the current state is the repaired on the door.
Further, the computer program, when executed by a processor, performs the following steps of state transition tasks, as shown in fig. 1:
s100, obtaining the current state st of the qth entity p 。
And the current state is a state which is synchronized into the task state conversion system when the user jumps to the interface where the current state is located.
S200, when st p Trigger event te for state transition p And/or trigger conditions tc p When triggered, according to st p And te p And/or tc p Calling a query function Pft to query the mapping relation in the state converter to obtain st p Converted secondary state tt p 。
The query function Pft is a preset encapsulation function, the Pft can execute query operation on the mapping table when the input is the current state and the trigger event and/or the trigger condition, and the output of the Pft is the searched secondary state and action which have mapping relation with the current state and the trigger event and/or the conversion condition; the encapsulation function is to encapsulate one or more function functions, and the encapsulation function provides only one function interface, so that when a user needs to execute the same operation in other scenes, the user can directly call from a function library without writing the same function, and the internal structure of the function is not considered.
When the secondary state is obtained through the current state and the trigger event/conversion condition, the mapping relation in the mapping table is queried by utilizing a query function Pft. Compared with the prior art that all the conversion relations among the states in the state conversion diagram are converted into the form of the state conversion function, the state conversion mapping relation among all the nodes in the state conversion diagram is stored by using the mapping table, the state conversion can be realized by inquiring the mapping table by using the packaged inquiry function, the code calling of the packaged function is short, the program faults are reduced, the maintenance is convenient, the reusability is strong, and when the state conversion relation needs to be modified, only the mapping relation in the mapping table needs to be modified, and the source code of the packaged function does not need to be modified.
Wherein, the mapping relation m p The acquiring step comprises:
s300, configuring the p current state, the trigger event for state transition, the trigger condition for state transition and the secondary state after state transition according to the state transition diagram.
S400, resolving the pth current state, the trigger event for state conversion, the trigger condition for state conversion and the secondary state after state conversion into a key value pair.
Optionally, the key value pair is in JASON format.
S500, extracting the p current state st in the key value pair p 、st p Trigger event te for state transition p 、st p Trigger condition tc for state transition to occur p And st p The next state tt after state transition p And saved as the mapping relation m p ={st p ,te p ,tc p ,tt p }。
In this embodiment, first, a mapping relationship among a current state of each node in a state transition graph, a trigger event where state transition occurs, a trigger condition where state transition occurs, and a secondary state after state transition is analyzed as a key value pair, and then stored in a database; compared with the prior art in which mapping relationships corresponding to all nodes are realized through a state transition function, program failures are reduced, the last state does not need to be checked through checking the mapping table to realize state transition, dependency relationships among the state transitions do not exist, and when the state transition relationships need to be modified, the state transition relationships can be modified through configuring the mapping relationships in the mapping table on the premise that source codes do not need to be modified.
The task state conversion system further comprises a cluster, wherein the cluster comprises a master node and slave nodes, the master node is used for scheduling the state conversion tasks according to the resource configuration of the slave nodes, the slave nodes are used for executing a plurality of state conversion tasks in parallel, and dependency does not exist among the plurality of state conversion tasks.
In the embodiment, the state converter is bound with a plurality of state conversion tasks, so that the parallel operation of the plurality of tasks can be realized; specifically, a user sends a task request to a cluster, and the cluster comprises a master node and a slave node; the master node and the slave nodes are different servers in the cluster, the master node acquires hardware resources of the slave nodes and schedules tasks, and the slave nodes execute the tasks distributed by the master node; since there is no mutual dependency relationship between tasks during execution, concurrent processing of a plurality of tasks can be realized.
To sum up, in this embodiment, a state transition diagram of a state transition task is first obtained, a mapping table is generated according to mapping relationships among a current state, a trigger event, a trigger condition, a secondary state and an action corresponding to each node in the state transition diagram, and the mapping table is stored in a database; generating a query function, wherein the query function is used for querying a mapping table, and when the input of the query function is the obtained current state, the trigger event and the trigger condition, the query function obtains a corresponding mapping relation through querying the mapping table, and outputs a secondary state and an action of the current state which meet the conversion event and the trigger condition, so that the conversion between task states is realized; in the embodiment, the mapping table is generated by using the state transition diagram, and the secondary state and the action of the current state can be acquired by using a simple query function, so that redundant state transition codes are reduced to a certain extent; when a new state transition task is added, a new mapping table is generated according to a state transition diagram of the new task, and the state transition of the new task can be realized only by binding the mapping table of the new task with the state transition; the multiplexing of the query function is realized, and the operation flow is simplified.
Although some specific embodiments of the present invention have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the invention. It will also be appreciated by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (7)
1. A task state transition system, comprising a database, a processor, and a memory storing a computer program, wherein the database comprises state transitions tr bound to t entities having t state transition mapping tables { M } 1 ,M 2 ,…,M q ,…,M t }，M q A state conversion mapping table for the qth entity, wherein the value range of q is 1 to t, M q Comprises n mapping relations m = { m = } 1 ,m 2 ,…,m p ,…,m n In which m is p The value range of p is 1 to n, and n is the number of the mapping relations; m is p ={st p ,te p ,tc p ,tt p In which st is p Is the p current state, te, of the q entity p Is st p Trigger event, tc, for state transition p Is st p Trigger condition for occurrence of state transition, tt p Is st p The secondary state after the state conversion is one of n current states; when executed by a processor, the computer program performs the steps of:
s100, obtaining the current state st of the qth entity p ；
S200, when st p Trigger event te for occurrence of state transition p And/or trigger conditions tc p When triggered, according to st p And te p And/or tc p Calling a query function Pft to query the mapping relation in the state converter tr to obtain st p Converted secondary state tt p 。
2. The task state transition system of claim 1, wherein m is p Further comprising an action ff p Ff is the same as p For the current state st p Conversion to tt p And then the next operation is performed.
3. The task state transition system of claim 2, wherein the mapping m comprises all state transition mappings in a state transition graph corresponding to a qth entity; the state transition diagram comprises n nodes { pn 1 ,pn 2 ,…,pn p ,…,pn n In which pn is p The value range of p is 1 to n for the p-th node; pn-N complex p Is m in a state of p The p-th current state st in p 。
4. The task state transition system of claim 3, wherein m is p The obtaining step comprises:
s300, configuring the p current state, a trigger event for state transition, a trigger condition for state transition and a secondary state after state transition according to the state transition diagram;
s400, resolving the pth current state, the trigger event for state conversion, the trigger condition for state conversion and the secondary state after state conversion into a key value pair;
s500, extracting the p current state st in the key value pair p 、st p Trigger event te for occurrence of state transition p 、st p Trigger condition tc for state transition p And st p The next state tt after state transition p And saved as a mapping relation m p ={st p ,te p ,tc p ,tt p }。
5. The task state transition system of claim 1, further comprising a cluster comprising a master node and slave nodes, wherein the master node is configured to schedule the state transition tasks according to resource configurations of the slave nodes, and the slave nodes are configured to execute a plurality of state transition tasks in parallel, and wherein no dependency exists between the plurality of state transition tasks.
6. The task state transition system of claim 2, wherein the query function Pft is a predetermined encapsulation function, the query operation is performed on the mapping table when the input of Pft is the current state and the trigger event and/or the trigger condition, and the output of Pft is the searched sub-state and action having mapping relation with the current state and the trigger event and/or the transition condition.
7. The task state transition system of claim 4, wherein the key-value pairs are in JASON format.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211638554.5A CN115630090B (en) | 2022-12-20 | 2022-12-20 | Task state conversion system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211638554.5A CN115630090B (en) | 2022-12-20 | 2022-12-20 | Task state conversion system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115630090A true CN115630090A (en) | 2023-01-20 |
| CN115630090B CN115630090B (en) | 2023-04-04 |
Family
ID=84910121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211638554.5A Active CN115630090B (en) | 2022-12-20 | 2022-12-20 | Task state conversion system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115630090B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068244A (en) * | 2007-06-07 | 2007-11-07 | 中兴通讯股份有限公司 | Metod for tracing protocol stack state machine switching |
| CN102890735A (en) * | 2012-07-09 | 2013-01-23 | 南京南瑞继保电气有限公司 | Modeling method of strategy table and strategy table searching match of stable control device |
| CN105045603A (en) * | 2015-08-24 | 2015-11-11 | 北京金山安全软件有限公司 | Method and device for constructing finite-state machine model framework and electronic device |
| CN105574295A (en) * | 2016-02-02 | 2016-05-11 | 浪潮(北京)电子信息产业有限公司 | Method and device for acquiring state expression of JK trigger |
| CN111638871A (en) * | 2020-05-28 | 2020-09-08 | 深圳市元征科技股份有限公司 | Equipment information processing method, device, equipment and medium |
| CN112733380A (en) * | 2021-01-20 | 2021-04-30 | 北京高码科技有限公司 | Finite state machine based on relational database |
| CN114780594A (en) * | 2022-04-29 | 2022-07-22 | 中国邮政储蓄银行股份有限公司 | Service processing method and processing device based on state machine |
-
2022
- 2022-12-20 CN CN202211638554.5A patent/CN115630090B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101068244A (en) * | 2007-06-07 | 2007-11-07 | 中兴通讯股份有限公司 | Metod for tracing protocol stack state machine switching |
| CN102890735A (en) * | 2012-07-09 | 2013-01-23 | 南京南瑞继保电气有限公司 | Modeling method of strategy table and strategy table searching match of stable control device |
| CN105045603A (en) * | 2015-08-24 | 2015-11-11 | 北京金山安全软件有限公司 | Method and device for constructing finite-state machine model framework and electronic device |
| CN105574295A (en) * | 2016-02-02 | 2016-05-11 | 浪潮(北京)电子信息产业有限公司 | Method and device for acquiring state expression of JK trigger |
| CN111638871A (en) * | 2020-05-28 | 2020-09-08 | 深圳市元征科技股份有限公司 | Equipment information processing method, device, equipment and medium |
| CN112733380A (en) * | 2021-01-20 | 2021-04-30 | 北京高码科技有限公司 | Finite state machine based on relational database |
| CN114780594A (en) * | 2022-04-29 | 2022-07-22 | 中国邮政储蓄银行股份有限公司 | Service processing method and processing device based on state machine |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115630090B (en) | 2023-04-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8386636B2 (en) | Business process system management method | |
| CN108279866B (en) | Method, device and medium for arranging and executing business process | |
| CN106681820B (en) | Extensible big data computing method based on message combination | |
| CN112394947B (en) | Information system based on micro-service architecture | |
| CN110764752B (en) | System and method for realizing graphic service arrangement of Restful service | |
| KR20110032222A (en) | Emf model synchronization method and system | |
| CN111240955A (en) | Automatic testing method and device for Http interface, storage medium and electronic device | |
| CN112363845A (en) | Data synchronization method of system integration middling station and integration middling station system | |
| CN110427258A (en) | Scheduling of resource control method and device based on cloud platform | |
| CN103257852A (en) | Method and device for building development environment of distributed application system | |
| CN116483859A (en) | Data query method and device | |
| CN111736810A (en) | Method for dynamically creating node of docker container to execute task based on jenkins real-time task | |
| CN116911588A (en) | Business process execution method, device, equipment and storage medium | |
| CN115525534A (en) | Test case generation method and platform based on swagger interface test | |
| CN111966718B (en) | System and method for data propagation tracking of application systems | |
| CN115630090B (en) | Task state conversion system | |
| CN112817600A (en) | Program annotation compiling method and corresponding device, equipment and medium | |
| CN112365239A (en) | Event-based cloud service management handling method and system | |
| CN110825452A (en) | Cloud service adaptation module management method for multi-cloud management | |
| CN116578282A (en) | Code generation method, device, electronic equipment and medium | |
| CN111488144A (en) | Data processing method and equipment | |
| CN112418796B (en) | Sub-process task node activation method and device, electronic equipment and storage medium | |
| CN114416311A (en) | Method and device for managing message queue based on Go language | |
| CN113485894A (en) | Data acquisition method, device and equipment and readable storage medium | |
| CN114691309A (en) | Batch business processing system, method and device |
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 | ||
| CP01 | Change in the name or title of a patent holder |
Address after: No.12, Saida 4th branch road, economic development zone, Xiqing District, Tianjin Patentee after: Tianjin Yike Automation Co.,Ltd. Address before: No.12, Saida 4th branch road, economic development zone, Xiqing District, Tianjin Patentee before: ELCO (TIANJIN) ELECTRONICS Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: No. 12 Saida Fourth Branch Road, Xiqing Economic and Technological Development Zone, Xiqing District, Tianjin, 300385 Patentee after: Tianjin Yike Automation Co.,Ltd. Address before: No.12, Saida 4th branch road, economic development zone, Xiqing District, Tianjin Patentee before: Tianjin Yike Automation Co.,Ltd. |
|
| CP02 | Change in the address of a patent holder |