Termination of Graph Rewriting is Undecidable
نویسنده
چکیده
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
منابع مشابه
Termination of graph rewriting is undecidable Detlef
It is shown that it is undecidable in general whether a graph rewriting system (in the \double pushout approach") is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting systems to the present problem.
متن کاملNon-simplifying Graph Rewriting Termination
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky’s work). However, some linguistic phenomena do not cope properly with trees. In a former paper, we showed the benefit of encoding linguistic structures by graphs and of using graph rewriting rules to compute on those stru...
متن کاملA Termination Criterion for Graph Transformations with Negative Application Conditions
Termination of graph transformations is in general undecidable, but it is possible to prove it for specific systems by checking for sufficient conditions. In the presence of rules with negative application conditions, the difficulties increase. In this paper we propose a different approach to the identification of a (sufficient) criterion for termination, based on the construction of a labelled...
متن کاملConfluence of Typed Attributed Graph Transformation Systems
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...
متن کاملEquilibrium and Termination ( extended version ) ∗
We present a reduction of the Post correspondence problem (PCP) to the question of whether a continuous-time Markov chain (CTMC) presented as a set graph-rewriting rules has an equilibrium. It follows that the question of whether a computable CTMC is dissipative (ie does not have an equilibrium) is undecidable. The encoding uses the Kappa language and is presented in details for a simple PCP in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 33 شماره
صفحات -
تاریخ انتشار 1998