Definition of Deadlock Patterns for Business Processes Work ow Models

  • Authors:

  • Sen'ichi Onoda;Yoshitomo Ikkai;Takashi Kobayashi;Norihisa Komoda

  • Affiliations:

  • -;-;-;-

  • Venue:
  • HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 5 - Volume 5
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

To support deadlock detection by computer, patterns which cause deadlock are defined. In expressing the pattern of deadlock structures by only control-node combinations, it is difficult to express the connection property, since it is decided by many complex combinations of control-nodes. Therefore, two new concepts, "Reachability" and "Absolute transferability", which express connection properties between two control-nodes are introduced. With these concepts, the five patterns of deadlocks is expressed simply. It is demonstrated mathematically that all deadlock structures can be classified into these patterns, and that deadlock occurs in business process workflow models which have one or those of these patterns.