Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.
Shingo YAMAGUCHI
Yamaguchi University
Mohd Anuaruddin BIN AHMADON
Yamaguchi University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shingo YAMAGUCHI, Mohd Anuaruddin BIN AHMADON, "Properties and Decision Procedure for Bridge-Less Workflow Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 2, pp. 509-512, February 2016, doi: 10.1587/transfun.E99.A.509.
Abstract: Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.509/_p
Copy
@ARTICLE{e99-a_2_509,
author={Shingo YAMAGUCHI, Mohd Anuaruddin BIN AHMADON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Properties and Decision Procedure for Bridge-Less Workflow Nets},
year={2016},
volume={E99-A},
number={2},
pages={509-512},
abstract={Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.},
keywords={},
doi={10.1587/transfun.E99.A.509},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - Properties and Decision Procedure for Bridge-Less Workflow Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 509
EP - 512
AU - Shingo YAMAGUCHI
AU - Mohd Anuaruddin BIN AHMADON
PY - 2016
DO - 10.1587/transfun.E99.A.509
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2016
AB - Many actual systems, e.g. computer programs, can be modeled as a subclass of Petri nets, called bridge-less workflow nets. For bridge-less workflow nets, we revealed the following properties: (i) any acyclic bridge-less workflow net is free choice; (ii) an acyclic bridge-less workflow net is sound iff it is well-structured; and (iii) any sound bridge-less workflow net is well-structured. We also proposed a necessary and sufficient condition to decide whether a given workflow net is bridge-less, and then constructed a polynomial-time procedure for it.
ER -