Tree Automata with Equality Constraints Modulo Equational Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Tree Automata with Equality Constraints Modulo Equational Theories

Abstract

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalized membership problem (embedding the emptiness problem) is decidable by proving that the saturation of tree automata presentations with suitable paramodulation strategies terminates. We sketch an application of these tree automata classes to the reachability problem for a fragment of the applied pi-calculus.
Fichier principal
Vignette du fichier
RR-5754.pdf (518.24 Ko) Télécharger le fichier

Dates and versions

inria-00071215 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071215 , version 1

Cite

Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron. Tree Automata with Equality Constraints Modulo Equational Theories. [Research Report] RR-5754, INRIA. 2005, pp.27. ⟨inria-00071215⟩
92 View
17116 Download

Share

Gmail Facebook Twitter LinkedIn More