Abstract
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. Proposed method computes prime compatibles more efficiently than conventional methods for many tested large ISFSM's.
| Original language | English |
|---|---|
| Pages | 229-234 |
| Number of pages | 6 |
| Publication status | Published - Dec 1 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95 - Chiba, Jpn Duration: Aug 29 1995 → Sept 1 1995 |
Other
| Other | Proceedings of the 1995 Asia and South Pacific Design Automation Conference, ASP-DAC'95 |
|---|---|
| City | Chiba, Jpn |
| Period | 8/29/95 → 9/1/95 |
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering