CN106227036B - A kind of symmetrical discrete event system On-line Control rule reconstructing method - Google Patents
A kind of symmetrical discrete event system On-line Control rule reconstructing method Download PDFInfo
- Publication number
- CN106227036B CN106227036B CN201610552197.9A CN201610552197A CN106227036B CN 106227036 B CN106227036 B CN 106227036B CN 201610552197 A CN201610552197 A CN 201610552197A CN 106227036 B CN106227036 B CN 106227036B
- Authority
- CN
- China
- Prior art keywords
- state
- monitoring controller
- event
- sup
- inv
- 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.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B13/00—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion
- G05B13/02—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric
- G05B13/04—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric involving the use of models or simulators
- G05B13/042—Adaptive control systems, i.e. systems automatically adjusting themselves to have a performance which is optimum according to some preassigned criterion electric involving the use of models or simulators in which a parameter or coefficient is automatically adjusted to optimise the performance
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Computation (AREA)
- Medical Informatics (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of symmetrical discrete event system On-line Controls to restrain reconstructing method, comprising the following steps: 1) calculate system global automaton model G;2) the automatic machine RG=relabel (G) after heavy label is calculated and the performance indicator after heavy label;3) monitoring controller XRSUP (m, n) in event heavy label system is calculated to obtain;4) the monitoring controller XRSUP (m, n) in event heavy label system is simplified, obtains simplified monitoring controller XRSIM (m, n);5) the monitoring controller NSUP of system after reconstructing when buffer pool size k increase and decrease is calculated;6) the monitoring controller SUP_INV after computational short cut and reconstruct after system monitoring controller NSUP between corresponding states to set SP;7) state of the monitoring controller NSUP of system after simplified monitoring controller SUP_INV and reconstruct is subjected to seamless switching, this method, which can be realized, simplifies original monitoring controller, at the same can be realized simplified monitoring controller and reconstruct after system monitoring controller between online switching.
Description
Technical field
The invention belongs to discrete event system Survey of Supervisory Control Theory field, it is related to a kind of symmetrical discrete event system in line traffic control
System rule reconstructing method.
Background technique
Discrete event system (Discrete-Event Systems, vehicle economy S) such as flexible manufacturing system, computer and logical
Communication network, robot, traffic control system, logistics and data base management system etc. be always control field research hotspot it
One.DES be it is a kind of with physical event occurs and the dynamical system of evolution, these physical events may be unknown and irregular
Occur in time interval.It due to the new system component of sensor fault, introducing or is equilibrium assignment in actual production
Production system input and output side machine quantity and appearance situations such as modify Control performance standard, the supervision designed before will cause
Controller does not adapt to new control requirement.And in order to design the supervisory control system of more flexible, flexible intelligence, just must
It must solve the problems, such as control law on-line reorganization, and further realize the seamless switching of system.
And the research of existing discrete event system control rule reconstruct is concentrated mainly on offline design and goes out between all mode
Handoff relation.Since offline design needs calculated in advance to go out the corresponding all possible control mode of various reconstruct, work as system
There are many component, when such as tens or more, calculate the work that all control mode will be a complexity and be difficult to realize, and
A large amount of memory spaces are needed to store the corresponding monitoring controller of each control mode.It is therefore desirable to study to be calculated with online mode
The monitoring controller of system after reconstruct.Because reconstruct front and back system has certain general character (such as symmetry), often can be by original
Monitoring controller after having supervisory control reconstruct.Furthermore, it is possible to pass through exploitation control software realization and the entire weight of management
Structure process enables system components after reconstruct to continue to complete task unfinished before without returning to original state
Restart work.
Do not consider the problems of Modeling of Discrete-event System that multiple components have identical structure (symmetry) in the past, it is such as more
The identical machine of a function takes workpiece from the same buffer area (Buffer), needs to all events occurred in each machine
It is marked with different digital, causes gained monitoring controller larger.In fact, mutually isostructural component can be with same
Event sets are marked, this is by the structure of largely simplified control device.Therefore when system has the more of variable amounts
When the group identical component of function, this symmetry will export the invariance and repeatability of controller.It, can be using the invariance
The design process for largely simplifying reconfigurable controller, to facilitate the solution of subsequent online switching problem.And by function
Energy same components are marked with same event sets weakens component itself, and control center of gravity has been placed on buffer pool size
(corresponding to the storehouse institute capacity in Petri network), the system after re-flagging have invariance --- template contral (Template
Control), this solves the problems, such as that there is control law reconstruction caused by changing due to system structure important science to grind to efficient
Study carefully meaning and engineering application value, however original monitoring controller cannot be simplified in technology, and not can be carried out online
Switching.
Summary of the invention
It is an object of the invention to overcome the above-mentioned prior art, it is online to provide a kind of symmetrical discrete event system
Control law reconstruction method, this method, which can be realized, simplifies original monitoring controller, while can be realized simplified prison
Online switching after superintending and directing controller and reconstructing between the monitoring controller of system.
In order to achieve the above objectives, symmetrical discrete event system On-line Control rule reconstructing method of the present invention includes following
Step:
1) the automaton model G of various components in system is establishedα, and according to the automaton model G of various components in systemα
Using synchronous integration method calculate system global automaton model G;
2) event heavy label operation is carried out to the global automaton model G and performance indicator BSPEC of system respectively, obtains and marks again
Automatic machine RG=relabel (G) after the note and performance indicator RBSPEC after heavy label, wherein G and RG are denoted as MACH respectively
(m, n) and RMACH (m, n);
3) the automatic machine RG after the heavy label and performance indicator RBSPEC after heavy label is calculated by the supcon in TCT software
Method calculates to obtain monitoring controller XRSUP (m, n) in event heavy label system;
4) call TCT software in supreduce algorithm in event heavy label system monitoring controller XRSUP (m,
N) simplified, obtain simplified monitoring controller XRSIM (m, n), and XRSIM (m, n) is denoted as SUP_INV;
5) when component increase or delete when, simplified monitoring controller SUP_INV is remained unchanged, thus need to only generate by
The corresponding monitoring controller of system calculates buffer pool size k if buffer pool size is k after buffer pool size increase and decrease triggering reconstruct
The monitoring controller NSUP of system after being reconstructed when increase and decrease;
6) it establishes corresponding between simplified monitoring controller SUP_INV and the monitoring controller NSUP of system after reconstruct
State set is to relationship, after the monitoring controller SUP_INV and reconstruct after computational short cut between the monitoring controller NSUP of system
Corresponding states set to set CSP;
7) the corresponding states set obtained according to step 6) to set CSP by simplified monitoring controller SUP_INV with
The state of the monitoring controller NSUP of system carries out seamless switching after reconstruct.
The concrete operations of step 1) are as follows: establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,
Qα,m), wherein QαFor GαState set, ∑αFor GαEvent sets, δαFor GαTransfer function, qα,0For GαInitial shape
State, Qα,mFor GαIdentification-state set;Further according to the automaton model G of component each in systemα=(Qα,∑α,δα,qα,0,Qα,m)
Utilize the global automaton model G of synchronous integration method computing system;Wherein, equal for the automaton model of component each in system
Using the form storage state transfer relationship of 3 tuples lists, 3 tuples list includes three column, wherein first row storage source shape
State, secondary series store event title, third column storage dbjective state, the currently active state of source status representative system, event generation
Table has the event that qualification occurs under current state, and dbjective state represents the state reached via generable event;If
There is β event under a source state, then there are β rows in list;
Establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,Qα,m) concrete operations are as follows:
101) event sets in the various components of controlled system are defined, wherein different event name is different, and foundation is used for
The status list State_list of storage system status;
102) using the original state of system as the first row in first source state write state list State_list
The position of first row, and will be in the original state write state list State_list of system;
103) dynamic process of analytic unit is established the event that can occur under the source state, is located under the original state
β event can occur;
104) by the first column position of the source state write state list State_list next line, next event is write
Enter the second column position of the row, then determine the state that the source state is reached after event generation, by the source state in the thing
State achieved is denoted as dbjective state after part occurs, when dbjective state is already present in status list State_list,
Status list State_list is constant;When dbjective state is not present in status list State_list, then by the mesh
Mark state is stored in the third column position of the row;
105) it repeats 104) until β transfer relationship whole write state list State_ corresponding with β event
Until list;
106) judge whether current source state is the last one state in status list, when current source state is status Bar
In table State_list when the last one state, then step 108) is gone to;When current source state is not status list State_
In list when the last one state, then step 107) is gone to;
107) next state is taken out from status list State_list, and will be taken out from status list State_list
Next state as new source state, and go to step 103);
108) the status list State_list for obtaining step 106) is as the automaton model of the component;
109) repeat step 101) -108) Ergodic Theory all components, obtain the automaton model of all components in system
Gα;By the automaton model G of all components in systemαCorresponding document, and root are inputted and created by the prompt of TCT program Create
Pass through the global automaton model G of TCT program Sync computing system according to the file of creation;
G=Sync (MIN1,…,MINm,MOUT1,…,MOUTn)
Wherein, MINγFor the γ input side component in system, 1≤γ≤m, MOUTλFor the λ outlet side group in system
Part, 1≤λ≤n;M is the number of input side component in system, and n is the number of outlet side component in system.
The concrete operations of step 2) are as follows:
Event heavy label relabel operation is carried out respectively to the global automaton model G and performance indicator BSPEC of system,
Automatic machine RG=relabel (G) after the obtaining heavy label and performance indicator RBSPEC=relabel (BSPEC) after heavy label, then
G and RG are denoted as MACH (m, n) and RMACH (m, n) respectively, wherein to the global automaton model G and performance indicator of system
BSPEC carry out the concrete operations of event heavy label operation respectively the following steps are included:
201) by global automaton model G=(Q, ∑, δ, the q of system0,Qm) traversal lists in each transfer < source state,
Event title, dbjective state > event title replaced one by one by heavy label rule, derive from Motivation Model G'=(Q, T, δ,
q0,Qm), wherein Q is the state set of G, and ∑ is the event sets of G, and δ is the transfer function of G, q0For the original state of G, QmFor
The identification-state set of G, event sets ∑ are denoted as T after event heavy label;
202) by automaton model G'=(Q, T, δ, q0,Qm) in { q0It is used as original state, to the thing after heavy label
Each event t in part set T successively generates subsets of states according to δ (S, t)=∪ { δ (q, t) | q ∈ S },To have generated
Subsets of states;
203) step 202) is repeated, until not new subsets of states generates, is obtained in all subsets of states containing mark
The subset of knowledge state;
204) using the subset for containing identification-state in all subsets of states that step 203) obtains as identification-state subset
Qm, automatic machine RG=relabel (G) after obtaining heavy label;
205) the performance indicator RBSPEC after heavy label is calculated, wherein RBSPEC=relabel (BSPEC).
The table of the monitoring controller XRSUP (m, n) in step 3) in event heavy label system is calculated using supcon algorithm
Up to formula are as follows:
XRSUP (m, n)=supcon (RMACH (m, n), RBSPEC)
The expression formula of simplified monitoring controller XRSIM (m, n) in step 4) are as follows:
XRSIM (m, n)=supreduce (RMACH (m, n), XRSUP (m, n), XRSUP (m, n) .dat)
XRSUP (m, n) .dat=condat (RMACH (m, n), XRSUP (m, n))
Wherein, supreduce algorithm is for calculating the corresponding simplified monitoring controller of monitoring controller XRSUP (m, n)
XRSIM (m, n), calculated result XRSUP (m, n) .dat are stored with forbidden in each state in monitoring controller XRSUP (m, n)
Controllable event sets.
The concrete operations of step 5) are as follows:
When component increases or deletes, monitoring controller SUP_INV:=(X, T, ξ, x0,Xm) remain unchanged, therefore only need
It generates and the corresponding monitoring controller of system after triggering reconstructs is increased and decreased by buffer pool size, wherein the state set of X expression SUP_INV
It closes, T indicates that the event sets of SUP_INV, ξ indicate the transfer function of SUP_INV, x0Indicate the original state of SUP_INV, XmTable
Show the identification-state set of SUP_INV, if buffer pool size is k, wherein when buffer pool size k increases by 1, after generating reconstruct
The concrete operations of the corresponding monitoring controller NSUP of system are as follows:
501a) buffer pool size k increases by 1, adds state xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
502a) buffer pool size k increases by 1, increases the corresponding transfer ξ (x of event a1, a2, b1 and b2ij,a1)、ξ
(xij,a2)、ξ(xij, b1) and ξ (xij, b2), wherein
ξ(xij, a1) and=xi,j+1, i ∈ { 0 ..., k }, j=k-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k }, j=k+1-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k+1 }, j=k+1-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
When buffer pool size reduces 1, the concrete operations of the corresponding monitoring controller of system after reconstruct are generated are as follows:
501b) delete state xij, i ∈ 0 ..., and k }, j=k-i;
502b) the corresponding transfer ξ (x of deletion event a1, a2, b1 and b2ij,a1)、ξ(xij,a2)、ξ(xij, b1) and ξ
(xij, b2), wherein
ξ(xij, a1) and=xi,j+1, i ∈ { 0 ..., k-1 }, j=k-1-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k-1 }, j=k-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k }, j=k-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k }, j=k-i.
The concrete operations of step 6) are as follows:
Establish simplified monitoring controller SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween corresponding states set to relationship, wherein Z indicate NSUP state set,Indicate NSUP
Transfer function, z0Indicate the original state of NSUP, ZmIndicate the identification-state set of NSUP, SUP_INV has identical with NSUP
Event sets, the event sets of NSUP are still indicated with T, enable (ori_ex, ori_ev, ori_en) ∈ ori_SUP, (new_ex,
New_ev, new_en) ∈ new_SUP, wherein ori_SUP indicates the state transfer relationship list of SUP_INV, ori_ex, ori_
Ev and ori_en respectively indicates the source state, event title and dbjective state shifted in SUP_INV, and new_SUP indicates NSUP's
State transfer relationship list, new_ex, new_ev and new_en respectively indicate the source state, event title and mesh shifted in NSUP
Mark state, then monitoring controller SUP_INV:=(X, T, ξ, the x after computational short cut0,Xm) with reconstruct after system Supervised Control
DeviceBetween corresponding states set to set CSP, wherein the monitoring controller after computational short cut
SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween correspondence shape
Concrete operations of the state set to set CSP are as follows:
601) intermediate variable corresponding states is introduced to set SP, initializes simplified monitoring controller SUP_INV and again
Corresponding states after structure between the monitoring controller NSUP of system is { (0,0) } to set SP;
602) to each transfer (ori_ex, ori_ev, ori_en), each tuple (sp_ori, sp_ in SP are successively searched
New) with new_SUP in each tuple (new_ex, new_ev, new_en), wherein sp_ori, sp_new indicate SUP_INV with
Corresponding states pair between NSUP, as ori_ex=sp_ori, sp_new=new_ex and ori_ev=new_ev, then by tuple
(ori_en, new_en) be added to simplified monitoring controller SUP_INV and reconstruct after system monitoring controller NSUP it
Between corresponding states in set SP;
603) it repeats step 602) and traverses all of state transfer relationship list in simplified monitoring controller SUP_INV
Until transfer;
604) the correspondence shape of each state q in the state transfer relationship list of simplified monitoring controller SUP_INV is set
State set CSqFor empty set, successively finding step 602) obtain to system after simplified monitoring controller SUP_INV and reconstruct
Monitoring controller NSUP between corresponding states to tuple (sp_ori, sp_new) each in set SP, if sp_ori=q,
Sp_new is then added to the corresponding states set CS of state qqIn;After lookup, by tuple (q, CSq) corresponding states collection is added
It closes in set CSP;
605) institute is stateful in the state transfer relationship list of the simplified monitoring controller SUP_INV of traversal, obtains simplification
Corresponding states set after rear monitoring controller SUP_INV and reconstruct between the monitoring controller NSUP of system is to set CSP.
The concrete operations of step 7) are as follows:
It records current activation state q of simplified monitoring controller SUP_INV during monitoring and has executed event
String s, the existence z ∈ Z in the monitoring controller NSUP of system after reconstruct, andThen directly it is switched to from state q
Z, then new system is run under the monitoring of the monitoring controller NSUP of system after reconstitution;Otherwise, then dijkstra's algorithm is utilized
Found in the monitoring controller NSUP of system after reconstitution with the shortest state q' in the path current activation state q, and state q' is deposited
In corresponding states set, state q to the shortest path between state q' is denoted as s ", state q0Shortest path to state q'
Diameter is denoted as s', from the current activation state q execution route s " of simplified monitoring controller SUP_INV by simplified prison
The current activation state for superintending and directing controller SUP_INV is updated to state q', and from the initial shape of the monitoring controller NSUP after reconstruct
State z0Virtual execution of setting out path s' is to stateThen it is switched to state z' from state q', new system is after reconstitution
It is run under the monitoring of the monitoring controller NSUP of system.
The invention has the following advantages:
Symmetrical discrete event system On-line Control of the present invention restrains reconstructing method, then when specific operation, based on marking again
Automatic machine RG after the note and performance indicator RBSPEC after heavy label calculates to obtain event weight by the supcon algorithm in TCT software
Monitoring controller XRSUP (m, n) in tagging system recycles the supreduce algorithm in TCT software to event heavy label system
Monitoring controller XRSUP (m, n) in system is simplified, to largely reduce controlled device and monitoring controller
Scale.In addition, between monitoring controller NSUP of the present invention using system after simplified monitoring controller SUP_INV and reconstruct
Corresponding states the monitoring controller NSUP of system after simplified monitoring controller SUP_INV and reconstruct is realized to set SP
State carries out seamless switching, cutting between the monitoring controller of system online after realizing simplified monitoring controller and reconstructing
It changes, thus keep system operation more flexible, it is more easy to maintain, discrete event system method for supervision and control is effectively advanced in reality
The application of occasion.
Detailed description of the invention
Fig. 1 is the schematic diagram of event heavy label function in the present invention;
Fig. 2 is the schematic diagram of certain manufacture system in the present invention;
Fig. 3 is the schematic diagram of monitoring controller invariance in heavy label system in the present invention;
Fig. 4 is the schematic diagram that discrete event system control restrains restructuring procedure in the present invention;
Fig. 5 is the schematic diagram of automaton model construction process in the present invention.
Specific embodiment
The invention will be described in further detail with reference to the accompanying drawing:
With reference to Fig. 1, symmetrical discrete event system On-line Control rule reconstructing method of the present invention the following steps are included:
1) the automaton model G of various components in system is establishedα, and according to the automaton model G of various components in systemα
Using synchronous integration method calculate system global automaton model G;
The concrete operations of step 1) are as follows: establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,
Qα,m), wherein QαFor GαState set, ∑αFor GαEvent sets, δαFor GαTransfer function, qα,0For GαInitial shape
State, Qα,mFor GαIdentification-state set;Further according to the automaton model G of component each in systemα=(Qα,∑α,δα,qα,0,Qα,m)
Utilize the global automaton model G of synchronous integration method computing system;Wherein, equal for the automaton model of component each in system
Using the form storage state transfer relationship of 3 tuples lists, 3 tuples list includes three column, wherein first row storage source shape
State, secondary series store event title, third column storage dbjective state, the currently active state of source status representative system, event generation
Table has the event that qualification occurs under current state, and dbjective state represents the state reached via generable event;If
There is β event under a source state, then there are β rows in list;
Establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,Qα,m) concrete operations are as follows:
101) event sets in the various components of controlled system are defined, wherein different event name is different, and foundation is used for
The status list State_list of storage system status;
102) using the original state of system as the first row in first source state write state list State_list
The position of first row, and will be in the original state write state list State_list of system;
103) dynamic process of analytic unit is established the event that can occur under the source state, is located under the original state
β event can occur;
104) by the first column position of the source state write state list State_list next line, next event is write
Enter the second column position of the row, then determine the state that the source state is reached after event generation, by the source state in the thing
State achieved is denoted as dbjective state after part occurs, when dbjective state is already present in status list State_list,
Status list State_list is constant;When dbjective state is not present in status list State_list, then by the mesh
Mark state is stored in the third column position of the row;
105) it repeats 104) until β transfer relationship whole write state list State_ corresponding with β event
Until list;
106) judge whether current source state is the last one state in status list, when current source state is status Bar
In table State_list when the last one state, then step 108) is gone to;When current source state is not status list State_
In list when the last one state, then step 107) is gone to;
107) next state is taken out from status list State_list, and will be taken out from status list State_list
Next state as new source state, and go to step 103);
108) the status list State_list for obtaining step 106) is as the automaton model of the component;
109) repeat step 101) -108) Ergodic Theory all components, obtain the automaton model of all components in system
Gα;By the automaton model G of all components in systemαCorresponding document, and root are inputted and created by the prompt of TCT program Create
Pass through the global automaton model G of TCT program Sync computing system according to the file of creation;
G=Sync (MIN1,…,MINm,MOUT1,…,MOUTn)
Wherein, MINγFor the γ input side component in system, 1≤γ≤m, MOUTλFor the λ outlet side group in system
Part, 1≤λ≤n;M is the number of input side component in system, and n is the number of outlet side component in system.
2) event heavy label operation is carried out to the global automaton model G and performance indicator BSPEC of system respectively, obtains and marks again
Automatic machine RG=relabel (G) after the note and performance indicator RBSPEC after heavy label, wherein G and RG are denoted as MACH respectively
(m, n) and RMACH (m, n);
The concrete operations of step 2) are as follows:
Event heavy label relabel operation is carried out respectively to the global automaton model G and performance indicator BSPEC of system,
Automatic machine RG=relabel (G) after the obtaining heavy label and performance indicator RBSPEC=relabel (BSPEC) after heavy label, then
G and RG are denoted as MACH (m, n) and RMACH (m, n) respectively, wherein to the global automaton model G and performance indicator of system
BSPEC carry out the concrete operations of event heavy label operation respectively the following steps are included:
201) by global automaton model G=(Q, ∑, δ, the q of system0,Qm) traversal lists in each transfer < source state,
Event title, dbjective state > event title replaced one by one by heavy label rule, derive from Motivation Model G'=(Q, T, δ,
q0,Qm), wherein Q is the state set of G, and ∑ is the event sets of G, and δ is the transfer function of G, q0For the original state of G, QmFor
The identification-state set of G, event sets ∑ are denoted as T after event heavy label;
202) by automaton model G'=(Q, T, δ, q0,Qm) in { q0It is used as original state, to the thing after heavy label
Each event t in part set T successively generates subsets of states according to δ (S, t)=∪ { δ (q, t) | q ∈ S },To have generated
Subsets of states;
203) step 202) is repeated, until not new subsets of states generates, is obtained in all subsets of states containing mark
The subset of knowledge state;
204) using the subset for containing identification-state in all subsets of states that step 203) obtains as identification-state subset
Qm, automatic machine RG=relabel (G) after obtaining heavy label;
205) the performance indicator RBSPEC after heavy label is calculated, wherein RBSPEC=relabel (BSPEC).
3) the automatic machine RG after the heavy label and performance indicator RBSPEC after heavy label is calculated by the supcon in TCT software
Method calculates to obtain monitoring controller XRSUP (m, n) in event heavy label system, wherein
XRSUP (m, n)=supcon (RMACH (m, n), RBSPEC)
4) call TCT software in supreduce algorithm in event heavy label system monitoring controller XRSUP (m,
N) simplified, obtain simplified monitoring controller XRSIM (m, n), and XRSIM (m, n) is denoted as SUP_INV;
The expression formula of simplified monitoring controller XRSIM (m, n) in step 4) are as follows:
XRSIM (m, n)=supreduce (RMACH (m, n), XRSUP (m, n), XRSUP (m, n) .dat)
XRSUP (m, n) .dat=condat (RMACH (m, n), XRSUP (m, n))
Wherein, supreduce algorithm is for calculating the corresponding simplified monitoring controller of monitoring controller XRSUP (m, n)
XRSIM (m, n), calculated result XRSUP (m, n) .dat are stored with forbidden in each state in monitoring controller XRSUP (m, n)
Controllable event sets.
5) when component increase or delete when, simplified monitoring controller SUP_INV is remained unchanged, thus need to only generate by
The corresponding monitoring controller of system calculates buffer pool size k if buffer pool size is k after buffer pool size increase and decrease triggering reconstruct
The monitoring controller NSUP of system after being reconstructed when increase and decrease;
The concrete operations of step 5) are as follows:
When component increases or deletes, monitoring controller SUP_INV:=(X, T, ξ, x0,Xm) remain unchanged, therefore only need
It generates and the corresponding monitoring controller of system after triggering reconstructs is increased and decreased by buffer pool size, wherein the state set of X expression SUP_INV
It closes, T indicates that the event sets of SUP_INV, ξ indicate the transfer function of SUP_INV, x0Indicate the original state of SUP_INV, XmTable
Show the identification-state set of SUP_INV, if buffer pool size is k, wherein when buffer pool size k increases by 1, after generating reconstruct
The concrete operations of the corresponding monitoring controller NSUP of system are as follows:
501a) buffer pool size k increases by 1, adds state xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
502a) buffer pool size k increases by 1, increases the corresponding transfer ξ (x of event a1, a2, b1 and b2ij,a1)、ξ
(xij,a2)、ξ(xij, b1) and ξ (xij, b2), wherein
ξ(xij, a1) and=xi,j+1, i ∈ { 0 ..., k }, j=k-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k }, j=k+1-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k+1 }, j=k+1-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
When buffer pool size reduces 1, the concrete operations of the corresponding monitoring controller of system after reconstruct are generated are as follows:
501b) delete state xij, i ∈ 0 ..., and k }, j=k-i;
502b) the corresponding transfer ξ (x of deletion event a1, a2, b1 and b2ij,a1)、ξ(xij,a2)、ξ(xij, b1) and ξ
(xij, b2), wherein
ξ(xij, a1) and=xi,j+1, i ∈ { 0 ..., k-1 }, j=k-1-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k-1 }, j=k-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k }, j=k-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k }, j=k-i.
6) it establishes corresponding between simplified monitoring controller SUP_INV and the monitoring controller NSUP of system after reconstruct
State set is to relationship, after the monitoring controller SUP_INV and reconstruct after computational short cut between the monitoring controller NSUP of system
Corresponding states set to set CSP;
The concrete operations of step 6) are as follows:
Establish simplified monitoring controller SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween corresponding states set to relationship, wherein Z indicate NSUP state set,Indicate NSUP
Transfer function, z0Indicate the original state of NSUP, ZmIndicate the identification-state set of NSUP, SUP_INV has identical with NSUP
Event sets, the event sets of NSUP are still indicated with T, enable (ori_ex, ori_ev, ori_en) ∈ ori_SUP, (new_ex,
New_ev, new_en) ∈ new_SUP, wherein ori_SUP indicates the state transfer relationship list of SUP_INV, ori_ex, ori_
Ev and ori_en respectively indicates the source state, event title and dbjective state shifted in SUP_INV, and new_SUP indicates NSUP's
State transfer relationship list, new_ex, new_ev and new_en respectively indicate the source state, event title and mesh shifted in NSUP
Mark state, then monitoring controller SUP_INV:=(X, T, ξ, the x after computational short cut0,Xm) with reconstruct after system Supervised Control
DeviceBetween corresponding states set to set CSP, wherein the monitoring controller after computational short cut
SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween correspondence shape
Concrete operations of the state set to set CSP are as follows:
601) intermediate variable corresponding states is introduced to set SP, initializes simplified monitoring controller SUP_INV and again
Corresponding states after structure between the monitoring controller NSUP of system is { (0,0) } to set SP;
602) to each transfer (ori_ex, ori_ev, ori_en), each tuple (sp_ori, sp_ in SP are successively searched
New) with new_SUP in each tuple (new_ex, new_ev, new_en), wherein sp_ori, sp_new indicate SUP_INV with
Corresponding states pair between NSUP, as ori_ex=sp_ori, sp_new=new_ex and ori_ev=new_ev, then by tuple
(ori_en, new_en) be added to simplified monitoring controller SUP_INV and reconstruct after system monitoring controller NSUP it
Between corresponding states in set SP;
603) it repeats step 602) and traverses all of state transfer relationship list in simplified monitoring controller SUP_INV
Until transfer;
604) the correspondence shape of each state q in the state transfer relationship list of simplified monitoring controller SUP_INV is set
State set CSqFor empty set, successively finding step 602) obtain to system after simplified monitoring controller SUP_INV and reconstruct
Monitoring controller NSUP between corresponding states to tuple (sp_ori, sp_new) each in set SP, if sp_ori=q,
Sp_new is then added to the corresponding states set CS of state qqIn;After lookup, by tuple (q, CSq) corresponding states collection is added
It closes in set CSP;
605) institute is stateful in the state transfer relationship list of the simplified monitoring controller SUP_INV of traversal, obtains simplification
Corresponding states set after rear monitoring controller SUP_INV and reconstruct between the monitoring controller NSUP of system is to set CSP.
7) the corresponding states set obtained according to step 6) to set CSP by simplified monitoring controller SUP_INV with
The state of the monitoring controller NSUP of system carries out seamless switching after reconstruct.
The concrete operations of step 7) are as follows:
It records current activation state q of simplified monitoring controller SUP_INV during monitoring and has executed event
String s, the existence z ∈ Z in the monitoring controller NSUP of system after reconstruct, andThen directly it is switched to from state q
Z, then new system is run under the monitoring of the monitoring controller NSUP of system after reconstitution;Otherwise, then dijkstra's algorithm is utilized
Found in the monitoring controller NSUP of system after reconstitution with the shortest state q' in the path current activation state q, and state q' is deposited
In corresponding states set, state q to the shortest path between state q' is denoted as s ", state q0Shortest path to state q'
Diameter is denoted as s', from the current activation state q execution route s " of simplified monitoring controller SUP_INV by simplified prison
The current activation state for superintending and directing controller SUP_INV is updated to state q', and from the initial shape of the monitoring controller NSUP after reconstruct
State z0Virtual execution of setting out path s' is to stateThen it is switched to state z' from state q', new system is after reconstitution
It is run under the monitoring of the monitoring controller NSUP of system.
Claims (8)
1. a kind of symmetrical discrete event system On-line Control restrains reconstructing method, which comprises the following steps:
1) the automaton model G of various components in system is establishedα, and according to the automaton model G of various components in systemαIt utilizes
Synchronous integration method calculate system global automaton model G;
2) event heavy label operation is carried out respectively to the global automaton model G and performance indicator BSPEC of system, after obtaining heavy label
Automatic machine RG=relabel (G) and heavy label after performance indicator RBSPEC, wherein by G and RG be denoted as respectively MACH (m,
And RMACH (m, n) n);
3) the automatic machine RG after the heavy label and performance indicator RBSPEC after heavy label passes through the supcon algorithm meter in TCT software
Calculate to obtain monitoring controller XRSUP (m, n) in event heavy label system;
4) call TCT software in supreduce algorithm to the monitoring controller XRSUP (m, n) in event heavy label system into
Row simplifies, and obtains simplified monitoring controller XRSIM (m, n), and XRSIM (m, n) is denoted as SUP_INV;
5) when component increases or deletes, simplified monitoring controller SUP_INV is remained unchanged, therefore need to only be generated by buffering
The corresponding monitoring controller of system calculates buffer pool size k increase and decrease if buffer pool size is k after the increase and decrease triggering reconstruct of area's capacity
When reconstruct after system monitoring controller NSUP;
6) corresponding states after establishing simplified monitoring controller SUP_INV and reconstructing between the monitoring controller NSUP of system
Pair of the set to relationship, after the monitoring controller SUP_INV and reconstruct after computational short cut between the monitoring controller NSUP of system
Answer state set to set CSP;
7) the corresponding states set obtained according to step 6) by simplified monitoring controller SUP_INV and reconstructs set CSP
The state of the monitoring controller NSUP of system carries out seamless switching afterwards.
2. symmetrical discrete event system On-line Control according to claim 1 restrains reconstructing method, which is characterized in that step 1)
Concrete operations are as follows: establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,Qα,m), wherein QαFor Gα's
State set, ∑αFor GαEvent sets, δαFor GαTransfer function, qα,0For GαOriginal state, Qα,mFor GαIdentification-state
Set;Further according to the automaton model G of component each in systemα=(Qα,∑α,δα,qα,0,Qα,m) utilize synchronous integration method calculating system
The global automaton model G of system;Wherein, the form of 3 tuples lists is all made of for the automaton model of component each in system
Storage state transfer relationship, 3 tuples list include three column, wherein first row storage source state, secondary series store event name
Claim, third column storage dbjective state, the currently active state of source status representative system, event is represented has hair under current state
The event of production-goods lattice, dbjective state represent the state reached via generable event;If there is β thing under a source state
Part occurs, then there are β rows in list;
Establish the automaton model G of each component in systemα=(Qα,∑α,δα,qα,0,Qα,m) concrete operations are as follows:
101) event sets in the various components of controlled system are defined, wherein different event name is different, establishes for storing
The status list State_list of system mode;
102) using the original state of system as the first row first in first source state write state list State_list
The position of column, and will be in the original state write state list State_list of system;
103) dynamic process of analytic unit establishes the event that can occur under the source state, and being located at can under the source state
β event occurs;
It 104), should the write-in of next event by the first column position of the source state write state list State_list next line
The second capable column position, then determine the state that the source state is reached after event generation, which is sent out in the event
State achieved is denoted as dbjective state after life, when dbjective state is already present in status list State_list, state
List State_list is constant;When dbjective state is not present in status list State_list, then by the target-like
State is stored in the third column position of the row;
105) it repeats 104) until β transfer relationship whole write state list State_list corresponding with β event is
Only;
106) judge whether current source state is the last one state in status list, when current source state is status list
In State_list when the last one state, then step 108) is gone to;When current source state is not status list State_list
In the last one state when, then go to step 107);
107) next state is taken out from status list State_list, and will be under status list State_list taking-up
One state goes to step 103) as new source state;
108) the status list State_list for obtaining step 106) is as the automaton model of the component;
109) repeat step 101) -108) Ergodic Theory all components, obtain the automaton model G of all components in systemα;It will
The automaton model G of all components in systemαCorresponding document is inputted and creates by the prompt of TCT program Create, and according to wound
The file built passes through the global automaton model G of TCT program Sync computing system;
G=Sync (MIN1,…,MINm,MOUT1,…,MOUTn)
Wherein, MINγFor the γ input side component in system, 1≤γ≤m, MOUTλFor the λ outlet side component in system, 1
≤λ≤n;M is the number of input side component in system, and n is the number of outlet side component in system.
3. symmetrical discrete event system On-line Control according to claim 2 restrains reconstructing method, which is characterized in that step 2)
Concrete operations are as follows:
Event heavy label relabel operation is carried out to the global automaton model G and performance indicator BSPEC of system respectively, obtains weight
Automatic machine RG=relabel (G) after the label and performance indicator RBSPEC=relabel (BSPEC) after heavy label, then by G
And RG is denoted as MACH (m, n) and RMACH (m, n) respectively, wherein to the global automaton model G and performance indicator BSPEC of system
Respectively carry out the operation of event heavy label concrete operations the following steps are included:
201) by global automaton model G=(Q, ∑, δ, the q of system0,Qm) traversal lists in each transfer < source state, event
Title, dbjective state > event title replaced one by one by heavy label rule, derive from Motivation Model G'=(Q, T, δ, q0,
Qm), wherein Q is the state set of G, and ∑ is the event sets of G, and δ is the transfer function of G, q0For the original state of G, QmFor G's
Identification-state set, event sets ∑ are denoted as T after event heavy label;
202) by automaton model G'=(Q, T, δ, q0,Qm) in { q0It is used as original state, to the event set after heavy label
The each event t closed in T successively generates subsets of states according to δ (S, t)=∪ { δ (q, t) | q ∈ S },For generated shape
State subset;
203) step 202) is repeated, until not new subsets of states generates, is obtained in all subsets of states containing mark shape
The subset of state;
204) using the subset for containing identification-state in all subsets of states that step 203) obtains as identification-state subset Qm, obtain
Automatic machine RG=relabel (G) after heavy label;
205) the performance indicator RBSPEC after heavy label is calculated, wherein RBSPEC=relabel (BSPEC).
4. symmetrical discrete event system On-line Control according to claim 1 restrains reconstructing method, which is characterized in that utilize
Supcon algorithm calculates the expression formula of the monitoring controller XRSUP (m, n) in step 3) in event heavy label system are as follows:
XRSUP (m, n)=supcon (RMACH (m, n), RBSPEC).
5. symmetrical discrete event system On-line Control according to claim 4 restrains reconstructing method, which is characterized in that step 4)
In simplified monitoring controller XRSIM (m, n) expression formula are as follows:
XRSIM (m, n)=supreduce (RMACH (m, n), XRSUP (m, n), XRSUP (m, n) .dat)
XRSUP (m, n) .dat=condat (RMACH (m, n), XRSUP (m, n))
Wherein, condat algorithm is the information based on controlled device RMACH (m, n), is calculated in monitoring controller XRSUP (m, n)
Each forbidden event information of state, supreduce algorithm is for calculating the corresponding simplified prison of monitoring controller XRSUP (m, n)
Controller XRSIM (m, n) is superintended and directed, calculated result XRSUP (m, n) .dat is stored in monitoring controller XRSUP (m, n) in each state
Forbidden controllable event sets.
6. symmetrical discrete event system On-line Control according to claim 5 restrains reconstructing method, which is characterized in that step 5)
Concrete operations are as follows:
When component increases or deletes, monitoring controller SUP_INV is remained unchanged, therefore need to only be generated and be increased and decreased by buffer pool size
The corresponding monitoring controller of system after triggering reconstruct, wherein X indicates that the state set of SUP_INV, T indicate the event of SUP_INV
Set, ξ indicate the transfer function of SUP_INV, x0Indicate the original state of SUP_INV, XmIndicate the identification-state collection of SUP_INV
It closes, if buffer pool size is k, wherein when buffer pool size k increases by 1, generate the corresponding monitoring controller of system after reconstruct
The concrete operations of NSUP are as follows:
501a) buffer pool size k increases by 1, adds state xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
502a) buffer pool size k increases by 1, increases the corresponding transfer ξ (x of event a1, a2, b1 and b2ij,a1)、ξ(xij,
a2)、ξ(xij,) and ξ (x b1ij, b2), wherein
ξ(xij, a1) and=xi,j+ 1, i ∈ { 0 ..., k }, j=k-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k }, j=k+1-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k+1 }, j=k+1-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k+1 }, j=k+1-i;
When buffer pool size reduces 1, the concrete operations of the corresponding monitoring controller of system after reconstruct are generated are as follows:
501b) delete state xij, i ∈ 0 ..., and k }, j=k-i;
502b) the corresponding transfer ξ (x of deletion event a1, a2, b1 and b2ij,a1)、ξ(xij,a2)、ξ(xij, b1) and ξ (xij,
B2), wherein
ξ(xij, a1) and=xi,j+1, i ∈ { 0 ..., k-1 }, j=k-1-i,
ξ(xij, a2) and=xi+1,j-1, i ∈ { 0 ..., k-1 }, j=k-i,
ξ(xij, b1) and=xi-1,j, i ∈ { 1 ..., k }, j=k-i,
ξ(xij, b2) and=xij, i ∈ 0 ..., and k }, j=k-i.
7. symmetrical discrete event system On-line Control according to claim 6 restrains reconstructing method, which is characterized in that step 6)
Concrete operations are as follows:
Establish simplified monitoring controller SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween corresponding states set to relationship, wherein Z indicate NSUP state set,Indicate NSUP
Transfer function, z0Indicate the original state of NSUP, ZmIndicate the identification-state set of NSUP, SUP_INV has identical with NSUP
Event sets, the event sets of NSUP are still indicated with T, enable (ori_ex, ori_ev, ori_en) ∈ ori_SUP, (new_ex,
New_ev, new_en) ∈ new_SUP, wherein ori_SUP indicates the state transfer relationship list of SUP_INV, ori_ex, ori_
Ev and ori_en respectively indicates the source state, event title and dbjective state shifted in SUP_INV, and new_SUP indicates NSUP's
State transfer relationship list, new_ex, new_ev and new_en respectively indicate the source state, event title and mesh shifted in NSUP
Mark state, then monitoring controller SUP_INV:=(X, T, ξ, the x after computational short cut0,Xm) with reconstruct after system Supervised Control
DeviceBetween corresponding states set to set CSP, wherein the monitoring controller after computational short cut
SUP_INV:=(X, T, ξ, x0,Xm) with reconstruct after system monitoring controllerBetween correspondence shape
Concrete operations of the state set to set CSP are as follows:
601) intermediate variable corresponding states is introduced to set SP, after initializing simplified monitoring controller SUP_INV and reconstruct
Corresponding states between the monitoring controller NSUP of system is { (0,0) } to set SP;
602) to each transfer (ori_ex, ori_ev, ori_en), successively search in SP each tuple (sp_ori, sp_new) with
Each tuple (new_ex, new_ev, new_en) in new_SUP, wherein sp_ori, sp_new indicate SUP_INV and NSUP it
Between corresponding states pair, as ori_ex=sp_ori, sp_new=new_ex and ori_ev=new_ev, then by tuple (ori_
En, new_en) be added to simplified monitoring controller SUP_INV and reconstruct after system monitoring controller NSUP between pair
Answer state in set SP;
603) all transfers that step 602) traverses state transfer relationship list in simplified monitoring controller SUP_INV are repeated
Until;
604) the corresponding states collection of each state q in the state transfer relationship list of simplified monitoring controller SUP_INV is set
Close CSqFor empty set, successively finding step 602) supervision of system after obtained simplified monitoring controller SUP_INV and reconstruct
Corresponding states between controller NSUP is to tuple (sp_ori, sp_new) each in set SP, if sp_ori=q, by sp_
The corresponding states set CS of new addition state qqIn;After lookup, by tuple (q, CSq) corresponding states set is added to set
In CSP;
605) institute is stateful in the state transfer relationship list of the simplified monitoring controller SUP_INV of traversal, obtains simplified
Monitoring controller SUP_INV and reconstruct after system monitoring controller NSUP between corresponding states set to set CSP.
8. symmetrical discrete event system On-line Control according to claim 7 restrains reconstructing method, which is characterized in that step 7)
Concrete operations are as follows:
It records current activation state q of simplified monitoring controller SUP_INV during monitoring and has executed event string s,
The existence z ∈ Z in the monitoring controller NSUP of system after reconstruct, andIt directly then is switched to z from state q, so
New system is run under the monitoring of the monitoring controller NSUP of system after reconstitution afterwards;Otherwise, then using dijkstra's algorithm in weight
Found in the monitoring controller NSUP of system after structure with the shortest state q' in the path current activation state q, and state q' exist pair
State set is answered, state q to the shortest path between state q' is denoted as s ", state q0To the shortest path note between state q'
Make s', controls simplified supervision from the current activation state q execution route s " of simplified monitoring controller SUP_INV
The current activation state of device SUP_INV processed is updated to state q', and from the original state z of the monitoring controller NSUP after reconstruct0
Virtual execution of setting out path s' is to stateThen state z' is switched to from state q', new system system after reconstitution
Monitoring controller NSUP monitoring under run.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610552197.9A CN106227036B (en) | 2016-07-13 | 2016-07-13 | A kind of symmetrical discrete event system On-line Control rule reconstructing method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610552197.9A CN106227036B (en) | 2016-07-13 | 2016-07-13 | A kind of symmetrical discrete event system On-line Control rule reconstructing method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN106227036A CN106227036A (en) | 2016-12-14 |
CN106227036B true CN106227036B (en) | 2019-03-01 |
Family
ID=57520193
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610552197.9A Expired - Fee Related CN106227036B (en) | 2016-07-13 | 2016-07-13 | A kind of symmetrical discrete event system On-line Control rule reconstructing method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN106227036B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107341325B (en) * | 2017-08-24 | 2020-03-31 | 西安交通大学 | Discrete event system suboptimum supervisory controller generation method |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104102195A (en) * | 2014-07-03 | 2014-10-15 | 西安交通大学 | Communication delay-existing discrete event system distributed supervision and control method |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP5910583B2 (en) * | 2013-08-20 | 2016-04-27 | 株式会社デンソー | AC motor control device |
-
2016
- 2016-07-13 CN CN201610552197.9A patent/CN106227036B/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104102195A (en) * | 2014-07-03 | 2014-10-15 | 西安交通大学 | Communication delay-existing discrete event system distributed supervision and control method |
Non-Patent Citations (2)
Title |
---|
On the reconfiguration of flexible manufacturing workcells;Ting Jiao等;《IEEE》;20131231;第1-4页 |
自动机到正规表达式的重构方法研究;马吉明,等;《计算机工程与应用》;20041231(第23期);第65-67页 |
Also Published As
Publication number | Publication date |
---|---|
CN106227036A (en) | 2016-12-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Tang et al. | Diversity-adaptive parallel memetic algorithm for solving large scale combinatorial optimization problems | |
González et al. | Scatter search with path relinking for the flexible job shop scheduling problem | |
CN106777029A (en) | A kind of distributed rule automotive engine system and its construction method | |
CN108370255A (en) | Polar code continuously eliminates memory management and paths ordering in list-decoding device | |
CN106846193A (en) | The controllable cource arrangement method of constraint granularity and system | |
CN106227736A (en) | A kind of logic flow implementation method based on list structure and device | |
CN111723298A (en) | Social network community discovery method, device and medium based on improved label propagation | |
CN112667860A (en) | Sub-graph matching method, device, equipment and storage medium | |
CN106814972A (en) | The rollback method and device of the snapshot node of distributed block storage | |
Zhang et al. | Quotient FCMs-a decomposition theory for fuzzy cognitive maps | |
CN103366021A (en) | Variable neighborhood search method and system on cloud computing platform | |
CN113435128B (en) | Method and device for predicting yield of oil and gas reservoirs based on condition generation type countermeasure network | |
CN106227036B (en) | A kind of symmetrical discrete event system On-line Control rule reconstructing method | |
CN116610104A (en) | Fault analysis method and system based on arsine synthesis control system | |
Nakano et al. | Diverse adaptive bulk search: a framework for solving QUBO problems on multiple GPUs | |
CN111461284A (en) | Data discretization method, device, equipment and medium | |
US11921624B2 (en) | Dynamic templated data test generation and execution | |
CN110110863A (en) | A kind of distributed machines study tune ginseng system based on celery | |
Thamilselvan et al. | Integrating genetic algorithm, tabu search and simulated annealing for job shop scheduling problem | |
CN111260500B (en) | Hadoop-based distributed differential evolution scheduling method for small hydropower station | |
CN107229657A (en) | Data migration method and device | |
Hagebring et al. | Compositional optimization of discrete event systems | |
CN106970840A (en) | A kind of Method for HW/SW partitioning of combination task scheduling | |
CN103440157B (en) | A kind of method and apparatus of the template for obtaining virtual machine | |
CN107544248A (en) | A kind of task optimization method and apparatus in mobile robot |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | 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 | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190301 Termination date: 20210713 |
|
CF01 | Termination of patent right due to non-payment of annual fee |