@inproceedings{LanevePadovani06,
  volume = {3921},
  author = {Cosimo Laneve and Luca Padovani},
  series = {LNCS},
  booktitle = {Proceedings of International Conference on Foundations of
               Software Science and Computation Structures (FoSSaCS'06)},
  url = {http://www.di.unito.it/~padovani/Papers/lncs_3921.pdf},
  abstract = { 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
              (full abstraction) 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. },
  title = {{Smooth Orchestrators}},
  publisher = {Springer},
  year = {2006},
  pages = {32-46},
  doi = {10.1007/11690634\_3},
}

This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)