Sciweavers

1923 search results - page 35 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
FORTE
2010
13 years 10 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
SKG
2006
IEEE
14 years 2 months ago
A Semantic-based Meteorology Grid Service Registry, Discovery and Composition Framework
Meteorology Grid Computing aims to provide scientist with seamless, reliable, secure and inexpensive access to meteorological resources. In this paper, we presented a semantic-bas...
Kaijun Ren, Nong Xiao, Junqiang Song, Weimin Zhang...
IEEEARES
2008
IEEE
14 years 2 months ago
Reliability Analysis using Graphical Duration Models
Reliability analysis has become an integral part of system design and operating. This is especially true for systems performing critical tasks such as mass transportation systems....
Roland Donat, Laurent Bouillaut, Patrice Aknin, Ph...
CTRSA
2006
Springer
107views Cryptology» more  CTRSA 2006»
14 years 5 days ago
A Round and Communication Efficient Secure Ranking Protocol
In this work, we initiate the study of realizing a ranking functionality (m1,
Shaoquan Jiang, Guang Gong
DNIS
2005
Springer
112views Database» more  DNIS 2005»
14 years 2 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani