Sciweavers

2171 search results - page 102 / 435
» A Generic Process Algebra
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp
AMAST
1998
Springer
15 years 10 months ago
Scheduling Algebra
The goal of this paper is to develop an algebraic theory of process scheduling. We specify a syntax for denoting processes composed of actions with given durations. Subsequently, w...
Rob J. van Glabbeek, Peter Rittgen
ENTCS
2008
121views more  ENTCS 2008»
15 years 6 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
IJNSEC
2008
147views more  IJNSEC 2008»
15 years 6 months ago
Constructing Efficient Certificateless Public Key Encryption with Pairing
Certificateless public key cryptography was introduced to overcome the key escrow limitation of the identity-based cryptography. Recently, Yum1 and Lee have proposed a generic ser...
Yijuan Shi, Jianhua Li, Jianjun Shi
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
15 years 11 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...