Sciweavers

329 search results - page 22 / 66
» Asynchronous Communication in Process Algebra
Sort
View
CONCUR
1993
Springer
13 years 11 months ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers
DMSN
2005
ACM
13 years 9 months ago
Timely data delivery in sensor networks using whirlpool
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical mo...
Divyasheel Sharma, Vladimir Zadorozhny, Panos K. C...
LCPC
2009
Springer
14 years 7 days ago
A Communication Framework for Fault-Tolerant Parallel Execution
PC grids represent massive computation capacity at a low cost, but are challenging to employ for parallel computing because of variable and unpredictable performance and availabili...
Nagarajan Kanna, Jaspal Subhlok, Edgar Gabriel, Es...
OPODIS
2000
13 years 9 months ago
Fair and Reliable Self-stabilizing Communication
We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper present...
Ivan Lavallée, Christian Lavault, Colette J...
FM
2008
Springer
127views Formal Methods» more  FM 2008»
13 years 9 months ago
A Schedulerless Semantics of TLM Models Written in SystemC Via Translation into LOTOS
TLM (Transaction-Level Modeling) was introduced to cope with the increasing complexity of Systems-on-Chip designs by raising the modeling level. Currently, TLM is primarily used fo...
Olivier Ponsini, Wendelin Serwe