Complexity of the system design problem

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 outpu...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 1995 International Symposium and Workshop on Systems Engineering of Computer-Based Systems pp. 51 - 57
Main Authors Chapman, W.L., Rozenblit, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Aircraft
Costs
H infinity control
NP-complete problem
Polynomials
Set theory
System performance
System testing
Time measurement
Online AccessGet full text

Cover

More Information
Summary: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 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.
ISBN:0780325311
9780780325319
DOI:10.1109/ECBS.1995.521840