Buscemi, Maria Grazia and Melgratti, Hernán C. Abstract Processes in Orchestration Languages. In: Proceedings of the 18th European Symposium on Programming (ESOP’09). Lecture Notes in Computer Science, 5502 . Springer, pp. 301-315. ISBN 978-3-642-00589-3 (2009)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Additional Information:||The final publication is available at www.springerlink.com.|
|Funders:||Research supported by the EU FET-GC2 IST-2004-16004 Integrated Project Sensoria.|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 29 not found.|
|Date Deposited:||02 Mar 2011 11:04|
|Last Modified:||11 Jul 2011 14:33|
Actions (login required)