Referenced Items are not available for this document.
This paper proposes a new implicit algorithm for excluding dominated compatibles. The algorithm utilizes a novel notion of signatures of compatibles to exclude dominated compatibles efficiently. Though this dominance check is weaker than the conventional one, experimental results show that in many cases the number of excluded compatibles is the same as that by class sets. The proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's
Date of Conference: 29 Aug-1 Sep 1995
- Page(s):
- 229 - 234
- Meeting Date :
- 29 Aug 1995-01 Sep 1995
- Print ISBN:
- 4-930813-67-0
- INSPEC Accession Number:
- 5217835
- Conference Location :
- Chiba
- Digital Object Identifier :
- 10.1109/ASPDAC.1995.486228
- 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.
