Abstract
We introduce two institutions for the process algebra CsP, one for the traces model, and one for the stable failures model. The construction is generic and should be easily instantiated with further models. As a consequence, we can use structured specification constructs like renaming, hiding and parameterisation (that have been introduced over an arbitrary institution) also for Csp. With a small example we demonstrate that structuring indeed makes sense for CSP. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Mossakowski, T., & Roggenbach, M. (2007). Structured CSP - A process algebra as an institution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4409 LNCS, pp. 92–110). Springer Verlag. https://doi.org/10.1007/978-3-540-71998-4_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
