MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A symbolic semantics for the &pgr;-calculus
Information and Computation
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Interface Theories for Component-Based Design
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Subtyping for session types in the pi calculus
Acta Informatica
Operating Guidelines - an Automata-Theoretic Foundation for the Service-Oriented Architecture
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR '07 Proceedings of the 18th international conference on Concurrency Theory
The Pairing of Contracts and Session Types
Concurrency, Graphs and Models
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
Session types for object-oriented languages
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
| Hi-index | 0.00 |
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.