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.
%0 Journal Article
%1 baresi_08_efficient
%A Baresi, Luciano
%A Rafe, Vahid
%A Rahmani, Adel T.
%A Spoletini, Paola
%B Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification (GT-VC 2007)
%D 2008
%J Electronic Notes in Theoretical Computer Science
%K 2008 model_transformation graph_transformation model_checking
%N 1
%P 3--21
%R http://dx.doi.org/10.1016/j.entcs.2008.04.071
%T An Efficient Solution for Model Checking Graph Transformation Systems
%U http://dx.doi.org/10.1016/j.entcs.2008.04.071
%V 213
%X 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.
@article{baresi_08_efficient,
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.},
added-at = {2009-02-11T20:11:44.000+0100},
author = {Baresi, Luciano and Rafe, Vahid and Rahmani, Adel T. and Spoletini, Paola},
biburl = {https://www.bibsonomy.org/bibtex/2ceb40dc40383d46e15fcaf1004fb6fdf/leonardo},
booktitle = {Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification (GT-VC 2007)},
citeulike-article-id = {2882703},
doi = {http://dx.doi.org/10.1016/j.entcs.2008.04.071},
interhash = {9ec22bb5845f926c9569c502fd012cea},
intrahash = {ceb40dc40383d46e15fcaf1004fb6fdf},
journal = {Electronic Notes in Theoretical Computer Science},
keywords = {2008 model_transformation graph_transformation model_checking},
month = May,
number = 1,
pages = {3--21},
posted-at = {2008-06-11 14:18:55},
priority = {4},
timestamp = {2009-02-11T20:11:44.000+0100},
title = {An Efficient Solution for Model Checking Graph Transformation Systems},
url = {http://dx.doi.org/10.1016/j.entcs.2008.04.071},
volume = 213,
year = 2008
}