Computer Science – Logic in Computer Science
Scientific paper
2010-02-15
EPTCS 18, 2010, pp. 46-61
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.18.4
Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those computational formalisms whose operational semantics is provided by reduction rules. RSs proved a flexible specification device, yet so far most of the efforts dealing with their behavioural semantics focused on idem pushouts (IPOs) and saturated (also known as dynamic) bisimulations. In this paper we introduce a novel, intermediate behavioural equivalence: L-bisimilarity, which is able to recast both its IPO and saturated counterparts. The equivalence is parametric with respect to a set L of RSs labels, and it is shown that under mild conditions on L it is indeed a congruence. Furthermore, L-bisimilarity can also recast the notion of barbed semantics for RSs, proposed by the same authors in a previous paper. In order to provide a suitable test-bed, we instantiate our proposal by addressing the semantics of (asynchronous) CCS and of the calculus of mobile ambients.
Bonchi Filippo
Gadducci Fabio
Monreale Giacoma Valentina
No associations
LandOfFree
On Barbs and Labels in Reactive Systems 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 On Barbs and Labels in Reactive Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Barbs and Labels in Reactive Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-146077