Presentation 2011-07-01
On a Condition for Refactoring of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets
Bozhong SUN, Shingo YAMAGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Most of actual workflows can be modeled as free choice workflow nets. There is a subclass of acyclic free choice workflow nets, which is called acyclic well-structured workflow nets. Acyclic well-structured workflow nets have relatively more analysis techniques than acyclic free choice workflow nets. In this paper, we propose a sufficient condition for transforming acyclic free choice workflow nets to acyclic well-structured workflow nets, which preserves a behavioral equivalence called branching bisimilarity.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) workflow nets / refactoring / extended free choice / well-structured / sufficient condition
Paper # CAS2011-19,VLD2011-26,SIP2011-48,MSS2011-19
Date of Issue

Conference Information
Committee MSS
Conference Date 2011/6/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 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 a Condition for Refactoring of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets
Sub Title (in English)
Keyword(1) workflow nets
Keyword(2) refactoring
Keyword(3) extended free choice
Keyword(4) well-structured
Keyword(5) sufficient condition
1st Author's Name Bozhong SUN
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-07-01
Paper # CAS2011-19,VLD2011-26,SIP2011-48,MSS2011-19
Volume (vol) vol.111
Number (no) 105
Page pp.pp.-
#Pages 5
Date of Issue