some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

   Volume 1 (2005)

   Volume 2 (2006)

   Volume 3 (2007)

   Volume 4 (2008)

   Volume 5 (2009)

   Volume 6 (2010)

   Volume 7 (2011)

      Issue 1

      Issue 2

      Issue 3

      Issue 4

   Volume 8 (2012)

   Volume 9 (2013)

   Volume 10 (2014)

   Volume 11 (2015)

   Volume 12 (2016)

   Volume 13 (2017)

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

VOLUME 7, ISSUE 2, PAPER 7


Symbolic and Asynchronous Semantics via Normalized Coalgebras

©Filippo Bonchi, CNRS - ENS, Lyon
©Ugo Montanari, Dipartimento di informatica, Pisa

Abstract
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since the behaviour of interactive systems is for many reasons infinite, symbolic semantics were introduced as a mean to define smaller, possibly finite, transition systems, by employing symbolic actions and avoiding some sources of infiniteness. Unfortunately, symbolic bisimilarity has a different shape with respect to ordinary bisimilarity, and thus the standard coalgebraic characterization does not work. In this paper, we introduce its coalgebraic models. We will use as motivating examples two asynchronous formalisms: open Petri nets and asynchronous pi-calculus. Indeed, as we have shown in a previous paper, asynchronous bisimilarity can be seen as an instance of symbolic bisimilarity.

Publication date: May 16, 2011

Supplementary Files:
2010-10-22Talk at CALCO: Coalgebraic Symbolic SemanticsTalk of the author of the paper at CALCO09

Full Text: PDF | PostScript
DOI: 10.2168/LMCS-7(2:7)2011

Hit Counts: 8302

Creative Commons