Mohd Anuaruddin BIN AHMADON

Computational Complexity and Polynomial Time Procedure of Response Property Problem in Workflow Nets
Muhammad Syafiq BIN AB MALEK Mohd Anuaruddin BIN AHMADON Shingo YAMAGUCHI 
Publication Date: 2018/06/01
Vol. E101-D  No. 6  pp. 1503-1510
Type of Manuscript:  Special Section PAPER (Special Section on Formal Approaches)
Category: Formal Approaches
the response propertyPetri netprocess treecomputational complexitypolynomial time algorithm
 Summary | Full Text:PDF(609.5KB)

Properties and Decision Procedure for Bridge-Less Workflow Nets
Shingo YAMAGUCHI Mohd Anuaruddin BIN AHMADON 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/02/01
Vol. E99-A  No. 2  pp. 509-512
Type of Manuscript:  Special Section LETTER (Special Section on Mathematical Systems Science and its Applications)
Petri networkflow netbridge-lessnecessary and sufficient conditionpolynomial-time procedure
 Summary | Full Text:PDF(384.6KB)

State Number Calculation Problem of Workflow Nets
Mohd Anuaruddin BIN AHMADON Shingo YAMAGUCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/06/01
Vol. E98-D  No. 6  pp. 1128-1136
Type of Manuscript:  Special Section PAPER (Special Section on Formal Approach)
Category: Petri net
Petri netstate number calculation problemprocess treesolvabilitycomputational complexitymodel checking
 Summary | Full Text:PDF(1.1MB)