85 search results - page 2 / 17 » Decidability of Trajectory-Based Equations |
IJAC
2007
13 years 4 months ago
2007
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...
RTA
1998
Springer
13 years 9 months ago
1998
Springer
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...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
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...
CCS
2005
ACM
13 years 10 months ago
2005
ACM
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...
HYBRID
2000
Springer
13 years 8 months ago
2000
Springer
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...