Publication detail

Symbolic Analysis Based on Graph Transformations

KOLKA, Z. VLK, M. BIOLEK, D. BIOLKOVÁ, V.

Original Title

Symbolic Analysis Based on Graph Transformations

English Title

Symbolic Analysis Based on Graph Transformations

Type

conference paper

Language

en

Original Abstract

The paper deals with implementation details of a method for approximate symbolic analysis of linear circuits based on nontrivial transformations of voltage and current graphs. The method is based on eliminating the low-voltage branches from "high-voltage" loops and the low-current branches from "high-current" cuts. This goes beyond the simple edge deletion or contraction used in previous methods. The paper describes a graph transformation for decreasing the number of spanning trees and its computer implementation.

English abstract

The paper deals with implementation details of a method for approximate symbolic analysis of linear circuits based on nontrivial transformations of voltage and current graphs. The method is based on eliminating the low-voltage branches from "high-voltage" loops and the low-current branches from "high-current" cuts. This goes beyond the simple edge deletion or contraction used in previous methods. The paper describes a graph transformation for decreasing the number of spanning trees and its computer implementation.

Keywords

Symbolic analysis, linear circuits, graphs

RIV year

2007

Released

11.12.2007

Publisher

IEEE

Location

Marrakech, Morocco

ISBN

978-1-4244-1377-5

Book

Proceedings of the 14th IEEE International Conference on Electronics, Circuits and Systems ICECS 2007

Pages from

1139

Pages to

1142

Pages count

4

Documents

BibTex


@inproceedings{BUT23241,
  author="Zdeněk {Kolka} and Martin {Vlk} and Dalibor {Biolek} and Viera {Biolková}",
  title="Symbolic Analysis Based on Graph Transformations",
  annote="The paper deals with implementation details of a method for approximate symbolic analysis of linear circuits based on nontrivial transformations of voltage and current graphs. The method is based on eliminating the low-voltage branches from "high-voltage" loops and the low-current branches from "high-current" cuts. This goes beyond the simple edge deletion or contraction used in previous methods. The paper describes a graph transformation for decreasing the number of spanning trees and its computer implementation.",
  address="IEEE",
  booktitle="Proceedings of the 14th IEEE International Conference on Electronics, Circuits and Systems ICECS 2007",
  chapter="23241",
  institution="IEEE",
  year="2007",
  month="december",
  pages="1139--1142",
  publisher="IEEE",
  type="conference paper"
}