Presentation 2011/11/10
On Reachability Verification for Acyclic Well-Structured Workflow Nets
Shinji HAMANO, Shingo YAMAGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Workflow nets are making great contributions for modeling and analysis of workflows. In this paper, we tackle verification of correctness of workflow instances by using reachability. Reachability is a basic property, but its verification is known to be intractable. There is a subclass of workflow nets which is called well-structured. Limiting our analysis to acyclic well-structured workflow nets, we propose a necessary and sufficient condition on the reachability, and construct a polynomial time algorithm based on the condition.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) workflow nets / well-structured / reachability / polynomial-time algorithm / necessary and sufficient condition
Paper # MSS2011-47,CAS2011-78
Date of Issue

Conference Information
Committee MSS
Conference Date 2011/11/10(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 Reachability Verification for Acyclic Well-Structured Workflow Nets
Sub Title (in English)
Keyword(1) workflow nets
Keyword(2) well-structured
Keyword(3) reachability
Keyword(4) polynomial-time algorithm
Keyword(5) necessary and sufficient condition
1st Author's Name Shinji HAMANO
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 2011/11/10
Paper # MSS2011-47,CAS2011-78
Volume (vol) vol.111
Number (no) 294
Page pp.pp.-
#Pages 5
Date of Issue