| Publication type: |
Article in Proceedings |
| Author: |
Till Mossakowski, Markus Roggenbach, Lutz Schröder |
| Editor: |
Hans-Peter Gumm |
| Title: |
CoCASL at work --- Modelling Process Algebra |
| Book / Collection title: |
Coalgebraic Methods in Computer Science |
| Volume: |
82 |
| Series: |
Electronic Notes in Theoretical Computer Science |
| Year published: |
2003 |
| Publisher: |
Elsevier Science |
| 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. |
| PDF Version: |
http://www.informatik.uni-bremen.de/~till/papers/process_algebra.pdf |
| PostScript Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/process_algebra.ps |
| Keywords: |
CASL CoCASL CSP CCS process algebra coalgebra |
| Status: |
Reviewed |
| Last updated: |
15. 06. 2004 |
