Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finite set nbh of other processes are not in their critical sections. For each execution of CS, the set nbh can be given by the environment. We present a starvation free solution of this problem in a setting with infinitel...

Mutual exclusion is a fundamental problem in distributed computing. In one well known variant of this problem, which we call priority mutual exclusion, processes have priorities and the requirement is that, whenever the critical section becomes vacant, the next occupant should be the process that has the highest priority among the waiting processes. Instead of first capturing this vague, but in...

The impact of verification technologies would be much greater if they could not only verify existing information systems, but also synthesize or discover new ones. In our previous study, we tried to discover new algorithms that satisfy a given specification, by first defining a space of algorithms, and then checking each algorithm in the space against the specification, using an automatic verif...

A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate. The mutual exclusion problem is fundamental in distributed computing, since it allows processors competing to access a shared resource to be able to synchronize and get exclusive access to the resource (i.e. execute their critical section). It is...

We consider the time complexity of shared-memory mutual exclusion algorithms based on reads, writes, and comparison primitives under the remotememory-reference (RMR) time measure. For asynchronous systems, a lower bound of Ω(log N/ log log N) RMRs per critical-section entry has been established in previous work, where N is the number of processes. In this paper, we show that lower RMR time comp...

In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of such criteria as the number of message exchanges and the response time. Our results indicate that the Star algorithm [2] achieves the shortest response time in most cases among all the algorithms on a small to medium siz...

We propose a concurrent semantics for concurrent constraint (cc) programs. A contextual net, that is a net with context conditions, besides pre-and post-conditions, is associated to each cc program. Context conditions are items which have to be present in order for an event to take place, but which are not aaected by the event. They are very useful for describing situations where diierent event...

We propose a generalized oscillator algebra at roots of unity with generalized exclusion and investigate the braided Hopf structure. We find that there are two solutions one of which is the generalized exclusion of the bosonic type and the other is the generalized exclusion of the fermionic type. We also discuss the covariance properties of these oscillators.

The mutual exclusion and concurrency are among the fundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a shared resource among a set of processes. The concurrency allows some processes to share a resource. The group mutual exclusion (GME) problem [1] deals with both mutual exclusion and concurrency. The GME solution allows n processes to share m mutu...