CN103218497A - Dynamical system on line incremental quick verification system based on increment linear programming and method thereof - Google Patents
Dynamical system on line incremental quick verification system based on increment linear programming and method thereof Download PDFInfo
- Publication number
- CN103218497A CN103218497A CN2013101469286A CN201310146928A CN103218497A CN 103218497 A CN103218497 A CN 103218497A CN 2013101469286 A CN2013101469286 A CN 2013101469286A CN 201310146928 A CN201310146928 A CN 201310146928A CN 103218497 A CN103218497 A CN 103218497A
- Authority
- CN
- China
- Prior art keywords
- model
- solving
- linear programming
- solution
- dynamic system
- 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
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000012795 verification Methods 0.000 title claims abstract description 28
- 238000005183 dynamical system Methods 0.000 title 1
- 238000012986 modification Methods 0.000 claims abstract description 12
- 230000004048 modification Effects 0.000 claims abstract description 12
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 230000001360 synchronised effect Effects 0.000 claims 1
- 238000004458 analytical method Methods 0.000 abstract description 5
- 238000002156 mixing Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000012360 testing method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Images
Landscapes
- Debugging And Monitoring (AREA)
Abstract
The invention provides a dynamic system on line incremental quick verification system based on an increment linear programming and a dynamic system on line incremental quick verification method based the an increment linear programming. The dynamic system on line incremental quick verification method based the increment linear programming comprises the following steps: firstly, loading a problem model of a dynamic system, comparing the problem model of the dynamic system with an original problem model, modifying the original problem model according to a compared result; then adopting a new problem model and an original linear programming solving model, modifying the original linear programming solving model according to a coding rule so as to obtain a linear programming solving model after being modified, and giving a solved result. Based on a linear blending together automat accessibility analytical method based on the linear programming, the dynamic system on line incremental quick verification method based the increment linear programming puts forward a dynamical problem model modification strategy and accelerates solving of a new problem through reuse of the solved result of an original problem so as to achieve on line incremental quick verification of the dynamic system, greatly improves a solving speed of the problem and can meet a real-time requirement of the verification of the dynamic system.
Description
Technical field
The present invention relates to a kind of quick verification method of dynamic system, and particularly relevant for quick verification system of the online increment type of a kind of dynamic system based on the increment linear programming and method.
Background technology
Dynamic system has application more and more widely in modern society, be widely used in fields such as track traffic, Aero-Space, and there is high requirement in these systems to security.
Blending together automat is a kind of formal dynamic system descriptive model.Most of character of dynamic system comprise that security, activity etc. can be summed up as the corresponding Reachability question that blendes together automat.The approachability analysis that blendes together automat is very difficult, all is undecidable even its subclass linearity blendes together the accessibility of automat.
The existing automat analysis method of reachability that blendes together mainly contains two kinds: an is-symbol model testing (Symbolic Model Checking), its main thought are to adopt to handle whole state space such as the polyhedron Calculation Method; Another is the bounded model testing, and its main thought is that the bounded Reachability question is converted into the satisfiability problem that the boolean combination by linear restriction and proposition vairable constitutes, and finds the solution with corresponding SMT solver then.
Above-mentioned two kinds of methods will be to the whole state spaces in whole or the fintie number of steps, so they are facing to the problem of state space blast, this has seriously limited the problem scale that they can find the solution, and makes them can't be applied to the demand of technical grade.
Whether before this, industry has proposed a kind of linearity based on linear programming again and has blended together the automat analysis method of reachability, and this method is by arriving all paths of destination node in the traversal certain-length, can reach thereby the accessibility of verifying each paths obtains destination node.This method has significantly reduced the problem scale of at every turn finding the solution, and has improved greatly and has found the solution efficient and problem scale.But this method can not satisfy the real-time verification demand of dynamic system.
Summary of the invention
The object of the invention is to provide a kind of and continues the verification system method more efficiently, to satisfy the checking real-time of dynamic system.
For reaching above-mentioned purpose, the present invention at first proposes the quick verification system of the online increment type of a kind of dynamic system based on the increment linear programming, comprising: the multiplexing module of finding the solution of problem model load-on module, solving model modified module and model; Wherein, problem model load-on module input problem model file, and obtain new problem model, the solving model modified module is revised the linear programming solving model according to new problem model, former linear programming solving model and coding rule, model is multiplexing finds the solution the amended linear programming of module invokes and finds the solution new problem model, and provides solving result.
Wherein, the problem model file of dynamic system comprises single automat file and dynamic system model file.
Wherein, it is specific as follows that the problem model load-on module obtains the step of new problem model: judge whether earlier to finding the solution for the first time, if find the solution for the first time, then at first create Vector container storage model content, wherein element is single automat fileinfo, comprises file address, path and parameter set; If not find the solution for the first time, then in the loading problem model, check whether there has been corresponding automat in the Vector container, thereby obtain the modification strategy of problem model, load initiate automat according to the mark result, and revise the problem model of Vector container, get problem model newly.
Wherein, the concrete steps that the solving model modified module is revised the linear programming solving model are as follows: judge whether earlier to finding the solution for the first time, if find the solution for the first time, need to create the linear programming solving model and problem model is encoded to the linear programming constraint set; If not find the solution for the first time, then revise the strategy modification solving model, thereby obtain the solving model corresponding with new problem model according to the problem model that has obtained.
Wherein, model is multiplexing finds the solution module to find the solution the concrete steps of new problem model as follows: the multiplexing parameter of finding the solution of model is set, make bottom linear programming solver can be multiplexing last time solving result, call multiplexing solver, return solving result.
For reaching above-mentioned purpose, the present invention proposes the quick verification method of the online increment type of a kind of dynamic system in addition, comprises the following steps:
Step 1: the problem model that loads dynamic system;
Step 2: revise former problem model, get problem model newly;
Step 3: use new problem model, former linear programming solving model and revise former linear programming solving model, thereby obtain amended linear programming solving model according to coding rule;
Step 4: utilize amended linear programming solving model to find the solution amended problem model, and provide solving result.
Further, the content of step 1 is specific as follows: if find the solution for the first time, then set up the Vector container with the memory model content; Otherwise, the content of Vector container in the contrast, the automat that mark should be deleted, the automat that should add and the automat that remains unchanged.
Further, the content of step 2 is specific as follows: be specially according to the mark result and remove the automat that delete, the new automat that adds of loading also joins in the Vector container.
Further, the content of step 3 is specific as follows:
1), then removes its corresponding solving model coding for the automat that has been removed; Remove the automation encoding relevant simultaneously with it;
2) for the automaton model that keeps, then it is encoded according to new path and parameter set; The coding that keeps the same paths section, the coding of deletion original route different piece, the coding of adding new route different piece; Revise respective coding according to parameter set;
3), it is encoded and join solving model according to coding rule, its related constraint and join solving model of encoding simultaneously for the automaton model of new interpolation;
Further, the content of step 4 is specific as follows: the multiplexing parameter of finding the solution is set, makes amended solving model can use solving result last time; Call multiplexing solver and find the solution, and provide solving result.
The present invention has improved the efficient of the online increment type checking of dynamic system greatly, makes this technology can be applied to the online verification of actual dynamic system.Specifically, of the present invention have a following beneficial effect:
(1) effectively eliminated the influence of state space blast, found the solution efficient and can find the solution problem scale and significantly improve.
(2) effectively utilized dynamic system real-time verification model to change features of limited, utilized the multiplex technique of finding the solution of linear programming, improved greatly and found the solution efficient, well satisfied the increment type of dynamic system and verified fast.
Description of drawings
Fig. 1 is the synoptic diagram of the quick verification system of the online increment type of the dynamic system of the embodiment of the invention.
Fig. 2 is the process flow diagram of the quick verification method of the online increment type of the dynamic system of the embodiment of the invention.
Embodiment
In order more to understand technology contents of the present invention, the spy is by concrete embodiment and cooperate appended graphic being described as follows.
Fig. 1 is the synoptic diagram of the quick verification system of the online increment type of the dynamic system of the embodiment of the invention.As shown in Figure 1, the quick verification system of the online increment type of dynamic system comprises: the multiplexing module of finding the solution of problem model load-on module, solving model modified module and model.
The beginning of whole solution procedure enters the problem model load-on module, receives the problem model file, loads the problem model of dynamic system and obtains the modification strategy of problem model, thereby obtain new problem model.This module is input as the problem model file.If find the solution for the first time, then at first create the container storage model content, wherein element is single automat fileinfo, comprises file address, path and parameter set; If not find the solution for the first time, then in the loading problem model, check in the container whether had corresponding automat, thereby obtain the model modification strategy.Load initiate automat according to the mark result, and revise container model.
The model modification strategy that more than obtains refers to respect to former problem model, the automat information that new problem model should add, deletes and keep.For the automat of each reservation, also to find the solution the variation in its path, thereby determine interpolation, deletion and the reservation of corresponding encoded constraint.Concrete rule is the same section reservation for new and old path, the different piece tag delete in old path, and the different piece mark of new route adds.
The solving model modified module uses new problem model, former linear programming solving model and revises former linear programming solving model according to coding rule, thereby obtains new linear programming solving model.If find the solution for the first time, need to create the linear programming solving model and problem model is encoded to the linear programming constraint set; If not find the solution for the first time,, thereby obtain the solving model corresponding with new problem model then according to the model modification strategy modification solving model that has obtained.Concrete rule is for initiate automat, and it is encoded and adds constraint set; Revise the corresponding constraint in its path for the automat that keeps, and revise corresponding constraint according to new parameter sets.
Model is multiplexing finds the solution the increment solution technique that module is utilized linear programming, calls amended linear programming solving model and finds the solution new problem model, and provide solving result.Be specially: the multiplexing parameter of finding the solution of model is set, make bottom linear programming solver can be multiplexing last time solving result.Call multiplexing solver, return solving result.
Wherein, the problem model file comprises single automat file and dynamic system model file.Single automat file adopts the XML formal definition, has described complete linearity and has blended together automat information.These information help the corresponding automat object of reconstruct; The dynamic system model file description dynamic system characteristic to be verified, this document comprises one group of single automat file address that this dynamic system comprised routing information to be verified of corresponding automat.Wherein, single automat file address is meant the store path of this automat file, and routing information to be verified refers to the paths on the corresponding automat, corresponding to a state transitions track to be verified.
The present invention proposes the quick verification method of the online increment type of a kind of dynamic system in addition, comprises the following steps, please refer to Fig. 2:
Step 1: load the problem model of dynamic system,, then set up the Vector container with the memory model content if find the solution for the first time; Otherwise, the content of Vector container in the contrast, the automat that mark should be deleted, the automat that should add and the automat that remains unchanged.
Step 2: revise former problem model, get problem model newly, remove the automat that delete, load the new automat that adds and also join in the Vector container according to the mark result;
Step 3: use new problem model, former linear programming solving model and revise former linear programming solving model, thereby obtain amended linear programming solving model according to coding rule, specific as follows:
1), then removes its corresponding solving model coding for the automat that has been removed; Remove the automation encoding relevant simultaneously with it;
2) for the automaton model that keeps, then it is encoded according to new path and parameter set; The coding that keeps the same paths section, the coding of deletion original route different piece, the coding of adding new route different piece; Revise respective coding according to parameter set;
3), it is encoded and join solving model according to coding rule, its related constraint and join solving model of encoding simultaneously for initiate automaton model.
Step 4: the multiplexing parameter of finding the solution is set, makes amended linear programming solving model can use solving result last time; Call multiplexing solver and find the solution, and provide solving result.
In sum, method and system proposed by the invention at first loads the problem model of dynamic system, then itself and former problem model is compared, and revises former problem model according to comparing result; Use new problem model, former linear programming solving model to revise former linear programming solving model then, thereby obtain new linear programming solving model according to coding rule; Use the increment solution technique of linear programming at last, utilize amended linear programming solving model to find the solution new problem model, and provide solving result.This method blendes together on the basis of automat analysis method of reachability in the linearity based on linear programming, propose dynamic problem model and revised strategy, and the solving result of multiplexing former problem quickens finding the solution of new problem, verifies fast with the online increment type that reaches dynamic system.The principal feature of this method is the model creation and the checking of increment type, has significantly improved the speed of finding the solution of problem, can satisfy the real-time requirement of dynamic system.
Though the present invention discloses as above with preferred embodiment, so it is not in order to limit the present invention.The persond having ordinary knowledge in the technical field of the present invention, without departing from the spirit and scope of the present invention, when being used for a variety of modifications and variations.Therefore, protection scope of the present invention is as the criterion when looking claims person of defining.
Claims (7)
1. the quick verification system of the online increment type of the dynamic system based on the increment linear programming is characterized in that, comprising: the multiplexing module of finding the solution of problem model load-on module, solving model modified module and model; Wherein, problem model load-on module input problem model file, and obtain new problem model, the solving model modified module is revised the linear programming solving model according to new problem model, former linear programming solving model and coding rule, model is multiplexing finds the solution the amended linear programming of module invokes and finds the solution new problem model, and provides solving result; The problem model file of dynamic system comprises single automat file and dynamic system model file;
It is specific as follows that wherein the problem model load-on module obtains the step of new problem model:
Judge whether earlier that to finding the solution for the first time if find the solution for the first time, then at first create Vector container storage model content, wherein element is single automat fileinfo, comprises file address, path and parameter set; If not find the solution for the first time, then in the loading problem model, check whether there has been corresponding automat in the Vector container, thereby obtain the modification strategy of problem model, load initiate automat according to the mark result, and revise the problem model of Vector container, get problem model newly;
Wherein the concrete steps of solving model modified module modification linear programming solving model are as follows:
Judge whether earlier to finding the solution for the first time,, need to create the linear programming solving model and problem model is encoded to solving model if find the solution for the first time; If not find the solution for the first time, then revise the strategy modification solving model, thereby obtain the solving model corresponding with new problem model according to the problem model that has obtained.
2. the quick verification system of the online increment type of dynamic system according to claim 1 is characterized in that, wherein model is multiplexing finds the solution module to find the solution the concrete steps of new problem model as follows:
The multiplexing parameter of finding the solution of model is set, make bottom linear programming solver can be multiplexing last time solving result, call multiplexing solver, return solving result.
3. the quick verification method of the online increment type of the dynamic system based on the increment linear programming is characterized in that, comprises the following steps:
Step 1: the problem model that loads dynamic system;
Step 2: revise former problem model, get problem model newly;
Step 3: use new problem model, former linear programming solving model and revise former linear programming solving model, thereby obtain amended linear programming solving model according to coding rule;
Step 4: utilize amended linear programming solving model to find the solution new problem model, and provide solving result.
4. the quick verification method of the online increment type of dynamic system according to claim 3 is characterized in that the content of step 1 is specific as follows: if find the solution for the first time, then set up the Vector container with the memory model content; Otherwise, the content of Vector container in the contrast, the automat that mark should be deleted, the automat that should add and the automat that remains unchanged.
5. the quick verification method of the online increment type of the dynamic system based on the increment linear programming according to claim 3, it is characterized in that, the content of step 2 is specific as follows: be specially according to the mark result and remove the automat that delete, the new automat that adds of loading also joins in the Vector container.
6. the quick verification method of the online increment type of dynamic system according to claim 3 is characterized in that the content of step 3 is specific as follows:
1), then removes its corresponding solving model coding for the automat that has been removed; Remove the automation encoding relevant simultaneously with it;
2) for the automaton model that keeps, then it is encoded according to new path and parameter set; The coding that keeps the same paths section, the coding of deletion original route different piece, the coding of adding new route different piece; Revise respective coding according to parameter set;
3), it is encoded and join new solving model according to coding rule, its relevant synchronous event and join new solving model of encoding simultaneously for the automaton model of new interpolation.
7. the quick verification method of the online increment type of the dynamic system based on the increment linear programming according to claim 3 is characterized in that the content of step 4 is specific as follows:
The multiplexing parameter of finding the solution is set, makes amended solving model can use solving result last time; Call multiplexing solver and find the solution, and provide solving result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310146928.6A CN103218497B (en) | 2013-04-24 | 2013-04-24 | Dynamic system based on increment linear programming online increment type fast verification system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310146928.6A CN103218497B (en) | 2013-04-24 | 2013-04-24 | Dynamic system based on increment linear programming online increment type fast verification system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103218497A true CN103218497A (en) | 2013-07-24 |
| CN103218497B CN103218497B (en) | 2016-03-02 |
Family
ID=48816278
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310146928.6A Active CN103218497B (en) | 2013-04-24 | 2013-04-24 | Dynamic system based on increment linear programming online increment type fast verification system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103218497B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106355252A (en) * | 2016-08-29 | 2017-01-25 | 桂林电子科技大学 | Incremental verification method for ASP knowledge base based on access control permission |
| CN112162932A (en) * | 2020-10-30 | 2021-01-01 | 中国人民解放军国防科技大学 | Symbol execution optimization method and device based on linear programming prediction |
| CN113872784A (en) * | 2020-06-30 | 2021-12-31 | 华为技术有限公司 | Network configuration verification method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070271204A1 (en) * | 2006-05-19 | 2007-11-22 | Gm Global Technology Operations, Inc. | Verification of Linear Hybrid Automaton |
| CN102636992A (en) * | 2012-04-19 | 2012-08-15 | 南京理工大学常熟研究院有限公司 | Modeling based on piecewise-linear system of hybrid system theory and control method |
-
2013
- 2013-04-24 CN CN201310146928.6A patent/CN103218497B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070271204A1 (en) * | 2006-05-19 | 2007-11-22 | Gm Global Technology Operations, Inc. | Verification of Linear Hybrid Automaton |
| CN102636992A (en) * | 2012-04-19 | 2012-08-15 | 南京理工大学常熟研究院有限公司 | Modeling based on piecewise-linear system of hybrid system theory and control method |
Non-Patent Citations (1)
| Title |
|---|
| 卜磊等: "BACH:线性混成系统有界可达性模型检验工具", 《软件学报》, no. 4, 15 April 2011 (2011-04-15), pages 644 - 647 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106355252A (en) * | 2016-08-29 | 2017-01-25 | 桂林电子科技大学 | Incremental verification method for ASP knowledge base based on access control permission |
| CN113872784A (en) * | 2020-06-30 | 2021-12-31 | 华为技术有限公司 | Network configuration verification method and device |
| CN113872784B (en) * | 2020-06-30 | 2022-12-06 | 华为技术有限公司 | Network configuration verification method and device |
| CN112162932A (en) * | 2020-10-30 | 2021-01-01 | 中国人民解放军国防科技大学 | Symbol execution optimization method and device based on linear programming prediction |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103218497B (en) | 2016-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101398845B (en) | Multi-language binding method and system in web applications | |
| CN109670053B (en) | Data object mapping method, device, equipment and computer readable storage medium | |
| Sherali et al. | The time‐dependent shortest pair of disjoint paths problem: Complexity, models, and algorithms | |
| Lee et al. | Benders decomposition approach for the robust network design problem with flow bifurcations | |
| CN103218497A (en) | Dynamical system on line incremental quick verification system based on increment linear programming and method thereof | |
| CN106649344B (en) | Weblog compression method and device | |
| CN110659905A (en) | Transaction verification method, device, terminal equipment and storage medium | |
| CN103400025B (en) | A kind of analysis method of reachability of hybrid system | |
| CN103336884A (en) | Modeling and path-oriented reachability analysis method of non-linear hybrid system | |
| Barbierato et al. | Exploiting multiformalism models for testing and performance evaluation in SIMTHESys | |
| CN105335160B (en) | A kind of WEB terminal component agile development method based on JSF | |
| WO2015107711A1 (en) | Model inspection device for distributed environment model, model inspection method for distributed environment model, and program | |
| CN102236679A (en) | Method and device for outputting workflow based on browser page | |
| CN105224305A (en) | Function call path decoding method, Apparatus and system | |
| CN113268368B (en) | Safety key data maintenance method for combined spacecraft based on flight mission profile | |
| Caspi et al. | Actors without directors: A Kahnian view of heterogeneous systems | |
| CN104572802A (en) | Method and system used for loading data with complex relationships | |
| CN107301063B (en) | Mirror image management method and device | |
| CN110888883A (en) | Data storage method, device, system and storage medium | |
| CN103279488B (en) | Minimum is unsatisfactory for the hybrid system analysis method of reachability of tree guidance | |
| Yu et al. | Modeling and analyzing SMIL documents in SAM | |
| Mohan et al. | Predicting and accessing reliability of components in component based software development | |
| Peng et al. | Verifying Behavioral Correctness of Design Pattern Implementation. | |
| Wimmer et al. | Optimization techniques for BDD-based bisimulation computation | |
| Kim et al. | Widening with thresholds via binary search |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |