@incollection{eprints118,
            note = {The final publication is available at www.springerlink.com.},
          series = {Lecture Notes in Computer Science},
          author = {Maria Grazia Buscemi and Hern{\'a}n C. Melgratti},
           pages = {301--315},
          volume = {5502},
          editor = {Giuseppe Castagna},
       booktitle = {Proceedings of the 18th European Symposium on Programming (ESOP?09)},
           title = {Abstract Processes in Orchestration Languages},
       publisher = {Springer},
            year = {2009},
        abstract = {Orchestrators are descriptions at implementation level and may contain sensitive information that should be kept private. Consequently, orchestration languages come equipped with a notion of abstract processes, which enable the interaction among parties while hiding private information. An interesting question is whether an abstract process accurately describes the behavior of a concrete process so to ensure that some particular property is preserved when composing services. In this paper we focus on compliance, i.e, the correct interaction of two orchestrators and we introduce two definitions of abstraction: one in terms of traces, called trace-based abstraction, and the other as a generalization of symbolic bisimulation, called simulation-based abstraction. We show that simulation-based abstraction is strictly more refined than trace-based abstraction and that simulation-based abstraction behaves well with respect to compliance. },
             url = {http://eprints.imtlucca.it/118/}
}