Sciweavers

276 search results - page 23 / 56
» Bisimulation for quantum processes
Sort
View
FOSSACS
2004
Springer
14 years 2 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
ISAAC
2005
Springer
78views Algorithms» more  ISAAC 2005»
14 years 2 months ago
The Phase Matrix
Reducing the error of quantum algorithms is often achieved by applying a primitive called amplitude amplification. Its use leads in many instances to quantum algorithms that are q...
Peter Høyer
ICCS
2004
Springer
14 years 2 months ago
Applying Grid Computing to the Parameter Sweep of a Group Difference Pseudopotential
Theoretical modeling of chemical and biological processes is a key to understand nature and to predict experiments. Unfortunately, this is very data and computation extensive. Howe...
Wibke Sudholt, Kim Baldridge, David Abramson, Coli...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta
JLP
2007
74views more  JLP 2007»
13 years 9 months ago
Linearity and bisimulation
Exploiting linear type structure, we introduce a new theory bisimilarity for the π-calculus in which we abstract away not only τ-actions but also non-τ actions which do not aff...
Nobuko Yoshida, Kohei Honda, Martin Berger