In the design of large-scale systems the problem is often too large to be approached by a single group. Then the system design problem must be resolved into component subproblems with different groups assigned to work on each subproblem. A. Wayne Wymore's "Tricotyledon Theory of Systems Design" (T3SD) provides a general system theoretic framework for the statement of large-scale system design problems. In this paper some results are developed for the extension of T3SD to the problem of the resolution of system design problems into system component design problems. Initially resolutions with respect to I/O specifications and technologies are defined and examined. Following this, resolutions with respect to merit orderings in which the merit orderings on the component problems have a specified relation with the merit orderings on the original problem are discussed. Ideal, strong and perfect resolutions with respect to merit orderings are defined and relationships among these types of resolutions are discussed. It is shown that trivial strong and ideal resolutions can always be developed from simple resolutions. Perfect resolutions are always ideal resolutions and ideal resolutions are always strong resolutions. Finally it is shown that given a class of simple resolutions there always exists a maximal ideal resolution for that class.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/187898 |
| Date | January 1984 |
| Creators | TURNBACH, ROBERT J., JR. |
| Contributors | Wymore, A. Wayne |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | English |
| Detected Language | English |
| Type | text, Dissertation-Reproduction (electronic) |
| Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.0022 seconds