CN104951618A - Possibility measurement calculating tree logic detection model optimization method - Google Patents
Possibility measurement calculating tree logic detection model optimization method Download PDFInfo
- Publication number
- CN104951618A CN104951618A CN201510394450.8A CN201510394450A CN104951618A CN 104951618 A CN104951618 A CN 104951618A CN 201510394450 A CN201510394450 A CN 201510394450A CN 104951618 A CN104951618 A CN 104951618A
- Authority
- CN
- China
- Prior art keywords
- calculation idea
- possibility measures
- possibility
- model
- formula
- 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.)
- Pending
Links
Landscapes
- Stored Programmes (AREA)
Abstract
The invention discloses a possibility measurement calculating tree logic detection model optimization method realized by an I-PM_CT model detection algorithm; the I-PM_CT model detection algorithm is calculating tree logic model detection mark algorithm based on possibility measurement, and comprises the following steps: using related possibility measurement to calculate a logic tree formula, and pre-processing uniqueness of a mark common subexpression; setting a common subexpression and possibility measurement calculating tree logic model state while fully ensuring a model detection space balance state. The I-PM_CT model detection algorithm can greatly reduce related time complexity on one hand, and improves verify performance on the other hand, and can be applied in highly complex and large scale environment through viewing experiment analysis.
Description
Technical field
The present invention relates to a kind of optimization method of detection model, especially a kind of optimization method of possibility measures calculation idea detection model, belongs to model inspection technical field.
Background technology
As the software and hardware device verification method of a kind of intellectuality, robotization, model inspection has all many-sided advantages, such as there are higher applicability, accuracy and high efficiency etc., just because of it, there is above-mentioned advantage, make it well received in all many-sides such as software and hardware Integrated designs, and obtain wideling popularize of relevant research and development unit.
Present stage, a large amount of associated specialist launches to inquire into this problem of mode detection, achieves a series of progress, Kattenbelt etc.
[1]illustrate in research process based on possibility measures calculation idea (PoCTL
[2-4]) certification mark algorithm, this algorithm can detect its finite state concurrent system very accurately and whether conform to the calculation idea formula specification of possibility measures, also describe its matching degree simultaneously, for the intellectualized detection principle inquiring into concurrent system has further established solid foundation, but PoCTL labeling algorithm still has certain weak point, such as it has relatively high time complexity, and the difficulty carrying out on a large scale using is very large; Also has Zhao Lin etc.
[5]in research process, the careful complicacy having inquired into the calculation idea formula of possibility measures, but its labeling algorithm has weak point, and such as verification efficiency is not high, cannot obtain penetration and promotion equally; There is foreign scholar Alur
[6]at Zhao Lin etc.
[5]under the prerequisite inquired into, design obtains the algorithm of Optimization-type, this algorithm mainly by one in advance model evaluation mechanism common subexpression is described, reduce the task amount of redundant validation to a great extent, finally can obtain higher verification efficiency, but the Pre-Evaluation used in this kind of algorithm mechanism needs very high extraneous expense, although it can improve verification efficiency, but but do not improve the overall cost performance of model inspection, in view of the reason of this aspect, a kind of this method is also difficult to obtain penetration and promotion.In addition, also have Zhou Conghua, Baier, Yang Jinji etc. in research process, have inquired into " State space explosion " problem further
[7-9].
Be not difficult to find out by analyzing current Most models etection theory result, emphasis is this problem of uniqueness having inquired into software and hardware system, and namely a model inspection just can carry out one-time authentication.But in the new period that current software and hardware technology sharply advances, its scale and regional extent improve constantly, the uniqueness detection technique in past cannot meet reality need.To validation region scope and the larger situation of sizable application, current model inspection is mainly processed by the mode of " defeating in detail ", but this kind of verification mode also exists certain weak point, namely detection efficiency is not high, fully cannot meet the performance requirement of authentication mechanism.
In sum, there are problems, such as low performance efficiency and high time complexity in the checking of possibility measures calculation idea model inspection.
The above list of references mentioned is as follows:
[1]KATTENBELT M，KWIATKOWSKA M，NORMAN G，et al.A game-based abstraction refinement framework for Markov decision processes[J].Formal Methods in System Design，2010，36(3)：246-280.
[2] Deng Hui, Xue Yan, Li Yali, etc. based on calculation idea CTL* and the possibility Mutual simulation [J] of possibility measures. computer science, 2012,39 (10): 258-263.
[3] grand view army, Wang Qing, Hou Lifeng, etc. based on the application of genetic algorithm in Intermodal Transportation Problems [J] of Pareto fitness. Southwestern Normal University's journal: natural science edition, 2012,37 (9): 43-47.
[4] Wang Shiping, Jiang Ling, Xiong Jiang, etc. a kind of association rules mining algorithm based on sequence number [J]. Southwestern University's journal: natural science edition, 2011,33 (3): 122-127.
[5] Zhao Lin, Wu Jinzhao. the multivalued model based on Wu Ritt's method is checked [J]. system science and mathematics, 2008,28 (8): 1020-1029.
[6]ALUR R.Model checking：from tools to theory[J].Lecture Notes in Computer Science.2008.5000：89-106.
[7] Zhou Conghua, Liu Zhifeng, Wang Changda. the gauge model inspection [J] of probability calculation tree logic. Journal of Software, 2012,23 (7): 1656-1668.
[8]BAIER C，KATOEN J P.Principles of Model Checking[M].Cambridge：MIT Press，2008：745-907.
[9] Yang Jinji, Su Kaile, Luo Xiangyu, etc. the optimization [J] that Bounded Model detects. Journal of Software, 2009,20 (8): 2005-2014.
Summary of the invention
The object of the invention is the defect in order to solve above-mentioned prior art, a kind of optimization method of possibility measures calculation idea detection model is provided, the I-PM_CTL model inspection algorithm that the method proposes reduces complexity correlation time on the one hand to a great extent, also makes checking performance promote to some extent on the other hand; Analyze by experiment and find out, can apply in high complexity, extensive environment.
Object of the present invention can reach by taking following technical scheme:
A kind of optimization method of possibility measures calculation idea detection model, described method adopts I-PM_CT model inspection algorithm realization, the design of described I-PM_CTL model inspection algorithm, based on the calculation idea model inspection labeling algorithm of possibility measures, comprises the following steps:
S1, the relevant possibility measures of utilization calculate logic tree formula, the uniqueness of pre-service mark common subexpression;
S2, fully guaranteeing under model inspection spatial balance state, to set common subexpression and possibility measures calculation idea model state.
As a kind of embodiment, in step S1, the calculation idea formula of described possibility measures is expressed by the extension mechanism of syntax tree logical organization, is specially:
If the standard syntax tree logical organization of the calculation idea formula of possibility measures is T < root
t>, in this case, then its extension syntax tree logical organization S < root
sthe generating step of > is as follows:
1) initialization S < root
s>, i.e. root
s=null;
2) to T < root
t> implements postorder traversal process, is exported by a certain node N, when this node N is empty, in this case, then performs step 5), otherwise, perform step 3);
3) if step 2) N that exports is unique, satisfies condition simultaneously
then form new node M; Otherwise, if N is unique, satisfy condition simultaneously
in this case, then step 2 is performed); In addition, if N is not exclusive, in this case, then N belongs to conjunctive word, performs step 4);
4) if step 2) N that exports is intermediate node, also satisfies condition
and when root node is N and the Sub-tree Matching of S, in this case, then N is the common subexpression of this parse tree; Otherwise, form new node M, trace back to the child node of S simultaneously from T, utilize conjunctive word to label, return and perform step 2);
5) if root
s=M, in this case, then exports the root node information of S, i.e. root
s.
As a kind of embodiment, in step S2, fully guaranteeing under model inspection spatial balance state, to set common subexpression and possibility measures calculation idea model state, be specially:
If
for the subexpression of the calculation idea formula φ of a certain possibility measures, in this case, so satisfied
ψ is simultaneously
direct subexpression, if the whole ψ of pre-service, unique identification is implemented to the direct subexpression of the calculation idea set of formulas C of a certain possibility measures, detects
concrete steps as follows:
1) judge
whether implement unique identification, if so, then perform step 2); If not, then step 3 is performed);
2) judge
whether implement
checking, if so, so then continues step 5), if not, then perform step 3);
3) according to the unique identification information in conjunctive word and pre-service mechanism, search meets the demands
state, then perform step 4);
4) if
for the common subexpression of the calculation idea formula of possibility measures, the calculation idea set of formulas C of real-time corresponding a certain possibility measures in M
status information, in extendability syntax tree logical organization
unique identification's examinations operates, and then performs step 5);
5) if
of equal value with φ, in this case, then the unique identification of its not common subexpression is deleted, otherwise, will
unique identification's status information exports.
As a kind of embodiment, step 3) in, described in meet the demands
state, refers to
meet following formula:
As a kind of embodiment, there is following relationship in the calculation idea set of formulas C of described a certain possibility measures:
As a kind of embodiment, the input parameter of described I-PM_CTL model inspection algorithm is made up of two parts, and these two parts are extendability syntax tree logical organization and the migratory system model M of detected state S set, for the calculation idea formula of all possibility measures
, after utilizing I-PM_CTL model inspection algorithm process mechanism, output valve is
the result.
The present invention has following beneficial effect relative to prior art:
1, the inventive method is based on the calculation idea model inspection labeling algorithm of possibility measures, adopt I-PM_CT model inspection algorithm realization, I-PM_CT model inspection algorithm is compared with traditional labeling algorithm, and the processing time period of use is relatively short, has relatively high effectiveness of performance simultaneously.
2, the I-PM_CT model inspection algorithm that the inventive method adopts utilizes pre-service mechanism to realize unique identification, the calculation idea formula syntax tree logical organization of the possibility measures that repeatedly there is redundancy is combined, guarantee to unify to detect its redundancy common subexpression, there is when solving the model inspection checking of current use the drawback of common subexpression redundant validation.
3, the I-PM_CT model inspection algorithm that adopts of the inventive method is known by simulated experiment, under the condition of the calculation idea formula check processing of high complexity, large-scale possibility measures, still can be realized associated verification work by relatively higher effectiveness of performance, therefore, it is possible to apply in extensive CTL formal test.
Accompanying drawing explanation
Fig. 1 is the I-PM_CT model inspection algorithm flow chart of the embodiment of the present invention 1.
Fig. 2 is that the formula (1) of the embodiment of the present invention 1 combines extendability syntax tree logical organization with (2).
Fig. 3 is program state and the model inspection time cycle comparison diagram of the embodiment of the present invention 1.
Fig. 4 is the I-PM_CTL model inspection algorithm performance efficiency change figure of the embodiment of the present invention 1.
Embodiment
Below in conjunction with embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are not limited thereto.
Embodiment 1:
The optimization method of the possibility measures calculation idea detection model of the present embodiment adopts I-PM_CT model inspection algorithm realization, and described I-PM_CTL model inspection algorithm realizes based on the calculation idea model inspection labeling algorithm of possibility measures.
1) correlation theory
Prerequisite is that in model inspection mechanism, triangular web structural model has some features, and describe software and hardware system structural model on this basis, S refers to detected state set herein; M refers to migratory system model; C refers to the calculation idea set of formulas of a certain possibility measures, also there is following relationship simultaneously:
whether find out thus, namely testing mechanism conforms to the calculation idea formula model of possibility measures some in C to M and verifies, specifically, namely
in general, the calculation idea model inspection labeling algorithm of its possibility measures does not still verify each common subexpression, in view of the reason of this aspect, and next main key feature and the subject matter inquiring into model inspection mechanism.
1.1) labeling algorithm
Labeling algorithm is the conventional process mechanism of verification computation tree logical formula (CTL)
[10], its ultimate principle selects a certain associative combination met the demands
the first step, replaced the calculation idea formula of some possibility measures by its associative combination equity formalized description
second step, to detect successively
the accordance of the subexpression of serialization, carrys out the relevant state information of Labeled transition system M with the subexpression met the demands, until detected
till the subexpression of serialization; The M state set of the 3rd step, marks for treatment, determines that original state is the calculation idea formula with certain possibility measures
correlated condition
[11-13]conform to.Next will set forth in detail:
Illustrate that 1 replaces the calculation idea formula of a possibility measures with ψ
subexpression, here
Illustrate 2
form a kind of specific syntax tree logic according to structure grammar, leafy node is
subexpression, other all belong to associative combination
the inside a certain.
The 3 calculation idea formula establishing multiple possibility measures are described
have identical subexpression ψ, in this case, then ψ belongs to
common subexpression.
Illustrate that 4 establish
for associative combination
n unit conjunctive word.
Illustrate that 5 establish ψ
1, ψ
2with
for the calculation idea formula of known possibility measures, if meet condition below, namely:
In this case, then ψ
1, ψ
2belong to
direct subexpression.
1.2) common subexpression redundancy validation problem
The calculation idea formula ψ of the predetermined possibility measures of inference 1
iwith
ψ here
ifor
subexpression, have in this case
then the result
m must be met, s|=ψ
i(ψ
i∈ C, s ∈ S).
Specifically can be proved by step below: because of
then can make following statement:
θ simultaneously
k, op
kcalculating tree conjunctive word and the logical formula of possibility measures is respectively both (0 < k≤i).If exist and meet δ=θ
iop
i(ψ) formula, in this case, then
and meet explanation 5 related conditions.
Be not difficult to find out by proof result above, verify M in advance, s|=δ
i(δ
i∈ C, s ∈ S) must M be met, s|=ψ
i(ψ
i∈ C, s ∈ S).
If SAT (ψ) is process M, s|=ψ
i(ψ
i∈ C, s ∈ S) method of operating, the output valve obtained is the set meeting ψ, and the calculation idea formula labeling algorithm of such possibility measures should be verified from the direct common subexpression illustrated in 5, then δ
icertain associating is there is, shown in specifically seeing below with ψ:
1)
SAT(δ)＝S-SAT(ψ)；
2)δ＝ψ∧ψ
1，SAT(δ)＝SAT(ψ)∩SAT(ψ
1)；
3)δ＝ψ∨ψ
1，SAT(δ)＝SAT(ψ)∪SAT(ψ
1)；
4)δ＝ψ→ψ
1，
5)δ＝AXψ，
6)δ＝EXψ，SAT(δ)＝SAT
EX(ψ)；
7)δ＝A[ψUψ
1]，
8)δ＝E[ψUψ
1]，SAT(δ)＝SAT
EU(ψ，ψ
1)；
9)δ＝EFψ，SAT(δ)＝SAT
EU(T，ψ)；
10)δ＝EGψ，
11)δ＝AFψ，SAT(δ)＝SAT
AF(ψ)；
12)δ＝AGψ，
Found by front four formulas above: the Output rusults that just can obtain SAT (δ) after obtaining SAT (ψ).According to the formalization equivalent mechanism of the calculation idea formula of possibility measures
[14], rear eight formulas are by associative combination
formalization representation, can also be learnt by treatment mechanism above, just can obtain the Output rusults of SAT (δ) after obtaining SAT (ψ).Thus acquisition result: if
in this case, if then think checking M, s|=δ
i(δ
i∈ C, s ∈ S), then must first to M, s|=ψ
i(ψ
i∈ C, s ∈ S) verify.
The calculation idea formula of the predetermined possibility measures of reasoning 1
with
if
ψ
ifor
with
common subexpression, then model inspection labeling algorithm proof procedure pair
with
repeated authentication M, s|=ψ
i(ψ
i∈ C, s ∈ S).
The calculation idea formula of the predetermined possibility measures of inference 2
if
in this case, then model inspection labeling algorithm checking
shi Biran redundant validation M, s|=δ (δ ∈ C, s ∈ S).
Can find out via above-mentioned analysis, still there is weak point more or less, particularly this problem of common subexpression redundant validation in the calculation idea formula of current possibility measures in model inspection labeling algorithm authentication mechanism.
2) I-PM_CT model inspection algorithm
Model inspection for the current use proposed in foregoing has the drawback of common subexpression redundant validation when verifying, the calculation idea formula of possibility measures is utilized to carry out pre-service to the common subexpression in mark formulary, during checking, model state and common subexpression are bound, scientific and reasonable description common subexpression, prevents repeated authentication.
As shown in Figure 1, I-PM_CT model inspection algorithm comprises the following steps:
2.1) relevant possibility measures is utilized to calculate logic tree formula, the uniqueness of pre-service mark common subexpression;
For fully guaranteeing that the common subexpression model inspection of the calculation idea formula of possibility measures only processes once in verifying, expressed the calculation idea formula of possibility measures by the extension mechanism of syntax tree logical organization
[15-16].Specific as follows:
If the standard syntax tree logical organization of the calculation idea formula of possibility measures is T < root
t>, in this case, then its extension syntax tree logical organization S < root
sthe generating step of > is as follows:
A) initialization S < root
s>, i.e. root
s=null;
B) to T < root
t> implements postorder traversal process, is exported by a certain node N, when this node N is empty, in this case, then performs step e), otherwise, perform step c);
If c) step b) N that exports is unique, satisfies condition simultaneously
then form new node M; Otherwise, if N is unique, satisfy condition simultaneously
in this case, then step b is performed); In addition, if N is not exclusive, in this case, then N belongs to conjunctive word, performs steps d);
If d) step b) N that exports is intermediate node, also satisfies condition
and when root node is N and the Sub-tree Matching of S, in this case, then N is the common subexpression of this parse tree; Otherwise, form new node M, trace back to the child node of S simultaneously from T, utilize conjunctive word to label, return and perform step b);
If e) root
s=M, in this case, then exports the root node information of S, i.e. root
s.
According to associative combination
enumerate the calculation idea formula that example illustrates possibility measures, specific as follows:
Can draw like this, the node set that above-mentioned formula (1) and formula (2) common subexpression build is
here p and p ∧ q is respectively
with the direct subexpression of EX (p ∧ q).
The common subexpression of the calculation idea formula of possibility measures is present in inside any subformula, how to complete the one-time detection to the common subexpression repeatedly existed, prevent the structure emphasis that redundancy detection has developed into novel syntax tree logical organization; Mainly utilize pre-service mechanism to realize unique identification here, the calculation idea formula syntax tree logical organization of the possibility measures that repeatedly there is redundancy is combined, guarantee to unify to detect its redundancy common subexpression.
Formula (1) and formula (2) carry out combining formed extendability syntax tree logical organization, as shown in Figure 2.
2.2) fully guaranteeing under model inspection spatial balance state, to set common subexpression and possibility measures calculation idea model state.
The input parameter of I-PM_CTL model inspection algorithm is made up of two parts, and these two parts are extendability syntax tree logical organization and the migratory system model M of detected state S set, for the calculation idea formula of all possibility measures
, after utilizing I-PM_CTL model inspection algorithm process mechanism, output valve is
the result.There are differences with traditional algorithm, the present embodiment modified hydrothermal process had increased above-mentioned formula pre-service mechanism newly before carrying out model inspection checking, determine that whether direct the subexpression of the calculation idea formula of its possibility measures is, whether public, for unique identification is implemented in the subexpression of the calculation idea formula of each possibility measures, if demonstrate common subexpression, in this case, again verification operation can not be implemented to it during subsequent authentication; For making its effectiveness of performance increase to some extent, after adopting I-PM_CTL model inspection mechanism to have detected the calculation idea formula of each possibility measures, the unique identification of not common subexpression will be deleted.
If
for the subexpression of the calculation idea formula φ of a certain possibility measures, in this case, so satisfied
ψ is simultaneously
direct subexpression, if the whole ψ of pre-service, unique identification is implemented to the direct subexpression of the calculation idea set of formulas C of a certain possibility measures, detects
concrete steps as follows:
A) judge
whether implement unique identification, if so, then perform step b); If not, then step c is performed);
B) judge
whether implement
checking, if so, so then continues step e), if not, then perform step c);
C) according to the unique identification information in conjunctive word and pre-service mechanism, search meets the demands
state, then performs steps d);
Meet the demands
state, refers to
meet following formula:
If d)
for the common subexpression of the calculation idea formula of possibility measures, the calculation idea set of formulas C of real-time corresponding a certain possibility measures in M
status information, in extendability syntax tree logical organization
unique identification's examinations operates, and then performs step e);
If e)
of equal value with φ, in this case, then the unique identification of its not common subexpression is deleted, otherwise, will
unique identification's status information exports.
Input：Kripke*module，Tree*ctl_tree，Formular*f；
// system model, PoCTL formula extendability syntax tree logical organization, subexpression f to be verified;
Output:Kripke*module; // mark f and state after system model
global Formular*g[]＝ExtractFromTree(ctl_tree)；
// produce the subexpression set g verified from extendability syntax tree logical organization, subexpression f ∈ g
3) experimental analysis
3.1) preliminary work
For verifying the advantage of above-mentioned designed optimized algorithm, simultaneously in order to test its results of property and range of application, simulation mark of correlation algorithm will be carried out by related tools such as VC and OpenGL platforms.Utilize IDA Pro instrument static treatment and analyze M=(S, →, L) system model, the running program checking it to be formed the calculation idea algorithm of possibility measures, obtains state set S={blkl, blk2,, blkn}, the mechanism of pre-service here unique identification set owner will comprise M model call parameters, pass through L={emt, syscall1, syscall2 ... syscallm} is described, and emt then represents herein does not have M model call parameters ability.In addition, the sequential relationship that the calculation idea formula of possibility measures checking feature utilizes M model to call substantially obtains for information about, below the calculation idea set of formulas of possibility measures corresponding to various sequence number different.
(i)EF((callset＝GetModuleFileName)&EF(callset＝WriteFile))；
(ii)EF(((callset＝FindFileFirst)|(callset＝FindFileFirstEx))&
EF(callset＝FindNextFile))
(iii)EF(callset＝GetSystemDirectory→
(EF(callset＝CopyFile)|EF(callset＝MoveFile)))
3.2) simulated experiment
After above-mentioned preliminary work completes, then utilize simulated experiment to test the calculation idea set of formulas of various possibility measures, concrete condition is as shown in table 1 below.
The various different experiments test result of table 1
Can be found out by table 1, with regard to same executable program Exl, the experimental result that the calculation idea set of formulas of the possibility measures of each quantity can obtain also exists certain difference.By analyze can find out, when M is the same time, assuming that when the common subexpression owning amount of the calculation idea formula of possibility measures is lower, the algorithm performance efficiency in past and processing time period relatively low
[1-2], on the contrary, assuming that when common subexpression owning amount is higher, the accordance of its model inspection authentication mechanism performance and common subexpression constantly increases.In addition, can find out, compared with conventional tag algorithm, the processing time period that the optimized algorithm that the present invention adopts uses is relatively short, has relatively high effectiveness of performance simultaneously.In order to analyze the model inspection authentication mechanism performance of contrast two kinds of algorithms under the prerequisite of the calculation idea set of formulas of same system model M and possibility measures, many group programming system models are utilized to launch research, guarantee≤10M byte, all come from the exe file computer system catalogue, as shown in Figure 3 and Figure 4 simultaneously.
As seen in Figure 3, the executable program quantity of state of system model is larger, the effectiveness of performance of I-PM_CTL model inspection algorithm better, with mention the algorithm that document [1] and document [2] propose in above-mentioned background technology and compare, I-PM_CTL model inspection algorithm has obviously performance advantage; As seen in Figure 4, I-PM_CTL model inspection algorithm improves gradually with the calculation idea formula quantity of possibility measures, its effectiveness of performance is equally in continuous increase, there is positive correlation between the two, known by experiment, under the condition of the calculation idea formula check processing of high complexity, large-scale possibility measures, optimized algorithm of the present invention still can realize associated verification work by relatively higher effectiveness of performance, therefore optimized algorithm of the present invention can be applied in extensive CTL formal test.
The document mentioned in above-described embodiment is as follows:
[10] Chen Zhiyuan, Huang Shaobin, white jade, etc. the CTL formalized description template [J] in model inspection. Harbin Engineering University's journal, 2013,34 (4): 483-487.
[11]DOVIER A，QUINTARELLI E.Applying model checking to solve queries on semistructured data[J].Computer Languages：Systems and Structures，2009，35：143-172.
[12]BARBUTI R，LEVI F，MILAZZO P，et al.Probabilistic model checking of biological systems with uncertain kinetic rattes[J].Theoretical Computer Science，2012，419：2-16.
[13]LI L J，LI Y M.Model-checking of linear-time properities in possibilistic kripke structure[C]//Proceedings ofthe QL&SC 2012，World Scientific，2012：287-294.
[14] Sun Zhian, Pei Xiaoli, Song listens. software reliability engineering [M], Beijing: publishing house of BJ University of Aeronautics & Astronautics, 2009:1-9.
[15]HARRISON J.Theorem proving for verification[C]//Proceedings of the 20th International Conference on Computer Aided Verification.Princeton，USA，2008：11-18.
[16]HOLZMANN G.The SPIN model checker：primer and reference manual[M].Upper Saddle River：Prentice Hall，2011：326-346.
In sum, the inventive method solves the weak point of low performance efficiency in the calculation idea model inspection checking of possibility measures and the aspect such as high time complexity, the I-PM_CTL model inspection algorithm proposed reduces complexity correlation time on the one hand to a great extent, also makes checking performance promote to some extent on the other hand; Analyze by experiment and find out, can apply in high complexity, extensive environment.
The above; be only patent preferred embodiment of the present invention; but the protection domain of patent of the present invention is not limited thereto; anyly be familiar with those skilled in the art in the scope disclosed in patent of the present invention; be equal to according to the technical scheme of patent of the present invention and patent of invention design thereof and replaced or change, all belonged to the protection domain of patent of the present invention.
Claims (6)
1. the optimization method of a possibility measures calculation idea detection model, it is characterized in that: described method adopts I-PM_CT model inspection algorithm realization, the design of described I-PM_CTL model inspection algorithm, based on the calculation idea model inspection labeling algorithm of possibility measures, comprises the following steps:
S1, the relevant possibility measures of utilization calculate logic tree formula, the uniqueness of pre-service mark common subexpression;
S2, fully guaranteeing under model inspection spatial balance state, to set common subexpression and possibility measures calculation idea model state.
2. the optimization method of a kind of possibility measures calculation idea detection model according to claim 1, is characterized in that: in step S1, and the calculation idea formula of described possibility measures is expressed by the extension mechanism of syntax tree logical organization, is specially:
If the standard syntax tree logical organization of the calculation idea formula of possibility measures is T<root
t>, in this case, then its extension syntax tree logical organization S<root
sthe generating step of > is as follows:
1) initialization S<root
s>, i.e. root
s=null;
2) to T<root
t> implements postorder traversal process, is exported by a certain node N, when this node N is empty, in this case, then performs step 5), otherwise, perform step 3);
3) if step 2) N that exports is unique, satisfies condition simultaneously
then form new node M; Otherwise, if N is unique, satisfy condition simultaneously
in this case, then step 2 is performed); In addition, if N is not exclusive, in this case, then N belongs to conjunctive word, performs step 4);
4) if step 2) N that exports is intermediate node, also satisfies condition
and when root node is N and the Sub-tree Matching of S, in this case, then N is the common subexpression of this parse tree; Otherwise, form new node M, trace back to the child node of S simultaneously from T, utilize conjunctive word to label, return and perform step 2);
5) if root
s=M, in this case, then exports the root node information of S, i.e. root
s.
3. the optimization method of a kind of possibility measures calculation idea detection model according to claim 1, it is characterized in that: in step S2, fully guaranteeing under model inspection spatial balance state, to set common subexpression and possibility measures calculation idea model state, be specially:
If
for the subexpression of the calculation idea formula φ of a certain possibility measures, in this case, so satisfied
ψ is simultaneously
direct subexpression, if the whole ψ of pre-service, unique identification is implemented to the direct subexpression of the calculation idea set of formulas C of a certain possibility measures, detects
concrete steps as follows:
1) judge
whether implement unique identification, if so, then perform step 2); If not, then step 3 is performed);
2) judge
whether implement M,
checking, if so, so then continues step 5), if not, then perform step 3);
3) according to the unique identification information in conjunctive word and pre-service mechanism, search meets the demands
state, then perform step 4);
4) if
for the common subexpression of the calculation idea formula of possibility measures, the calculation idea set of formulas C of real-time corresponding a certain possibility measures in M
status information, in extendability syntax tree logical organization
unique identification's examinations operates, and then performs step 5);
5) if
of equal value with φ, in this case, then the unique identification of its not common subexpression is deleted, otherwise, will
unique identification's status information exports.
4. the optimization method of a kind of possibility measures calculation idea detection model according to claim 3, is characterized in that: step 3) in, described in meet the demands
state, refers to
meet following formula:
5. the optimization method of a kind of possibility measures calculation idea detection model according to claim 3, is characterized in that: the calculation idea set of formulas C of described a certain possibility measures exists following relationship:
6. the optimization method of a kind of possibility measures calculation idea detection model according to any one of claim 1-5, it is characterized in that: the input parameter of described I-PM_CTL model inspection algorithm is made up of two parts, these two parts are extendability syntax tree logical organization and the migratory system model M of detected state S set, for the calculation idea formula of all possibility measures
, utilize output valve after I-PM_CTL model inspection algorithm process mechanism to be M,
the result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510394450.8A CN104951618A (en) | 2015-07-06 | 2015-07-06 | Possibility measurement calculating tree logic detection model optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510394450.8A CN104951618A (en) | 2015-07-06 | 2015-07-06 | Possibility measurement calculating tree logic detection model optimization method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104951618A true CN104951618A (en) | 2015-09-30 |
Family
ID=54166275
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510394450.8A Pending CN104951618A (en) | 2015-07-06 | 2015-07-06 | Possibility measurement calculating tree logic detection model optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104951618A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107015794A (en) * | 2015-12-18 | 2017-08-04 | Sap欧洲公司 | Software is service reference flow extensible authentication framework |
| CN113268890A (en) * | 2021-06-25 | 2021-08-17 | 华北电力大学（保定） | Method for mapping behavior tree model to Kripke structure |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049277A (en) * | 2013-01-29 | 2013-04-17 | 江苏大学 | Clearance inspection technology-oriented system model construction method |
| CN103699762A (en) * | 2014-01-15 | 2014-04-02 | 苏州大学 | CPS (Cyber-Physical System) attribute verification method based on statistical model checking (SMC) |
-
2015
- 2015-07-06 CN CN201510394450.8A patent/CN104951618A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103049277A (en) * | 2013-01-29 | 2013-04-17 | 江苏大学 | Clearance inspection technology-oriented system model construction method |
| CN103699762A (en) * | 2014-01-15 | 2014-04-02 | 苏州大学 | CPS (Cyber-Physical System) attribute verification method based on statistical model checking (SMC) |
Non-Patent Citations (5)
| Title |
|---|
| MARK KATTENBELT等: "《A Game-based Abstraction-Refinement Framework for Markov Decision Processes》", 《FORMAL METHODS IN SYSTEM DESIGN》 * |
| 奚琪等: "《一种改进的大规模CTL公式检测算法》", 《计算机科学》 * |
| 李亚利等: "《可能性测度下计算树逻辑的若干性质》", 《陕西师范大学学报（自然科学版）》 * |
| 薛艳等: "《基于可能性测度的计算树逻辑》", 《计算机工程与科学》 * |
| 邓辉等: "《基于可能性测度的计算树逻辑CTL*与可能性互模拟》", 《计算机科学》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107015794A (en) * | 2015-12-18 | 2017-08-04 | Sap欧洲公司 | Software is service reference flow extensible authentication framework |
| CN107015794B (en) * | 2015-12-18 | 2021-07-06 | Sap欧洲公司 | Software-as-a-service reference flow extension verification framework |
| CN113268890A (en) * | 2021-06-25 | 2021-08-17 | 华北电力大学（保定） | Method for mapping behavior tree model to Kripke structure |
| CN113268890B (en) * | 2021-06-25 | 2023-06-23 | 华北电力大学（保定） | Method for mapping behavior tree model to Kripke structure |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jackson et al. | Components, platforms and possibilities: towards generic automation for MDA | |
| Santone | Clone detection through process algebras and java bytecode | |
| CN101968769A (en) | Behavioral model-based software security test case generation method | |
| CN101833499A (en) | Software testing validating method based on reachability tree | |
| CN103942147A (en) | Test data automatic generation method based on linear fitting function driving | |
| CN104408020A (en) | Formula parsing calculation system and method | |
| CN103294596A (en) | Early warning method for contract-type software fault based on program invariants | |
| CN108037913A (en) | A kind of conversion method of xUML4MC models to MSVL LISP program LISPs, computer program | |
| Kothari et al. | Modeling lessons from verifying large software systems for safety and security | |
| Botinčan et al. | Separation logic verification of C programs with an SMT solver | |
| Sargsyan et al. | Directed fuzzing based on program dynamic instrumentation | |
| CN104951618A (en) | Possibility measurement calculating tree logic detection model optimization method | |
| CN102508766B (en) | Static analysis method of errors during operation of aerospace embedded C language software | |
| CN105653935A (en) | Social networking system privacy security runtime verification method based on PPTL3 | |
| WO2020012196A1 (en) | Runtime analysis of source code using a machine learning model trained using trace data from instrumented source code | |
| CN102103539A (en) | Z-specification-based test case generating method | |
| Leeser et al. | OpenCL floating point software on heterogeneous architectures–portable or not | |
| Bacci et al. | Finding a Forest in a Tree: The Matching Problem for Wide Reactive Systems | |
| CN102541738A (en) | Method for accelerating soft error resistance test of multi-core CPUs (central processing units) | |
| CN103488571A (en) | Method for verifying correctness of JavaScript procedure in mixed mode | |
| CN104850646A (en) | Method of mining frequent subgraphs for single uncertain graphs | |
| CN103399816A (en) | Data checking method and device | |
| CN111507080B (en) | Data quality inspection method and device, electronic equipment and storage medium | |
| CN104424332A (en) | Unambiguous Japanese name list building method and name identification method and device | |
| CN106330400A (en) | Rapid CRC method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150930 |