Graphical matroid for causality assignment in bond graphs
The paper deals with the structural analysis of dynamical systems modeled by bond graphs. The authors use matroid theory as a method. After a brief introduction into matroids, Section 3 describes how every result in bond graph theory can be translated into matroid theory. In fact, for every dynamical system represented by a bond graph two corresponding matroids are defined. Section 4 contains the main result of the paper, which is a greedy algorithm that constructs cycle and co-cycle graphs from graphical matroids defined in the previous section. The algorithm fails if the matroid is not graphic as shown in Example 2. The validity of this procedure is verified in Section 5. Section 6 provides two explicit examples where the main result is applied.
- The mathematical foundations of bond graphs. IV: Matrix representations and causality
- Matroid algorithm for monitorability analysis of bond graphs
- Computation in causal graphs
- Bond graphs. II: Causality and singularity
- On efficient adjustment in causal graphs
- Causal Graph Dynamics
- Causal graph dynamics
- Causality and Network Graph in General Bilinear State-Space Representations
- Bond graphs. I: Acausal equivalence
This page was built for publication: Graphical matroid for causality assignment in bond graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963944)
