946 search results - page 101 / 190 » Process Algebra and Non-Interference |
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Relays represent a promising approach to extend the cell coverage, combat the strong shadowing effects as well as guarantee the QoS in dense networks. Among the numerous existing ...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
FOSSACS
2006
Springer
14 years 1 months ago
2006
Springer
We prove that the equational theory of the process algebra BCCSP modulo completed simulation equivalence does not have a finite basis. Furthermore, we prove that with a finite alph...
ENTCS
2007
13 years 10 months ago
2007
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 ...