Sciweavers

729 search results - page 14 / 146
» Communicating Evolving Algebras
Sort
View
ENTCS
2007
97views more  ENTCS 2007»
13 years 8 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
DMSN
2005
ACM
13 years 10 months ago
Timely data delivery in sensor networks using whirlpool
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical mo...
Divyasheel Sharma, Vladimir Zadorozhny, Panos K. C...
CRYPTO
2004
Springer
123views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
Asymptotically Optimal Communication for Torus-Based Cryptography
Abstract. We introduce a compact and efficient representation of elements of the algebraic torus. This allows us to design a new discretelog based public-key system achieving the o...
Marten van Dijk, David P. Woodruff
ENTCS
2002
101views more  ENTCS 2002»
13 years 8 months ago
A categorical framework for typing CCS-style process communication
Category theory has proved a useful tool in the study of type systems for sequential programming languages. Various approaches have been proposed to use categorical models to exam...
Ralf Schweimeier
CONCUR
1993
Springer
14 years 21 days ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers