Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study decidability issues for reachability problems in graph#R##N#transformation systems, a porful infinite-state model. For a fixed initial configuration,  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.   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.
['Nathalie Bertrand', 'Giorgio Delzanno', 'Barbara König', 'Arnaud Sangnier', 'Jan Stückrath']
I am writing a research paper on a idea On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.
[{"from": "human", "value": "I am writing a research paper on a idea On the Decidability Status of Reachability and Coverability in Graph Transformation Systems."}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  study decidability issues for reachability problems in graph#R##N#transformation systems, a porful infinite-state model. For a fixed initial configuration,  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.   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."}]