CN106257425A - A kind of Java concurrent program path based on con current control flow graph method for decomposing - Google Patents
A kind of Java concurrent program path based on con current control flow graph method for decomposing Download PDFInfo
- Publication number
- CN106257425A CN106257425A CN201610577045.4A CN201610577045A CN106257425A CN 106257425 A CN106257425 A CN 106257425A CN 201610577045 A CN201610577045 A CN 201610577045A CN 106257425 A CN106257425 A CN 106257425A
- Authority
- CN
- China
- Prior art keywords
- thread
- control flow
- current control
- flow graph
- con current
- 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
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Devices For Executing Special Programs (AREA)
Abstract
The invention discloses a kind of Java concurrent program path based on con current control flow graph method for decomposing, by controlling flow relation and the contact (including the establishment of thread and all kinds of synchronized relation) of cross-thread in analyzing the thread in Java source code, build Java con current control flow graph；Java con current control flow graph is implemented concurrent path and dissects algorithm, and according to arithmetic result, Java source code is carried out pitching pile so that the source code after pitching pile can generate the path of concurrent program in the process of implementation and dissect result.
Description
Technical field
The invention belongs to dynamic routine analysis field, relate to a kind of Java concurrent program path based on con current control flow graph
Method for decomposing.
Background technology
Dynamic routine analysis is the analytical technology performed based on program, so the execution information of collection procedure is dynamically to analyze
The indispensable part of method.In order to collect the execution information in path efficiently, the commonly used path code of prior art
Mode, is mapped to one or one group of integer by every paths, quickly to judge that whether the current path performed is with executed
Certain paths is identical, carries out easily performing the cumulative of number of times.Accordingly, for the coding of realizing route, it is performed in program
Before, first have to program is carried out pitching pile, on the basis of the controlling stream graph (CFG, control flow graph) of the program of analysis,
Relevant position in program inserts Value Operations statement and relevant logic control, the probe collection etc. of one or more probe variablees
Statement.So after program is finished each time, collected path code result of calculation the most uniquely determines this execution
Path.
For single-threading program, on the basis of its control flow analysis, existing technology can execution route by every
It is encoded to a unique nonnegative integer or a string unique integer set；In order to realize this kind of path code, insert in a program
The statement of stake needs to perform along with the execution of target program, calculates final path code when being finished.
For concurrent program, the difficulty that traditional method for decomposing is difficult to carry out mainly has two: concurrent program adds thread
Establishment, termination and interaction mechanism, cause control flow structure and perform space be all very different with single-threading program；Concurrently
In program, each thread alternately mixes execution, causes the computing statement of probe variable it can also happen that out of order situation, it is difficult to place
Reason.
In actual Java software, the application of concurrent mechanism is relatively broad, and the complex relationship between multiple threads can be led
Causing its controlling stream graph and perform confusion, therefore, the practical anatomy scheme for concurrent program is indispensable.
Summary of the invention
Technical problem: the present invention provides its middle probe a kind of to calculate and path code mode ensure that in concurrent program every
The coding of the execution route of individual thread has uniqueness, reach can Precise collection concurrent program perform information effect based on
The Java concurrent program path method for decomposing of con current control flow graph.
Technical scheme: Java concurrent program path based on the con current control flow graph method for decomposing of the present invention, including as follows
Step:
Step 1) obtain from Java concurrent program source code and control between flow structure and thread also within each thread
The relation of sending out；
Step 2) first on the basis controlling flow structure within each thread, according to the concurrency relation between thread
Type, does following process respectively to different concurrent elements, and final structure obtains con current control flow graph:
A) for thread creation relation, increase from thread creation node to the control stream limit being created thread entry node；
B) for the thread synchronization relation of " notice-block ", Synchronization Control statement is identified, according to every Synchronization Control statement
Implication, delete the controlling stream graph structure disappeared because of synchronization inside thread, increase the control occurred because of synchronization between thread
Flow graph structures so that the execution precedence of every statement in con current control flow graph Correct thread；
C) for the thread synchronization relation of FutureGet mechanism, the notice node control stream limit to notified node is increased,
And notified node within thread all go out limit；
Step 3) implement to dissect algorithm in the con current control flow graph that described step 2 obtains, and required probe statement is inserted
Stake is in former concurrent program, it is ensured that the concurrent program after pitching pile is under arbitrary implementation status, and the execution track of each thread is equal
Identified by unique path code；
Step 4) perform the program after pitching pile, in program process, calculate path by the probe statement of institute's pitching pile
Coding statistical path frequency, as final anatomy result.
Further, in the inventive method, step 3) in required probe statement use multiple probe variablees, at pitching pile to former
Each thread unique probe variable is dynamically distributed according to Java Thread Id during concurrent program.
Further, in the inventive method, the required probe statement in step 3 dissects method according to complete trails and is calculated.
The present invention proposes a kind of Java concurrent program path based on con current control flow graph method for decomposing, is mainly closing
And on the basis of multiple thread internal control flow graph, by analyzing concurrent correlative code, increase, delete corresponding control and flow limit,
To build con current control flow graph, and then implementation path method for decomposing on the basis of con current control flow graph.
Beneficial effect: the present invention compared with prior art, has the advantage that
(1) anatomy technology in existing path fails to build the control flow relation between thread, also lacks in concurrent program
The parsability of each thread.Due to the fact that and add the process that cross-thread is created the information such as relation and synchronized relation, structure
Build con current control flow graph, it is possible to distinguish during each thread performs in the process of implementation and the different of other threads synchronize shape
State, and then make coded routing information can comprise the establishment of each thread, perform and terminate, it is ensured that accurately dissect also
Send out the ability of java applet.
(2) the anatomy commonly used single argument of technology in existing path is as probe variable, causes the probe language of multiple thread
Sentence performs to interact, it is difficult to distinguish.The inventive method make use of Java language Thread Id mechanism, for each thread according to
Its Thread Id dynamically distributes a distinctive probe variable and carries out coding calculating, the path during execution between each thread
Encoding operation is independent of each other, it is possible to process the multiple threads simultaneously performed in concurrent program.Even by same section of code establishing
Different threads, owing to its Thread Id is different, therefore also be able to distinguish clearly in parsing process, obtain each thread corresponding
Dissect result.
Accompanying drawing explanation
Fig. 1 is the architecture of the present invention.
Fig. 2 is the process schematic diagram in con current control flow graph structure to thread creation relation.
Fig. 3 is the process schematic diagram in con current control flow graph structure to thread " notice-block " synchronized relation.
Fig. 4 is the process schematic diagram in con current control flow graph structure to thread " FutureGet " synchronized relation.
Fig. 5 is the single-threaded controlling stream graph that example procedure is corresponding.
Fig. 6 is the con current control flow graph generated for Fig. 5.
Detailed description of the invention
Below in conjunction with embodiment and Figure of description, the present invention is further illustrated.
Probe in technology calculates and path code is two inseparable parts, the coding in path and the probe of pitching pile
Statement is corresponding, and probe statement is calculated during target program performs by the probe statement of institute's pitching pile.Accurately
Path code requires that the coding of either path has uniqueness, and accordingly, probe statement performed on different paths also must
Different variable-values must be calculated.
The basis of the inventive method is the structure of con current control flow graph, this Figure illustrates the control flow relation within thread
With the synchronization between thread performs relation；Implementing corresponding probe pile pitching method on Concurrent Control Flow graph model, the method is protected
Demonstrate,proved concurrent execution route coding uniqueness, and can be simple and clear be achieved.
One, architecture
Fig. 1 gives the architecture of this method.The illustrating of several major part is given below.
1 Concurrent Control Flow analysis
The function of this part is that from source code obtaining the synchronization controlled between flow relation and thread within thread holds
The relevant informations such as row relation, to be applied to probe pile pitching method.The control stream information needed in the present invention mainly includes single
The control flow relation between call relation and thread between controlling stream graph within method, method.
A) for thread creation relation, if there is the A in A thread controlling stream graphxNode creates thread B, thread B's
Ingress node is B1, then increase in con current control flow graph and control stream limit (Ax, B1), as shown in Figure 2: on the left of figure be thread A and
The controlling stream graph of thread B and the A establishment relationship description to B, right side is the corresponding con current control flow graph generated.
B) for the thread synchronization relation of " notice-block ", by identifying Synchronization Control statement correction con current control flow graph.
In " notice-block ", notice node is divided into 4 classes: (1) is inherited from notify, notifyAll of Object base class；(2)
What countdown was machine-processed deletes statement；(3) signal, signalAll of conditional-variable；(4) realized by Phaser class
Arrive notifies statement.The obstruction node corresponding with notice node is respectively wait, await, await, awaitAdvance.?
In con current control flow graph, build the notice statement node corresponding with the blocking statement control to this obstruction statement subsequent execution node
System stream limit, deletes, controlling within thread, the control stream limit blocking statement with its subsequent execution node simultaneously in flow structure, as
Shown in Fig. 3 (same Fig. 2 of implication in figure).
C) for the thread synchronization relation of FutureGet mechanism, if there is the A in A thread controlling stream graphxNode calls
The get () of thread B or join () method, the Egress node of thread B is By, then increase in con current control flow graph and control stream
Limit (By, Ax), and leave out the A in A thread controlling stream graphxNode go out limit, as shown in Figure 4 (same Fig. 2 of implication in figure).
2 concurrent paths dissect algorithm
In the control stream of single process, probe calculation is required to distinguish different paths.Traditional is single-threaded
Path dissects algorithm calculation: input controlling stream graph, how to carry out pitching pile by the structures shape of analysis and Control flow graph.Institute
The statement of pitching pile defines the probe variable r of an integer type, in action statement relevant for the diverse location pitching pile r of program (i.e.
Probe, comprises the assignment to r, adds up and tires out operations such as taking advantage of), make the value of r perform along with program and change, relative with path code
Should.
On this basis, the concurrent path of the present invention dissects algorithm improvement and includes two parts:
A) improvement of controlling stream graph.Be different from legacy paths dissect algorithm using single-threaded controlling stream graph as input, this
Bright generate con current control flow graph by previous step, and then on con current control flow graph, implement traditional single-threaded path dissect
Algorithm, it is ensured that the anatomy of single thread can be correctly completed.
B) improvement of plug-in mounting mode.Be different from legacy paths dissect algorithm use unitary variant as probe variable, this
The variable ri that probe variable is one group of integer type of bright use, the line that may perform for each in con current control flow graph
Journey use a variable as its probe variable, it is to avoid in concurrent mechanism execute out to probe calculate interference, it is ensured that no
Non-interference with the path code performed by thread.
Concrete calculation is: all probe variablees are realized by the variable array of an integer type；Each thread is created
When building, apply for the probe variable ri of this thread according to thread number i, and initialize ri；During thread performs, each thread
Probe statement by current thread numbering distinguish, will not interact, so ensure whole concurrent program path dissect energy
Enough correct enforcement.
3 perform and path code
For the controlling stream graph that static path is limited, the path code mode that the present invention uses is: perform at target program
Before, enumerate all static loop free path, and set up the one-to-one relationship table that every paths encodes with it；Performing every time
Bi Shi, tables look-up according to collected coding and can learn performed path.
In the case of having Do statement, recursive call or circulation thread to rely on, static path number is unlimited, it is impossible to piece
Lift.So before target program performs, it is impossible to list the one_to_one corresponding table of path code and path.In order to from path code
Statistical result show that corresponding path performs as a result, it is desirable to the method using the path in existing anatomy field to recall obtains coding
Corresponding path.
In code after pitching pile, probe statement constantly calculates the path of each thread along with the execution process of concurrent program
Coding, when Thread Termination and program determination, the probe variable number of use is performed number of threads, and each probe becomes
The value of amount is the coding of each thread execution route.
Two, method flow
This method, by target program controls the analysis of flow structure, calculates needs spy of pitching pile in program's source code
Pin, then by the execution of target program to collect path code, draws last execution result.Concrete step is as follows:
Step 1) from program's source code, obtain the control structure between each thread inside and thread, construct Concurrent Control Flow
Figure；
Step 2) concurrent path anatomy algorithm is implemented for con current control flow graph, calculate corresponding probe pitching pile to program
Among source code；
Step 3) perform the program after pitching pile, and collect corresponding path code and frequency thereof；
Step 4) recalled on con current control flow graph by the information collected, path code is converted into path, with
Obtain the execution result of concurrent path.
Embodiment:
Describing for convenience, it is assumed that there is the application example of following simplification, the source code of target concurrent program is as follows:
This code function is: Producer Producer and consumer Comsumer concurrently performs, Producer to
Being pressed into data in the stack of Container, Consumer takes out data from the stack of Container, if stack is full, then and Producer
Thread waits, if stack is empty, then Consumer thread waits.
Control flow structure in the single-threaded middle method of this program and between method is as shown in Figure 5.
According to the con current control flow graph building method of the present invention, do on the basis of Fig. 5 and revise (seeing Fig. 6) as follows:
1. analyze thread creation relation, increase thread creation limit: 4 → 28,5 →-39；
2. analyzing thread " notice-block " relation, it is known that notify in program that node is 16 and 22, the corresponding node that blocks is
20 and 13, and the descendant node blocking node is 21 and 14.Therefore increase limit 16 → 21,22 → 14, delete limit 13 → 14,21 →
22。
On con current control flow graph, (each thread uses self ID application, uses unique probe the probe of pitching pile as follows
Variable ri):
12 → 14:ri=ri*2；
22 → 14:ri=ri*2+1；
19 → 21:ri=ri*2；
16 → 21:ri=ri*2+1；
4 → 28:ri=ri*2；
31 → 28:ri=ri*2+1；
30 → 31:ri=ri*2；
16 → 31:ri=ri*2+1；
5 → 39:ri=ri*2；
42 → 39:ri=ri*2+1；
41 → 42:ri=ri*2；
23 → 42:ri=ri*2+1。
Assume there is following execution process:
Run such as the probe (value of the probe variable after calculating is in bracket) on below during execution successively:
Producer:(r2=0) 4 → 28 (r2=0), 12 → 14 (r2=0), 16 → 31 (r2=1), 31 → 28 (r2=3),
22→14(r2=7), 16 → 31 (r2=15)
Consumer:(r3=0) 5 → 39 (r3=0), 19 → 21 (r3=0), 23 → 42 (r3=1), 42 → 39 (r3=3),
19→21(r3=6), 23 → 42 (r3=13)
Corresponding path code: Producer thread is 15, and Consumer thread is 13.
If another time execution process is:
Following probe has been run successively during so performing:
Producer:(r2=0) 4 → 28 (r2=0), 12 → 14 (r2=0), 16 → 31 (r2=1), 31 → 28 (r2=3),
22→14(r2=7), 16 → 31 (r2=15)
Consumer:(r3=0) 5 → 39 (r3=0), 19 → 21 (r3=0), 23 → 42 (r3=1), 42 → 39 (r3=3),
16→21(r3=7), 23 → 42 (r3=15)
Corresponding path code: Producer thread is 15, and Consumer thread is 15.
Above-described embodiment is only the preferred embodiment of the present invention, it should be pointed out that: for the ordinary skill of the art
For personnel, under the premise without departing from the principles of the invention, it is also possible to making some improvement and equivalent, these are to the present invention
Claim improve with equivalent after technical scheme, each fall within protection scope of the present invention.
Claims (3)
1. Java concurrent program path based on a con current control flow graph method for decomposing, it is characterised in that the method include as
Lower step:
Step 1) from Java concurrent program source code, obtain the concurrently pass controlled between flow structure and thread within each thread
System；
Step 2) first on the basis controlling flow structure within each thread, according to the concurrency relation class between thread
Type, does following process respectively to different concurrent elements, and final structure obtains con current control flow graph:
A) for thread creation relation, increase from thread creation node to the control stream limit being created thread entry node；
B) for the thread synchronization relation of " notice-block ", Synchronization Control statement is identified, according to containing of every Synchronization Control statement
Justice, deletes the controlling stream graph structure disappeared inside thread because of synchronization, increases the controlling stream graph occurred between thread because of synchronization
Structure so that the execution precedence of every statement in con current control flow graph Correct thread；
C) for the thread synchronization relation of FutureGet mechanism, then in con current control flow graph, notice node is increased to notified
The control stream limit of node, and leave out notified node within thread all go out limit；
Step 3) implement to dissect algorithm in the con current control flow graph that described step 2 obtains, and required probe statement pitching pile is arrived
In former concurrent program, it is ensured that the concurrent program after pitching pile is under arbitrary implementation status, and the execution track of each thread is by only
The path code mark of one；
Step 4) perform the program after pitching pile, in program process, calculate path code by the probe statement of institute's pitching pile
And statistical path frequency, as final anatomy result.
Java concurrent program path based on con current control flow graph the most according to claim 1 method for decomposing, is characterized in that,
Described step 3) in required probe statement use multiple probe variablees, according to Java line during pitching pile to former concurrent program
Journey ID dynamically distributes each thread unique probe variable.
Java concurrent program path based on con current control flow graph the most according to claim 1 and 2 method for decomposing, its feature
It is that the required probe statement in described step 3 dissects method according to complete trails and is calculated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610577045.4A CN106257425B (en) | 2016-07-20 | 2016-07-20 | A kind of Java concurrent program path method for decomposing based on con current control flow graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610577045.4A CN106257425B (en) | 2016-07-20 | 2016-07-20 | A kind of Java concurrent program path method for decomposing based on con current control flow graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106257425A true CN106257425A (en) | 2016-12-28 |
| CN106257425B CN106257425B (en) | 2019-04-09 |
Family
ID=57714172
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610577045.4A Active CN106257425B (en) | 2016-07-20 | 2016-07-20 | A kind of Java concurrent program path method for decomposing based on con current control flow graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106257425B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108170434A (en) * | 2017-12-26 | 2018-06-15 | 首都师范大学 | The parallel acquisition methods and device in dangerous path |
| CN108182144A (en) * | 2017-12-14 | 2018-06-19 | 东南大学 | A kind of concurrent program method for decomposing based on sequential mode mining |
| CN109189483A (en) * | 2018-08-02 | 2019-01-11 | 优视科技新加坡有限公司 | Regulation method, apparatus, equipment/terminal/server and the storage medium of task execution |
| WO2022178889A1 (en) * | 2021-02-27 | 2022-09-01 | 华为技术有限公司 | Function calling context encoding method and apparatus, and function calling context decoding method and apparatus |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364185A (en) * | 2008-09-02 | 2009-02-11 | 中国科学院软件研究所 | Thread pool size self-adapting regulating method and concurrency control method applying server |
| CN101702176A (en) * | 2009-11-25 | 2010-05-05 | 南开大学 | XML data concurrency control method based on local path lock |
| CN102110052A (en) * | 2011-03-03 | 2011-06-29 | 华中科技大学 | Parallel acceleration method for dynamic analysis of program behavior |
| CN103197920A (en) * | 2013-03-25 | 2013-07-10 | 华为技术有限公司 | Concurrency control method, control nodes and system |
| US20150067283A1 (en) * | 2013-08-27 | 2015-03-05 | International Business Machines Corporation | Image Deduplication of Guest Virtual Machines |
-
2016
- 2016-07-20 CN CN201610577045.4A patent/CN106257425B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101364185A (en) * | 2008-09-02 | 2009-02-11 | 中国科学院软件研究所 | Thread pool size self-adapting regulating method and concurrency control method applying server |
| CN101702176A (en) * | 2009-11-25 | 2010-05-05 | 南开大学 | XML data concurrency control method based on local path lock |
| CN102110052A (en) * | 2011-03-03 | 2011-06-29 | 华中科技大学 | Parallel acceleration method for dynamic analysis of program behavior |
| CN103197920A (en) * | 2013-03-25 | 2013-07-10 | 华为技术有限公司 | Concurrency control method, control nodes and system |
| US20150067283A1 (en) * | 2013-08-27 | 2015-03-05 | International Business Machines Corporation | Image Deduplication of Guest Virtual Machines |
Non-Patent Citations (3)
| Title |
|---|
| 周志远等: ""对Java并发程序进行模型检测"", 《计算机工程与设计》 * |
| 王越等: ""Java并发程序动态分析技术研究"", 《南京大学学报（自然科学）》 * |
| 郭君红等: ""飞行控制软件测试中插桩技术的优化方法"", 《计算机工程》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108182144A (en) * | 2017-12-14 | 2018-06-19 | 东南大学 | A kind of concurrent program method for decomposing based on sequential mode mining |
| CN108182144B (en) * | 2017-12-14 | 2020-12-11 | 东南大学 | Concurrent program parsing method based on sequential pattern mining |
| CN108170434A (en) * | 2017-12-26 | 2018-06-15 | 首都师范大学 | The parallel acquisition methods and device in dangerous path |
| CN109189483A (en) * | 2018-08-02 | 2019-01-11 | 优视科技新加坡有限公司 | Regulation method, apparatus, equipment/terminal/server and the storage medium of task execution |
| WO2022178889A1 (en) * | 2021-02-27 | 2022-09-01 | 华为技术有限公司 | Function calling context encoding method and apparatus, and function calling context decoding method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106257425B (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106257425A (en) | A kind of Java concurrent program path based on con current control flow graph method for decomposing | |
| Xing et al. | Optimal Petri-net-based polynomial-complexity deadlock-avoidance policies for automated manufacturing systems | |
| Uzam et al. | An iterative synthesis approach to Petri net-based deadlock prevention policy for flexible manufacturing systems | |
| Liu et al. | Transition cover-based design of Petri net controllers for automated manufacturing systems | |
| Wang et al. | Controllability conditions of resultant siphons in a class of Petri nets | |
| Xing et al. | Resource-transition circuits and siphons for deadlock control of automated manufacturing systems | |
| CN104503917B (en) | Change domain of influence analysis method and system based on data flow function call path | |
| CN103744643B (en) | The method and device of multi-node parallel framework under a kind of multithread programs | |
| CN106200575A (en) | A kind of robustness control method of automated manufacturing system based on Petri network | |
| Hu et al. | Liveness and ratio-enforcing supervision of automated manufacturing systems using Petri nets | |
| CN105683940A (en) | Processing a data flow graph of a hybrid flow | |
| Rad et al. | Topological measure locating the effective crossover between segregation and integration in a modular network | |
| CN100538632C (en) | Be used for controlling sequential object-oriented systems method of emulation | |
| CN105184385A (en) | Distributed control method of automatic manufacturing system | |
| Szpyrka et al. | Formal description of Alvis language with α 0 system layer | |
| Javed et al. | Exploring spiking neural networks for prediction of traffic congestion in networks-on-chip | |
| Malaguti et al. | Models and heuristic algorithms for a weighted vertex coloring problem | |
| CN104036141B (en) | Open computing language (OpenCL)-based red-black tree acceleration method | |
| CN108376070A (en) | A kind of method, apparatus and computer of compiling source code object | |
| Pemmaraju et al. | Super-fast MST Algorithms in the Congested Clique using $ o (m) $ Messages | |
| CN104750610A (en) | Dominating degree based aberrance reduction method for message passing parallel program | |
| Thierry-Mieg et al. | Compositional analysis of discrete time petri nets | |
| CN104199649B (en) | The path method for decomposing of interactive information between a kind of process for father and son | |
| Hillston et al. | Formal techniques for performance analysis: blending SAN and PEPA | |
| Martin et al. | A tool for proving deadlock freedom |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |