Switched Bond Graphs: Towards Systematic Composition of Computational Models
1995 (English)In: Proceedings of the 2nd International Conference on Bond Graph Modeling and Simulation, 1995, no 1, 73-79 p.Conference paper (Refereed)
In classical bond graph modelling, a computational model is systematically composed from the parts without having to introduce local or global patches. Unfortunately this has not yet been fully carried over to switched bond graphs, i.e. bond graphs employing the ideal switch concept. The focus of this paper is on the systematic composition of the discrete mode transitions. To this end we provide a mathematical structure for the composed computational model and a procedural composition operator. We also outline an algorithm to localize and adjust the composed system in those cases where the composition operator fails. An important concept in this treatment is the generalization of primitive switches to multiport switch fields.
Place, publisher, year, edition, pages
1995. no 1, 73-79 p.
Bond graph, Computational models, Systematic compositions
IdentifiersURN: urn:nbn:se:liu:diva-93708OAI: oai:DiVA.org:liu-93708DiVA: diva2:629009
2nd International Conference on Bond Graph Modeling and Simulation, Las Vegas, NV, USA, January, 1995