Abstract
The reachability problem for term rewriting systems (TRS) is the problem of deciding, for a given TRS S and two terms M and N, whether M can reduce to N by applying the rules of S.
We show in this paper by some new methods based on algebraical tools of tree automata, the decidability of this problem for ground TRS's and, for every ground TRS S, we built a decision algorithm. In the order to obtain it, we compile the system S and the compiled algorithm works in a real time (as a fonction of the size of M and N).
We establish too some new results for ground TRS modulo different sets of equations : modulo commutativity of an operator σ, the reachability problem is shown decidable with technics of finite tree automata; modulo associativity, the problem is undecidable; modulo commutativity and associativity, it is decidable with complexity of reachability problem for vector addition systems.
supported by "Greco programmation" and "PRC mathematique et informatique"
Chapter PDF
Similar content being viewed by others
Bibliography
BRAINERS: Tree-generating regular systems, Info and control (1969)
G.W. BRAMS: Reseaux de Petri:theorie et pratique,tomes 1&2, Masson, Paris (1983)
CHEW: An improved algorithm for computing with equations,21st FOCS (1980)
DAUCHET, HEUILLARD, LESCANNE, TISON: The confluence of ground term tewriting systems is decidable,2nd LICS (1987)
DAUCHET & TISON: Tree automata and decidability in ground term rewriting systems FCT' 85 (LNCS no 199)
N.DERSHOWITZ,J.HSIANG,N.JOSEPHSON and D.PLAISTED: Associative-commutative rewriting,Proc.10th IJCAI, LNCS 202 (1983)
GECSEG F. & STEINBY M: tree automata,Akadémiai Kiado, Budapest (1984)
HUET.G & OPPEN.D.: Equations and rewrite rules:a survey,in formal languages:perspective and open problems,Ed.Book R.,Academic Press(1980)
J.P.JOUANNAUD: Church-Rosser computations with equational term rewriting systems,Proc.4th Conf on Automata, Algebra and programming,LNCS 159 (1983)
C.KIRCHNER: Methodes et outils de conception systematique d'algorithmes d'unification dans les théories équationnelles,These d'etat de l'universite de Nancy I (1985)
S.R.KOSARAJU: Decidability of reachability in vector addition systems, Proc.14th Ann.Symp.on Theory of Computing, 267–281.(1982)
KOZEN: Complexity of finitely presented algebra, 9th ACM th. comp. (1977)
E.W.MAYR: An algorithm for the general Petri net reachability problem, Siam J Comput.13 441.–460
NELSON & OPPEN: Fast decision algorithms based on congruence closure, JACM 27 (1980)
OYAMAGUCHI M.: The reachability problem for quasi-ground Term Rewriting Systems, Journal of Information Processing, vol 9, no4 (1986)
PLAISTED D. & BACHMAIR L.: Associative path ordering, Proc. 1st conference on Rewriting Techniques and Applications, LNCS 202 (1985)
RAOULT J.C.: Finiteness results on rewriting systems, RAIRO, IT, vol 15 (1985)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deruyver, A., Gilleron, R. (1989). The reachability problem for ground TRS and some extensions. In: Díaz, J., Orejas, F. (eds) TAPSOFT '89. CAAP 1989. Lecture Notes in Computer Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50939-9_135
Download citation
DOI: https://doi.org/10.1007/3-540-50939-9_135
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50939-4
Online ISBN: 978-3-540-46116-6
eBook Packages: Springer Book Archive