抄録A-012
A Semigroup of Homomorphisms Based on Vertex Connectivity of Weighted Directed Graphs
A Semigroup of Homomorphisms Based on Vertex Connectivity of Weighted Directed Graphs
○國持良行（静岡理工科大）
In this paper we give our definition of homomorphisms of general weighted directed graphs and investigate the semigroups of surjective homomorphims and synthesize graphs to obtain a generator of pricipal left (or right) ideal in the semigroup. This study is motivated by reducing the redundancy in concurrent systems, for example, Petri nets which are represented by weighted bipartite graphs. Here we can obtain some results in graphs that is similar to the ones already shown in Petri nets.
