Regular processes with relative time and silent steps:

Abstract: "In this paper recursion is added to real-time process algebra. An elimination theorem and a completeness result are proven for regular processes, where the time domain is restricted to the rational numbers. Finally, the alphabet is extended with the silent step [tau] and completeness...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Fokkink, Willem J. 1965- (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Amsterdam 1992
Schriftenreihe:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,31
Schlagworte:
Zusammenfassung:Abstract: "In this paper recursion is added to real-time process algebra. An elimination theorem and a completeness result are proven for regular processes, where the time domain is restricted to the rational numbers. Finally, the alphabet is extended with the silent step [tau] and completeness is deduced for regular processes w.r.t. rooted branching bisimulation."
Beschreibung:21 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!