ICALP
2009
Springer
14 years 11 months ago
2009
Springer
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition r...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We define stochastic timed games, which extend two-player timed games with probabilities (following a recent approach by Baier et al), and which extend in a natural way continuous-...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
