Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
Abstract Processes in Orchestration Languages @INPROCEEDINGS{BM:APOL, title = {{Abstract Processes in Orchestration Languages}}, author = {{Maria Grazia} {Buscemi} and {Hern\'an} {Melgratti}}, booktitle = {Proceedings of the 18th European Symposium on Programming }, editor = {Giuseppe Castagna}, pages = {301-315}, abstract = {Orchestration languages are tailored to the executable description
of composite services: when composition spawns over different organisations, any participant in a business interaction is modeled by
an orchestrator, usually referred to as a concrete process, and the
whole composition consists on a set of communicating concrete
processes. Since orchestrators are descriptions at implementation
level and may contain sensible information that should be kept private
to each party, orchestration come equipped with the notion of
abstract processes, which enable the interaction of parties while
hiding private information. More in detail, abstract processes allow
for the specification of the behavior of a party just in terms of the
messages it exchanges with a set of partners. An interesting question
is whether an abstract process is a suitable protocol describing
the behavior of a concrete process, and vice versa. In this paper we
study two alternative characterisations of such a notion: one in term
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, i.e, the correct
interaction of two orchestrators.}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, volume = {5502}, year = {2009}, url = {http://rap.dsi.unifi.it/sensoriasite/55020301.pdf}, keywords = { Date Flow Analysis}, partner = {PISA}, school = {University of Pisa}, status = {public}, task = {T5.1, T5.2}, }
|