CSP-Casl – A new integration of process algebra and algebraic specification (2003)
| Venue: | Theoretical Computer Science |
| Citations: | 26 - 14 self |
BibTeX
@ARTICLE{Roggenbach03csp-casl–,
author = {Markus Roggenbach},
title = {CSP-Casl – A new integration of process algebra and algebraic specification},
journal = {Theoretical Computer Science},
year = {2003},
volume = {354},
pages = {2006}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Csp-Casl is a combination of the process algebra Csp [11,22] and the algebraic specification language Casl [7,1]. Its novel aspects include the combination of denotational semantics in the process part and, in particular, loose semantics for the data types covering both concepts partiality and sub-sorting. Technically, this integration involves the development of a new co-called data-logic formulated as an institution. This data-logic serves as a link between the institution underlying Casl and the alphabet of communications necessary for the Csp semantics. Besides being generic in the various denotational Csp semantics, this construction leads also to an appropriate notion of refinement with clear relations to both data refinement in Casl and process refinement in Csp. Key words: Algebraic specification; institution; process algebra; CASL, CSP. 1
