Sciweavers

132 search results - page 15 / 27
» Process Equivalences as Global Bisimulations
Sort
View
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
LICS
1992
IEEE
13 years 12 months ago
Equivalences on Observable Processes
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
Irek Ulidowski
IANDC
2008
84views more  IANDC 2008»
13 years 8 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
FOSSACS
2005
Springer
14 years 1 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
CSFW
2002
IEEE
14 years 24 days ago
Information Flow Security in Dynamic Contexts
We study a security property for processes in dynamic contexts, i.e., contexts that can be reconfigured at runtime. The security property that we propose in this paper, named Per...
Riccardo Focardi, Sabina Rossi