{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T07:20:08Z","timestamp":1710400808626},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci China Ser F"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1007\/bf02714572","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:32:23Z","timestamp":1654014743000},"page":"226-233","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial-time algorithm for the legal firing sequences problem of a type of synchronous composition Petri nets"],"prefix":"10.1007","volume":"44","author":[{"given":"Changjun","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02714572_CR1","first-page":"162","volume-title":"Proc. of the 14th IFAC, Beijing","author":"C. Berenice","year":"1999","unstructured":"Berenice, C., Xiaolan, X., Deadlock-free scheduling of manufacturing systems using Petri nets and dynamic programming, in Proc. of the 14th IFAC, Beijing, New York: IEEE Automation Society Press, 1999, 162\u2013168."},{"key":"BF02714572_CR2","volume-title":"Proc. INCOM, Nancy-Metz, France","author":"B. C. Damasceno","year":"1998","unstructured":"Damasceno, B. C., Xiaolan X., Deadlock-free scheduling of manufacturing systems with multipie resources, in Proc. INCOM, Nancy-Metz, France, New York: IEEE Automation Society Press, 1998."},{"issue":"2","key":"BF02714572_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/70.499821","volume":"12","author":"S. E. Ramaswamy","year":"1996","unstructured":"Ramaswamy, S. E., Joshi, S. B., Deadlock-free schedules for automated manufacturing workstations, IEEE Trans. on Robotics and Automation, 1996, 12(2): 391\u2013400.","journal-title":"IEEE Trans. on Robotics and Automation"},{"issue":"10","key":"BF02714572_CR4","first-page":"1394","volume":"75","author":"T. Watanabe","year":"1992","unstructured":"Watanabe, T. et al., Priority-list scheduling in timed Petri nets, Trans. IEICE of Japan, 1992, 75(10): 1394\u20131406","journal-title":"Trans. IEICE of Japan"},{"key":"BF02714572_CR5","first-page":"493","volume-title":"LNCS, Vol. 691","author":"T. Watanabe","year":"1993","unstructured":"Watanabe, T. et al., New Priority-list for Scheduling in Timed Petri Nets, LNCS, Vol. 691, Berlin: Springer-Verlag, 1993. 493\u2013512."},{"key":"BF02714572_CR6","unstructured":"Yamauchi, M. et al., An approximation algorithm for the legal firing sequence problem of Petri nets, IPSJ SIG Notes, 1993, 17\u201324."},{"key":"BF02714572_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/ISCAS.1989.100356","volume-title":"Proc. 1989 IEEE Int. Sympo. on Circuits and Systems","author":"T. Watanabe","year":"1989","unstructured":"Watanabe, T. et al., Legal firing sequences and minimum initial markings for Petri nets, Proc. 1989 IEEE Int. Sympo. on Circuits and Systems, New York: IEEE Automation Society Press, 1989, 323\u2013326."},{"key":"BF02714572_CR8","first-page":"277","volume-title":"Proc. The 3rd Int. Workshop on Petri Nets and Performance Models (PNPM89)","author":"T. Watanabe","year":"1989","unstructured":"Watanabe, T. et al., Legal firing sequences and related problems of Petri nets, Proc. The 3rd Int. Workshop on Petri Nets and Performance Models (PNPM89), New York: IEEE Computer Society Press, 1989, 277\u2013286."},{"issue":"12","key":"BF02714572_CR9","first-page":"1390","volume":"72","author":"T. Watanabe","year":"1989","unstructured":"Watanabe, T. et al., Minimum initial marking problems of Petri nets, Trans. IEICE of Japan, 1989, 72(12): 1390\u20131399.","journal-title":"Trans. IEICE of Japan"},{"issue":"10","key":"BF02714572_CR10","first-page":"1407","volume":"75","author":"T. Watanabe","year":"1992","unstructured":"Watanabe, T. et al., The minimum initial marking problems for scheduling of timed Petri nets, Trans. IEICE of Japan, 1992, 75(10): 1407\u20131421.","journal-title":"Trans. IEICE of Japan"},{"key":"BF02714572_CR11","unstructured":"Yamauchi, M. et al., A new approximation algorithm for the minimum initial marking problem of Petri nets, Proc. 6th Karuizawa Workshop on Circuits and Systems, IEICE of Japan, 1993, 279\u2013284."},{"key":"BF02714572_CR12","first-page":"267","volume-title":"Proc. 14th Annual ACM Symposium on Theory of Computing","author":"R. Kosaraju","year":"1982","unstructured":"Kosaraju, R., Decidability of reachability in vector addition systems, Proc. 14th Annual ACM Symposium on Theory of Computing, New York: Prentice-Hall, 1982, 267\u2013280."},{"key":"BF02714572_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E. W. Mayr","year":"1984","unstructured":"Mayr, E. W., An algorithm for the general Petri net reachability problem, SIAM J. Comput., 1984, 13: 441\u2013460.","journal-title":"SIAM J. Comput."},{"issue":"7","key":"BF02714572_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/TCS.1977.1084357","volume":"24","author":"T. Murata","year":"1977","unstructured":"Murata, T., Circuit theoretic analysis and synthesis of marking graphs, IEEE Trans. Circuits and Systems, 1977, 24(7): 400\u2013405.","journal-title":"IEEE Trans. Circuits and Systems"},{"issue":"12","key":"BF02714572_CR15","first-page":"1400","volume":"72","author":"T. Watanabe","year":"1989","unstructured":"Watanabe, T. et al., Time complexity of legal firing sequences and related problems of Petri nets, Trans. IEICE of Japan, 1989, 72(12): 1400\u20131409.","journal-title":"Trans. IEICE of Japan"},{"key":"BF02714572_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T., Petri nets: Properties, analysis and applications, Proc. IEEE, 1989, 77: 541\u2013580.","journal-title":"Proc. IEEE"},{"issue":"4","key":"BF02714572_CR17","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/70.864234","volume":"16","author":"H. Q. Wang","year":"2000","unstructured":"Wang, H. Q., Jiang, C. J., Liao, S. Y., Behaviour relations in synthesis process of Petri net models, IEEE Trans. on Robotics and Automation, 2000, 16(4): 400\u2013407.","journal-title":"IEEE Trans. on Robotics and Automation"},{"issue":"6","key":"BF02714572_CR18","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/BF02943509","volume":"10","author":"C. J. Jiang","year":"1995","unstructured":"Jiang, C. J., Nets Operations (II), J. of Comp. Sci. & Tech., 1995, 10(6): 509.","journal-title":"J. of Comp. Sci. & Tech."},{"key":"BF02714572_CR19","first-page":"129","volume-title":"PN Machine Theory of Discrete Event Dynamic Systems","author":"C. J. Jiang","year":"2000","unstructured":"Jiang, C. J., PN Machine Theory of Discrete Event Dynamic Systems, Beijing: Science Press, 2000, 129\u2013171."},{"issue":"12","key":"BF02714572_CR20","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1109\/71.553301","volume":"7","author":"S. M. Shatz","year":"1996","unstructured":"Shatz, S. M., Tu, S., Murata, T., An application of Petri net reduction for Ada tasking deadlock analysis, IEEE Trans. Parallel and Distributed Systems, 1996, 7(12): 1307.","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Science in China Series F Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02714572.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02714572\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02714572.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T16:32:33Z","timestamp":1654014753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02714572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["BF02714572"],"URL":"https:\/\/doi.org\/10.1007\/bf02714572","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}