Concurrency semantics based on metric domain equations:

Abstract: "We show how domain equations may be solved in the category of complete metric spaces. For five example languages we demonstrate how to exploit domain equations in the design of their operational and denotational semantics. Two languages are schematic or uniform. Three have interprete...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bakker, Jacobus W. de 1939-2012 (VerfasserIn), Rutten, Jan J. (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1989
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,54
Schlagworte:
Zusammenfassung:Abstract: "We show how domain equations may be solved in the category of complete metric spaces. For five example languages we demonstrate how to exploit domain equations in the design of their operational and denotational semantics. Two languages are schematic or uniform. Three have interpreted elementary actions involving individual variables and inducing state transformations. For the latter group we discuss three denotational models reflecting a variety in the language notions considered. A central theme is the distinction, within the nonuniform setting, of linear time versus branching time models
Throughout, fruitful use is made of the technique of obtaining semantic mappings, operators etc. as fixed points of higher order functions. A brief discussion of the relationship between bisimulation and one of the domains considered concludes the paper.
Beschreibung:26 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!