Sciweavers

4385 search results - page 150 / 877
» Abstraction for Concurrent Objects
Sort
View
ACSD
2003
IEEE
125views Hardware» more  ACSD 2003»
15 years 4 months ago
Modelling a Secure, Mobile, and Transactional System with CO-OPN
Modelling complex concurrent systems is often difficult and error-prone, in particular when new concepts coming from advanced practical applications are considered. These new appl...
Didier Buchs, Stanislav Chachkov, David Hurzeler
AIPS
2009
15 years 10 days ago
Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis
We provide a theoretical analysis of planning via Petri net unfolding, a novel technique for synthesising parallel plans. Parallel plans are generally valued for their execution f...
Sarah L. Hickmott, Sebastian Sardiña
CONCURRENCY
2010
104views more  CONCURRENCY 2010»
14 years 11 months ago
Performance analysis of an experimental wireless relay sensor network
Communication through relay channels in wireless sensor networks can create diversity and consequently improve robustness of data transmission for ubiquitous computing and network...
Gu-Chun Zhang, Xiao-Hong Peng, Xuan-Ye Gu
WDAG
2009
Springer
77views Algorithms» more  WDAG 2009»
15 years 5 months ago
Nonblocking Algorithms and Backward Simulation
Abstract. Optimistic and nonblocking concurrent algorithms are increasingly finding their way into practical use; an important example is software transactional memory implementat...
Simon Doherty, Mark Moir
ERSHOV
2009
Springer
15 years 5 months ago
Invariants, Modularity, and Rights
Abstract. The quest for modular concurrency reasoning has led to recent proposals that extend program assertions to include not just knowledge about the state, but rights to access...
Ernie Cohen, Eyad Alkassar, Vladimir Boyarinov, Ma...