Deriving bisimulation congruences for conditional reactive systems

Abstract

We consider conditional reactive systems, a general abstract framework for rewriting, in which reactive systems à la Leifer and Milner are enriched with (nested) application conditions. We study the problem of deriving labelled transitions and bisimulation congruences from a reduction semantics. That is, we synthesize interactions with the environment in order to obtain a compositional semantics. Compared to earlier work we not only address the problem of deriving information about the (minimal) context needed to obtain a full left-hand side and thus be able to perform a reduction, but also generate conditions on the remaining context. © 2012 Springer-Verlag Berlin Heidelberg.