High availability is becoming an essential part of network services because even a little downtime may lead to a great loss of money. According to previous research, network failure is one of the major causes of system unavailability. In this paper, we propose a framework called HANet for building highly available network services. The main goal of HANet is to allow a server to continue providi...

We address the following decision problem. Given a numeration system U and U-recognizable set [Formula: see text], i.e. of its greedy U-representations is recognized by finite automaton, decide whether or not X ultimately periodic. prove that this problem decidable for large class systems built on linear recurrence sequences. Based arithmetical considerations about equation p-adic methods, DFA ...

The aim of this paper is to study the power of parallel multisetrewriting systems with permitting context (or P systems with non-cooperative rules with promoters). The main result obtained is that if we use promoters of weight two, then the system is universal. Moreover, the construction satisfies a special property we define: it is ultimately confluent. This means that if the system allows at ...