Sciweavers

942 search results - page 80 / 189
» Process Algebraic Non-product-forms
Sort
View
CSFW
2002
IEEE
14 years 3 months ago
Quantifying Information Flow
We extend definitions of information flow so as to quantify the amount of information passed; in other words, we give a formal definition of the capacity of covert channels. Ou...
Gavin Lowe
ECAI
2000
Springer
14 years 2 months ago
Diagnosis and Diagnosability Analysis Using PEPA
In this paper we propose the use of process algebras as powerful frameworks for model-based diagnosis. In fact, they provide machinery and tools for building component-oriented mod...
Luca Console, Claudia Picardi, Marina Ribaudo
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
14 years 4 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
ICDT
1995
ACM
96views Database» more  ICDT 1995»
14 years 1 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers
Recently proposed algebraic attacks [2, 6] and fast algebraic attacks [1, 5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exp...
Philip Hawkes, Gregory G. Rose