Article ID Journal Published Year Pages File Type
422504 Electronic Notes in Theoretical Computer Science 2008 19 Pages PDF
Abstract

This paper presents an efficient solution for modeling checking graph transformation systems. The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations. Resulting models are amenable to check interesting properties expressed as combinations of LTL (Linear Temporal Logic) and graph transformation rules. The first experimental results are encouraging and show that in most cases our proposal improves existing approaches, both in terms of performance and expressiveness.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics