36 search results - page 3 / 8 » concur 2009 |
CONCUR
2009
Springer
13 years 9 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...
CONCUR
2009
Springer
13 years 10 months ago
2009
Springer
ract bigraphs lack RPOs 57 6 Sorting 59 6.1 Place sorting and CCS 59 6.2 Link sorting, arithmetic nets and Petri nets 64 6.3 The impact of sorting 69 Part II : Motion 71 7 Reaction...
CONCUR
2009
Springer
13 years 12 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 12 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 12 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...