Sciweavers

359 search results - page 12 / 72
» Modeling Consensus in a Process Calculus
Sort
View
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 10 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ZUM
1998
Springer
111views Formal Methods» more  ZUM 1998»
14 years 2 months ago
Combining Specification Techniques for Processes, Data and Time
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
Ernst-Rüdiger Olderog
SFM
2009
Springer
14 years 4 months ago
Quantitative Analysis of Web Services Using SRMC
In this tutorial paper we present quantitative methods for analysing Web Services with the goal of understanding how they will perform under increased demand, or when asked to serv...
Allan Clark, Stephen Gilmore, Mirco Tribastone
ENTCS
2008
99views more  ENTCS 2008»
13 years 10 months ago
A Categorical Model of the Fusion Calculus
We provide a categorical presentation of the Fusion calculus. Working in a suitable category of presheaves, we describe the syntax as initial algebra of a signature endofunctor, a...
Marino Miculan
PDSE
2000
91views more  PDSE 2000»
13 years 11 months ago
A Formalism for Hierarchical Mobile Agents
This paper presents a theoretical and practical framework for constructing and reasoning about mobile agents. The framework is formulated as a process calculus and has two contrib...
Ichiro Satoh