1471 search results - page 58 / 295 » Composing concurrency control |
AIPS
2000
14 years 11 months ago
2000
This paper develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern concurrent percept-driven robot plans. PHA...
FUIN
2007
14 years 9 months ago
2007
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
DEXAW
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper proposes an optimistic concurrency control (CC) algorithm, called Sequential Order with Dynamic Adjustment (SODA), that guarantees timely and correct execution of concu...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...