The Interworking language (lW) is a graphical formalism for displaying the communication behaviour of system components. In this chapter, we develop a format semantics for the Interworking language. This semantics must support the analysis of (collections of) Interworking diagrams and allow to express the relation between diagrams. We will explain how techniques from process algebra can be successfully applied to this problem. Thereto, we introduce process operators for expressing the relationship between Interworking diagrams. We define a number of process algebras with increasing complexity. For each of these we prove completeness with respect to an operational semantics.
|Title of host publication||Handbook of Process Algebra|
|Editors||J.A. Bergstra, A. Ponse, S.A. Smolka|
|Place of Publication||Amsterdam|
|Publication status||Published - 2001|