A process algebra for Interworkings

S. Mauw; M.A. Reniers

A process algebra for Interworkings

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-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 language	English
Title of host publication	Handbook of Process Algebra
Editors	J.A. Bergstra, A. Ponse, S.A. Smolka
Place of Publication	Amsterdam
Publisher	Elsevier
Pages	1269-1327
ISBN (Print)	0-444-82830-3
Publication status	Published - 2001

Cite this

@inbook{e6adfd8e626749d4bfb32b80bba3cbbf,

title = "A process algebra for Interworkings",

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.",

author = "S. Mauw and M.A. Reniers",

year = "2001",

language = "English",

isbn = "0-444-82830-3",

pages = "1269--1327",

editor = "J.A. Bergstra and A. Ponse and S.A. Smolka",

booktitle = "Handbook of Process Algebra",

publisher = "Elsevier",

address = "Netherlands",

}

TY - CHAP

T1 - A process algebra for Interworkings

AU - Mauw, S.

AU - Reniers, M.A.

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

M3 - Chapter

SN - 0-444-82830-3

SP - 1269

EP - 1327

BT - Handbook of Process Algebra

A2 - Bergstra, J.A.

A2 - Ponse, A.

A2 - Smolka, S.A.

PB - Elsevier

CY - Amsterdam

ER -

A process algebra for Interworkings

Abstract

Fingerprint

Cite this