%0 Conference Proceedings
%F rta12
%A Bertrand, N.
%A Delzanno, G.
%A König, B.
%A Sangnier, A.
%A Stückrath, J.
%T On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
%B 23rd International Conference on Rewriting Techniques and Applications
%P 101-116
%S LIPIcs 15
%C Nagoya, Japan
%X We study decidability issues for reachability problems in graph transformation systems, a powerful infinite-state model. For a fixed initial configuration, we consider reachability of an entirely specified configuration and of a configuration that satisfies a given pattern (coverability). The former is a fundamental problem for any computational model, the latter is strictly related to verification of safety properties in which the pattern specifies an infinite set of bad configurations. In this paper we reformulate results obtained, e.g., for context-free graph grammars and concurrency models, such as Petri nets, in the more general setting of graph transformation systems and study new results for classes of models obtained by adding constraints on the form of reduction rules
%U http://www.irisa.fr/vertecs/Publis/Ps/BDKSS-rta12.pdf
%8 May
%D 2012