Cart (Loading....) | Create Account
Close category search window
 

A heuristic algorithm for the minimum initial marking problem of Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yamauchi, M. ; Fac. of Eng., Hiroshima Univ., Japan ; Watanabe, T.

This paper proposes a heuristic algorithm YWMIM for the minimum initial marking problem (MIM) of Petri nets: “Given a Petri net and a firing count vector X, find an initial marking M, with the minimum total token number, for which there is a sequence δ of transitions such that each transition t appears exactly X(t) times in δ, the first transition is firable on M and the rest can be fired one by one subsequently.” Experimental results show that YWMIM produces better solutions than the algorithm AMIM that was known to have higher performance than the algorithm in Onaga et al. (1987)

Published in:

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.