{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:58:15Z","timestamp":1725490695053},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403340"},{"type":"electronic","value":"9783540449195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44919-1_26","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T20:38:42Z","timestamp":1188765522000},"page":"417-439","source":"Crossref","is-referenced-by-count":5,"title":["A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Taoka","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Furusato","sequence":"additional","affiliation":[]},{"given":"Toshimasa","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"26_CR1","unstructured":"K. Awa, S. Taoka, and T. Watanabe, \u201cThe legal firing sequence problem of Petri nets with lower bounds on the number of tokens,\u201d Tech. Rep. CST99-3, IEICE of Japan, pp. 17\u201324, May 1999, (in Japanese)."},{"key":"26_CR2","volume-title":"Graph Algorithms","author":"S. Even","year":"1978","unstructured":"S. Even, Graph Algorithms, Pitman, London, U.K., 1978."},{"key":"26_CR3","first-page":"480","volume":"E83-A","author":"T. Fujito","year":"2000","unstructured":"T. Fujito, S. Taoka, and T. Watanabe, \u201cOn the legal firing sequence problem of Petri nets with cactus structure,\u201d IEICE Trans. Fundamentals, Vol. E83-A, No. 3, pp. 480\u2013486, March 2000.","journal-title":"IEICE Trans. Fundamentals"},{"key":"26_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1978."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"R. Kosaraju, \u201cDecidability of reachability in vector addition systems,\u201d in Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 267\u2013280, 1982.","DOI":"10.1145\/800070.802201"},{"key":"26_CR6","unstructured":"K. Maniwa, M. Yamauchi, and T. Watanabe, \u201cThe marking construction problem of Petri nets,\u201d in Proc. of the 47th Joint Convention at the Chugoku Branch of Electrical 5-Societies of Japan, pp. 290\u2013291, October 1996, (in Japanese)."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"E. W. Mayr, \u201cAn algorithm for the general Petri net reachability problem,\u201d in Proc. 13th Annual ACM Symposium on Theory of Computing, pp. 238\u2013246, 1981, See also SIAM J. Comput., Vol.13, pp.441\u2013460 (1984). (with the same title by the author).","DOI":"10.1137\/0213029"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"K. Morita and T. Watanabe, \u201cThe legal firing sequence problem of Petri nets with state machine structure,\u201d in Proc. 1996 IEEE International Symposium on Circuits and Systems, pp. 64\u201367, May 1996.","DOI":"10.1109\/ISCAS.1996.541481"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"T. Murata, \u201cPetri nets: Properties, analysis and applications,\u201d Proc. IEEE, Vol. 77, No. 4, pp. 541\u2013580, April 1989.","journal-title":"Proc. IEEE"},{"key":"26_CR10","unstructured":"S. Nishi, S. Taoka, and T. Watanabe, \u201cAn Improved Heuristic Algorithm AAD for Minimizing Initial Markings of Petri Nets,\u201d Tech. Rep. CAS2001-67, IEICE of Japan, pp. 23\u201330, November 2001."},{"key":"26_CR11","first-page":"771","volume":"E84-A","author":"S. Nishi","year":"2001","unstructured":"S. Nishi, S. Taoka, and T. Watanabe, \u201cA heuristic algorithm FMDB for the minimum initial marking problem of Petri nets,\u201d IEICE Trans. Fundamentals, Vol. E84-A, No. 3, pp. 771\u2013780, March 2001.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"11","key":"26_CR12","first-page":"1774","volume":"E79-A","author":"K. Takahashi","year":"1996","unstructured":"K. Takahashi, M. Yamamura, and S. Kobayashi, \u201cA GA approach to solving reachability problems for Petri net,\u201d IEICE Trans. Fundamentals, Vol. E79-A, No. 11, pp. 1774\u20131780, November 1996.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"11","key":"26_CR13","first-page":"1817","volume":"E79-A","author":"S. Tanimoto","year":"1996","unstructured":"S. Tanimoto, M. Yamauchi, and T. Watanabe, \u201cFinding minimal siphons in general Petri nets,\u201d IEICE Trans. Fundamentals, Vol. E79-A, No. 11, pp. 1817\u20131824, November 1996.","journal-title":"IEICE Trans. Fundamentals"},{"key":"26_CR14","unstructured":"S. Taoka, T. Nojo, and T. Watanabe, \u201cThe marking construction problem of Petri nets MCP and its heuristic algorithm,\u201d in Proc. 15th Karuizawa Workshop on Circuits and Systems, pp. 447\u2013452, April 2002."},{"issue":"12","key":"26_CR15","first-page":"1390","volume":"E72","author":"T. Watanabe","year":"1989","unstructured":"T. Watanabe, Y. Mizobata, and K. Onaga, \u201cMinimum initial marking problems of Petri nets,\u201d Trans. IEICE of Japan, Vol. E72, No. 12, pp. 1390\u20131399, December 1989.","journal-title":"Trans. IEICE of Japan"},{"issue":"12","key":"26_CR16","first-page":"1400","volume":"E72","author":"T. Watanabe","year":"1989","unstructured":"T. Watanabe, Y. Mizobata, and K. Onaga, \u201cTime complexity of legal firing sequence and related problems of Petri nets,\u201d Trans. IEICE, Vol. E72, No. 12, pp. 1400\u20131409, December 1989.","journal-title":"Trans. IEICE"},{"issue":"10","key":"26_CR17","first-page":"1407","volume":"E75-A","author":"T. Watanabe","year":"1992","unstructured":"T. Watanabe, T. Tanida, M. Yamauchi, and K. Onaga, \u201cThe minimum initial marking problem for scheduling in timed Petri nets,\u201d IEICE Trans. Fundamentals, Vol. E75-A, No. 10, pp. 1407\u20131421, October 1992.","journal-title":"IEICE Trans. Fundamentals"},{"key":"26_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/3-540-56863-8_63","volume-title":"Application and Theory of Petri Nets 1993","author":"T. Watanabe","year":"1993","unstructured":"T. Watanabe and M. Yamauchi, \u201cNew priority-lists for scheduling in timed Petri nets,\u201d in Application and Theory of Petri Nets 1993, M. A. Marsan, Ed., Lecture Notes in Computer Science, No. 691, pp. 493\u2013512. Springer-Verlag, Berlin, Germany, June 1993."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"M. Yamauchi and T. Watanabe, \u201cAn approximation algorithm for the legal firing sequence problem of Petri nets,\u201d in Proc. 1994 IEEE International Symposium on Circuits and Systems, pp. 181\u2013184, May 1994.","DOI":"10.1109\/ISCAS.1994.409556"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"M. Yamauchi and T. Watanabe, \u201cA heuristic algorithm for the minimum initial marking problem of Petri net,\u201d in Proc. 1997 IEEE International Conference on Systems, Man and Cybernetics, pp. 245\u2013250, October 1997.","DOI":"10.1109\/ICSMC.1997.625757"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"M. Yamauchi and T. Watanabe, \u201cA heuristic algorithm FSD for the legal firing sequence problem of Petri nets,\u201d in Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics, pp. 78\u201383, October 1998.","DOI":"10.1109\/ICSMC.1998.725387"},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"M. Yamauchi and T. Watanabe, \u201cA heuristic algorithm SDS for scheduling with timed Petri nets,\u201d in Proc. 1999 IEEE International Symposium on Circuits and Systems, pp. VI-81\u2013VI-84, May 1999.","DOI":"10.1109\/ISCAS.1999.780100"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44919-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T15:41:31Z","timestamp":1556811691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44919-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403340","9783540449195"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44919-1_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}