CN107121969B - PCD manufacture model difference detection method based on adjacency matrix - Google Patents
PCD manufacture model difference detection method based on adjacency matrix Download PDFInfo
- Publication number
- CN107121969B CN107121969B CN201710173011.3A CN201710173011A CN107121969B CN 107121969 B CN107121969 B CN 107121969B CN 201710173011 A CN201710173011 A CN 201710173011A CN 107121969 B CN107121969 B CN 107121969B
- Authority
- CN
- China
- Prior art keywords
- transition
- library
- matched
- procedural
- intersection
- 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.)
- Active
Links
- 239000011159 matrix material Substances 0.000 title claims abstract description 54
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 26
- 238000001514 detection method Methods 0.000 title claims abstract description 17
- 230000007704 transition Effects 0.000 claims abstract description 82
- 230000008859 change Effects 0.000 claims description 29
- 230000007613 environmental effect Effects 0.000 claims description 6
- 238000003825 pressing Methods 0.000 claims 1
- 238000000034 method Methods 0.000 abstract description 37
- 230000008569 process Effects 0.000 description 31
- FFBHFFJDDLITSX-UHFFFAOYSA-N benzyl N-[2-hydroxy-4-(3-oxomorpholin-4-yl)phenyl]carbamate Chemical compound OC1=C(NC(=O)OCC2=CC=CC=C2)C=CC(=C1)N1CCOCC1=O FFBHFFJDDLITSX-UHFFFAOYSA-N 0.000 description 9
- 239000000463 material Substances 0.000 description 9
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 2
- 238000010168 coupling process Methods 0.000 description 2
- 238000005859 coupling reaction Methods 0.000 description 2
- 238000005498 polishing Methods 0.000 description 2
- 238000004378 air conditioning Methods 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000000262 chemical ionisation mass spectrometry Methods 0.000 description 1
- 238000005520 cutting process Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000002360 preparation method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B19/00—Programme-control systems
- G05B19/02—Programme-control systems electric
- G05B19/418—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM]
- G05B19/41885—Total factory control, i.e. centrally controlling a plurality of machines, e.g. direct or distributed numerical control [DNC], flexible manufacturing systems [FMS], integrated manufacturing systems [IMS] or computer integrated manufacturing [CIM] characterised by modeling, simulation of the manufacturing system
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
- G05B2219/00—Program-control systems
- G05B2219/30—Nc systems
- G05B2219/32—Operator till task planning
- G05B2219/32339—Object oriented modeling, design, analysis, implementation, simulation language
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/02—Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]
Landscapes
- Engineering & Computer Science (AREA)
- Manufacturing & Machinery (AREA)
- General Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present invention discloses a kind of PCD manufacture model difference detection method based on adjacency matrix.This method including the following steps: two carry out Match of elemental composition (transition matching and library are matched) with the PCD manufacture model that Petri network models, and obtain a variety of matching ways；For each group of matching way, procedural model is converted into corresponding adjacency matrix, two adjacency matrix subtract each other to obtain differential matrix；In all differential matrixs, wherein optimal differential matrix is selected to represent the difference between two procedural models.It is only facing the limitation that two similar procedures carry out difference detection the invention has the advantages that having broken, comparison range is expanded to all procedural models, substantially increases actual availability.
Description
Technical field
The invention belongs to Business Process Management field, the difference detection method being related between procedural model, especially a kind of base
In the PCD manufacture model difference detection method of adjacency matrix.
Background technique
It is more next with the development of business process model management (Business Process Management, BPM) technology
More factories starts to create the procedural model library of oneself.Possess a large amount of procedural model, including mould if a Die & Mould Manufacture
Have the processes such as manufacture, quality examination, schedule, workshop processing, process monitoring.The process mould that one household electrical appliances manufacturing works is related to
Type has TV manufacturing process, refrigerator manufacturing process, air-conditioning manufacturing process, electric fan manufacturing process etc..These procedural models are factories
Critical asset, effectively management can be improved efficiency, increase profit for factory.The detection of procedural model difference is used as a kind of process
Model management technology is more and more important in operation flow field: two procedural models is given, by comparing the difference obtained between them
Not, and by difference process design personnel are fed back to.It is low that process analysis personnel can find process execution efficiency by the difference
The reason of and redesign etc. the execution efficiency that other operations carry out modified flow model to process.Traditionally, artificially right
Two procedural models are compared and find out difference, however time-consuming, low efficiency for the way, and the result of difference can vary with each individual.
There is an urgent need to a kind of technologies of automation as a result, to detect the difference between two procedural models.
Summary of the invention
In order to it is automatic, efficient, accurately and rapidly find out difference between two PCD manufacture models, the present invention
It is proposed a kind of difference detection algorithm based on adjacency matrix.Procedural model is converted to an adjacency matrix and will be between procedural model
Difference detection be converted to the detection of the difference between its corresponding adjacency matrix, broken be only facing two similar procedures carry out it is poor
Comparison range is expanded to all procedural models by the limitation not detected, substantially increases actual availability.
PCD manufacture model difference detection method based on adjacency matrix, comprising the following steps:
(1) two PCD manufacture models modeled with Petri network are inputted, the transition in procedural model, library are saved
Point and side parse；
(2) Match of elemental composition, that is, find out in first procedural model with the peer element in second procedural model；
(3) one group of element matching way therein is chosen, the corresponding neighbour of two procedural models is established based on the matching way
Matrix is connect, two adjacency matrix are subtracted each other, obtains the corresponding differential matrix of the matching way；
(4) judge whether that there are also other Match of elemental composition modes, if so, step (3) are then skipped to, it is no to then follow the steps (5)；
(5) N kind matching way corresponds to N number of differential matrix, and optimal differential matrix therein is selected to indicate two process moulds
The difference of type；
Further, step (2) specifically includes:
(2.1) transition matching is found out and changes the identical transition node of label in two procedural models to set { (T1,
T1’),(T2,T2’),…,(Ti,Ti'), wherein TiIt is the transition node in first procedural model, Ti' it is second process mould
Transition node in type；
(2.2) library is matched, that is, finds out library institute node reciprocity in two procedural models to { (P1,P1’),(P2,
P2’),…,(Pi,Pi')}.One library context environmental by it enter transition set and transition collection is combined into out: { { enter to become
Move set }, { out transition set }, that is, flow in and out the library transition set；Can two library institute nodes map by them
Enter to change intersection set and go out transition intersection set determine；
Further, the step (2.2) specifically includes:
All possible matched libraries institutes are to (P in two procedural models of (2.2.1) calculatingi,_Pi') enter to change intersection set
With go out transition intersection set: { { entering to change intersection set }, { changing intersection set out } }, wherein PiIt is first procedural model
One library institute node, Pi' be second procedural model a library institute node；
(2.2.2) for enter to change intersection set and go out transition intersection set not for empty library it is right, be pressed into and change friendship
Collection number is matched from big to small multiplied by the value for going out transition intersection number, and the library institute node matched cannot be matched again；
(2.2.3) wherein has a library for sky right for entering to change intersection set with transition intersection set is gone out, by not
It is matched from big to small for transition number in empty set, the library institute node matched cannot be matched again；
Matched transition are carried out union operation to set to set and library institute by (2.2.4), obtain Match of elemental composition set；
(2.2.5) repeats (2.2.2) to (2.2.4) and finds out N (N >=1) kind Match of elemental composition mode；
Further, step (2.2.5) can obtain N (N >=1) kind Match of elemental composition mode.This is because can in (2.2.2)
Can there is a situation where it is identical enter change intersection number multiplied by go out transition intersection number correspond to multiple libraries pair, select that at this time
A library to carry out matching be random.Equally, equally possible in (2.2.3) to occur not handing over there are identical for 0 transition
Collection number correspond to multiple libraries pair situation.Although preferentially select which library to carry out matching be it is random, it is of the invention
All match conditions can be all found out.
Further, in step (3), it is assumed that two PCD manufacture models are respectively P1(possess n library institute's node and
M transition node) and P2(possessing x library institute's node and y transition node), P1With P2Matching library institute's logarithm be a, matching become
Moving number is b, then their corresponding adjacency matrix are the matrixes of (n+x-a+m+y-b) × (n+x-a+m+y-b).n+x-a+m+y-b
Indicate { matched library institute is to set } ∪ { not matched set of library is closed in two procedural models } ∪ { matched transition are gathered } ∪
{ not matched transition set in two procedural models }.Content A [i] [j] in adjacency matrix indicates i-th of node and j-th
It whether there is directed edge between node, if it exists directed edge then A [i] [j]=1, otherwise A [i] [j]=0.P in order to obtain1With P2
Corresponding adjacency matrix A1, A2, need to fill the content A in adjacency matrix respectively1[i] [j] and A2[i][j].By two processes
The corresponding adjacency matrix A of model1, A2Subtract each other, obtains indicating the element shared -1,0,1 three in the adjacency matrix A, A of difference of them
Kind situation, -1 indicates insertion side, i.e. A2There is side between two nodes of middle correspondence and A1No, 0 A is indicated1、A2Middle correspondence two sections
There is side between point, 1 indicates to delete side, i.e. A1There is side between kind of corresponding two nodes and A2No.
Further, the step (5) specifically includes:
(5.1) the sum of the element absolute value in N number of differential matrix is calculated separately；
(5.2) selection and the smallest differential matrix.
Technical concept of the invention is: before the difference for calculating two PCD manufacture models, first finding process mould
Coupling element between type guarantees the accuracy of coupling element.Since the step is the first step of process CIMS, the step
Accuracy rate directly affect subsequent difference Detection accuracy.When calculating the difference of two procedural models, procedural model is turned
It is changed to corresponding adjacency matrix, such mode is suitable for calculating the difference between any two procedural model rather than being only applicable to
Two similar procedure models, so that use scope of the invention is wider.
It is only facing the limitation that two similar procedures carry out difference detection the invention has the advantages that having broken, model will be compared
It encloses and is expanded to all procedural models, substantially increase actual availability.
Detailed description of the invention
Fig. 1 is total flow chart of the invention
Fig. 2 matches case diagram by library between two PCD manufacture models
Fig. 3 is all possible match condition figure of two PCD manufacture models in Fig. 2
Fig. 4 is that difference calculates case diagram between two PCD manufacture models in Fig. 2, Fig. 4 a~Fig. 4 d be respectively based on
With 1~4 adjacency matrix.
Specific embodiment
Embodiment one
With reference to attached drawing 1
PCD manufacture model difference detection method based on adjacency matrix, including the following steps:
(1) two PCD manufacture models modeled with Petri network are inputted, the transition in procedural model, library are saved
Point and side parse；
(2) Match of elemental composition is found out with the peer element in second procedural model in first procedural model, specific to wrap
It includes:
(2.1) transition matching is found out and changes the identical transition node of label in two procedural models to set { (T1,
T1’),(T2,T2’),…,(Ti,Ti'), wherein TiIt is the transition node in first procedural model, Ti' it is second process mould
Transition node in type；
(2.2) library is matched, that is, finds out library institute node reciprocity in two procedural models to { (P1,P1’),(P2,
P2’),…,(Pi,Pi')}.One library context environmental by it enter transition set and transition collection is combined into out: { { enter to become
Move set }, { out transition set }, that is, flow in and out the library transition set；Can two library institute nodes map by them
Enter to change intersection set and go out transition intersection set determine；Matched library institute is found to needing to be implemented following steps:
All possible matched libraries institutes are to (P in two procedural models of (2.2.1) calculatingi,Pi') enter to change intersection set
With go out transition intersection set: { { entering to change intersection set }, { changing intersection set out } }, wherein PiIt is first procedural model
One library institute node, Pi' be second procedural model a library institute node；
(2.2.2) for enter to change intersection set and go out transition intersection set not for empty library it is right, be pressed into and change friendship
Collection number is matched from big to small multiplied by the value for going out transition intersection number, and the library institute node matched cannot be matched again；
(2.2.3) wherein has a library for sky right for entering to change intersection set with transition intersection set is gone out, by not
It is matched from big to small for transition number in empty set, the library institute node matched cannot be matched again；
Matched transition are carried out union operation to set to set and library institute by (2.2.4), obtain Match of elemental composition set；
(2.2.5) repeats (2.2.2) to (2.2.4) and finds out N (N >=1) kind Match of elemental composition mode；
(3) one group of element matching way therein is chosen, the corresponding neighbour of two procedural models is established based on the matching way
Matrix is connect, two adjacency matrix are subtracted each other, obtains the corresponding differential matrix of the matching way；
(4) judge whether that there are also other Match of elemental composition modes, if so, step (3) are then skipped to, it is no to then follow the steps (5)；
(5) N kind matching way corresponds to N number of differential matrix, and optimal differential matrix therein is selected to indicate two process moulds
The difference of type, specifically includes:
(5.1) the sum of the element absolute value in N number of differential matrix is calculated separately；
(5.2) selection and the smallest differential matrix.
Embodiment two
With reference to attached drawing 2,3,4
Fig. 2 indicates the matched case diagram in library between two PCD manufacture models.It is topmost two of difference to be calculated
The procedural model of mold: Process 1, Process 2 is manufactured with the mould factory that Petri network models.Due to space limitations, I
Represent the meaning that node indicates with the combination of letter and number: T1 indicates " material preparations ", and T2 indicates " polishing ", T3 expression
" polishing ", T4 indicate " cutting ", and T5 indicates " assembling ", and S and S ' expression start, and E and E ' expression terminate, and P1 indicates " material of main part
It is ready for ", P2 indicates " material of main part is completed ", and P3 indicates " fitment material is ready for ", and P4 indicates that " fitment material is complete
At ", P1 ' indicates " starting to make material of main part ", and P2 ' indicates " material of main part, which is made, to be finished ", and P3 ' expression " starts to make accessory
Material ", P4 ' indicate " fitment material, which is made, to be finished ".
Difference between the two procedural models in order to obtain, needs to be implemented following steps:
(1) Process 1, Process 2 are inputted, their transition, library institute's node and side are parsed, obtained
The transition node set of Process 1 is { T1, T2, T3, T4, T5 }, and library institute's node set is { S, P1, P2, P3, P4, E }, side
Collection be combined into S → T1, T1 → P1, T1 → P3, P1 → T2, P1 → T3, T2 → P2, T3 → P2, P2 → T5, P3 → T4, T4 →
P4,P4→T5,T5→E}；The transition node set of Process 2 is { T 1, T2, T3, T4, T5 }, and library institute node set is
S ', P1 ', and P2 ', P3 ', P4 ', E ', the collection on side is combined into { S ' → T 1, T1 → P1 ', T1 → P3 ', P1 ' → T2, P3 ' → T3, T2
→P2',T3→P4',P2'→T5,P3'→T4,T 4→P4',P4'→T5,T5→E'}；
(2) Match of elemental composition, that is, find out in Process 1 with the peer element in Process 2, specifically further include:
(2.1) transition matching is found out and changes the identical transition node of label in Process 1, Process 2 to collection
It closes, is { T1-T1, T2-T2, T3-T3, T4-T4, T5-T5 }, wherein "-" indicates matched relationship；
(2.2) library is matched, that is, finds out library institute node reciprocity in two procedural models to { (P1,P1’),(P2,
P2’),…,(Pi,Pi')}；One library context environmental by it enter transition set and transition collection is combined into out: { { enter to become
Move set }, { out transition set }, that is, flow in and out the library transition set；Can two library institute nodes map by them
Enter to change intersection set and go out transition intersection set determine；Matched library institute is found to needing to be implemented following steps:
All possible matched libraries institutes are to (P in (2.2.1) calculating Process 1, Process 2i,Pi') enter transition hand over
Transition intersection set: { { entering to change intersection set }, { changing intersection set out } } is gathered and gone out to collection, wherein PiIt is first process
One library institute node of model, Pi' be second procedural model a library institute node；As P1 context environmental be { T1 },
{ T2, T3 } }, the context environmental of P1 ' is { { T1 }, { T2 } }, and the intersection set that enters to change of P1 and P1 ' are { T1 }, and transition are handed over out
Ji Ji is combined into { T2 }；In order to which possible matched library institutes all in two procedural models are right, it is referred to as initial that we establish a table
Library institute matching list, as shown in second part from top to bottom: in first row, what S, Pi (1≤i≤4), E were represented is in Process 1
All library institutes, in initial matching table right-hand component then represent library all in Process 2 with it is all in Process 1
The result of library institute initial matching；Content in cell consists of two parts: library institute and Process in Process 1
A library in 2 enter to change intersection set and go out transition intersection set；
(2.2.2) for enter to change set intersection and go out transition set intersection not for empty library it is right, be pressed into and change friendship
Collection number is matched from big to small multiplied by the value for going out transition number, and the library institute node matched cannot be matched again:
P1 and P3 can first be obtained ' it is matched, then delete all cells that P1 and P3 ' occurred；Then P2 and P4 are obtained '
Matched, then delete P2 and P4 ' all cells for occurring, the stage terminates as a result, because being not present at this time into change
It moves set intersection and transition set intersection is not right for empty library out；
(2.2.3) wherein has a library for sky right for entering to change intersection set with transition intersection set is gone out, by not
It is matched from big to small for transition number in empty set, the library institute node matched cannot be matched again: can be with
Matched library institute is first obtained to for P3-P1 ', P4-P2 ', S-S ', E-E ', so far, which terminates；
Matched transition are carried out union operation to set to set and library institute by (2.2.4), obtain all Match of elemental composition
Set: T1-T1, T2-T2, T3-T3, T4-T4, T5-T5, P1-P3 ', P2-P4 ', P3-P1 ', P4-P2 ', S-S ' and, E-E ' }；
(2.2.5) repeats (2.2.2) to (2.2.4) and finds out 4 kinds of Match of elemental composition modes, as shown in Figure 3: matching way 1
({ T1-T1, T2-T2, T3-T3, T4-T4, T5-T5, P1-P1 ', P2-P2 ', P3-P3 ', P4-P4 ', S-S ', E-E ' }), matching
Mode 2 (T1-T1, T2-T2, T3-T3, T4-T4, T5-T5, P1-P3 ', and P2-P2 ', P3-P1 ', P4-P4 ', S-S ' and, E-E ' }),
Matching way 3 (T1-T1, T2-T2, T3-T3, T4-T4, T5-T5, P1-P1 ', and P2-P4 ', P3-P3 ', P4-P2 ', S-S ' and, E-
E ' }), matching way 4 ({ T1-T1, T2-T2, T3-T3, T4-T4, T5-T5, P1-P3 ', P2-P4 ', P3-P1 ', P4-P2 ', S-
S',E-E'})；
(3) choose one group of element matching way therein: matching way 1 establishes two process moulds based on the matching way
The corresponding adjacency matrix of type subtracts each other two adjacency matrix, obtains the corresponding differential matrix of the matching way, as shown in fig. 4 a；
(4) judge whether that there are also other Match of elemental composition modes, if so, step (3) are then skipped to, it is no to then follow the steps (5):
It sequentially finds matching way 2, matching way 3, matching way 4 and obtains corresponding differential matrix, such as Fig. 4 b, Fig. 4 c, Fig. 4 d institute
Show；
Corresponding 4 differential matrixs of (5) 4 kinds of matching ways, select optimal differential matrix therein to indicate two process moulds
The difference of type, specifically includes:
(5.1) the sum of the element absolute value calculated in 4 differential matrixs is respectively 4,6,6,8；
(5.2) selection and the smallest differential matrix select the differential matrix in Fig. 4 a to indicate 1 He of Process
The difference of Process 2.
Claims (2)
1. the PCD manufacture model difference detection method based on adjacency matrix, comprising the following steps:
(1) input two with Petri network model PCD manufacture models, by procedural model transition, library institute's node and
While parsing；
(2) Match of elemental composition is found out in first procedural model with the peer element in second procedural model, is specifically included:
(2.1) transition matching is found out and changes the identical transition node of label in two procedural models to set { (T1,T1’),
(T2,T2’),…,(Ti,Ti'), wherein TiIt is the transition node in first procedural model, Ti' it is in second procedural model
Transition node；
(2.2) library is matched, that is, finds out library institute node reciprocity in two procedural models to { (P1,P1’),(P2,P2’),…,
(Pi,Pi')}；One library context environmental by it enter transition set and transition collection is combined into out: { entering transition to gather },
{ out transition set } }, that is, flow in and out the library transition set；Can two library institute nodes, which map, enters transition by them
Intersection set and the out decision of transition intersection set；Matched library institute is found to needing to be implemented following steps:
All possible matched libraries institutes are to (P in two procedural models of (2.2.1) calculatingi,Pi') enter to change intersection set and go out
Intersection set: { { entering to change intersection set }, { changing intersection set out } } is changed, wherein PiIt is one of first procedural model
Library institute node, Pi' be second procedural model a library institute node；
(2.2.2) for enter to change intersection set and go out transition intersection set not for empty library it is right, be pressed into and change intersection number
It is matched from big to small multiplied by the value for going out transition intersection number, the library institute node matched cannot be matched again；
(2.2.3) wherein has a library for sky right for entering to change intersection set with transition intersection set is gone out, and pressing is not sky
Set in transition number matched from big to small, the library institute node matched cannot be matched again；
Matched transition are carried out union operation to set to set and library institute by (2.2.4), obtain Match of elemental composition set；
(2.2.5) repeats (2.2.2) to (2.2.4) and finds out N (N >=1) kind Match of elemental composition mode；
(3) one group of element matching way therein is chosen, the corresponding adjacent square of two procedural models is established based on the matching way
Battle array, two adjacency matrix are subtracted each other, the corresponding differential matrix of the matching way is obtained；
(4) judge whether that there are also other Match of elemental composition modes, if so, step (3) are then skipped to, it is no to then follow the steps (5)；
(5) N kind matching way corresponds to N number of differential matrix, and optimal differential matrix therein is selected to indicate two procedural models
Difference, comprising the following steps:
(5.1) the sum of the element absolute value in N number of differential matrix is calculated separately；
(5.2) selection and the smallest differential matrix.
2. the PCD manufacture model difference detection method based on adjacency matrix as described in claim 1, it is characterised in that:
(1) library described in step (2.2) enter transition set and out transition collection share in describe a library institute node context ring
Border, and with two libraries enter to change intersection and go out transition intersection come find out two Petri networks modeling procedural model in match
Library institute it is right；(2) found out described in step (2.2) matched library pair strategy it is as follows: first to enter to change intersection set and out
It changes that intersection set is not right for empty library, is pressed into transition intersection number and is carried out from big to small multiplied by the value for changing intersection number out
Match；Again to enter to change intersection set and go out transition intersection set wherein have one it is right for empty library, by the set not for sky
Transition number is matched from big to small；The library institute node matched cannot be matched again；(3) described in step (3)
The corresponding adjacency matrix of two procedural models is established based on different node matching modes, asks difference to obtain by two adjacency matrix
Differential matrix indicates the difference between two procedural models, this is that convert its for the difference detection between procedural model corresponding
Difference test problems between adjacency matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710173011.3A CN107121969B (en) | 2017-03-22 | 2017-03-22 | PCD manufacture model difference detection method based on adjacency matrix |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710173011.3A CN107121969B (en) | 2017-03-22 | 2017-03-22 | PCD manufacture model difference detection method based on adjacency matrix |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107121969A CN107121969A (en) | 2017-09-01 |
| CN107121969B true CN107121969B (en) | 2019-04-09 |
Family
ID=59717299
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710173011.3A Active CN107121969B (en) | 2017-03-22 | 2017-03-22 | PCD manufacture model difference detection method based on adjacency matrix |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107121969B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110806738A (en) * | 2019-12-05 | 2020-02-18 | 浙江工业大学 | Method for detecting difference between factory manufacturing processes based on one-hot coding |
| CN112052232B (en) * | 2020-07-21 | 2021-06-01 | 杭州电子科技大学 | Business process context extraction method based on replay technology |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104732546A (en) * | 2015-04-02 | 2015-06-24 | 西安电子科技大学 | Non-rigid SAR image registration method based on region similarity and local spatial constraint |
| CN106443621A (en) * | 2016-09-13 | 2017-02-22 | 哈尔滨工程大学 | Coherent source dynamic DOA tracking method based on orthogonal matching sparse reconstruction under impulsive noise |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103927603A (en) * | 2014-04-30 | 2014-07-16 | 安徽理工大学 | Business process model change domain adaptation method based on differential Petri net |
| US20160063422A1 (en) * | 2014-08-27 | 2016-03-03 | International Business Machines Corporation | Business process model synchronization |
| KR101680448B1 (en) * | 2015-02-17 | 2016-11-28 | 부산대학교 산학협력단 | Method for evaluating the process model |
| CN106096644B (en) * | 2016-06-08 | 2019-04-02 | 杭州电子科技大学 | Method for measuring similarity and device based on probability workflow |
-
2017
- 2017-03-22 CN CN201710173011.3A patent/CN107121969B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104732546A (en) * | 2015-04-02 | 2015-06-24 | 西安电子科技大学 | Non-rigid SAR image registration method based on region similarity and local spatial constraint |
| CN106443621A (en) * | 2016-09-13 | 2017-02-22 | 哈尔滨工程大学 | Coherent source dynamic DOA tracking method based on orthogonal matching sparse reconstruction under impulsive noise |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107121969A (en) | 2017-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105117421B (en) | Based on the matched social network analysis method of graph structure | |
| CN109472390B (en) | Intelligent planning scheme generation method and system based on machine learning | |
| CN105281925B (en) | The method and apparatus that network service groups of users divides | |
| CN106599230A (en) | Method and system for evaluating distributed data mining model | |
| CN101794106B (en) | Quality control system, quality control apparatus, and quality control method | |
| CN107121969B (en) | PCD manufacture model difference detection method based on adjacency matrix | |
| CN106204086A (en) | The method for early warning of Sales Volume of Commodity and device | |
| CN105976048A (en) | Power transmission network extension planning method based on improved artificial bee colony algorithm | |
| CN106021733B (en) | A kind of fast custom design service system of production line | |
| Kholopov et al. | Development of digital machine-building production in the Industry 4.0 concept | |
| CN101901251B (en) | Method for analyzing and recognizing complex network cluster structure based on markov process metastability | |
| CN104346481A (en) | Community detection method based on dynamic synchronous model | |
| CN111611236A (en) | Data analysis method and system | |
| CN108765180A (en) | The overlapping community discovery method extended with seed based on influence power | |
| Jefferson et al. | Reconfigurable assembly system design methodology: a wing assembly case study | |
| Senin et al. | Concurrent assembly planning with genetic algorithms | |
| CN117355852A (en) | Knowledge-based assembly process planning method, device and system | |
| KR102111430B1 (en) | PLM Apparatus and Managing Method Thereof | |
| CN110378583A (en) | Adjacent process exchanges method with equipment for a kind of quasi- critical path | |
| Bejjani et al. | Flow chart based information modeling for factory planning | |
| CN114239960A (en) | Distribution network project group progress management method and system based on dynamic resource optimization | |
| CN114491236A (en) | Intelligent supply chain matching technology based on knowledge learning | |
| CN105488271B (en) | A kind of oil gas module shaped steel automatic matching method | |
| Yu et al. | Constructing traceability between features and requirements for software product line engineering | |
| CN111160862A (en) | Thinking-guidance-diagram-based process flow display method, electronic equipment and storage 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 |