Barbed Semantics for Open Reactive Systems

Gadducci, Fabio; Monreale, Giacoma Valentina

doi:10.1007/978-3-642-37635-1_10

Cited by 1 publication

(1 citation statement)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The topic has been tentatively addressed in categorical terms [Klin et al 2005;Gadducci and Monreale 2013], yet the complexity of the machinery is further increased. We do believe that the categorical properties required to hold in these systems can be more easily recast in terms of suitable distributivity laws between the two monoid operators.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

A General Theory of Barbs, Contexts, and Labels

Bonchi

Gadducci

Monreale

2014

ACM Trans. Comput. Logic

Self Cite

View full text Add to dashboard Cite

Barbed bisimilarity is a widely used behavioral equivalence for interactive systems: given a set of predicates (denoted "barbs" and representing basic observations on states) and a set of contexts (representing the possible execution environments), two systems are deemed to be equivalent if they verify the same barbs whenever inserted inside any of the chosen contexts. Despite its flexibility and expressiveness, this definition of equivalence is unsatisfactory because often the quantification is over an infinite set of contexts, thus making barbed bisimilarity very hard to be verified.Should a labeled operational semantics be available, more efficient observational equivalences might be adopted. To this end, a series of techniques has been proposed to derive labeled transition systems (LTSs) from unlabeled ones, the main example being Leifer and Milner's theory of reactive systems. The underlying intuition is that labels should be the "minimal" contexts that allow for a reduction step to be performed.However, minimality is difficult to asses, whereas the set of "intuitively" correct labels is often easily devised by the ingenuity of the researcher. This article introduces a framework that characterizes (weak) barbed bisimilarity via LTSs whose labels are (not necessarily minimal) contexts. Differently from previous proposals, our theory does not depend on the way the labeled transitions are built but instead relies on a simple set-theoretical presentation for identifying those properties such an LTS should verify to (1) capture the barbed bisimilarities of the underlying system and (2) ensure that such bisimilarities are congruences.Furthermore, we adopt suitable proof techniques to make feasible the verification of such properties. To provide a test-bed for our formalism, we instantiate it by addressing the semantics of the Mobile Ambients calculus, recasting its barbed bisimilarities via label-based behavioral equivalences.

show abstract

Section: Conclusion and Further Workmentioning

confidence: 99%