@inproceedings{MossakowskiEA03a,
abstract = {CoCASL, a recently developed coalgebraic extension of the algebraic specification language CASL, allows for modelling systems in terms of inductive datatypes as well as of co-inductive process types. Here, we demonstrate how to specify process algebras, namely CCS and CSP, within such an algebraic-coalgebraic framework. It turns out that CoCASL can deal with the fundamental concepts of process algebra in a natural way: The type system of communications, the syntax of processes and their structural operational semantics fit well in the algebraic world of CASL, while the additional coalgebraic constructs of CoCASL cover the various process equivalences (bisimulation, weak bisimulation, observational congruence, and trace equivalence) and provide fully abstract semantic domains. CoCASL hence becomes a meta-framework for studying the
semantics and proof theory of reactive systems.},
added-at = {2016-08-05T15:59:03.000+0200},
author = {Mossakowski, Till and Roggenbach, Markus and Schr{\"o}der, Lutz},
biburl = {https://www.bibsonomy.org/bibtex/28d8298dae4a1a8c1bde87fbdf85bacd7/tillmo},
booktitle = {Coalgebraic Methods in Computer Science},
editor = {Gumm, Hans-Peter},
interhash = {c9037f4db328f71abf4ec05d7b3e803e},
intrahash = {8d8298dae4a1a8c1bde87fbdf85bacd7},
keywords = {CASL CCS CSP CoCASL algebra coalgebra process},
pdfurl = {http://www.informatik.uni-bremen.de/~till/papers/process_algebra.pdf},
psurl = {http://www.informatik.uni-bremen.de/~lschrode/papers/process_algebra.ps},
publisher = {Elsevier Science; http://www.elsevier.nl/},
series = {Electronic Notes in Theoretical Computer Science},
status = {Reviewed},
timestamp = {2016-08-05T15:59:03.000+0200},
title = {{CoCASL} at work --- Modelling Process Algebra},
volume = 82,
year = 2003
}