Undirected graph algebra application for formalization description of information flows

The paper described algebra untargeted consistent graphs, allowing for formal, algebraic notation of any network structures including topology representing computer systems and networks. In contrast to the known methods for recording the structure of graphs, the proposed approach, an object is described by an algebraic expression, on which can be carried out various activities to determine or change its properties, for example, by creating a new network structure. The study demonstrated basic algebra, as well as showing its use to describe a popular network topology and computer systems.

[1]  Narayan C. Debnath,et al.  Aspect Algebra: The Operational Semantics for Aspect Oriented Software , 2012, 2012 Ninth International Conference on Information Technology - New Generations.

[2]  Yongyi Mao,et al.  Normal factor graphs: A diagrammatic approach to linear algebra , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[3]  Xie Gang,et al.  Hierarchy fault diagnosis based on signed directed graphs model , 2012, 2012 24th Chinese Control and Decision Conference (CCDC).

[4]  Stephen Gilmore,et al.  Scalable Differential Analysis of Process Algebra Models , 2012, IEEE Transactions on Software Engineering.

[5]  R. Judd,et al.  Signal flow graphs over max-plus algebra and applications , 2010, Proceedings of the 2010 American Control Conference.

[6]  Marko A. Rodriguez,et al.  A path algebra for multi-relational graphs , 2011, 2011 IEEE 27th International Conference on Data Engineering Workshops.