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 suitable for checking interesting properties expressed as combinations of LTL 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.
Baresi et al. REF present an efficient solution for modeling checking graph transformation systems.
An Efficient Solution for Model Checking Graph Transformation Systems
Electron. Notes Theor. Comput. Sci.
Electron. Notes Theor. Comput. Sci.
Computer Science