SPEAKER: Lisbeth Fajstrup and Martin Raussen, Department of Mathematical Sciences, Aalborg University
DATE: Friday, 23 April 1999
PLACE and TIME: Room E3-209 at 14:00.
ABSTRACT:
Several people have suggested geometric/topological models to "view" concurrent behaviour. A common feature for those is the structure of a higher-dimensional complex together with a (local) partial order induced by the irreversibility of time. In particular, all relevant execution paths in these models have to respect this partial order.
In this talk, we explain a geometric perspective on the detection of deadlocking states for ``mutual exclusion models'', and moreover on the detection of the associated ``unsafe regions'' which consist of the states that will eventually lead to a deadlocking state. The geometric considerations led to a new algorithm that seems to compare well with known traversing techniques.
If time permits, we shall explain how geometric/topological ideas can be used in the classification of traces/schedules in a distributed system, in particular to serializability, and to an analysis of decision tasks and asynchronous computability.