Abstract
The paper proposes a heuristic algorithm FSDC for solving the Maximum Legal Firing Sequence problem of Petri nets (MAX LFS for short) and evaluates it experimentally. FSDC is improved from the existing one FSD for MAX LFS by focusing on deadlock components, instead of D-siphons, and by incorporating efficient backtracking. As experimental evaluation, FSDC is applied to 3017 test problems to each of which existence of an exact solution is guaranteed, and it has produced an optimum solution to each of 2330 (77.2%) test problems, which is about 1.43 times more than that of FSD, while the average CPU time is about 1.82 times longer than that of FSD. For five related problems each of which contains MAX LFS as a subproblem, it is experimentally shown that incorporating FSDC for solving MAX LFS gives us five heuristic algorithms that are superior in capability to existing ones.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. Awa, S. Taoka, and T. Watanabe, “The legal firing sequence problem of Petri nets with lower bounds on the number of tokens,” Tech. Rep. CST99-3, IEICE of Japan, pp. 17–24, May 1999, (in Japanese).
S. Even, Graph Algorithms, Pitman, London, U.K., 1978.
T. Fujito, S. Taoka, and T. Watanabe, “On the legal firing sequence problem of Petri nets with cactus structure,” IEICE Trans. Fundamentals, Vol. E83-A, No. 3, pp. 480–486, March 2000.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1978.
R. Kosaraju, “Decidability of reachability in vector addition systems,” in Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 267–280, 1982.
K. Maniwa, M. Yamauchi, and T. Watanabe, “The marking construction problem of Petri nets,” in Proc. of the 47th Joint Convention at the Chugoku Branch of Electrical 5-Societies of Japan, pp. 290–291, October 1996, (in Japanese).
E. W. Mayr, “An algorithm for the general Petri net reachability problem,” in Proc. 13th Annual ACM Symposium on Theory of Computing, pp. 238–246, 1981, See also SIAM J. Comput., Vol.13, pp.441–460 (1984). (with the same title by the author).
K. Morita and T. Watanabe, “The legal firing sequence problem of Petri nets with state machine structure,” in Proc. 1996 IEEE International Symposium on Circuits and Systems, pp. 64–67, May 1996.
T. Murata, “Petri nets: Properties, analysis and applications,” Proc. IEEE, Vol. 77, No. 4, pp. 541–580, April 1989.
S. Nishi, S. Taoka, and T. Watanabe, “An Improved Heuristic Algorithm AAD for Minimizing Initial Markings of Petri Nets,” Tech. Rep. CAS2001-67, IEICE of Japan, pp. 23–30, November 2001.
S. Nishi, S. Taoka, and T. Watanabe, “A heuristic algorithm FMDB for the minimum initial marking problem of Petri nets,” IEICE Trans. Fundamentals, Vol. E84-A, No. 3, pp. 771–780, March 2001.
K. Takahashi, M. Yamamura, and S. Kobayashi, “A GA approach to solving reachability problems for Petri net,” IEICE Trans. Fundamentals, Vol. E79-A, No. 11, pp. 1774–1780, November 1996.
S. Tanimoto, M. Yamauchi, and T. Watanabe, “Finding minimal siphons in general Petri nets,” IEICE Trans. Fundamentals, Vol. E79-A, No. 11, pp. 1817–1824, November 1996.
S. Taoka, T. Nojo, and T. Watanabe, “The marking construction problem of Petri nets MCP and its heuristic algorithm,” in Proc. 15th Karuizawa Workshop on Circuits and Systems, pp. 447–452, April 2002.
T. Watanabe, Y. Mizobata, and K. Onaga, “Minimum initial marking problems of Petri nets,” Trans. IEICE of Japan, Vol. E72, No. 12, pp. 1390–1399, December 1989.
T. Watanabe, Y. Mizobata, and K. Onaga, “Time complexity of legal firing sequence and related problems of Petri nets,” Trans. IEICE, Vol. E72, No. 12, pp. 1400–1409, December 1989.
T. Watanabe, T. Tanida, M. Yamauchi, and K. Onaga, “The minimum initial marking problem for scheduling in timed Petri nets,” IEICE Trans. Fundamentals, Vol. E75-A, No. 10, pp. 1407–1421, October 1992.
T. Watanabe and M. Yamauchi, “New priority-lists for scheduling in timed Petri nets,” in Application and Theory of Petri Nets 1993, M. A. Marsan, Ed., Lecture Notes in Computer Science, No. 691, pp. 493–512. Springer-Verlag, Berlin, Germany, June 1993.
M. Yamauchi and T. Watanabe, “An approximation algorithm for the legal firing sequence problem of Petri nets,” in Proc. 1994 IEEE International Symposium on Circuits and Systems, pp. 181–184, May 1994.
M. Yamauchi and T. Watanabe, “A heuristic algorithm for the minimum initial marking problem of Petri net,” in Proc. 1997 IEEE International Conference on Systems, Man and Cybernetics, pp. 245–250, October 1997.
M. Yamauchi and T. Watanabe, “A heuristic algorithm FSD for the legal firing sequence problem of Petri nets,” in Proc. 1998 IEEE International Conference on Systems, Man and Cybernetics, pp. 78–83, October 1998.
M. Yamauchi and T. Watanabe, “A heuristic algorithm SDS for scheduling with timed Petri nets,” in Proc. 1999 IEEE International Symposium on Circuits and Systems, pp. VI-81–VI-84, May 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Taoka, S., Furusato, S., Watanabe, T. (2003). A Heuristic Algorithm FSDC Based on Avoidance of Deadlock Components in Finding Legal Firing Sequences of Petri Nets. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_26
Download citation
DOI: https://doi.org/10.1007/3-540-44919-1_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40334-0
Online ISBN: 978-3-540-44919-5
eBook Packages: Springer Book Archive