Weak bisimilarity coalgebraically

Popescu, Andrei (2009) Weak bisimilarity coalgebraically. Algebra and Coalgebra in Computer Science : Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009. Proceedings. In: Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, 7-10 Sep 2009, Udine, Italy. ISBN 9783642037405. ISSN 0302-9743

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (207kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
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
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15381
Notes on copyright: The final publication is available at Springer via https://dx.doi.org/10.1007/978-3-642-03741-2_12
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 15:04
Last Modified: 03 Jun 2019 06:23
URI: https://eprints.mdx.ac.uk/id/eprint/15381

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year