DocumentCode
2963580
Title
On projection inheritance between acyclic extended free-choice workflow net and its subnet
Author
Yamaguchi, Satarou
Author_Institution
Grad. Sch. of Sci. & Eng., Yamaguchi Univ., Ube, Japan
fYear
2012
fDate
19-22 Nov. 2012
Firstpage
1
Lastpage
6
Abstract
A workflow net N may be extended as another workflow net N´ by adding places, transitions, and arcs. N´ is intuitively called a subclass of N under projection inheritance if we cannot distinguish the behaviors of N and N´ when ignoring the firing of the transitions newly added to N. Projection inheritance problem is to decide whether N´ is a subclass of N under projection inheritance. It is known that the problem is decidable but is intractable. Even if N is a subnet of N´, N´ is not always a subclass of N under projection inheritance. In this paper, limiting our analysis to projection inheritance between acyclic extended free-choice workflow nets and their subnets, we gave a necessary and sufficient condition on the problem. Based on the condition, we also constructed a polynomial time procedure for solving the problem.
Keywords
computational complexity; network theory (graphs); workflow management software; acyclic extended free-choice workflow net; necessary and sufficient condition; polynomial time procedure; projection inheritance problem; subnet; transition firing; Bridge circuits; Educational institutions; Electronic mail; Integrated circuit interconnections; Labeling; Limiting; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON 2012 - 2012 IEEE Region 10 Conference
Conference_Location
Cebu
ISSN
2159-3442
Print_ISBN
978-1-4673-4823-2
Electronic_ISBN
2159-3442
Type
conf
DOI
10.1109/TENCON.2012.6412180
Filename
6412180
Link To Document