Infinitely running concurrent processes with loops from a geometric viewpoint
Lisbeth Fajstrup, Stefan Sokołowski · Electronic Notes in Theoretical Computer Science · 2000
This report gives a formal topological semantics to inductively defined concurrent systems and investigates the properties of such systems. We allow loops and infinitely running computations, which is new in the topological investigations of concurrency. In this more general setting, we prove the equivalent to the result from [2] that deadlocks and unsafe points can be found using a finite number of deloopings.