It is known that the problem of determining consistency of a finite system of equations in a free group or a free monoid is decidable, but the corresponding problem for systems o...
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...