Weak Bisimilarity Coalgebraically
- Cite this paper as:
- Popescu A. (2009) Weak Bisimilarity Coalgebraically. In: Kurz A., Lenisa M., Tarlecki A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg
We argue that weak bisimilarity of processes can be conveniently captured in a semantic domain by a combination of traces and coalgebraic finality, in such a way that important process algebra aspects such as parallel composition and recursion can be represented compositionally. We illustrate the usefulness of our approach by providing a fully-abstract denotational semantics for CCS under weak bisimilarity.
Unable to display preview. Download preview PDF.