Process algebra with signals and conditions:

Abstract: "Several new operators are introduced on top of the algebra of communicating processes (ACP) from [BK 84] in order to incorporate stable signals in process algebra. Semantically this involves assigning labels to nodes of process graphs in addition to the actions that serve as labels o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Baeten, Josephus C. M. (VerfasserIn), Bergstra, Jan A. 1951- (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1991
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,3
Schlagworte:
Zusammenfassung:Abstract: "Several new operators are introduced on top of the algebra of communicating processes (ACP) from [BK 84] in order to incorporate stable signals in process algebra. Semantically this involves assigning labels to nodes of process graphs in addition to the actions that serve as labels of edges. The labels of nodes are called signals. In combination with the operators of BPA, two signal insertion operators allow to describe each finite tree labeled with actions and signals. In the context of parallel processes there is a new feature connected with signals: the signal observation mechanism
This mechanism is organised on basis of a signal observation function in very much the same way as the communication mechanism of ACP is organised around a communication function. Also, we discuss conditionals on signals and processes, and make much use of them in our examples.
Beschreibung:42 S.