Recovering Resources in the π-Calculus (DRAFT)
David Teller · Kluwer Academic Publishers eBooks · 2006
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 gp-calculus , an extension of the gp-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 poten tial of the Controlled gp-calculus These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.