{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:23:00Z","timestamp":1649064180094},"reference-count":11,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2018,6,1]]},"DOI":"10.1587\/transinf.2017fop0008","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T22:50:28Z","timestamp":1527807028000},"page":"1503-1510","source":"Crossref","is-referenced-by-count":2,"title":["Computational Complexity and Polynomial Time Procedure of Response Property Problem in Workflow Nets"],"prefix":"10.1587","volume":"E101.D","author":[{"given":"Muhammad Syafiq","family":"BIN AB MALEK","sequence":"first","affiliation":[{"name":"Graduate School of Science and Technology for Innovation, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohd Anuaruddin","family":"BIN AHMADON","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Technology for Innovation, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"YAMAGUCHI","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Technology for Innovation, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] T. Murata, \u201cPetri nets: Properties, analysis and applications,\u201d Proc. IEEE, vol.77, no.4, pp.541-580, 1989. 10.1109\/5.24143","DOI":"10.1109\/5.24143"},{"key":"2","unstructured":"[2] O.E. Hichami, M.A. Achhab, I. Berrada, R. Oucheikh, B.E.E. Mohajir, \u201cAn approach of optimization and formal verification of workflow Petri nets,\u201d Journal of Theoretical and Applied Information Technology, vol.61, no.3, pp.486-495, 2014."},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] S. Yamaguchi, \u201cPolynomial time verification of reachability in sound extended free-choice workflow net,\u201d IEICE Trans. Fundamentals, vol.E97-A, no.2, pp.468-475, Feb. 2014. 10.1587\/transfun.e97.a.468","DOI":"10.1587\/transfun.E97.A.468"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] W.M.P. van der Aalst and K.M. van Hee, Workflow Management: Models, Methods, and Systems, The MIT Press, 2002.","DOI":"10.7551\/mitpress\/7301.001.0001"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] W. van der Aalst, J. Buijs, and B. van Dongen, \u201cTowards improving the representational bias of process mining,\u201d Data-Driven Process Discovery and Analysis, Lecture Notes in Business Information Processing, vol.116, pp.39-54, Springer-Verlag, Berlin, 2012. 10.1007\/978-3-642-34044-4_3","DOI":"10.1007\/978-3-642-34044-4_3"},{"key":"6","unstructured":"[6] R. De Nicola, \u201cProcess algebras,\u201d Encyclopedia of Parallel Computing, pp.1624-1636, 2011."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M.A.B. Ahmadon and S. Yamaguchi, \u201cState number calculation problem of workflow nets,\u201d IEICE Trans. Inf. & Syst., vol.E98-D, no.6, pp.1128-1136, June 2015. 10.1587\/transinf.2014fop0009","DOI":"10.1587\/transinf.2014FOP0009"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] W.M.P. van der Aalst, \u201cVerification of workflow nets,\u201d Application and Theory of Petri Nets 1997, Lecture Notes in Computer Science, vol.1248, pp.407-426, Springer, 1997. 10.1007\/3-540-63139-9_48","DOI":"10.1007\/3-540-63139-9_48"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] M.A.B, Ahmadon and S. Yamaguchi, \u201cConvertibility and conversion algorithm of well-structured workflow net to process tree,\u201d Proc. CANDAR 2013, pp.122-127, 2013. 10.1109\/candar.2013.24","DOI":"10.1109\/CANDAR.2013.24"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] N. Qu, S. Yamaguchi, and Q.-W. Ge, \u201cParallel degree of well-structured workflow nets,\u201d IEICE Trans. Fundamentals, vol.E93-A, no.12, pp.2730-2739, Dec. 2010. 10.1587\/transfun.e93.a.2730","DOI":"10.1587\/transfun.E93.A.2730"},{"key":"11","unstructured":"[11] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition, pp.998-1003, The MIT Press, 2001."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/6\/E101.D_2017FOP0008\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T23:07:52Z","timestamp":1571440072000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E101.D\/6\/E101.D_2017FOP0008\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,1]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2017fop0008","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,1]]}}}