@inproceedings{MossakowskiRoggenbach07,
  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.
},
  added-at = {2016-08-05T15:59:03.000+0200},
  author = {Mossakowski, Till and Roggenbach, Markus},
  biburl = {https://www.bibsonomy.org/bibtex/2249c8dcabc0a8114879eeb3d12d54b15/tillmo},
  booktitle = {WADT 2006},
  editor = {Fiadeiro, J.},
  interhash = {f8547b5770db22243f279e6ee1a4730e},
  intrahash = {249c8dcabc0a8114879eeb3d12d54b15},
  keywords = {CSP institution structuring},
  pages = {92-110},
  pdfurl = {http://www.informatik.uni-bremen.de/~till/papers/csp.pdf},
  psurl = {http://www.informatik.uni-bremen.de/~till/papers/csp.ps},
  publisher = {Springer-Verlag Heidelberg},
  series = {Lecture Notes in Computer Science},
  status = {Reviewed},
  timestamp = {2016-08-05T15:59:03.000+0200},
  title = {Structured CSP --  A Process Algebra as an Institution},
  volume = 4409,
  year = 2007
}