Presentation 2014/1/23
On Polynomial Time Checking on Reachability in Sound Cyclic Well-Structured Workflow Nets
Yuan QU, Shingo YAMAGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we discuss verification of correctness of instances in workflows having iteration. Most of the workflows can be modeled as cyclic well-structured workflow nets. Reachability is available as a criterion of the correctness for workflow instances, but it is unknown whether reachability of cyclic well-structured workflow nets can be verified in polynomial time. This paper proposes a polynomial time verification method. We convert a given cyclic well-structured workflow net to a free choice workflow net preserving reachability, and apply the free choice workflow net's verification method to the converted workflow net.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) workflow net / Petri net / releasing / reachability / polymomial-time
Paper # SS2013-56,MSS2013-59
Date of Issue

Conference Information
Committee SS
Conference Date 2014/1/23(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 Software Science (SS)
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 Cyclic Well-Structured Workflow Nets
Sub Title (in English)
Keyword(1) workflow net
Keyword(2) Petri net
Keyword(3) releasing
Keyword(4) reachability
Keyword(5) polymomial-time
1st Author's Name Yuan QU
1st Author's Affiliation Graduate School of Science and Engineering, Yamaguchi University()
2nd Author's Name Shingo YAMAGUCHI
2nd Author's Affiliation Graduate School of Science and Engineering, Yamaguchi University
Date 2014/1/23
Paper # SS2013-56,MSS2013-59
Volume (vol) vol.113
Number (no) 422
Page pp.pp.-
#Pages 6
Date of Issue