Sciweavers

138 search results - page 18 / 28
» Model Checking Round-Based Distributed Algorithms
Sort
View
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 2 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
JUCS
2006
124views more  JUCS 2006»
14 years 9 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
115
Voted
WOA
2010
14 years 7 months ago
Using Mobile Agents for Secure Biometric Authentication
This paper deals with the definition of a strong authentication model, coupling usual password/PIN based methods with a biometric matching, over a Multi Agent distributed infrastru...
Marco Tranquillin, Carlo Ferrari, Michele Moro
AP2PS
2009
IEEE
15 years 23 days ago
Algorithm-Based Fault Tolerance Applied to P2P Computing Networks
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance i...
Thomas Roche, Mathieu Cunche, Jean-Louis Roch
PPOPP
2010
ACM
15 years 6 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...