Abstract
We introduce a class of tree automata that perform tests on a memory that is updated using function symbol application and projection. The language emptiness problem for this class of tree automata is shown to be in DEXPTIME. We also introduce a class of set constraints with equality tests and prove its decidability by completion techniques and a reduction to tree automata with one memory. Set constraints with equality tests may be used to decide secrecy for a class of cryptographic protocols that properly contains a class of memoryless ping-pong protocols introduced by Dolev and Yao. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Comon, H., Cortier, V., & Mitchell, J. (2001). Tree automata with one memory, set constraints, and ping-pong protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 682–693). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_56
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
