Discrete-time Process Algebra and the Semantics of SDL (1997)
BibTeX
@MISC{Bergstra97discrete-timeprocess,
author = {J.A. Bergstra and C. A. Middelburg and Y. S. Usenko},
title = {Discrete-time Process Algebra and the Semantics of SDL},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present an extension of discrete relative time process algebra where recursion, propositional signals, a counting process creation operator and the state operator are combined. A semantics of ' \Gamma SDL, a small subset of SDL that is closely connected with full SDL, is proposed which describes the meaning of ' \Gamma SDL constructs using this extension of discrete relative time process algebra. This semantics allows for the generation of finitely branching transition systems for ' \Gamma SDL specifications. Jan Bergstra is a Professor of Programming and Software Engineering at the University of Amsterdam and a Professor of Applied Logic at Utrecht University, both in the Netherlands. His research interest is in mathematical aspects of software and system development, in particular in the design of algebras that can contribute to a better understanding of the relevant issues at a conceptual level. He is perhaps best known for his contributions to the field of process algeb...
Keyphrases
discrete-time process algebra gamma sdl discrete relative time process algebra conceptual level relevant issue research interest counting process creation operator full sdl software engineering mathematical aspect propositional signal utrecht university gamma sdl specification jan bergstra transition system state operator system development applied logic small subset process algeb
