A graphical form of the mutual exclusion problem is considered in which each vertex represents a process and each edge represents a mutual exclusion constraint between the critical sections of the processes associated with its endpoints. An edge semaphore solution for mutual exclusion problems is defined, and those graphs which are edge solvable are characterized in terms of both a forbidden su...

In [4], Freuder defines several types of interchangeability to capture the equivalence among the values of a variable in a discrete constraint satisfaction problem (CSP), and provides a procedure for computing one type of local interchangeability. In this paper, we first extend this procedure for computing a weak form of local interchangeability. Second, we show that the modified procedure can ...

Symmetry in constraints has always been important but in recent years has become a major research area in its own right. A key problem in constraint programming has long been recognised: search can revisit equivalent states over and over again. In principle this problem has been solved, with a number of different techniques. As we write, research remains very active for two reasons. First, ther...

The classical partition of the event set into controllable and uncontrollable events from supervisory control theory is replaced by introducing the concept of control and observation cost of an event. This leads naturally to consider an optimal control problem for a given logical control specification. On the other hand, if we consider a timed model a performance optimization may be considered ...

Many existing token-based, distributed mutual exclusion algorithms can be generalized by a single algorithm. The number of messages required to provide mutual exclusion is dependent upon the logical topology imposed on the nodes and the policy used to forward requests. This paper extends the generalized algorithm to support prioritized requests and presents models that can be used to analyze th...

We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model the problem of finding supports as a constraint satisfaction problem in which arc-consistency is maintained. Contrary to other works on the similar topic, we do not model the whole planning problem as a CSP but only a s...

In this paper, we present a quorum based algorithm for (m,h, k)-resource allocation problem, i.e., a conflict resolution problem to control a distributed system consisting of n users and m critical resources so that the following two requirements are satisfied: at any given time, at most h (out of m) resources can be utilized by some users simultaneously and each resource is utilized by at most...