The following publications are possibly variants of this publication:
- Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow NetsShingo Yamaguchi. ieicet, 95-D(5):1375-1379, 2012. [doi]
- On Liveness of Non-sound Acyclic Free Choice Workflow NetsNaoki Nakahara, Shingo Yamaguchi. ic-nc 2014: 336-341 [doi]
- Sufficient Condition on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow NetsYuki Murakami, Ichiro Toyoshima, Shingo Yamaguchi. ic-nc 2013: 592-596 [doi]
- Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their ApplicationIchiro Toyoshima, Shingo Yamaguchi, Yuki Murakami. ieicet, 98-A(2):635-644, 2015. [doi]
- Polynomial Time Verification of Reachability in Sound Extended Free-Choice Workflow NetsShingo Yamaguchi. ieicet, 97-A(2):468-475, 2014. [doi]
- Polynomial Time Verification of Protocol Inheritance between Acyclic Extended Free-Choice Workflow Nets and Their SubnetsShingo Yamaguchi, Tomohiro Hirakawa. ieicet, 96-A(2):505-513, 2013. [doi]