Generalized controlled switched bond graph junctions

Abstract

This article presents two dual-controlled switched bond graph structures called generalized switched junction structures. These structures can represent all the interconnections enforced by commutations involving bond graph elements around standard 0- and 1-junctions. Moreover, pre-existing multiport switched bond graph formalisms like controlled junctions and switched power junctions can be represented as particular configurations of generalized switched junction structures. The generalized switched junction structures incorporate some algebraic constraints into their equation sets, which in the bond graph domain can be represented with residual sinks, in order to make them able to keep fixed the causality assignment even under ideal switching (zero transition time switching), as a convenient tool for simulation purposes. However, just performing some minor modifications on their internal implementation using basic bond graph components, the generalized switched junction structure can also be used to model commutations relaxing the ideal switching hypothesis in favor of the approximate one which introduces some parasitic components, which is frequently used as a means to avoid possibly appearing causality changes. The generalized switched junction structure can be implemented in a compact way at high level using the equation sets defining their behavior, or in detailed way using elements out of the standard set of bond graph components.