Presentation 2012-01-26
On Polynomial Time Verification of Protocol Inheritance between Extended Free Choice Workflow Nets and Their Subnets
Tomohiro HIRAKAWA, Shingo YAMAGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A workflow may be changed to adapt to market growth, legal reform, and so on. In that case, the new workflow has to preserve the behavior of the old workflow for business continuity. This property is called behavioral inheritance. It is known that the verification problem on behavioral inheritance is decidable but is intractable. In this paper, limiting the change to workflows to extension on structure, we proposed a necessary and sufficient condition and a polynomial-time algorithm for solving the verification problem on behavioral inheritance (strictly speaking, protocol inheritance).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) workflow / workflow net / behavioral inheritance / subnet / polynomial time verification
Paper # MSS2011-60,SS2011-45
Date of Issue

Conference Information
Committee MSS
Conference Date 2012/1/19(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 Verification of Protocol Inheritance between Extended Free Choice Workflow Nets and Their Subnets
Sub Title (in English)
Keyword(1) workflow
Keyword(2) workflow net
Keyword(3) behavioral inheritance
Keyword(4) subnet
Keyword(5) polynomial time verification
1st Author's Name Tomohiro HIRAKAWA
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 2012-01-26
Paper # MSS2011-60,SS2011-45
Volume (vol) vol.111
Number (no) 405
Page pp.pp.-
#Pages 6
Date of Issue