85 search results - page 6 / 17 » Decidability of Trajectory-Based Equations |
ASIAN
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
WOLLIC
2010
Springer
14 years 23 days ago
2010
Springer
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
AISC
2004
Springer
14 years 1 months ago
2004
Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
COMBINATORICS
2006
13 years 7 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
FROCOS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...