<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Alexandre Madeira</style></author><author><style face="normal" font="default" size="100%">M. Martins</style></author><author><style face="normal" font="default" size="100%">Luis Soares Barbosa</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">John Derrick</style></author><author><style face="normal" font="default" size="100%">Eerke Boiten</style></author><author><style face="normal" font="default" size="100%">Steve Reeves</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Bisimilarity and refinement for hybrid(ised) logics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings 16th International Refinement Workshop - Refine</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Electronic Proceedings in Theoretical Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/lsb/files/1305.6115.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Turku, Finland</style></pub-location><volume><style face="normal" font="default" size="100%">115</style></volume><pages><style face="normal" font="default" size="100%">84-98</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The complexity of modern software systems entails the need for reconfiguration mechanisms gov-&lt;br /&gt;
erning the dynamic evolution of their execution configurations in response to both external stimulus&lt;br /&gt;
or internal performance measures. Formally, such systems may be represented by transition systems&lt;br /&gt;
whose nodes correspond to the different configurations they may assume. Therefore, each node is en-&lt;br /&gt;
dowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics&lt;br /&gt;
of the services provided in the corresponding configuration.&lt;br /&gt;
Hybrid logics, which add to the modal description of transition structures the ability to refer to&lt;br /&gt;
specific states, offer a generic framework to approach the specification and design of this sort of&lt;br /&gt;
systems. Therefore, the quest for suitable notions of equivalence and refinement between models of&lt;br /&gt;
hybrid logic specifications becomes fundamental to any design discipline adopting this perspective.&lt;br /&gt;
This paper contributes to this effort from a distinctive point of view: instead of focussing on a specific&lt;br /&gt;
hybrid logic, the paper introduces notions of bisimilarity and refinement for hybridised logics, i.e.&lt;br /&gt;
standard specification logics (e.g. propositional, equational, fuzzy, etc) to which modal and hybrid&lt;br /&gt;
features were added in a systematic way.&lt;/p&gt;
</style></abstract></record></records></xml>