CN108536606A - A kind of EFSM test methods based on complex dependence relationship coverage criterion - Google Patents
A kind of EFSM test methods based on complex dependence relationship coverage criterion Download PDFInfo
- Publication number
- CN108536606A CN108536606A CN201810363831.3A CN201810363831A CN108536606A CN 108536606 A CN108536606 A CN 108536606A CN 201810363831 A CN201810363831 A CN 201810363831A CN 108536606 A CN108536606 A CN 108536606A
- Authority
- CN
- China
- Prior art keywords
- dependence
- migration
- complex
- control
- efsm
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3684—Test management for test design, e.g. generating new test cases
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of EFSM test methods based on complex dependence relationship coverage criterion, belong to the fields such as communication protocol, embedded system and web application tests.Method proposes the coverage criterion based on complex dependence relationship, in conjunction in EFSM models Novel control dependence and data dependence relation instruct the generation of test path.The test method that this method is related to is divided into complex dependence migration and set generating portion, migration detects conflict relationship and removed part and three cores of test path generating portion.Relative to the current test method based on data flow and based on migration or state coverage criterion, this method solve the test paths of nonterminal model to generate problem, the advantage of control dependence and data dependence has been given full play to simultaneously, allow the EFSM path sets generated are more efficient must detect mistake, reduces testing cost.
Description
Technical field
The present invention relates to a kind of EFSM test methods based on complex dependence relationship coverage criterion, belong to communication protocol, embedding
The fields such as embedded system and web application tests.
Background technology
Extended finite state machine (ExtendedFinite State Machine, EFSM) have very strong data modeling and
Behavior modeling ability has a wide range of applications in communications protocol, embedded system and web application modeling.Extended finite state
Machine can be expressed as hexa-atomic group of M=(S, a s0, T, E, G, A), wherein and s0∈ S indicate original state, and T is all migrations
Set, E is the event event set in migration, and the set of Rule of judgment guard in G migrations, A is all operation action
Set.
Testing criteria is the core of software test, and Testing criteria defines a test case demand collection, and
And this set must be covered by a complete test use cases.Testing criteria be in order to find one can test it is soft
The minimum test case set of each part of part.The Testing criteria on EFSM models is mainly divided into three at present
Class：Coverage criterion based on data flow, coverage criterion and random coverage criterion based on migration or state.
Invention content
It is an object of the invention to propose a kind of EFSM test methods based on complex dependence relationship coverage criterion.The party
Method defines the complex dependence relationship coverage criterion for finishing and closing control dependence and data dependence, and proposes a kind of EFSM based on the criterion
Test path generation method can solve the problems, such as that nonterminal EFSM test paths generate.
To achieve the above object, the scheme that the present invention uses is a kind of EFSM mould based on complex dependence relationship coverage criterion
The important control dependence of EFSM models and data dependence relation are instructed test road by type test method as coverage criterion
The generation of diameter.This test method includes that complex dependence migration generates set, migration is detected and removed to conflict relationship and test
Three cores of coordinates measurement：
The first, complex dependence migration generates set：Termination according to model in EFSM models selects novel control
Dependence processed generates complex dependence migration to set；
The second, migration is detected and is removed to conflict relationship：To complex dependence migration to the variable in set in two migrations
It is analyzed, by the migration of branch hazard to being migrated from complex dependence to being removed in set；
Third, test path generate：Meet complex dependence relationship covering standard using the method for depth-first traversal to generate
Test path collection then, to better meet complex dependence coverage criterion, proposes that four paths generate in path
Rule.
These three parts are described in detail individually below.
The first, complex dependence migration generates set：Termination according to model in EFSM models selects novel control
Dependence processed generates complex dependence migration to set；
According to the nonterminal of EFSM models and uncertainty, control is relied on and is divided into the control dependence of nonterminal sensitivity
(NTSCD), the insensitive control of nonterminal relies on (NTICD), and wherein NTICD is suitable for terminating EFSM models, and NTSCD is suitable for non-
Model is terminated, needs to select as the case may be suitably to control dependence.
There are intersections between for the dependence migration that relationship according to control dependence and data dependence generates, while the two is again
It is non-to include mutually, the definition of complex dependence relationship coverage criterion is proposed accordingly：
All migrations pair that Pair_TS is sequence TS are defined first：Given nonempty sequence TS=＜ t1,...,tn＞, wherein ti
It is the migration in EFSM M, n indicates that migration serial number number, i indicate i-th of migration serial number；If Pair_TS={ (ti,tj)|1≤i,j≤
N }, then Pair_TS is referred to as all migrations pair of sequence TS, and j indicates j-th of migration serial number；Then complex dependence relationship coverage criterion is defined：
It is assumed that the migration collection of EFSM M is combined into T={ ti| 1≤i≤n }, control, which relies on, is combined into collection
Indicate control dependence；Data dependence is combined into collectionSet A={ TSi| i ∈ N } be
The set of all migration series in M,Indicate data dependence relation；If there is set
So thatThen claim AMIt is covered for the complex dependence relationship of M；Indicate empty set；N indicates migration series serial number
Number, l indicate the l articles migration series serial number；.
Generation method of the complex dependence migration to set is proposed according to definition：It selects to correspond to according to the termination of model first
Control dependence calculate control rely on pair and data dependence pair, and ultimately generate complex dependence migration to set.
The second, migration is detected and is removed to conflict relationship：To complex dependence migration to the variable in set in two migrations
It is analyzed, by the migration of branch hazard to being migrated from complex dependence to being removed in set；
Due in coordinates measurement can to branch hazard to judging, if complex dependence in set exist conflict migration
Right, corresponding path can not cover conflict migration pair.Therefore, this method migrates to each of set complex dependence
Dependence conflict judgement is carried out between, if certain to rely on between exist conflict, just by this to rely on to from dependence to collect
It is removed in conjunction, last remaining non conflicting, which is relied on, to be relied on to set forming compound non conflicting.
Third, test path generate：Meet complex dependence relationship covering standard using the method for depth-first traversal to generate
Test path collection then, to better meet complex dependence coverage criterion, proposes that four paths generate in path
Rule.
Coordinates measurement uses the algorithm of depth-first traversal, will meet complex dependence relationship coverage criterion conduct in the algorithm
The stopping criterion of coordinates measurement proposes four paths create-rules to better meet complex dependence coverage criterion.
Rule 1：If existence condition conflict in path, this paths would not be added into set of paths.
Rule 2：After selection when migration, the subsequent migration that occurrence number is minimum in path is selected to be added in path.
Rule 3：For nonterminal model, each node in being subside for control, which assigns certain termination probability, makes it have
It may be terminated in any node during control is subside.
Rule 4：Control is relied on pair, the test path of generation only need to cover this to；For data dependence pair, need
Variable analysis is carried out to the migration between two migrations with data dependence in path, to determine the data dependence to energy
It is no capped.
Compared with prior art, the present invention has the advantages that.
Data dependence relation and control dependence are combined and can be flowed to avoid in the error detection of data flow and control
Error detection present on test incompleteness.
What control relied on reflection is structural information mostly important in EFSM models, can be with compared to other coverage criterions
The test case for greatly reducing redundancy finds more mistakes to reach, and reduces the effect of testing cost.
Description of the drawings
Fig. 1 is the implementing procedure figure of the method for the present invention.
Specific implementation mode
The scheme that the present invention uses, will for a kind of EFSM Model test Methods based on complex dependence relationship coverage criterion
The important control dependence of EFSM models and data dependence relation instruct the generation of test path as coverage criterion.This survey
Method for testing includes that complex dependence migration generates set, migration detects conflict relationship and removes and test path generates three cores
Center portion point：
The first, complex dependence migration generates set：Termination according to model in EFSM models selects novel control
Dependence processed generates complex dependence migration to set；
The second, migration is detected and is removed to conflict relationship：To complex dependence migration to the variable in set in two migrations
It is analyzed, by the migration of branch hazard to being migrated from complex dependence to being removed in set；
Third, test path generate：Meet complex dependence relationship covering standard using the method for depth-first traversal to generate
Test path collection then.
Specifically embodiment is as shown in the implementing procedure figure of Fig. 1, three dotted line frames respectively represent from top to bottom it is compound according to
Migration is relied to generate set, migration detects conflict relationship and removes and test path generates.
The first, complex dependence migration generates set：Before generating complex dependence migration to set, control is probed into first
The relationship with data dependence is relied on, if control dependence can completely include data dependence also or data dependence can completely include
Control relies on, and it is nonsensical that, which combines control dependence with data dependence,.Therefore control dependence and data have been probed into
The property not included mutually is relied on, is defined as follows：Vacation lets m represent the set that all EFSM models are constituted, if control relies on
With data dependence be mutually do not include relationship and if only if,So that the PathSetData_m' of m' do not cover it is all
PathSetControl_m' on PairSetControl_m' or m' does not cover all PairSetData_m'；Pass through card
It is bright to show that control relies on and data dependence is not include relationship mutually.
Then the definition of complex dependence relationship coverage criterion is proposed：
All migrations pair that Pair_TS is sequence TS are defined first：Given nonempty sequence TS=＜ t1,...,tn＞, wherein ti
It is the migration in EFSM M, n indicates that migration serial number number, i indicate i-th of migration serial number；If Pair_TS={ (ti,tj)|1≤i,j≤
N }, then Pair_TS is referred to as all migrations pair of sequence TS, and j indicates j-th of migration serial number；Then it is accurate to define the covering of complex dependence relationship
Then：It is assumed that the migration collection of EFSM M is combined into T={ ti| 1≤i≤n }, control, which relies on, is combined into collection
Indicate control dependence；Data dependence is combined into collectionSet A={ TSi| i ∈ N } it is M
In all migration series set,Indicate data dependence relation；If there is set
So thatThen claim AMIt is covered for the complex dependence relationship of M；Indicate empty set；N indicates migration series serial number
Number, l indicate the l articles migration series serial number；
Complex dependence migration is generated to set, selects corresponding control dependence to calculate according to the termination of model first
Control dependence pair, the control of composition is relied on is denoted as PairSetControl_M to set, and data dependence pair, composition are calculated to model
Data dependence to set be denoted as PairSetData_M.Complex dependence is migrated to set CombinePairSet_M=
PairSetControl_M ∪ PairSetData_M reach removal control and rely on to set and data dependence to identical in set
Dependence pair, obtain complex dependence migration to set.Since calculated control is relied on to for two tuples, calculated data according to
Rely to due to comprising the definition in migration using variable be triple, by two set merge when, to data dependence to collection
When conjunction element, each variable element for relying on centering can be removed so that data dependence pair and the form of control dependence pair are protected
It holds consistent.And original data dependence to gather still can retain retain variable information for coordinates measurement covers when it is used.
The second, migration is detected and is removed to conflict relationship：To complex dependence migration to the variable in set in two migrations
It is analyzed, by the migration of branch hazard to being migrated from complex dependence to being removed in set；
Due in coordinates measurement can to branch hazard to judging, if complex dependence in set exist conflict migration
Right, corresponding path can not cover conflict migration pair.Therefore, this method migrates to each of set complex dependence
Dependence conflict judgement is carried out between, if certain to rely on between exist conflict, just by this to rely on to from dependence to collect
It is removed in conjunction, last remaining non conflicting, which is relied on, to be relied on to set forming compound non conflicting.
Above-mentioned conflict refers to branch hazard, i.e., the condition in one migration and some migration in same paths
On condition exist conflict.ForTo migrating tiWith migration tjCarry out conflict judgement.
Variable is in migration tiIt can not be in t after upper definitionjCondition on be triggered, not so as to cause whole path comprising the dependence pair
It is feasible.The migration pair of these branch hazards is removed, remaining non conflicting, which is relied on, to be relied on to set forming compound non conflicting.
Third, test path generate：Meet complex dependence relationship covering standard using the method for depth-first traversal to generate
Test path collection then, to better meet complex dependence coverage criterion, proposes that four paths generate in path
Rule.
Four rules are elaborated below：
Rule 1：If existence condition conflict in path, this paths would not be added into set of paths.
Obviously, if existence condition conflict migration pair in path, can not find a variate-value so that it meets simultaneously
Branch hazard migrate centering migration, that is to say, that can not to this coordinates measurement test data, so, when path selection
By the test path of filtering existence condition conflict pair that takes the lead in, tentatively path is screened.
Rule 2：After selection when migration, the subsequent migration that occurrence number is minimum in path is selected to be added in path.
A counting variable can be added to each migration first it is used for indicating and each migrates the number that occurs in the paths.
When the counting variable of subsequent migration is identical, a migration is randomly choosed；When the counting variable difference of subsequent migration, selection meter
The migration of number variable minimum.
Rule 3：For nonterminal model, each node in being subside for control, which assigns certain termination probability, makes it have
It may be terminated in any node during control is subside.
All contain control in nonterminal model and subside and be not present terminal node, therefore controls each section in subsideing
Point can stop the generation in path.But which node stopping certain rule is needed in.In just being subside herein to control
Each node certain termination probability is set, a kind of mode of the setting of the termination probability can be a specific constant,
They may be specifically set according to specific situations, for example, subsideing existing node number in k in control is denoted as Nk, during that control is subside
The termination probability of each node is 1/Nk.
Rule 4：Control is relied on pair, the test path of generation only need to cover this to；For data dependence pair, need
Variable analysis is carried out to the migration between two migrations with data dependence in path, to determine the data dependence to energy
It is no capped.
Control is relied on to finding, it is assumed that Path (A, B) represents all paths from A to B.IfIt is then rightThere is Tj control dependence in Ti, i.e., the control dependence between two migrations two is moved with this
Path selection between shifting is unrelated.Free routing can retain the control dependence between two migrations relied on control.
The control dependence includes NTSCD, NTICD and UNTICD.Therefore covering control rely on to can cover accordingly control according to
The relationship of relying.
For data dependence to finding, may be led due to the difference in path between two migrations with data dependence
Cause the variation of data dependence relation.Therefore, in the algorithm of coordinates measurement, in addition to relying on to the dependence in set to being
The label of no covering will also be made whether the label for data dependence pair.To data dependence pair, need to judge two tools in path
Have whether the path between the migration of data dependence relation is to define clear path.Former data dependence will be used at this time to collection
It closes, this set is the variable information remained in two migrations with data dependence, if the variable has for two in the paths
Have and be not redefined in the migration between the migration of data dependence relation, is then recorded as covering the data dependence pair；Instead
It, not cover.
Claims (4)
1. a kind of EFSM Model test Methods based on complex dependence relationship coverage criterion, it is characterised in that：On EFSM models
Dependence is divided into control dependence and data dependence relation, plays an important roll to model measurement；This test method includes
Complex dependence migration is generated, migrates to conflict relationship detection and removed to set and test path generates three cores：
The first, complex dependence migration generates set：In EFSM models according to model termination select novel control according to
The relationship of relying generates complex dependence migration to set；
The second, migration is detected and is removed to conflict relationship：Complex dependence migration carries out the variable in set in two migrations
Analysis, by the migration of branch hazard to being migrated from complex dependence to being removed in set；
Third, test path generate：Meet complex dependence relationship coverage criterion using the method for depth-first traversal to generate
Test path collection, to better meet complex dependence coverage criterion, proposes that four paths generate rule in path
Then.
2. a kind of EFSM Model test Methods based on complex dependence relationship coverage criterion according to claim 1, special
Sign is：
The first, complex dependence migration generates set：In EFSM models according to model termination select novel control according to
The relationship of relying generates complex dependence migration to set；
According to the nonterminal of EFSM models and uncertainty, control is relied on and is divided into nonterminal sensitivity control dependence, nonterminal
Insensitive control relies on, and wherein NTICD is suitable for terminating EFSM models, and NTSCD is suitable for nonterminal model, needs according to specific
The suitable control dependence of situation selection；
There are intersections between for the dependence migration that foundation control relies on and the relationship of data dependence generates, while the two is non-mutual again
Include mutually to propose the definition of complex dependence relationship coverage criterion accordingly：
All migrations pair that Pair_TS is sequence TS are defined first：Given nonempty sequence TS=＜ t1,...,tn＞, wherein tiIt is EFSM
Migration in M, n indicate that migration serial number number, i indicate i-th of migration serial number；If Pair_TS={ (ti,tj) | 1≤i, j≤n }, then
Pair_TS is referred to as all migrations pair of sequence TS, and j indicates j-th of migration serial number；Then complex dependence relationship coverage criterion is defined：It is false
The migration collection for determining EFSM M is combined into T={ ti| 1≤i≤n }, control, which relies on, is combined into collection Indicate control dependence；Data dependence is combined into collectionSet A={ TSi|
I ∈ N } be M in all migration series set,Indicate data dependence relation；If there is setAM=
{TSl| l ∈ N } so thatThen claim AMIt is covered for the complex dependence relationship of M；Indicate empty set；N expressions are moved
Sequence serial number number is moved, l indicates the l articles migration series serial number；
Generation method of the complex dependence migration to set is proposed according to definition：Corresponding control is selected according to the termination of model first
Dependence processed calculates control dependence pair and data dependence pair, and ultimately generates complex dependence migration to set.
3. a kind of EFSM Model test Methods based on complex dependence relationship coverage criterion according to claim 1, special
Sign is：The variable in set in two migrations is analyzed in complex dependence migration, by the migration of branch hazard to from again
It closes and relies on migration to being removed in set；
Due in coordinates measurement can to branch hazard to judging, if complex dependence in set exist conflict migration pair,
Corresponding path can not cover conflict migration pair；Therefore complex dependence migration relies on between each of set
Carry out conflict judgement, if certain to rely on between exist conflict, just by this to dependence to from dependence to being removed in set, most
Remaining non conflicting, which is relied on, afterwards relies on to set forming compound non conflicting.
4. a kind of EFSM Model test Methods based on complex dependence relationship coverage criterion according to claim 1, special
Sign is：Meet complex dependence relationship coverage criterion using the method for depth-first traversal to generate in test path generating portion
Test path collection, to better meet complex dependence coverage criterion, propose that four paths generate rule in path
Then；
Coordinates measurement uses the algorithm of depth-first traversal, will meet complex dependence relationship coverage criterion in the algorithm as path
The stopping criterion of generation proposes four paths create-rules to better meet complex dependence coverage criterion；
Rule 1：If existence condition conflict in path, this paths would not be added into set of paths；
Rule 2：After selection when migration, the subsequent migration that occurrence number is minimum in path is selected to be added in path；
Rule 3：For nonterminal model, each node in being subside for control assigns certain termination probability and makes it possible to
Any node in control is subside terminates；
Rule 4：Control is relied on pair, the test path of generation only need to cover this to；For data dependence pair, need pair
Variable analysis is carried out with the migration between two of data dependence migrations in path, to determine the data dependence to can be by
Covering.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810363831.3A CN108536606B (en) | 2018-04-22 | 2018-04-22 | EFSM test method based on composite dependency coverage criterion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810363831.3A CN108536606B (en) | 2018-04-22 | 2018-04-22 | EFSM test method based on composite dependency coverage criterion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108536606A true CN108536606A (en) | 2018-09-14 |
| CN108536606B CN108536606B (en) | 2021-01-19 |
Family
ID=63479030
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810363831.3A Active CN108536606B (en) | 2018-04-22 | 2018-04-22 | EFSM test method based on composite dependency coverage criterion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108536606B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111274142A (en) * | 2020-01-20 | 2020-06-12 | 中国人民解放军国防科技大学 | Software communication system architecture conformance test modeling method based on extended finite-state machine |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050204344A1 (en) * | 2004-03-12 | 2005-09-15 | Hideaki Shinomi | Program analysis device, analysis method and program of same |
| US20090138862A1 (en) * | 2007-11-22 | 2009-05-28 | Kabushiki Kaisha Toshiba | Program parallelization supporting apparatus and program parallelization supporting method |
| CN101901188A (en) * | 2010-07-23 | 2010-12-01 | 哈尔滨工程大学 | Reachable path-based software testing method |
| CN102323906A (en) * | 2011-09-08 | 2012-01-18 | 哈尔滨工程大学 | MC/DC test data automatic generation method based on genetic algorithm |
| CN102368226A (en) * | 2011-10-10 | 2012-03-07 | 南京大学 | Method for automatically generating test cases based on analysis on feasible paths of EFSM (extended finite state machine) |
| CN102404167A (en) * | 2011-11-03 | 2012-04-04 | 清华大学 | Protocol test generating method of parallel expansion finite-state machine based on variable dependence |
| CN103559122A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Test case reduction method based on program behavior slices |
| CN104077228A (en) * | 2014-07-08 | 2014-10-01 | 浙江理工大学 | EFSM performable test sequence generating method based on predicate dependency graph |
| WO2016036813A4 (en) * | 2014-09-02 | 2016-08-11 | Ab Initio Technology Llc | Controlling data processing tasks |
| CN106502892A (en) * | 2016-10-20 | 2017-03-15 | 杭州电子科技大学 | A kind of test case prioritization method based on uml model |
| CN106708739A (en) * | 2016-12-30 | 2017-05-24 | 桂林电子科技大学 | Extended finite state machine (EFSM) model-based Web service case generation method and system |
-
2018
- 2018-04-22 CN CN201810363831.3A patent/CN108536606B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050204344A1 (en) * | 2004-03-12 | 2005-09-15 | Hideaki Shinomi | Program analysis device, analysis method and program of same |
| US20090138862A1 (en) * | 2007-11-22 | 2009-05-28 | Kabushiki Kaisha Toshiba | Program parallelization supporting apparatus and program parallelization supporting method |
| CN101901188A (en) * | 2010-07-23 | 2010-12-01 | 哈尔滨工程大学 | Reachable path-based software testing method |
| CN102323906A (en) * | 2011-09-08 | 2012-01-18 | 哈尔滨工程大学 | MC/DC test data automatic generation method based on genetic algorithm |
| CN102368226A (en) * | 2011-10-10 | 2012-03-07 | 南京大学 | Method for automatically generating test cases based on analysis on feasible paths of EFSM (extended finite state machine) |
| CN102404167A (en) * | 2011-11-03 | 2012-04-04 | 清华大学 | Protocol test generating method of parallel expansion finite-state machine based on variable dependence |
| CN103559122A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Test case reduction method based on program behavior slices |
| CN104077228A (en) * | 2014-07-08 | 2014-10-01 | 浙江理工大学 | EFSM performable test sequence generating method based on predicate dependency graph |
| WO2016036813A4 (en) * | 2014-09-02 | 2016-08-11 | Ab Initio Technology Llc | Controlling data processing tasks |
| CN106502892A (en) * | 2016-10-20 | 2017-03-15 | 杭州电子科技大学 | A kind of test case prioritization method based on uml model |
| CN106708739A (en) * | 2016-12-30 | 2017-05-24 | 桂林电子科技大学 | Extended finite state machine (EFSM) model-based Web service case generation method and system |
Non-Patent Citations (1)
| Title |
|---|
| 苏宁: "基于EFSM模型不定型切片测试用例自动生成的研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111274142A (en) * | 2020-01-20 | 2020-06-12 | 中国人民解放军国防科技大学 | Software communication system architecture conformance test modeling method based on extended finite-state machine |
| CN111274142B (en) * | 2020-01-20 | 2023-04-21 | 中国人民解放军国防科技大学 | Software communication system architecture conformance test modeling method based on extended finite state machine |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108536606B (en) | 2021-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109782763A (en) | A kind of method for planning path for mobile robot under dynamic environment | |
| CN106506556B (en) | A kind of network flow abnormal detecting method and device | |
| CN106209862A (en) | A kind of steal-number defence implementation method and device | |
| CN113672937B (en) | Block chain link point | |
| CN111132145B (en) | Network communication safety monitoring method, device, server and network communication system | |
| CN104112284B (en) | The similarity detection method and equipment of a kind of picture | |
| CN110598999B (en) | Traffic travel analysis method, system and storage medium based on individual data | |
| CN102708052B (en) | Software fault automatic positioning method in a kind of unit testing | |
| CN111275975B (en) | Method and device for acquiring intersection turning flow data and storage medium | |
| CN103927483A (en) | Decision model used for detecting malicious programs and detecting method of malicious programs | |
| CN109738760A (en) | A kind of distribution network short circuit fault localization method merging a variety of distribution terminal data | |
| CN106789912A (en) | Router data plane anomaly detection method based on classification regression tree | |
| CN107491394A (en) | A kind of method for testing and analyzing and device based on digraph identification | |
| CN106569490A (en) | Robot scheduling system and method based on magnetic stripe navigation | |
| CN108734304A (en) | A kind of training method of data model, device and computer equipment | |
| CN110096013A (en) | A kind of intrusion detection method and device of industrial control system | |
| CN111679657A (en) | Attack detection method and system based on industrial control equipment signals | |
| CN104750828B (en) | A kind of unconscious self-learning method of conclusion deductive knowledge based on 6W rules | |
| CN110375736A (en) | Paths planning method, system, equipment and the readable storage medium storing program for executing of smart machine | |
| CN108536606A (en) | A kind of EFSM test methods based on complex dependence relationship coverage criterion | |
| CN109299719A (en) | Barrage method of calibration, device, terminal and storage medium based on Character segmentation | |
| CN108932839A (en) | A kind of colleague's vehicle judgment method and device | |
| CN106649335A (en) | Data processing method and device | |
| Frederix et al. | A density-based dynamic OD estimation method that reproduces within-day congestion dynamics | |
| CN112272184B (en) | Industrial flow detection method, device, equipment and medium |
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 |