Sciweavers

436 search results - page 5 / 88
» On the interconnection of message passing systems
Sort
View
CSL
2004
Springer
14 years 1 months ago
Parameterized Model Checking of Ring-Based Message Passing Systems
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems,  ¢¡ , comprised of finite, but arbitrarily many,...
E. Allen Emerson, Vineet Kahlon
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
14 years 9 months ago
Probabilistic Message Passing in Peer Data Management Systems
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...
Philippe Cudré-Mauroux, Karl Aberer, Andras...
FSTTCS
2007
Springer
14 years 1 months ago
Propositional Dynamic Logic for Message-Passing Systems
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
OPODIS
2003
13 years 9 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
SEFM
2008
IEEE
14 years 2 months ago
Tagging Make Local Testing of Message-Passing Systems Feasible
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
Puneet Bhateja, Madhavan Mukund