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

Minimum initial marking in timed marked graphs

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)
Rodriguez-Beltran, J. ; CINVESTAV-IPN, Mexico City, Mexico ; Ramfrez-Trevino, A.

This paper addresses the minimum initial marking (MIM) in timed marked graphs. In this problem both the net and the cycle time are fixed, so the problem consists in finding out a minimum initial marking M0 such that the cycle time of the TMG will be less or equal to the required one. The main result of this work is the heuristic algorithm MIM Solver to solve the MIM problem. It computes a subset of p-semiflows and adds tokens to places in two steps. First it adds the minimum number of tokens needed to reduce the difference between the required cycle time πd and the cycle time πi of each p-semiflow belonging to the computed subset. The difference π di>0 must be minimum. In this step a heuristic based on the places belonging to the maximum number of p-semiflows is used. Afterwards, the algorithm adds the largest number of tokens in p-semiflows to fulfil cycle time constraints. In this step a heuristic based on the places belonging to the shortest number of p-semiflows is used

Published in:

Systems, Man, and Cybernetics, 2000 IEEE International Conference on  (Volume:4 )

Date of Conference:


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.