Recovering resources in the pi-calculus

Although limits of resources such as memory or disk usage

are one of the key problems of many communicating applications, most

process algebras fail to take this aspect of mobile and concurrent systems

into account. In order to study this problem, we introduce the Controlled

pi-calculus, an extension of the pi-calculus with a notion of recovery of

unused resources with an explicit (parametrized) garbage-collection and

dead-process elimination. We discuss the definition of garbage-collection

and dead-process elimination for concurrent, communicating applications,

and provide a type-based technique for statically proving resource

bounds. Selected examples are presented and show the potential of the

Controlled pi-calculus.

## Recent comments

1 hour 13 min ago

6 hours 12 min ago

6 hours 23 min ago

8 hours 28 min ago

15 hours 19 min ago

16 hours 51 min ago

19 hours 55 min ago

20 hours 9 min ago

20 hours 27 min ago

21 hours 11 min ago