The SOS formats that ensure that bisimilarity is a congruence fail in the presence of structural axioms on states. Dynamic bisimulation, introduced to characterize the coarsest congruence for CCS which is also a weak bisimulation, reconciles the 'bisimilarity is a congruence' property with structural axioms and also with the specification of open ended systems, where states can be reconfigured at runtime. We show that the compositional framework offered by tile logic handles structural axioms and specifications of reconfigurable systems successfully. This allows for a finitary presentation of dynamic context closure, as internalized in the tile language. The case study of the π-calculus illustrates the main features of our approach. Moreover, duality is exploited to model a second kind of reconfiguration: dynamic specialization. © 2005 Elsevier B.V. All rights reserved.
Bruni, R., Montanari, U., & Sassone, V. (2005). Observational congruences for dynamically reconfigurable tile systems. In Theoretical Computer Science (Vol. 335, pp. 331–372). https://doi.org/10.1016/j.tcs.2004.10.044