DocumentCode
2492237
Title
The analysis on grid workflow’s deadlock by Petri Nets
Author
Wang, Baoyi ; Zhang, Shaomin ; Xue, Qiaoli
Author_Institution
Sch. of Comput. Sci. & Technol., North China Electr. Power Univ., Baoding
fYear
2008
fDate
25-27 June 2008
Firstpage
5432
Lastpage
5437
Abstract
In the gird environment, grid workflow can carry on grid application conveniently, and it can improve the performance and efficiency of the grid application, but it may be referred to deadlock problem during its execution in operation process. There are a lot of modelling and analysis tools available for workflow, but Petri net is more preferable because of its solid mathematical foundation and graphical nature. After analysing the difference between grid workflow and traditional workflow, the grid workflow is modelled by D-Petri net, and deadlock detection algorithm based on reachable-graph is adopted to carry on deadlock detection on the grid workflow. Finally, verification is carried on the instance of software test workflow in the grid environment.
Keywords
Petri nets; grid computing; program verification; reachability analysis; workflow management software; D-Petri net; deadlock detection algorithm; grid workflow; reachable-graph; software test workflow; Algorithm design and analysis; Application software; Detection algorithms; Grid computing; High performance computing; Intelligent control; Mathematical model; Petri nets; Solid modeling; System recovery; D-Petri Net; Deadlock; Grid workflow; Petri; Reachable-graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on
Conference_Location
Chongqing
Print_ISBN
978-1-4244-2113-8
Electronic_ISBN
978-1-4244-2114-5
Type
conf
DOI
10.1109/WCICA.2008.4593815
Filename
4593815
Link To Document