DocumentCode
2898306
Title
Definition of deadlock patterns for business processes workflow models
Author
Onoda, S. ; Ikkai, Y. ; Kobayashi, T. ; Komoda, N.
Author_Institution
Fac. of Eng., Osaka Univ., Japan
Volume
Track5
fYear
1999
fDate
5-8 Jan. 1999
Abstract
To support deadlock detection by computer, five patterns which cause deadlock are defined. In expressing the pattern of deadlock structures by control-node combinations only, it is difficult to express the connection properties, since these are 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 deadlock patterns are 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 more of these patterns.
Keywords
business data processing; concurrency control; corporate modelling; flow graphs; reachability analysis; workflow management software; absolute transferability; business process workflow models; computerized deadlock detection; connection properties; control nodes; deadlock patterns; deadlock structures; reachability; History; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Systems Sciences, 1999. HICSS-32. Proceedings of the 32nd Annual Hawaii International Conference on
Conference_Location
Maui, HI, USA
Print_ISBN
0-7695-0001-3
Type
conf
DOI
10.1109/HICSS.1999.772966
Filename
772966
Link To Document