Method and device for detecting deadlock in BPEL process graphical design
A graphical and deadlock technology, applied in program control design, multi-program device, calculation, etc., can solve problems such as no effective deadlock detection method, and achieve the effect of eliminating deadlock
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] This embodiment provides a method for detecting deadlock in the graphical design of a BPEL process. The method includes:
[0024] Establish a consent data set;
[0025] Establish a rejection list corresponding to the consent side data set, and each item in the rejection list is a set of all rejected sides corresponding to each agreed side in the consent side data set;
[0026] Get the newly introduced edge;
[0027] Determine whether the newly introduced edge belongs to the existing rejection list, and if so, determine whether to introduce a deadlock.
[0028] Based on this method, deadlock can be checked in real time during the process design stage.
Embodiment 2
[0030] This embodiment provides a method for detecting deadlock in the graphical design of BPEL process, such as figure 1 As shown, the method includes the following steps.
[0031] In step S1, a consent edge data set is established.
[0032] The agreed edge is an edge in the graphical tool, which has a source vertex and a destination vertex. The source vertex represents one task, the destination vertex represents another task, and an edge represents the task corresponding to the destination vertex after the task corresponding to the source vertex is executed. The agreed side will not introduce a deadlock, it is a "safe" side.
[0033] Deadlock means that there is a simple loop that starts from a source vertex, executes the next tasks in sequence, and finally returns to this source vertex.
[0034] For example, in Figure 2(a), vi and vj are the source and destination vertices that agree with edge ek, respectively.
[0035] The agreed edge data is stored centrally for edges that have b...
Embodiment 3
[0083] This embodiment provides a device for detecting deadlock in the graphical design of BPEL process, such as image 3 As shown, the apparatus includes a memory 100 and a processor 200, the memory 100 stores instructions, and the processor 200 executes the instructions to execute the method according to Embodiment 1 or Embodiment 2.
[0084] Specifically, the memory 100 is, for example, a read-only memory (ROM), a flash memory (Flash Memory), or the like. The processor 200 is, for example, a central processing unit (CPU), a single-chip microcomputer, or the like.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


