Affordable Access

Publisher Website

An Efficient Solution for Model Checking Graph Transformation Systems

Authors
Journal
Electronic Notes in Theoretical Computer Science
1571-0661
Publisher
Elsevier
Publication Date
Volume
213
Issue
1
Identifiers
DOI: 10.1016/j.entcs.2008.04.071
Keywords
  • Attributed Type Graphs
  • Layered Graph Transformations
  • Model Checking
  • Bogor
  • Agg

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.