A process algebra for Interworkings

S. Mauw, M.A. Reniers

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

1 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationHandbook of Process Algebra
EditorsJ.A. Bergstra, A. Ponse, S.A. Smolka
Place of PublicationAmsterdam
PublisherElsevier
Pages1269-1327
ISBN (Print)0-444-82830-3
Publication statusPublished - 2001

Fingerprint Dive into the research topics of 'A process algebra for Interworkings'. Together they form a unique fingerprint.

Cite this