{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T07:12:18Z","timestamp":1719472338681},"reference-count":20,"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":[[2015]]},"DOI":"10.1587\/transinf.2014fop0009","type":"journal-article","created":{"date-parts":[[2015,5,31]],"date-time":"2015-05-31T18:09:58Z","timestamp":1433095798000},"page":"1128-1136","source":"Crossref","is-referenced-by-count":12,"title":["State Number Calculation Problem of Workflow Nets"],"prefix":"10.1587","volume":"E98.D","author":[{"given":"Mohd Anuaruddin","family":"BIN AHMADON","sequence":"first","affiliation":[{"name":"Graduate School of Science and Engineering, Yamaguchi University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shingo","family":"YAMAGUCHI","sequence":"additional","affiliation":[{"name":"Graduate School of Science and Engineering, 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.","DOI":"10.1109\/5.24143"},{"key":"2","unstructured":"[2] G.J. Holzmann, The SPIN Model Checker: Primer and Reference Manual, Addison-Wesley, 2004."},{"key":"3","unstructured":"[3] D.Y. Chao and Y. Fang, \u201cNumber of reachable states for simple classes of Petri nets,\u201d Proc. IECON 2011, pp.3788-3791, 2011."},{"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.M.P. van der Aalst, J.C.A.M. Buijs, and B.F. van Dongen, \u201cTowards improving the representational bias of process mining,\u201d Lecture Notes in Business Information Processing, vol.116, pp.39-54, 2012.","DOI":"10.1007\/978-3-642-34044-4_3"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] J. Esparza and M. Silva, \u201cCircuits, handles, bridges and nets,\u201d Lecture Notes in Computer Science, vol.483, pp.210-242, 1990.","DOI":"10.1007\/3-540-53863-1_27"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] W.M.P. van der Aalst, \u201cVerification of workflow nets,\u201d Lecture Notes in Computer Science, vol.1248, pp.407-426, 1997.","DOI":"10.1007\/3-540-63139-9_48"},{"key":"8","unstructured":"[8] T. Susaki and S. Yamaguchi, \u201cOn process tree based calculation of the number of states in Petri nets,\u201d Proc. ITC-CSCC 2013, pp.84-87, 2013."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] J. Desel and J. Esparza, Free Choice Petri Nets, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511526558"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J. Esparza and M. Nielsen, \u201cDecidability issues for Petri nets,\u201d Bulletin of the EATCS 52, pp.244-262, 1994.","DOI":"10.7146\/brics.v1i8.21662"},{"key":"11","unstructured":"[11] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, Second ed., pp.998-1003, The MIT Press, 2001."},{"key":"12","unstructured":"[12] A. Ohta and K. Tsuji, \u201cNP-hardness of liveness problem of bounded asymmetric choice net,\u201d IEICE Trans. Fundamentals, vol.E85-A, no.5, pp.1071-1075, May 2002."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] R.R. Howell, L.E. Rosier, and H. Yen, \u201cNormal and sinkless Petri nets,\u201d J. Computer and System Sciences, vol.46, pp.1-26, 1993.","DOI":"10.1016\/0022-0000(93)90046-Y"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] M.A. Bin Ahmadon and S. Yamaguchi, \u201cConvertibility and conversion algorithm of well-structured workflow net to process tree,\u201d Proc. CANDAR 2013, pp.122-127, 2013.","DOI":"10.1109\/CANDAR.2013.24"},{"key":"15","unstructured":"[15] K.M. van Hee, N. Sidorova, and M. Voorhoeve, \u201cSoundness and separability of workflow nets in the stepwise refinement approach,\u201d Proc. ICATPN 2003, vol.2679, pp.337-356, 2003."},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] S. Yamaguchi, \u201cPolynomial time verification of reachability in sound extended free-choice workflow nets,\u201d IEICE Trans. Fundamentals, vol.E97-A, no.2, pp.468-475, Feb. 2014.","DOI":"10.1587\/transfun.E97.A.468"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] R.E. Tarjan, \u201cDepth-first search and linear graph algorithms,\u201d SIAM J. Comput., vol.1, no.2, pp.146-160, 1972.","DOI":"10.1137\/0201010"},{"key":"18","unstructured":"[18] S. Dohi and S. Yamaguchi, \u201cOn properties and a decision method of bridge-less workflow nets,\u201d IEICE Technical Report, MSS2013-94, 2014."},{"key":"19","unstructured":"[19] S. Yamaguchi, M. Yamaguchi, and M. Tanaka, \u201cA model checking method of soundness for acyclic workflow nets using the SPIN model checker,\u201d Int. J. INFORMATION, vol.12, no.1, pp.163-172, 2009.1."},{"key":"20","unstructured":"[20] O.E. Hichami, M.A. Achhab, I. Berrada, R. Oucheikh, and B.E.E. Mohajir, \u201cAn approach of optimization and formal verification of workflow Petri nets,\u201d J. Theoretical and Applied Information Technology, vol.61, no.3, pp.486-495, 2014."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/6\/E98.D_2014FOP0009\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,25]],"date-time":"2019-08-25T18:05:37Z","timestamp":1566756337000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E98.D\/6\/E98.D_2014FOP0009\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2014fop0009","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}