Proceedings of IEEE Systems Man and Cybernetics Conference - SMC
DOI: 10.1109/icsmc.1993.384711
|View full text |Cite
|
Sign up to set email alerts
|

Application of bond graph methodology to concurrent conceptual design of interdisciplinary systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…The early Schemebuilder design workbench described in Bracewell et al (1993) and Sharpe et al (1993), has been enhanced so that schemes may be developed from first principles using a development of the function-means tree approach as described by Buur (1990). The process is facilitated by application of functionally classified working principles and bond graph based decomposition principles.…”
Section: Computer-aided Methodology For Qualitative Development Of Scmentioning
confidence: 99%
“…The early Schemebuilder design workbench described in Bracewell et al (1993) and Sharpe et al (1993), has been enhanced so that schemes may be developed from first principles using a development of the function-means tree approach as described by Buur (1990). The process is facilitated by application of functionally classified working principles and bond graph based decomposition principles.…”
Section: Computer-aided Methodology For Qualitative Development Of Scmentioning
confidence: 99%
“…Bond graphs [4][5][6][7] describe system energy variables through their bond elements by denoting effort variable flows in one direction and flow variable flows in the opposite direction which are decided by bond casual structure. It is, therefore, very easy to obtain the dynamic response of any energy variable from a bond graph simulation method.…”
Section: Simulation Facilitiesmentioning
confidence: 99%
“…A generic representation (GR) across a wide variety of models that MLs could map into, and views could map out of, can make a difference. Graph data structures (GDS) can serve as GRs [12][13][14][15]. A GDS is simple, robust, scalable, and amenable to both relational and graph-theoretic algorithms.…”
Section: Introductionmentioning
confidence: 99%