Abstract. A choreography describes the interaction between services. It may be used for specification purposes, for instance serving as a contract in the design of an interorganizational business process. Typically, not all describable interactions make sense which motivates the study of the realizability problem for a given choreography. In this paper, we show that realizability can be traced back to the problem of controllability which askes whether a service has compatible partner processes. This way of thinking makes algorithms for controllability available for reasoning about realizability. In addition, it suggests alternative definitions for realizability. We discuss several proposals for defining realizability which differ in the degree of coverage of the specified interaction.
Lohmann and Wolf REF show how realizability can be verified by using existing techniques for the controllability problem, which checks whether a service has compatible partner processes.
Realizability is controllability
ZEUS
Materials Science Computer Science Mathematics