An algorithm for converting an electrical circuit to a bond graph : a formalization of the inspection method

Bruno Robisson 1 Jean-Gabriel Ganascia 1
1 APA - Apprentissage et Acquisition des connaissances
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this article, we show that the algorithm proposed by Karnopp and Rosenberg for converting a circuit into a bond graph is not fully adapted to the bond graph formalism. This formalism implicitly deletes information which is useless for describing the circuits' functioning. But this information is not systematically deleted in the bond graphs obtained with their algorithm. We propose an algorithm based on another of their method, called the inspection method. It was not yet formalized and allows to obtain bond graphs where the useless information is entirely deleted. This algorithm uses the Tutte decomposition of graphs and associates a unique bond graph with a given circuit.
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-00481641
Contributor : Bruno Robisson <>
Submitted on : Tuesday, February 9, 2016 - 5:16:18 PM
Last modification on : Thursday, March 21, 2019 - 1:07:05 PM
Long-term archiving on : Saturday, November 12, 2016 - 2:10:14 PM

File

robisson_2001_algorithm_for_co...
Files produced by the author(s)

Identifiers

  • HAL Id : emse-00481641, version 1

Citation

Bruno Robisson, Jean-Gabriel Ganascia. An algorithm for converting an electrical circuit to a bond graph : a formalization of the inspection method. International Conference on Bond Graph Modeling and Simulation, Society for Computer Simulation, Jan 2001, Phoenix, United States. pp.199-203. ⟨emse-00481641⟩

Share

Metrics

Record views

220

Files downloads

537