Computer Science – Logic in Computer Science
Scientific paper
2011-03-02
LMCS 7 (2:7) 2011
Computer Science
Logic in Computer Science
53 pages, 13 Figures, 2 Tables. Journal version of the work published in the proceedings of CALCO 2009
Scientific paper
10.2168/LMCS-7(2:7)2011
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.
Bonchi Filippo
Montanari Ugo
No associations
LandOfFree
Symbolic and Asynchronous Semantics via Normalized Coalgebras does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Symbolic and Asynchronous Semantics via Normalized Coalgebras, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic and Asynchronous Semantics via Normalized Coalgebras will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-474700