Computational Complexity of DECLARE Relation Problem for Sound non-Free-Choice Workflow Nets

2020 59th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE) ◽

10.23919/sice48898.2020.9240244 ◽

2020 ◽

Author(s):

Atsushi Ohta ◽

Kohkichi Tsuji

Keyword(s):

Computational Complexity ◽

Free Choice ◽

Download Full-text

Analysis of Option to Complete, Proper Completion and No Dead Tasks for Acyclic Free Choice Workflow Nets

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e102.a.336 ◽

2019 ◽

Vol E102.A (2) ◽

pp. 336-342

Author(s):

Shingo YAMAGUCHI

Keyword(s):

Free Choice ◽

Download Full-text

Protocol Inheritance Preserving Soundizability Problem and Its Polynomial Time Procedure for Acyclic Free Choice Workflow Nets

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e97.d.1181 ◽

2014 ◽

Vol E97.D (5) ◽

pp. 1181-1187 ◽

Author(s):

Shingo YAMAGUCHI ◽

Huan WU

Keyword(s):

Polynomial Time ◽

Free Choice ◽

Download Full-text

Polynomial analysis algorithms for free choice Probabilistic Workflow Nets

Performance Evaluation ◽

10.1016/j.peva.2017.09.006 ◽

2017 ◽

Vol 117 ◽

pp. 104-129 ◽

Author(s):

Javier Esparza ◽

Philipp Hoffmann ◽

Ratul Saha

Keyword(s):

Free Choice ◽

Download Full-text

Refactoring Problem of Acyclic Extended Free-Choice Workflow Nets to Acyclic Well-Structured Workflow Nets

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e95.d.1375 ◽

2012 ◽

Vol E95.D (5) ◽

pp. 1375-1379 ◽

Author(s):

Shingo YAMAGUCHI

Keyword(s):

Free Choice ◽

Download Full-text

Polynomial Time Verification of Protocol Inheritance between Acyclic Extended Free-Choice Workflow Nets and Their Subnets

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e96.a.505 ◽

2013 ◽

Vol E96.A (2) ◽

pp. 505-513 ◽

Author(s):

Shingo YAMAGUCHI ◽

Tomohiro HIRAKAWA

Keyword(s):

Polynomial Time ◽

Free Choice ◽

Download Full-text

A verification method of soundizability under protocol inheritance for acyclic free choice workflow nets

2013 IEEE International Conference of IEEE Region 10 (TENCON 2013) ◽

10.1109/tencon.2013.6718812 ◽

2013 ◽

Author(s):

Huan Wu ◽

Shingo Yamaguchi

Keyword(s):

Free Choice ◽

Workflow Nets ◽

Verification Method

Download Full-text

Computing the Concurrency Threshold of Sound Free-Choice Workflow Nets

Tools and Algorithms for the Construction and Analysis of Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-319-89963-3_1 ◽

2018 ◽

pp. 3-19 ◽

Author(s):

Philipp J. Meyer ◽

Javier Esparza ◽

Hagen Völzer

Keyword(s):

Free Choice ◽

Download Full-text

Polynomial Analysis Algorithms for Free-Choice Workflow Nets

Electronic Proceedings in Theoretical Computer Science ◽

10.4204/eptcs.253.1 ◽

2017 ◽

Vol 253 ◽

pp. 3-3

Author(s):

Javier Esparza

Keyword(s):

Free Choice ◽

Download Full-text

Implicit Places and Refactoring in Sound Acyclic Extended Free Choice Workflow Nets

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e99.a.502 ◽

2016 ◽

Vol E99.A (2) ◽

pp. 502-508 ◽

Author(s):

Ichiro TOYOSHIMA ◽

Shingo YAMAGUCHI ◽

Jia ZHANG

Keyword(s):

Free Choice ◽

Download Full-text

Two Sufficient Conditions on Refactorizability of Acyclic Extended Free Choice Workflow Nets to Acyclic Well-Structured Workflow Nets and Their Application

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e98.a.635 ◽

2015 ◽

Vol E98.A (2) ◽

pp. 635-644 ◽

Author(s):

Ichiro TOYOSHIMA ◽

Shingo YAMAGUCHI ◽

Yuki MURAKAMI

Keyword(s):

Free Choice ◽

Sufficient Conditions ◽

Download Full-text