On the complexity of the design synthesis problem

被引:18
作者
Maimon, O [1 ]
Braha, D [1 ]
机构
[1] BOSTON UNIV,DEPT MFG ENGN,BOSTON,MA 02215
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS | 1996年 / 26卷 / 01期
关键词
D O I
10.1109/3468.477869
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we present and analyze a formal model of a design process, emphasizing the synthesis part. The design artifact description is identified as an algebraic structure. The desired function and constraints are mapped to the artifact description using an evolutionary process that can be visualized as a feedback loop of analysis, synthesis and evaluation. A special case of the synthesis activity, called the Basic Synthesis Problem (BSP), is addressed. The BSP is shown to be NP-Complete. As a consequence, tractability can be obtained by enforcing constraints on the artifact structure. As such, we present a model having an element of descriptive design theory that is also a framework for the future development of computational support systems and automatic design tools.
引用
收藏
页码:142 / 151
页数:10
相关论文
共 25 条
[1]  
[Anonymous], COMPUTER ARCHITECTUR
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]  
APPLE A, 1968, IBM SYST J, V7, P310
[4]  
Asimow Morris., 1962, INTRO DESIGN
[5]  
Boehm B. W., 1981, SOFTWARE ENG EC
[6]  
BRAHA D, 1995, INT J GEN SYST
[7]  
BRAID IC, 1975, COMM ACM, V18
[8]  
Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X
[9]  
Coyne R., 1990, KNOWLEDGE BASED DESI
[10]  
DAS SR, 1973, IEEE T COMPUT, VC 22, P845, DOI 10.1109/TC.1973.5009176