Bisimilarity and refinement for hybrid(ised) logics

Citation:
Madeira A, Martins M, Barbosa LS.  2013.  Bisimilarity and refinement for hybrid(ised) logics. Proceedings 16th International Refinement Workshop - Refine. 115:84-98.

Tertiary Title:

Electronic Proceedings in Theoretical Computer Science

Date Presented:

June

Abstract:

The complexity of modern software systems entails the need for reconfiguration mechanisms gov-
erning the dynamic evolution of their execution configurations in response to both external stimulus
or internal performance measures. Formally, such systems may be represented by transition systems
whose nodes correspond to the different configurations they may assume. Therefore, each node is en-
dowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics
of the services provided in the corresponding configuration.
Hybrid logics, which add to the modal description of transition structures the ability to refer to
specific states, offer a generic framework to approach the specification and design of this sort of
systems. Therefore, the quest for suitable notions of equivalence and refinement between models of
hybrid logic specifications becomes fundamental to any design discipline adopting this perspective.
This paper contributes to this effort from a distinctive point of view: instead of focussing on a specific
hybrid logic, the paper introduces notions of bisimilarity and refinement for hybridised logics, i.e.
standard specification logics (e.g. propositional, equational, fuzzy, etc) to which modal and hybrid
features were added in a systematic way.

Citation Key:

MMB13-refine

DOI:

10.4204/EPTCS.115.6

PreviewAttachmentSize
1305.6115.pdf368.27 KB