FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
FSTTCS
2010
Springer
13 years 2 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 2 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
Given a zero-sum infinite game we examine the question if players have optimal memoryless deterministic strategies. It turns out that under some general conditions the problem for...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
FSTTCS
2010
Springer
13 years 2 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 2 months ago
2010
Springer
