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

Full description

Saved in:
Bibliographic Details
Main Author: Fokkink, Willem J. 1965- (Author)
Format: Book
Language:English
Published: Amsterdam 1992
Series:Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,31
Subjects:
Summary: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."
Physical Description:21 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!