CN108153262A - A kind of Chemical Manufacture control system - Google Patents
A kind of Chemical Manufacture control system Download PDFInfo
- Publication number
- CN108153262A CN108153262A CN201711423570.1A CN201711423570A CN108153262A CN 108153262 A CN108153262 A CN 108153262A CN 201711423570 A CN201711423570 A CN 201711423570A CN 108153262 A CN108153262 A CN 108153262A
- Authority
- CN
- China
- Prior art keywords
- interpolation
- state
- node
- path
- control
- 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
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 49
- 239000000126 substance Substances 0.000 title claims abstract description 28
- 238000012544 monitoring process Methods 0.000 claims abstract description 36
- 238000000034 method Methods 0.000 claims description 38
- 230000006870 function Effects 0.000 claims description 26
- 238000012795 verification Methods 0.000 claims description 23
- 238000002156 mixing Methods 0.000 claims description 9
- 238000010276 construction Methods 0.000 claims description 4
- 238000013508 migration Methods 0.000 claims description 3
- 230000005012 migration Effects 0.000 claims description 3
- 239000013589 supplement Substances 0.000 claims description 3
- 230000007704 transition Effects 0.000 claims description 3
- 239000000654 additive Substances 0.000 claims 1
- 230000000996 additive effect Effects 0.000 claims 1
- 239000012141 concentrate Substances 0.000 claims 1
- 230000008901 benefit Effects 0.000 abstract description 5
- 239000006185 dispersion Substances 0.000 abstract description 2
- 230000015556 catabolic process Effects 0.000 abstract 1
- 230000009885 systemic effect Effects 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 15
- 238000004880 explosion Methods 0.000 description 9
- 238000004458 analytical method Methods 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000007689 inspection Methods 0.000 description 5
- RTZKZFJDLAIYFH-UHFFFAOYSA-N Diethyl ether Chemical compound CCOCC RTZKZFJDLAIYFH-UHFFFAOYSA-N 0.000 description 4
- 238000001514 detection method Methods 0.000 description 4
- 235000013399 edible fruits Nutrition 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 241000238876 Acari Species 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000002708 enhancing effect Effects 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000003825 pressing Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 241001289435 Astragalus brachycalyx Species 0.000 description 1
- 241000196324 Embryophyta Species 0.000 description 1
- 235000002917 Fraxinus ornus Nutrition 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010219 correlation analysis Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000036541 health Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000002045 lasting effect Effects 0.000 description 1
- 238000000465 moulding Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
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
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41875—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by quality surveillance of production
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/30—Polynomial surface description
-
- 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
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Analysis (AREA)
- Pure & Applied Mathematics (AREA)
- Automation & Control Theory (AREA)
- Algebra (AREA)
- Manufacturing & Machinery (AREA)
- Mathematical Optimization (AREA)
- Mathematical Physics (AREA)
- Quality & Reliability (AREA)
- Computer Graphics (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Programmable Controllers (AREA)
Abstract
The invention belongs to chemical producing system technical fields, disclose a kind of Chemical Manufacture control system, are provided with：Control module, monitoring module and acquisition/control module；Control module is connected by programmable controller with monitoring module；Control module includes data server, historical data station, engineer station, operator station, inspector station and dispatcher station；Data server, engineer station, operator station, inspector station and dispatcher station are mutually redundant Ethernet with a pair and are connected；Monitoring module includes on-site supervision module, remote monitoring module and Centralized Monitoring module；Acquisition/control module is connected with production/control object module.The present invention has control accuracy height, the advantages of reliability, flexibility, high opening, passes through the electric automatizations such as on-site supervision, remote monitoring and Centralized Monitoring and controls, centrality dispersion, ensure the normal operation of system to greatest extent, reduce the risk of systemic breakdown.
Description
Technical field
The invention belongs to chemical producing system field more particularly to a kind of Chemical Manufacture control systems.
Background technology
At present, with Production in Chemical Plant scale and the gradually expansion that can realize function, the production that Chemical Manufacture is configured
Unit scale and complexity are also greatly improved, and under this environment, rely solely on and have manually carried out production control
The production requirement of chemical enterprise can not be met, and the hair of information technology stands and its so that Chemical Manufacture is automatic in multi-field application
Change and increasingly popularize, the production control of motive force chemical enterprise is gradually to automation, intelligent, scale and complication
Direction hair station.And it is sent out with a variety of integrated technologys such as multiple network technology, the communication technology and control technology and display technology
The dcs stood up is widely used in Chemical Manufacture control.The control system can be to chemical industry
Plurality of devices in production carries out automated production management and control, can effectively improve the production efficiency of enterprise, reduces management
Cost saves energy consumption, additionally it is possible to which the lasting hair station for enterprise provides forever motive force, is the core hand for modernizing Chemical Manufacture control
Section.At present, existing control system needs larger memory, and response speed is slower.
With the fast development of science and technology and the continuous improvement of industrial requirement, the complexities of various design of hardware and software is also increasingly
Increase, the requirement for reliability and safety is also continuously improved.The reliability of system, safety and correctness have received
Scientific circles and the extensive concern of industrial quarters.Formal Verification and test are to solve the problems, such as this main method.Formal Verification side
Method starts from the research in terms of program specification and verification such as Floyd, Hoare and Manna of late 1960s.Form is chemically examined
Card method is divided into two major class：Based on theorem proving and based on model.Model inspection (the Model that early 1980s propose
Checking) belong to the formalization verification method based on model, thought is relatively easy and high degree of automation, can be widely applied to
The verification of ware circuit and procotol system.It is first finite state transfer system system modelling that model inspection, which is exactly,
And with tense logical description spy verify specification, exhaustive search is carried out in finite state transfer system, determine specification whether by
Meet, if not meeting, provide counter-example and point out why not meet.Model inspection faces state explosion problem, so-called state
Explosion issues, that is, system mode number exponentially increases with the increase of state scale.So the researcher in the field uses respectively
The state space of kind method reduction search, the abstract model detection based on counter-example guiding is common technology.Based on counter-example path
Abstract refinement (Counterexample-Guided Abstraction Refinement, CEGAR) technology process it is as follows：
A model and property are given, an abstract model is generated by abstract method first.The behavior that abstract model includes may
Archetype can be more than, still, the structure of abstract model and description are all simpler than archetype, it is possible to relieved state space
Explosion issues.Whether then calling model detector, detection formula are effective in abstract model.If it is valid, program determination；
Otherwise, counter-example path can be provided, (reconstruction) process is then reconstructed, i.e., in archetype, if success
A paths are found corresponding to counter-example path, then EP (end of program)；Otherwise, counter-example path is false counter-example path, next iteration
Process starts, and regenerates abstract model, is verified.This process is repeated, effectively either invalid or state is empty until returning
Between explosion cause program stopped.Dynamic symbol execution technology is a kind of semiology analysis with specifically performing the means of testing being combined.
Semiology analysis refers to that under the premise of program is not performed, with the value of value of symbol representation program variable, then simulation program, which performs, comes
Carry out correlation analysis.First, to code construction controlling stream graph to be analyzed (Control Flow Graph, CFG), it is compiler
Inside represents the abstract data structure of a program process with digraph.It simulates and performs since Ingress node on CFG, meeting
During to branch node, judge which branch is feasible using constraint solver, and realized according to the path scheduling strategy being pre-designed
The traversal in all paths of the process is analyzed, finally exports the analysis result in every executable path.Dynamic symbol execution be with
Concrete numerical value starts code simulation actuator, and institute is collected from the predicate of the branch statement of current path as input
There is symbol constraint.Then a branch in strategy reversion constraint, constructs a new feasible path constraint, and with about
Beam solver solves a feasible new specific input, and then semiology analysis engine divides a new input value progress new round
Analysis.The method newly inputted is generated by using this input iteration, theoretically all feasible paths can be calculated and be divided
Analysis one time.The main bottleneck that dynamic symbol performs technology is path explosion problem, i.e., in program branch's number increase, path
Exponentially increase.Interpolation is to alleviate the effective ways of path explosion problem, and mainly a kind of thought for searching for beta pruning passes through profit
Row vertex ticks interpolation is given with infeasible path, interpolation refers to centainly reach the constraint for being marked as error row.It is right
In branch node, if each branch of the node was explored, then the vertex ticks interpolation for full interpolation, otherwise for
Half interpolation.In dynamic symbol execution, if the path constraint from start node to present node meets the full interpolation of present node,
Then the path can be merged, i.e., be not explored, so as to effectively alleviate path explosion problem.For large scale system, it is abstracted mould
It is excessive that type refines number when being verified, and the bottleneck of model inspection is state explosion problem, therefore proposes a kind of having for row
The method imitated and accelerate abstract model verification is very urgent.
In conclusion problem of the existing technology is：Need memory larger, corresponding speed is slow, and centralization degree
Height, some part easily cause whole system paralysis after going wrong, can not meet the needs of the producer.
Invention content
In view of the problems of the existing technology, the present invention provides a kind of Chemical Manufacture control systems.
The invention is realized in this way a kind of Chemical Manufacture set-up of control system has：
Control module, programmable controller, monitoring module and acquisition/control module and production/control object module, institute
Control module is stated by programmable controller with monitoring module to be connected.
The control module includes data server, historical data station, engineer station, operator station, inspector station and adjusts
Degree person stands, and the data server, engineer station, operator station, inspector station and dispatcher station are mutually redundant ether with a pair
Net is connected.
The monitoring module includes on-site supervision module, remote monitoring module and Centralized Monitoring module, the acquisition/control
Molding block is connected with production/control object module.
The control method of the programmable controller includes：
1), according to program to be verified, controlling stream graph CFG is generated, 3 attributes are added to the node in CFG:R interpolation, S
Interpolation and E interpolation, R interpolation are the reachable constraints of node, judge the accessibility of a state；S interpolation and E interpolation are to path
Carry out stipulations, the verification of faster procedure；To the side addition attribute W of CFG；The W values of a line represent using the node that the side is directed toward as
In the subgraph of root node, there are no the numbers for the branch being traversed；
2), according to the CFG of generation, abstract reachability graph ARG is generated, if generating a new state s along a paths, such as
The corresponding R interpolation of fruit s is satisfied, and illustrates that state s is reachable, the state s of continuing on traverses the path；Otherwise, state s is unreachable,
Then the path terminates, and traverses other paths；For a reachable state s, if the corresponding E interpolation of state s is by the path pair
The path formula answered contains, and illustrates that the path there are an arrival dbjective state, program are dangerous along the state；If state
The corresponding S interpolation of s is contained, and illustrates that all paths using state as starting point are all safe, is needed not be along state s and is explored journey
Sequence；If state s is reachable, and E interpolation and S interpolation are not contained, then continue on state s and traverse the path；
3) it, during ARG is generated, finds a counter-example path, reaches dbjective state, then need further to judge anti-
Whether example path is false；It is not false counter-example, then read-me is unsafe；Otherwise, according to false counter-example, refined model,
The R interpolation of corresponding states, S interpolation and E interpolation are calculated and updated respectively, and execution regenerates ARG, until finding a true counter-example
Path or there is no counter-example paths.
4) R interpolation, S interpolation and E interpolation are using the building method of four B-spline interpolation curves of quadravalence to the knot in CFG
Point addition attribute；It specifically includes：
One expansion graduation of given section [a, b]：
t-6≤t-4≤t-2≤ a=t0＜ t1＜ ... ＜ t2i＜ t2i+1＜ ... ＜ t2m-1＜ t2m=b≤t2(m+1)≤t2(m+2)≤
t2(m+3)；
And de Boor control vertex sequences：
d-1,d0,d1,d2,…,dm,dm+1；
On section [a, b] with：
{t-6,t-4,t-2,t0,t2,…,t2i,…,t2(m-1),t2m,t2(m+1),t2(m+2),t2(m+3)}；
Four B-spline curves of quadravalence for batten node are denoted as：
Wherein B-spline basic function Ωj(t) the batten node in support is：
t2(j-2),t2(j-1),t2j,t2(j+1),t2(j+2), j=-1,0,1 ..., m+1；
On the basis of r (t), four B-spline interpolation curve r of a quadravalence are constructedI(t) so that it passes through all data points
Arrange { dk, that is, meet interpolation condition：
rI(t2k)=dk, k=0,1,2 ..., m；
Junction curve section r (t) two-end-point r (t2i) and r (t2i+2) straightway be denoted as：
Connect two adjacent de Boor points diAnd di+1Straightway be denoted as：
Blending functions ψi(t) expression formula is：
Wherein ei0It is free parameter,
Further, the building method of four B-spline interpolation curves of quadravalence that the R interpolation, S interpolation and E interpolation use
It also protects and includes：
Blending functions are chosen, make the straight line for linking two endpoints of each batten minizone and connection and corresponding two-phase
The straight line of adjacent de Boor control vertexs makees the point in the spline curve on each batten minizone with linking each batten minizone
The difference of point on the straight line of two endpoints obtains incremental vector；
It will just have been obtained on straight line of the incremental vector by moving to two adjacent de Boor control vertexs of connection after stretching each
Batten cell interpolation is in the interpolation curve of de Boor control vertexs；
It is stretched shift method with increment for four B-spline curves of quadravalence, generates corresponding interpolation curve, blending functions
In contain there are one free parameter, be four B-spline multinomials of a quadravalence.
Further, the method for constructing interpolation curve includes：
Given offset point range d0,d1,d2,…,dm, supplement auxiliary magnet d-2,d-1... and dm+1,dm+2..., batten node sequence
For：
…≤t-1≤ a=t0＜ t1＜ t2＜ ... ＜ tm-1＜ tm=b≤tm+1≤…；
By { djAs de Boor control vertex sequences, n rank B-spline curves are obtained, are denoted as：
Wherein Nj,n(t) it is n rank B-spline basic functions, support is set as section For real number
Rounding；
Curve construction dI(t), meet interpolation condition：
dI(tk)=dk, k=0,1,2 ..., m；
In each section batten subinterval [ti,ti+1] on (i=0,1,2 ..., m-1), connection B-spline curves section d's (t)
Two endpoint d (ti) and d (ti+1) straightway be denoted as li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
And connect two adjacent de Boor points diAnd di+1Straightway be denoted as Li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
Li(t)=(1- Φi(t))di+Φi(t)di+1,ti≤t≤ti+1；
Make curved section d (t) and straightway li(t) in section [ti,ti+1] on difference vector：
δi(t)=d (t)-li(t),ti≤t≤ti+1；
Difference vector stretches to get α δi(t), α ＞ 0, are translated, its starting point is made to fall in straightwayOn corresponding points
Place to get：
dI(t)=Li(t)+αδi(t),ti≤t≤ti+1, i=0,1,2 ..., m-1；
Or it is written as：
dI(t)=[(1- Φi(t))di+Φi(t)di+1]+α[d(t)-(1-Φi(t))d(ti)-Φi(t)d(ti+1)]；
ti≤t≤ti+1, i=0,1,2 ..., m-1；
Function phii(t) meet following condition：
Φi(t) in section [ti,ti+1] on have until the continuous derivative of n-2 ranks；
：
Φi(t) in section [ti,ti+1] it is monotonic increasing function, to avoid straightway li(t) and Li(t) there is weight node.
Further, the CFG of the generation program to be verified, and node and the attribute on side are initialized, include the following steps：
(1) destination node in CFG is found, CFG is reversely traversed since destination node, the node of traversal and side are all protected
It stays, the node and side not traversed all are deleted；
(2) CFG after being cut, the value of init attributes initialize three kinds of interpolation of each node, for the first time
CFG is traversed, during generating ARG, the initial value of the R interpolation of each node is { true }；For S interpolation, define
For two tuples:(F,Is), wherein, the codomain of F is { full, half }, IsValue be a conjunction expression being made of predicate；
For a node l, if it is all full that l, which does not have the S interpolation of successor node or all successor nodes of l, f is denoted as, represents l
All successor nodes be all traversed, then the S interpolation of l is also full, and otherwise, the S interpolation of l is half, is denoted as h, specifically
Form is as follows：
L is destination node, and the initial value of S interpolation is (full, true), is represented if reaching destination node, and path must be peace
Complete；L is destination node, and the initial value of S interpolation is (full, false), represents that, if reaching destination node, path must be
Counter-example path；For other nodes, the initial value of S interpolation is (half, true), and specific form is as follows:
L is destination node, and the initial value of E interpolation is true, represents that path must be true counter-example；L is destination node, E interpolation
Initial value for false, represent that path can not possibly centainly reach destination node；For other nodes, the initial value of E interpolation is
False initially thinks reach destination node；For the W attributes of each migration, initial value ⊥, expression is not opened also
Begin traversal, wherein, the codomain of W is { N+, ⊥ }, and N+ is Positive Integer Set.
Further, in the step 2), the traversal order on branch side is determined using W attributes, meanwhile, it is inserted using S interpolation and E
Value, accelerates the efficiency of verification, and specific step includes：
(1) a reachable state s' is obtained, according to the transition relationship of CFG, generates successor states；If there is multiple possibility
It is subsequent, according to the W values on side, determine traversal order；The priority of the W values on side is：(>0)>⊥>0；If the W values on side are identical,
Then randomly choose；For a successor states s, according to R interpolation, if state s is unreachable, current path terminates, and traverses it
His path；If current state s is reachable, whether the E interpolation for first determining whether s is false；If false, after illustrating s [0]
It was not traversed also, jumped to (2) after node；If not false, first using SSA principles, each variable is at most assigned
Value is primary, obtains from original state s0The path formula of s is reached, is denoted as Pf(s0,…,s)；Judge P with solverf(s0,…,s)
Whether the E interpolation of s is contained；If contained, read-me is there are a true counter-example, and program is dangerous, and verification terminates；Otherwise it jumps
It goes to (2)；
(2) whether the S interpolation for judging s is full interpolation；If not full interpolation, then jump to (3)；If full
Interpolation is obtained from original state s0The path formula of s is reached, is denoted as Pf(s0..., s), then judge P with solverf(s0,…,
S) whether contain the S interpolation of s；If contained, illustrate that all paths using state s as starting point are all safe, do not need to visit
Rope, current path terminate, and traverse other paths；
(3) judge s whether dbjective state, if dbjective state, then find a counter-example path, perform step 3)；Such as
Whether fruit is not further to judge s by other state coverages；If s is capped, does not need to explore current path, traverse it
His path；If s is uncovered, continue to explore current path；
(4) it if there is the reachable state not being traversed, then jumps to (1)；Otherwise, verification terminates, program safety.
Further, the acquisition/control module is for directly to the progress data acquisition such as production object, control object and work(
It can control, and monitoring module is passed to by being concentrated after the data information acquisition of production/control object module, be analyzed, simultaneously
The control instruction and operational order for downloading and receiving monitoring module transmission carry out Industry Control to specific object.
Further, the control module can provide software and hardware to whole system and support to assist to complete production management and examination
The functions such as industry battalion, and each link in entire production process is monitored, production control data are summarized, are divided
Analysis and archive, the office automatic for enhancing chemical enterprise are horizontal.
Further, side's on-site supervision be exactly employee before control system, pass through the experience of oneself and supervise equipment
Operation conditions.
Further, the advantage of the Centralized Monitoring is, convenient for the centralized management and maintenance of control system, and comparatively
The designing scheme of the electric-automation control system of centralized management is easily understood, and the requirement of shelter for protecting station is not high.
Further, the remote monitoring can reduce mounting cost, save the input of the equipment such as material, cable.
The present invention can make practitioner follow one's inclinations by motor drive crawler belt rotation and the manipulation to main story switch and reversal switch
Desired progress leg pressing practice, and can free hold leg pressing dynamics, improve the enthusiasm of practice, enhance the strong of body
Health.
Advantages of the present invention and good effect are：False counter-example path is more fully utilized in model inspection in the present invention
The information of offer by calculating S interpolation and E interpolation, improves the efficiency of detection so that Model Detection Algorithm can be answered preferably
For large-scale program；S interpolation may determine that the subsequently all possible path sequence of a state whether be all it is safe,
So as to avoid unnecessary exploration, the status number of ARG is greatly reduced；E interpolation can apply to
It is no there are true counter-example path, accelerate the verification of program, improve efficiency.
The present invention has cut node useless in CFG and side, the state space of traversal has been further reduced, on the side of CFG
Upper addition W attributes so that the efficiency of program verification is further promoted.Path when being verified by reducing abstract model is searched
Accelerate verification efficiency so as to relieved state explosion issues in rope space.Two kinds of optimization operations are provided simultaneously so that verification process is more
Increase effect；It is mainly used in the Formal Verification of the software and hardware system correctness of the domain designs such as industry, scientific research and all kinds of logical
Believe protocol safety, the Formal Verification of reliability.
Interpolation curve building method provided by the invention based on B-spline, the side for translation and the tensor product of being stretched using increment
Method constructs the interpolation in rectangular domain in four B-spline interpolation curved surfaces of double quadravalences of control vertex grid, interpolation curve/curved surface
Building method it is succinct, geometric meaning is apparent, compatible with BURBS methods, meaningful to geometric modeling.The present invention proposes
One new geometric modeling method, this method solve the problems, such as interpolation control vertex, for Chemical Manufacture control engineering tool
It is significant.
Description of the drawings
Fig. 1 is Chemical Manufacture control system architecture schematic diagram provided in an embodiment of the present invention；
In figure：1st, control module；2nd, programmable controller；3rd, monitoring module；4th, acquisition control module；5th, production/control
Object module；6th, on-site supervision module；7th, remote monitoring module；8th, Centralized Monitoring module.
Specific embodiment
In order to further understand the content, features and effects of the present invention, the following examples are hereby given, and coordinate attached drawing
Detailed description are as follows.
The structure of the present invention is explained in detail below in conjunction with the accompanying drawings.
As shown in Figure 1, Chemical Manufacture control system provided in an embodiment of the present invention includes：Control module 1, PLC technology
Device 2, monitoring module 3 and acquisition/control module 4 and production/control object module 5, the control module 1 pass through programmable control
Device 2 processed is connected with monitoring module 3.
The control module 1 includes data server, historical data station, engineer station, operator station, inspector station and adjusts
Degree person stands, and the data server, engineer station, operator station, inspector station and dispatcher station are mutually redundant ether with a pair
Net is connected.
The monitoring module 3 includes on-site supervision module 6, remote monitoring module 7 and Centralized Monitoring module 8, described to adopt
Collection/control module 4 is connected with production/control object module 5.
Acquisition/the control module 4 is for directly to the progress data acquisition such as production object, control object and function control
System, and monitoring module is passed to by being concentrated after the data information acquisition of production/control object module, it is analyzed, is downloaded simultaneously
Industry Control is carried out to specific object with the control instruction and operational order for receiving monitoring module transmission.
The control module 1 can provide software and hardware to whole system and support to manage to assist to complete production management and test manufacture
Etc. functions, and each link in entire production process is monitored, production control data are summarized, analyze and
It achieves, the office automatic for enhancing chemical enterprise is horizontal.
The on-site supervision module 6 be exactly employee before control system, pass through oneself experience supervise equipment operation
Situation.
The advantage of the Centralized Monitoring module 8 is convenient for the centralized management and maintenance of control system, and comparatively to collect
The designing scheme of the electric-automation control system of middle management is easily understood, and the requirement of shelter for protecting station is not high.
The remote monitoring module 7 can reduce mounting cost, save the input of the equipment such as material, cable.
The present invention has the advantages of control accuracy is high, reliability, flexibility, high opening, passes through on-site supervision, long-range prison
The electric automatizations control such as control and Centralized Monitoring, centrality dispersion ensure the normal operation of system, reduce system to greatest extent
The risk of system paralysis.
The control method of the programmable controller includes：
1), according to program to be verified, controlling stream graph CFG is generated, 3 attributes are added to the node in CFG:R interpolation, S
Interpolation and E interpolation, R interpolation are the reachable constraints of node, judge the accessibility of a state；S interpolation and E interpolation are to path
Carry out stipulations, the verification of faster procedure；To the side addition attribute W of CFG；The W values of a line represent using the node that the side is directed toward as
In the subgraph of root node, there are no the numbers for the branch being traversed；
2), according to the CFG of generation, abstract reachability graph ARG is generated, if generating a new state s along a paths, such as
The corresponding R interpolation of fruit s is satisfied, and illustrates that state s is reachable, the state s of continuing on traverses the path；Otherwise, state s is unreachable,
Then the path terminates, and traverses other paths；For a reachable state s, if the corresponding E interpolation of state s is by the path pair
The path formula answered contains, and illustrates that the path there are an arrival dbjective state, program are dangerous along the state；If state
The corresponding S interpolation of s is contained, and illustrates that all paths using state as starting point are all safe, is needed not be along state s and is explored journey
Sequence；If state s is reachable, and E interpolation and S interpolation are not contained, then continue on state s and traverse the path；
3) it, during ARG is generated, finds a counter-example path, reaches dbjective state, then need further to judge anti-
Whether example path is false；It is not false counter-example, then read-me is unsafe；Otherwise, according to false counter-example, refined model,
The R interpolation of corresponding states, S interpolation and E interpolation are calculated and updated respectively, and execution regenerates ARG, until finding a true counter-example
Path or there is no counter-example paths.
4) R interpolation, S interpolation and E interpolation are using the building method of four B-spline interpolation curves of quadravalence to the knot in CFG
Point addition attribute；It specifically includes：
One expansion graduation of given section [a, b]：
t-6≤t-4≤t-2≤ a=t0＜ t1＜ ... ＜ t2i＜ t2i+1＜ ... ＜ t2m-1＜ t2m=b≤t2(m+1)≤t2(m+2)≤
t2(m+3)；
And de Boor control vertex sequences：
d-1,d0,d1,d2,…,dm,dm+1；
On section [a, b] with：
{t-6,t-4,t-2,t0,t2,…,t2i,…,t2(m-1),t2m,t2(m+1),t2(m+2),t2(m+3)}；
Four B-spline curves of quadravalence for batten node are denoted as：
Wherein B-spline basic function Ωj(t) the batten node in support is：
t2(j-2),t2(j-1),t2j,t2(j+1),t2(j+2), j=-1,0,1 ..., m+1；
On the basis of r (t), four B-spline interpolation curve r of a quadravalence are constructedI(t) so that it passes through all data points
Arrange { dk, that is, meet interpolation condition：
rI(t2k)=dk, k=0,1,2 ..., m；
Junction curve section r (t) two-end-point r (t2i) and r (t2i+2) straightway be denoted as：
Connect two adjacent de Boor points diAnd di+1Straightway be denoted as：
Blending functions ψi(t) expression formula is：
Wherein ei0It is free parameter,
Further, the building method of four B-spline interpolation curves of quadravalence that the R interpolation, S interpolation and E interpolation use
It also protects and includes：
Blending functions are chosen, make the straight line for linking two endpoints of each batten minizone and connection and corresponding two-phase
The straight line of adjacent de Boor control vertexs makees the point in the spline curve on each batten minizone with linking each batten minizone
The difference of point on the straight line of two endpoints obtains incremental vector；
It will just have been obtained on straight line of the incremental vector by moving to two adjacent de Boor control vertexs of connection after stretching each
Batten cell interpolation is in the interpolation curve of de Boor control vertexs；
It is stretched shift method with increment for four B-spline curves of quadravalence, generates corresponding interpolation curve, blending functions
In contain there are one free parameter, be four B-spline multinomials of a quadravalence.
Further, the method for constructing interpolation curve includes：
Given offset point range d0,d1,d2,…,dm, supplement auxiliary magnet d-2,d-1... and dm+1,dm+2..., batten node sequence
For：
…≤t-1≤ a=t0＜ t1＜ t2＜ ... ＜ tm-1＜ tm=b≤tm+1≤…；
By { djAs de Boor control vertex sequences, n rank B-spline curves are obtained, are denoted as：
Wherein Nj,n(t) it is n rank B-spline basic functions, support is set as sectionFor real number
Rounding；
Curve construction dI(t), meet interpolation condition：
dI(tk)=dk, k=0,1,2 ..., m；
In each section batten subinterval [ti,ti+1] on (i=0,1,2 ..., m-1), connection B-spline curves section d's (t)
Two endpoint d (ti) and d (ti+1) straightway be denoted as li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
And connect two adjacent de Boor points diAnd di+1Straightway be denoted as Li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
Li(t)=(1- Φi(t))di+Φi(t)di+1,ti≤t≤ti+1；
Make curved section d (t) and straightway li(t) in section [ti,ti+1] on difference vector：
δi(t)=d (t)-li(t),ti≤t≤ti+1；
Difference vector stretches to get α δi(t), α ＞ 0, are translated, its starting point is made to fall in straightwayOn corresponding points
Place to get：
dI(t)=Li(t)+αδi(t),ti≤t≤ti+1, i=0,1,2 ..., m-1；
Or it is written as：
dI(t)=[(1- Φi(t))di+Φi(t)di+1]+α[d(t)-(1-Φi(t))d(ti)-Φi(t)d(ti+1)]；
ti≤t≤ti+1, i=0,1,2 ..., m-1；
Function phii(t) meet following condition：
Φi(t) in section [ti,ti+1] on have until the continuous derivative of n-2 ranks；
：
Φi(t) in section [ti,ti+1] it is monotonic increasing function, to avoid straightway li(t) and Li(t) there is weight node.
Further, the CFG of the generation program to be verified, and node and the attribute on side are initialized, include the following steps：
(1) destination node in CFG is found, CFG is reversely traversed since destination node, the node of traversal and side are all protected
It stays, the node and side not traversed all are deleted；
(2) CFG after being cut, the value of init attributes initialize three kinds of interpolation of each node, for the first time
CFG is traversed, during generating ARG, the initial value of the R interpolation of each node is { true }；For S interpolation, define
For two tuples:(F,Is), wherein, the codomain of F is { full, half }, IsValue be a conjunction expression being made of predicate；
For a node l, if it is all full that l, which does not have the S interpolation of successor node or all successor nodes of l, f is denoted as, represents l
All successor nodes be all traversed, then the S interpolation of l is also full, and otherwise, the S interpolation of l is half, is denoted as h, specifically
Form is as follows：
L is destination node, and the initial value of S interpolation is (full, true), is represented if reaching destination node, and path must be peace
Complete；L is destination node, and the initial value of S interpolation is (full, false), represents that, if reaching destination node, path must be
Counter-example path；For other nodes, the initial value of S interpolation is (half, true), and specific form is as follows:
L is destination node, and the initial value of E interpolation is true, represents that path must be true counter-example；L is destination node, E interpolation
Initial value for false, represent that path can not possibly centainly reach destination node；For other nodes, the initial value of E interpolation is
False initially thinks reach destination node；For the W attributes of each migration, initial value ⊥, expression is not opened also
Begin traversal, wherein, the codomain of W is { N+, ⊥ }, and N+ is Positive Integer Set.
Further, in the step 2), the traversal order on branch side is determined using W attributes, meanwhile, it is inserted using S interpolation and E
Value, accelerates the efficiency of verification, and specific step includes：
(1) a reachable state s' is obtained, according to the transition relationship of CFG, generates successor states；If there is multiple possibility
It is subsequent, according to the W values on side, determine traversal order；The priority of the W values on side is：(>0)>⊥>0；If the W values on side are identical,
Then randomly choose；For a successor states s, according to R interpolation, if state s is unreachable, current path terminates, and traverses it
His path；If current state s is reachable, whether the E interpolation for first determining whether s is false；If false, after illustrating s [0]
It was not traversed also, jumped to (2) after node；If not false, first using SSA principles, each variable is at most assigned
Value is primary, obtains from original state s0The path formula of s is reached, is denoted as Pf(s0,…,s)；Judge P with solverf(s0,…,s)
Whether the E interpolation of s is contained；If contained, read-me is there are a true counter-example, and program is dangerous, and verification terminates；Otherwise it jumps
It goes to (2)；
(2) whether the S interpolation for judging s is full interpolation；If not full interpolation, then jump to (3)；If full
Interpolation is obtained from original state s0The path formula of s is reached, is denoted as Pf(s0..., s), then judge P with solverf(s0,…,
S) whether contain the S interpolation of s；If contained, illustrate that all paths using state s as starting point are all safe, do not need to visit
Rope, current path terminate, and traverse other paths；
(3) judge s whether dbjective state, if dbjective state, then find a counter-example path, perform step 3)；Such as
Whether fruit is not further to judge s by other state coverages；If s is capped, does not need to explore current path, traverse it
His path；If s is uncovered, continue to explore current path；
(4) it if there is the reachable state not being traversed, then jumps to (1)；Otherwise, verification terminates, program safety.
The above is only the preferred embodiments of the present invention, and not makees limitation in any form to the present invention,
Any simple modification made to the above embodiment of every technical spirit according to the present invention, equivalent variations and modification, belong to
In the range of technical solution of the present invention.
Claims (6)
1. a kind of Chemical Manufacture control system, which is characterized in that the Chemical Manufacture set-up of control system has：Control module, can
Programmable controller, monitoring module, acquisition/control module and production/control object module；The control module passes through programmable
Controller is connected with monitoring module；
The control module includes data server, historical data station, engineer station, operator station, inspector station and dispatcher
It stands；The data server, engineer station, operator station, inspector station and dispatcher station are mutually redundant Ethernet phase with a pair
Even；
The monitoring module includes on-site supervision module, remote monitoring module and Centralized Monitoring module, the acquisition/control mould
Block is connected with production/control object module；
The control method of the programmable controller includes：
1), according to program to be verified, controlling stream graph CFG is generated, 3 attributes are added to the node in CFG:R interpolation, S interpolation
With E interpolation, R interpolation is the reachable constraints of node, judges the accessibility of a state；S interpolation and E interpolation carry out path
Stipulations, the verification of faster procedure；To the side addition attribute W of CFG；The node that the W values expression of a line is directed toward using the side is root knot
In the subgraph of point, there are no the numbers for the branch being traversed；
2), according to the CFG of generation, abstract reachability graph ARG is generated, if a new state s is generated along a paths, if s
Corresponding R interpolation is satisfied, and illustrates that state s is reachable, the state s of continuing on traverses the path；Otherwise, state s is unreachable, then should
Path terminates, and traverses other paths；For a reachable state s, if the corresponding E interpolation of state s is corresponding by the path
Path formula contains, and illustrates that the path there are an arrival dbjective state, program are dangerous along the state；If s pairs of state
The S interpolation answered is contained, and is illustrated that all paths using state as starting point are all safe, is needed not be along state s heuristic routines；
If state s is reachable, and E interpolation and S interpolation are not contained, then continue on state s and traverse the path；
3) it, during ARG is generated, finds a counter-example path, reaches dbjective state, then need further to judge counter-example road
Whether diameter is false；It is not false counter-example, then read-me is unsafe；Otherwise, according to false counter-example, refined model, difference
The R interpolation of corresponding states, S interpolation and E interpolation are calculated and update, execution regenerates ARG, until finding a true counter-example path
Or there is no counter-example paths.
4) R interpolation, S interpolation and E interpolation are added using the building method of four B-spline interpolation curves of quadravalence to the node in CFG
Additive attribute；It specifically includes：
One expansion graduation of given section [a, b]：
t-6≤t-4≤t-2≤ a=t0＜ t1＜ ... ＜ t2i＜ t2i+1＜ ... ＜ t2m-1＜ t2m=b≤t2(m+1)≤t2(m+2)≤
t2(m+3)；
And de Boor control vertex sequences：
d-1,d0,d1,d2,…,dm,dm+1；
On section [a, b] with：
{t-6,t-4,t-2,t0,t2,…,t2i,…,t2(m-1),t2m,t2(m+1),t2(m+2),t2(m+3)}；
Four B-spline curves of quadravalence for batten node are denoted as：
Wherein B-spline basic function Ωj(t) the batten node in support is：
t2(j-2),t2(j-1),t2j,t2(j+1),t2(j+2), j=-1,0,1 ..., m+1；
On the basis of r (t), four B-spline interpolation curve r of a quadravalence are constructedI(t) so that it passes through all offset point ranges
{dk, that is, meet interpolation condition：
rI(t2k)=dk, k=0,1,2 ..., m；
Junction curve section r (t) two-end-point r (t2i) and r (t2i+2) straightway be denoted as：
Connect two adjacent de Boor points diAnd di+1Straightway be denoted as：
Blending functions ψi(t) expression formula is：
Wherein ei0It is free parameter,
2. Chemical Manufacture control system as described in claim 1, which is characterized in that the R interpolation, S interpolation and E interpolation are adopted
The building method of four B-spline interpolation curves of quadravalence also protect including：
Blending functions are chosen, make the straight line for linking two endpoints of each batten minizone and connection and corresponding two adjacent de
The straight line of Boor control vertexs makees two ends of the point in the spline curve on each batten minizone with linking each batten minizone
The difference of point on the straight line of point obtains incremental vector；
Each batten will have just been obtained on straight line of the incremental vector by moving to two adjacent de Boor control vertexs of connection after stretching
Cell interpolation is in the interpolation curve of de Boor control vertexs；
It is stretched shift method with increment for four B-spline curves of quadravalence, generates corresponding interpolation curve, contain in blending functions
There are one free parameters, are four B-spline multinomials of a quadravalence.
3. Chemical Manufacture control system as claimed in claim 2, which is characterized in that the method for constructing interpolation curve includes：
Given offset point range d0,d1,d2,…,dm, supplement auxiliary magnet d-2,d-1... and dm+1,dm+2..., batten node sequence is：
…≤t-1≤ a=t0＜ t1＜ t2＜ ... ＜ tm-1＜ tm=b≤tm+1≤…；
By { djAs de Boor control vertex sequences, n rank B-spline curves are obtained, are denoted as：
Wherein Nj,n(t) it is n rank B-spline basic functions, support is set as section For real numberRounding；
Curve construction dI(t), meet interpolation condition：
dI(tk)=dk, k=0,1,2 ..., m；
In each section batten subinterval [ti,ti+1] on (i=0,1,2 ..., m-1), two of connection B-spline curves section d (t)
Endpoint d (ti) and d (ti+1) straightway be denoted as li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
And connect two adjacent de Boor points diAnd di+1Straightway be denoted as Li(t), equation is：
li(t)=(1- Φi(t))d(ti)+Φi(t)d(ti+1),ti≤t≤ti+1；
Li(t)=(1- Φi(t))di+Φi(t)di+1,ti≤t≤ti+1；
Make curved section d (t) and straightway li(t) in section [ti,ti+1] on difference vector：
δi(t)=d (t)-li(t),ti≤t≤ti+1；
Difference vector stretches to get α δi(t), α ＞ 0, are translated, its starting point is made to fall in straightwayOn corresponding point position, i.e.,
：
dI(t)=Li(t)+αδi(t),ti≤t≤ti+1, i=0,1,2 ..., m-1；
Or it is written as：
dI(t)=[(1- Φi(t))di+Φi(t)di+1]+α[d(t)-(1-Φi(t))d(ti)-Φi(t)d(ti+1)]；
ti≤t≤ti+1, i=0,1,2 ..., m-1；
Function phii(t) meet following condition：
Φi(t) in section [ti,ti+1] on have until the continuous derivative of n-2 ranks；
Φi(ti)=0, Φi(ti+1)=1,J=1,2 ..., n-2；
：
Φi(t) in section [ti,ti+1] it is monotonic increasing function, to avoid straightway li(t) and Li(t) there is weight node.
4. Chemical Manufacture control system as described in claim 1, which is characterized in that
The CFG of the generation program to be verified, and node and the attribute on side are initialized, include the following steps：
(1) destination node in CFG is found, CFG is reversely traversed since destination node, the node of traversal and side all retain, do not have
There are the node traversed and side all to delete；
(2) CFG after being cut, the value of init attributes initialize three kinds of interpolation of each node, first to traverse
CFG, during generating ARG, the initial value of the R interpolation of each node is { true }；For S interpolation, it is one to define
A two tuple:(F,Is), wherein, the codomain of F is { full, half }, IsValue be a conjunction expression being made of predicate；For
One node l if it is all full that l, which does not have the S interpolation of successor node or all successor nodes of l, is denoted as f, represents the institute of l
There is successor node to be all traversed, then the S interpolation of l is also full, and otherwise, the S interpolation of l is half, is denoted as h, specific form
It is as follows：
L is destination node, and the initial value of S interpolation is (full, true), represents that, if reaching destination node, path must be safe；
L is destination node, and the initial value of S interpolation is (full, false), represents that, if reaching destination node, path must be counter-example road
Diameter；For other nodes, the initial value of S interpolation is (half, true), and specific form is as follows:
L is destination node, and the initial value of E interpolation is true, represents that path must be true counter-example；L is destination node, E interpolation just
Initial value is false, represents that path can not possibly centainly reach destination node；For other nodes, the initial value of E interpolation is false,
Initially think all reach destination node；For the W attributes of each migration, initial value ⊥, expression is not begun stepping through also,
Wherein, the codomain of W is { N+, ⊥ }, and N+ is Positive Integer Set.
5. Chemical Manufacture control system as described in claim 1, which is characterized in that
In the step 2), the traversal order on branch side is determined using W attributes, meanwhile, using S interpolation and E interpolation, accelerate verification
Efficiency, specific step includes：
(1) a reachable state s' is obtained, according to the transition relationship of CFG, generates successor states；If there is it is multiple it is possible after
After according to the W values on side, decision traversal order；The priority of the W values on side is：(>0)>⊥>0；If the W values on side are identical, with
Machine selects；For a successor states s, according to R interpolation, if state s is unreachable, current path terminates, and traverses other roads
Diameter；If current state s is reachable, whether the E interpolation for first determining whether s is false；If false, illustrate the subsequent knot of s [0]
Point was not traversed also, was jumped to (2)；If not false, first using SSA principles, each variable is at most assigned one
It is secondary, it obtains from original state s0The path formula of s is reached, is denoted as Pf(s0,…,s)；Judge P with solverf(s0..., s) whether
Contain the E interpolation of s；If contained, read-me is there are a true counter-example, and program is dangerous, and verification terminates；Otherwise it jumps to
(2)；
(2) whether the S interpolation for judging s is full interpolation；If not full interpolation, then jump to (3)；If full is inserted
Value, obtains from original state s0The path formula of s is reached, is denoted as Pf(s0..., s), then judge P with solverf(s0,…,s)
Whether the S interpolation of s is contained；If contained, illustrate that all paths using state s as starting point are all safe, do not need to explore,
Current path terminates, and traverses other paths；
(3) judge s whether dbjective state, if dbjective state, then find a counter-example path, perform step 3)；If no
It is further to judge s whether by other state coverages；If s is capped, does not need to explore current path, traverse other roads
Diameter；If s is uncovered, continue to explore current path；
(4) it if there is the reachable state not being traversed, then jumps to (1)；Otherwise, verification terminates, program safety.
6. Chemical Manufacture control system as described in claim 1, which is characterized in that the acquisition/control module is for direct
Carry out data acquisition and function control to production object, control object, and by the data information acquisition of production/control object module
It concentrates afterwards and passes to monitoring module, analyzed, while download and receive control instruction and operational order that monitoring module transmits
Industry Control is carried out to specific object.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711423570.1A CN108153262B (en) | 2017-12-25 | 2017-12-25 | Chemical production control system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711423570.1A CN108153262B (en) | 2017-12-25 | 2017-12-25 | Chemical production control system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108153262A true CN108153262A (en) | 2018-06-12 |
| CN108153262B CN108153262B (en) | 2020-08-28 |
Family
ID=62462070
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711423570.1A Expired - Fee Related CN108153262B (en) | 2017-12-25 | 2017-12-25 | Chemical production control system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108153262B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103970653A (en) * | 2014-04-29 | 2014-08-06 | 南京邮电大学 | Sensor network software accessibility verification method |
| CN104932474A (en) * | 2015-06-16 | 2015-09-23 | 滁州市西控电子有限公司 | Chemical production control system |
| CN106504297A (en) * | 2016-09-14 | 2017-03-15 | 陕西理工学院 | The flexible wrench tectonics method of the increment of interpolation curve or curved surface based on B-spline |
-
2017
- 2017-12-25 CN CN201711423570.1A patent/CN108153262B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103970653A (en) * | 2014-04-29 | 2014-08-06 | 南京邮电大学 | Sensor network software accessibility verification method |
| CN104932474A (en) * | 2015-06-16 | 2015-09-23 | 滁州市西控电子有限公司 | Chemical production control system |
| CN106504297A (en) * | 2016-09-14 | 2017-03-15 | 陕西理工学院 | The flexible wrench tectonics method of the increment of interpolation curve or curved surface based on B-spline |
Non-Patent Citations (1)
| Title |
|---|
| 张波: "基于动态执行的C程序复杂循环检测方法", 《中国优秀硕士学位论文全文数据库（电子期刊）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108153262B (en) | 2020-08-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103823666B (en) | Smart substation equipment visualized programming method | |
| AlBahnassi et al. | Near real-time motion planning and simulation of cranes in construction: Framework and system architecture | |
| CN103116540B (en) | Dynamic symbol execution method based on global superblock domination graph | |
| Larsson | ObjectStab-an educational tool for power system stability studies | |
| CN103279124B (en) | Experiment system oriented to development of motor controller of electric vehicle | |
| CN109344476B (en) | CIM model-based power distribution network single line diagram line branch structure generation method and device | |
| CN108804391A (en) | A kind of building method and system of interpolation curve or curved surface based on B-spline | |
| CN107092736A (en) | A kind of PLC Hardware Implementations of Shop Floor Petri net model | |
| Johnstone et al. | A co-simulation approach using powerfactory and matlab/simulink to enable validation of distributed control concepts within future power systems | |
| CN104866319B (en) | The method of logic chart execution sequence and feedback decoupling based on adjacency matrix | |
| CN108153262A (en) | A kind of Chemical Manufacture control system | |
| Li et al. | Recursive modeling of stateflow as input/output-extended automaton | |
| CN107168298A (en) | Ladder diagram dynamic analysis method | |
| Fadzail et al. | Application of Automated Machine Learning (AutoML) method in wind turbine fault detection | |
| Xiao et al. | A hierarchy framework on compositional verification for PLC software | |
| Frehse et al. | Modular analysis of discrete controllers for distributed hybrid systems | |
| CN110059354A (en) | A kind of electric system real-time electromechanical transient emulation method based on FPGA | |
| Maier et al. | Automated generation of timing models in distributed production plants | |
| CN110262288A (en) | A kind of electric power isomery hybrid real-time simulation system | |
| Huang et al. | An optimal directed control framework for discrete event systems | |
| CN109754087A (en) | Quantum program method for transformation, device and electronic equipment | |
| Yu et al. | A graphical method for multi-signal flow graph modeling and testability analysis based on visio control component | |
| Zhou et al. | Design and Manufacturing of Large Amusement Devices for Performance and Reliability with Qualitative Reasoning | |
| Su et al. | HSTCG: State-Aware Simulink Model Test Case Generation with Heuristic Strategy | |
| Meng et al. | Formal verification for embedded software with cognitive environment modelling |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200828 |