Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A calculus of mobile processes, II
Information and Computation
Regular types for active objects
OOPSLA '93 Proceedings of the eighth annual conference on Object-oriented programming systems, languages, and applications
Protocol specifications and component adaptors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Compatibility and inheritance in software architectures
Science of Computer Programming
IEEE Transactions on Software Engineering
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Behavioral Subtyping Relations for Active Objects
Formal Methods in System Design
Goal-Oriented Requirements Engineering: A Guided Tour
RE '01 Proceedings of the Fifth IEEE International Symposium on Requirements Engineering
Subtyping for session types in the pi calculus
Acta Informatica
Typing the Behavior of Software Components using Session Types
Fundamenta Informaticae
Modal I/O automata for interface and product line theories
ESOP'07 Proceedings of the 16th European conference on Programming
Web Services: Concepts, Architectures and Applications
Web Services: Concepts, Architectures and Applications
Behavior based service composition
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
| Hi-index | 0.00 |
One fundamental issue in service-oriented computing concerns the question whether services can be composed in a manner that allows them to achieve their individual goals. In this paper we use a variant of interface automata as an abstraction of the input/output behaviour of services, which are themselves represented as terms in the π-calculus extended with an action for expressing service collaboration. In this setting, the question whether two or more services can meaningfully compose is then reduced to checking a simple property of the product automaton of the involved interfaces.