An Efficient Solution for Model Checking Graph Transformation Systems

  • Authors:
  • Luciano Baresi;Vahid Rafe;Adel T. Rahmani;Paola Spoletini

  • Affiliations:
  • Dipartimento di Elettronica e Informazione, Politecnico di Milano -- Milan, Italy;Department of Computer Engineering, Iran University of Science and Technology -- Tehran, Iran;Department of Computer Engineering, Iran University of Science and Technology -- Tehran, Iran;Dipartimento di Scienze della Cultura, Politiche e dell'Informazione, Università degli Studi dell'Insubria -- Como, Italy

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.