31 search results - page 2 / 7 » Probabilistic Information Flow in a Process Algebra |
CSFW
1996
IEEE
13 years 9 months ago
1996
IEEE
In this paper we compare two information flow security properties: the lazy security (L-Sec) [11] and the Bisimulation Non-deducibility on Compositions (BNDC) [4]. To make this we...
ERSHOV
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
CAISE
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Flexibility and automatic learning are key aspects to support users in dynamic business environments such as value chains across SMEs or when organizing a large event. Pr...
TCS
2010
13 years 8 hour ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...