Sciweavers

125 search results - page 5 / 25
» Process Algebra with Probabilistic Choice
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
14 years 9 months ago
Anonymity in Probabilistic and Nondeterministic Systems
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
Catuscia Palamidessi
EPEW
2008
Springer
14 years 11 months ago
Assembly Code Analysis Using Stochastic Process Algebra
Currently compilers contain a large number of optimisations which are based on a set of heuristics that are not guaranteed to be effective to improve the performance metrics. In th...
Lamia Djoudi, Leïla Kloul
ENTCS
1998
101views more  ENTCS 1998»
14 years 9 months ago
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes M.Z. Kwiatkowska and G.J. Norman School of Computer Science, University of Birmingham, Edgbaston, ...
Marta Z. Kwiatkowska, Gethin Norman
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 months ago
Notes on Generative Probabilistic Bisimulation
In this notes we consider the model of Generative Probabilistic Transition Systems, and Baier and Hermanns’ notion of weak bisimulation defined over them. We prove that, if we ...
Simone Tini
80
Voted
JLP
2007
99views more  JLP 2007»
14 years 9 months ago
Resources in process algebra
The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Anna Philippou, Oleg Sokolsky