Open ended systems, dynamic bisimulation and tile logic

Abstract The sos formats ensuring that bisimilarity is a congruence of-ten fail in the presence of structural axioms on the algebra of states. Dy-namic bisimulation, introduced to characterize the coarsest congruence for ccs which is also a (weak) bisimulation, reconciles the bisimilarity as congruence property with such axioms and with the specication of open ended systems, where states can be recongured at run-time, at the cost of an innitary operation at the meta-level. We show that the compositional framework oered by tile logic is suitable to deal with structural axioms and open ended systems specications, allowing for a nitary presentation of context closure