Presentation | 2013-01-22 On Polynomial Time Checking on Reachability in Sound Extended Free-Choice Workflow Nets Daiki KANOH, Shingo YAMAGUCHI, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | There are two aspects of a workflow: definition and instance. In this paper, we tackle verification of correctness of workflow instances by using reachability. The reachability problem is known to be intractable. Limiting our analysis to sound extended free-choice workflow nets, we gave a condition on the reachability problem. Based on the condition, we also proposed a polynomial time algorithm for solving the problem. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | Petri net / workflow net / reachability / polynomial-time algorithm |
Paper # | MSS2012-48 |
Date of Issue |
Conference Information | |
Committee | MSS |
---|---|
Conference Date | 2013/1/15(1days) |
Place (in Japanese) | (See Japanese page) |
Place (in English) | |
Topics (in Japanese) | (See Japanese page) |
Topics (in English) | |
Chair | |
Vice Chair | |
Secretary | |
Assistant |
Paper Information | |
Registration To | Mathematical Systems Science and its applications(MSS) |
---|---|
Language | JPN |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | On Polynomial Time Checking on Reachability in Sound Extended Free-Choice Workflow Nets |
Sub Title (in English) | |
Keyword(1) | Petri net |
Keyword(2) | workflow net |
Keyword(3) | reachability |
Keyword(4) | polynomial-time algorithm |
1st Author's Name | Daiki KANOH |
1st Author's Affiliation | Faculty of Engineering, Yamaguchi University() |
2nd Author's Name | Shingo YAMAGUCHI |
2nd Author's Affiliation | Graduate School of Science and Engineering, Yamaguchi University |
Date | 2013-01-22 |
Paper # | MSS2012-48 |
Volume (vol) | vol.112 |
Number (no) | 383 |
Page | pp.pp.- |
#Pages | 5 |
Date of Issue |