Sciweavers

224 search results - page 29 / 45
» A parallel repetition theorem
Sort
View
PODC
2009
ACM
14 years 8 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling
IPPS
2008
IEEE
14 years 2 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
14 years 1 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
ICPPW
2003
IEEE
14 years 28 days ago
Constructing Nondominated Local Coteries for Distributed Resource Allocation
The resource allocation problem is a fundamental problem in distributed systems. In this paper, we focus on constructing nondominated (ND) local coteries to solve the problem. Dis...
Jehn-Ruey Jiang, Cheng-Sheng Chou, Shing-Tsaan Hua...
CONCUR
2000
Springer
14 years 9 hour ago
Typed Mobile Objects
We describe a general model for embedding object-oriented constructs into calculi of mobile agents. The model results from extending agents with methods and primitives for message ...
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa