Computing a canonical bond graph from a component-connection representation

Bruno Robisson 1 Jean-Gabriel Ganascia 1
1 APA - Apprentissage et Acquisition des connaissances
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper proposes away to create a tool to discover new power electronic circuits. The first step of the proposed approach is to generate electrical circuits without redundancy. For that, a representation of electrical networks is constructed such that one single representation corresponds to several structurally distinct circuits all of which are equivalent, i.e. “function in the same way”. First, the classical componentconnection representation is used to define the equivalence between circuits. Then, this equivalence is expressed mathematically using the notion of 2-isomorphism, which is closely related to a particular decomposition of graphs called the Tutte decomposition. We have developed an algorithm to transform a circuit into a bond graph based on this decomposition. Contrary to existing algorithms, the algorithm developed here computes a canonical bond graph from a circuit. Finally, we show that this representation is fully adapted to the generating process.
Type de document :
Communication dans un congrès
Summer Computer Simulation Conference, Jul 2000, Vancouver, Canada. Proceedings of SCS Summer Computer Simulation Conference, pp.109-113, 2000
Liste complète des métadonnées

https://hal-emse.ccsd.cnrs.fr/emse-00481629
Contributeur : Bruno Robisson <>
Soumis le : vendredi 7 mai 2010 - 09:31:54
Dernière modification le : vendredi 31 août 2018 - 09:25:57

Identifiants

  • HAL Id : emse-00481629, version 1

Collections

Citation

Bruno Robisson, Jean-Gabriel Ganascia. Computing a canonical bond graph from a component-connection representation. Summer Computer Simulation Conference, Jul 2000, Vancouver, Canada. Proceedings of SCS Summer Computer Simulation Conference, pp.109-113, 2000. 〈emse-00481629〉

Partager

Métriques

Consultations de la notice

62