Bond graphs and matroids

A Reibiger and H Loose

Mathematics and Computers in Simulation (MATCOM), 2000, vol. 53, issue 4, 323-332

Abstract: We define bond graphs in a completely new way, and thereby justify the bond graph terminology in the framework of classical network theory. We discuss some interrelations between bond graphs and Minty networks.

Keywords: Kirchhoff networks; Bond graphs; Paynter network (search for similar items in EconPapers)
Date: 2000
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475400002196
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:53:y:2000:i:4:p:323-332

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().