This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
Today, most cooperative systems support primarily either asynchronous or synchronous (real time) cooperative work. We feel that both synchronous and asynchronous cooperation are e...
This paper gives a new definition of Security, which takes causal information into account. The new definition can be used to determine the security of nondeterministic concurrent...
Just as the order defined by generality over concepts allows concept induction to be performed without generalisation/specialisation operators, so too the order defined by set inc...