Sciweavers

Share
FOSSACS
2006
Springer

Smooth Orchestrators

8 years 11 months ago
Smooth Orchestrators
A smooth orchestrator is a process with several alternative branches, every one defining synchronizations among co-located channels. Smooth orchestrators constitute a basic mechanism that may express standard workflow patterns in Web services as well as common synchronization constructs in programming languages. Smooth orchestrators may be created in one location and migrated to a different one, still not manifesting problems that usually afflict generic mobile agents. We encode an extension of Milner's (asynchronous) pi calculus with join patterns into a calculus of smooth orchestrators and we yield a strong correctness result straction) when the subjects of the join patterns are co-located. We also study the translation of smooth orchestrators into finite-state automata, therefore addressing the implementation of co-location constraints and the case when synchronizations are not linear with respect to subjects.
Cosimo Laneve, Luca Padovani
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where FOSSACS
Authors Cosimo Laneve, Luca Padovani
Comments (0)
books