Referenced Items are not available for this document.
The relaxed problems for SMR⊃MR have been formulated by PMP with a free terminal time; SMR using Theorem Al and MR using Corollary Al; note that MR-FV has been solved by PMP-LP with a fixed terminal time. Secondly, we have proven that each problem for SMR⊃MR can have nonnegative integer solution by using PMP-LP of which time complexity is semi-polynomial time in live TCC and SCC nets. But, checking critical siphons at each time is needed in the upper classes. We have also assured the above execution by computer simulations. These approaches can give useful approximation algorithms for various important reachability problems in practical applications
Published in:
Circuits and Systems, 1997. ISCAS '97., Proceedings of 1997 IEEE International Symposium on
(Volume:2
)
Date of Conference: 9-12 Jun 1997
- Page(s):
- 1017 - 1020 vol.2
- Meeting Date :
- 09 Jun 1997-12 Jun 1997
- Print ISBN:
- 0-7803-3583-X
- INSPEC Accession Number:
- 5738866
- Digital Object Identifier :
- 10.1109/ISCAS.1997.621907
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
