A Graphical Approach to Progress for Structured Communication in Web Services

Marco Carbone
(IT University of Copenhagen)
Søren Debois
(IT University of Copenhagen)

We investigate a graphical representation of session invocation interdependency in order to prove progress for the pi-calculus with sessions under the usual session typing discipline. We show that those processes whose associated dependency graph is acyclic can be brought to reduce. We call such processes transparent processes. Additionally, we prove that for well-typed processes where services contain no free names, such acyclicity is preserved by the reduction semantics.

Our results encompass programs (processes containing neither free nor restricted session channels) and higher-order sessions (delegation). Furthermore, we give examples suggesting that transparent processes constitute a large enough class of processes with progress to have applications in modern session-based programming languages for web services.

In Simon Bliudze, Roberto Bruni, Davide Grohmann and Alexandra Silva: Proceedings Third Interaction and Concurrency Experience Guaranteed Interaction (ICE 2010), Amsterdam, The Netherlands, 10th of June 2010, Electronic Proceedings in Theoretical Computer Science 38, pp. 13–27.
Published: 26th October 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.38.4 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org