Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...

Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...

Within the Input/Output Automata framework, we state and prove a general abstraction theorem giving conditions for preservation of safety properties from one automaton to another. We use our abstraction theorem to verify that Burns distributed mutual exclusion algorithm parameterized in the number of processes n satisses the mutual exclusion property. The concrete n-process algorithm is abstrac...

In the last ten years a lot of research has been done on resource allocation in Ad-hoc networks. The Classical approaches of mutual exclusion and its variants need to be modified to suit the dynamic topology, low bandwidth and low processing capabilities of mobile ad-hoc network (MANET).The distributed mutual exclusion in MANETs is comparatively less explored area of research. In this paper, we...

In this work a mutual exclusion algorithm is mod-eled using Transition Assertions. The main feature of a mutual exclusion algorithm is to prevent simultaneous access of a shared resource by two or more systems. The speciication of the algorithm is a collection of transition assertions with each transition assertion containing a precondition and postcondition. The Transition Assertions model is ...

Mutual exclusion is a very common requirement in parallel systems. Yet its modeling is a tedious task in UML state machines, one of the most popular languages for behavior modeling. We present HiLA, an aspect-oriented extension of UML state machines, to address this problem. In HiLA, mutual exclusion can be modeled in a highly modular and declarative way. That is, the logic of mutual exclusion ...

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...