35 search results - page 4 / 7 » fsttcs 2010 |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. This paper proposes a global escape mechanism which can handle unexpected or unwanted conditions changing the default execution of distributed communicational flows, pres...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
We study the alternating-time temporal logics ATL and ATL extended with strategy contexts: these make agents commit to their strategies during the evaluation of formulas, contrary...
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...