The Correctness Proof of a Decomposing Approach
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Mathematically a 2Dconstrained design system can be modeled by m independent nonlinear equa-tions with n design variables and the design process can be viewed as a process ofsolving a geometric constraintsystem.Design decomposition is a highly effective way to improve a geometric constraint solver to make it effi-cient and robust.This paper reports a graph based decomposing approach and gives the correctness proof oftheapproach:(1)this approach can dealwith the decomposition ofstructurally under-constrained systems,(2)thisapproach can detect structurally over-constrained systems,(3)the approach can terminate within finite numberofsteps,and(4)the solving steps obtained through the decomposing approach are structurally consistent.

    Reference
    Related
    Cited by
Get Citation

袁波,李彦涛,孙家广.一种设计分解的正确性证明.软件学报,2001,12(3):323-328

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 04,1999
  • Revised:December 03,1999
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063