We generalize the theory of permutations of names to so-called mutations that transform tuples by introducing duplicates and fresh names. The theory of mutations underpins an algorithm for detecting deadlocks (i.e. circular dependencies between resources) in a model defining dependencies – the language for lams. We demonstrate that our algorithm is a decision procedure for so-called linear lams...

In multidatabase systems, autonomous executions of concurrency control schemes at local sites make it diicult to detect global deadlocks. Though time-out schemes are able to detect transactions involved in deadlocks, they may include false deadlocks. It is believed that an approximate wait-for-graph(AWFG) helps reduce the false deadlocks by extending the time-out values for those that appear no...

An algorithm is presented which prevents place/transition systems with nitely many states (boundedness) from running into dead markings. The algorithm determines supplementary places which protect structural deadlocks from becoming insuuciently marked. All steps, the determination of minimal deadlocks, the test whether deadlocks can be emptied, the determination of the supplementary places and ...

Handling deadlocks is essential for providing reliable communication paths between processing nodes in parallel computer systems. The existence of multiple message types and associated intermessage dependencies may cause message-dependent deadlocks in networks that are designed to be free of routing deadlock. Most methods currently used for dealing with messagedependent deadlocks require more s...

Even though transaction deadlocks can severely affect the performance of distributed database systems, many current evaluation techniques ignore this aspect. In [4], Shyu and Li proposed an evaluation method which takes deadlocks into consideration. However, their technique is limited to exclusive locking. In this paper, we extend their technique to allow for both shared and exclusive locking. ...

A Petri net based approach for the modeling of batch plants as well as products is presented. Allocating non-sharable resources for product recipes can lead to deadlocks. In this paper we focus on the detection of potential deadlock situations using a graph structure derived from synchronization issues that arise when moving a batch between resources. It is shown that different graph patterns d...