On the Analysis and Verification of Graph Transformation Systems

Graph Transformation has recently become more and more popular as a general formal modeling language. Easy to use by designers and a considerable capability to behavioral modeling of dynamic systems characterize it among other formalisms. In this paper we concentrate on how to analyze these models. We will describe our approach to show how one can verify the designed graph transformation systems. To verify graph transformation systems we use a novel approach: using Bogor model checker to verify graph transformation systems.