### Abstract

The system design problem describes the process used to translating the need or requirements for a system into an actual design. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The results indicate that designing optimal systems with deterministic, polynomial time procedures is not possible.

Original language | English (US) |
---|---|

Title of host publication | International Symposium and Workshop on Systems Engineering of Computer Based Systems - Proceedings |

Pages | 51-57 |

Number of pages | 7 |

State | Published - 1995 |

Externally published | Yes |

Event | Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems - Tucson, AZ, USA Duration: Mar 6 1995 → Mar 9 1995 |

### Other

Other | Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems |
---|---|

City | Tucson, AZ, USA |

Period | 3/6/95 → 3/9/95 |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*International Symposium and Workshop on Systems Engineering of Computer Based Systems - Proceedings*(pp. 51-57)

**Complexity of the system design problem.** / Chapman, William L.; Rozenblit, Jerzy W; Bahill, A. Terry.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*International Symposium and Workshop on Systems Engineering of Computer Based Systems - Proceedings.*pp. 51-57, Proceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer Based Systems, Tucson, AZ, USA, 3/6/95.

}

TY - GEN

T1 - Complexity of the system design problem

AU - Chapman, William L.

AU - Rozenblit, Jerzy W

AU - Bahill, A. Terry

PY - 1995

Y1 - 1995

N2 - The system design problem describes the process used to translating the need or requirements for a system into an actual design. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The results indicate that designing optimal systems with deterministic, polynomial time procedures is not possible.

AB - The system design problem describes the process used to translating the need or requirements for a system into an actual design. It requires selecting components from a given set and matching the interfaces between them. Those that can be connected to meet the top level system's input and output requirements are tested to see how well they meet the system's performance and cost goals. We will prove that this system design process is NP-complete by restricting the Knapsack problem, which is known to be NP-complete, to an instance of the system design process problem. The results indicate that designing optimal systems with deterministic, polynomial time procedures is not possible.

UR - http://www.scopus.com/inward/record.url?scp=0029212622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029212622&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029212622

SP - 51

EP - 57

BT - International Symposium and Workshop on Systems Engineering of Computer Based Systems - Proceedings

ER -