Name
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1587/transfun.E99.A.509 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
Petri net, workflow net, bridge-less, necessary and sufficient condition, polynomial-time procedure | Programming language,Petri net,Computer science,Theoretical computer science,Workflow nets,Distributed computing | Journal |
Volume | Issue | ISSN |
E99A | 2 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yamaguchi, S. | 1 | 12 | 7.14 |
| Mohd Anuaruddin Bin Ahmadon | 2 | 6 | 10.13 |