Abstract
The question of determining the sequential diagnosability number of system in the PMC model has remained open since it was first formulated two decades ago. We show that this problem is co-NP complete. The problem is also shown to be co-NP complete even when restricted to planar graphs both in the weighted and the BGM models.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 584-595 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Computers |
| Volume | 40 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 1991 |