Graphical matroid for causality assignment in bond graphs (Q1963944): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:37, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Graphical matroid for causality assignment in bond graphs |
scientific article |
Statements
Graphical matroid for causality assignment in bond graphs (English)
0 references
19 March 2000
0 references
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.
0 references
matroid theory
0 references
bond graphs
0 references
causality assignment
0 references
combinatorial problems
0 references