Sciweavers

278 search results - page 35 / 56
» Formal Composition of Distributed Scenarios
Sort
View
CNSM
2010
13 years 7 months ago
Decomposition techniques for policy refinement
Abstract--The automation of policy refinement, whilst promising great benefits for policy-based management, has hitherto received relatively little treatment in the literature, wit...
Robert Craven, Jorge Lobo, Emil C. Lupu, Alessandr...
FM
2006
Springer
113views Formal Methods» more  FM 2006»
14 years 20 days ago
Interface Input/Output Automata
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...
TASE
2009
IEEE
14 years 3 months ago
Verifying Self-stabilizing Population Protocols with Coq
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
Yuxin Deng, Jean-François Monin
ATAL
2005
Springer
14 years 2 months ago
Simulating data dissemination techniques for local reputation systems
In distributed scenarios the robustness of a reputation mechanism depends on the data available for computation. Especially in ad-hoc networks the amount of available data is rest...
Andreas Schlosser, Marco Voss
ACSD
2008
IEEE
127views Hardware» more  ACSD 2008»
14 years 3 months ago
On the interplay between fault handling and request-response service invocations
Abstract. Service Oriented Computing (SOC) allows for the composition of services which communicate using unidirectional notification or bidirectional request-response primitives....
Claudio Guidi, Ivan Lanese, Fabrizio Montesi, Gian...