Weak bisimilarity coalgebraically

Conference paper

Popescu, A. 2009. Weak bisimilarity coalgebraically. Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009. Udine, Italy 07 - 10 Sep 2009 Springer. pp. 157-172
TypeConference paper
TitleWeak bisimilarity coalgebraically
AuthorsPopescu, A.
Abstract

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.

Research GroupFoundations of Computing group
ConferenceAlgebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009
Page range157-172
ISSN0302-9743
ISBN
Hardcover9783642037405
PublisherSpringer
Publication dates
Print2009
Publication process dates
Deposited27 Apr 2015
Accepted2009
Output statusPublished
Accepted author manuscript
Copyright Statement

The final publication is available at Springer via https://dx.doi.org/10.1007/978-3-642-03741-2_12

Additional information

Published paper appears as a chapter in: Algebra and Coalgebra in Computer Science,Volume 5728 of the series Lecture Notes in Computer Science, pp 157-172

Web address (URL)https://dx.doi.org/10.1007/978-3-642-03741-2_12
LanguageEnglish
Book titleAlgebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings
Permalink -

https://repository.mdx.ac.uk/item/85215

Log in to edit

Download files

Accepted author manuscript
CALCO2009.pdf

  • 12
    total views
  • 3
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as