CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We examine the role of transactional memory from two perspectives: that of a programming language with atomic actions and that of implementations of the language. We argu...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
One-counter automata are a fundamental and widely-studied class of infinite-state systems. In this paper we consider one-counter automata with counter updates encoded in binary—...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study bisimulation and minimization for weighted automata, relying on a geometrical representation of the model, linear weighted automata (lwa). In a lwa, the state-sp...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....