Formal Aspects of Computing

, Volume 27, Issue 2, pp 375–395

Refinement in hybridised institutions

  • Alexandre Madeira
  • Manuel A. Martins
  • Luís S. Barbosa
  • Rolf Hennicker
Original Article

DOI: 10.1007/s00165-014-0327-6

Cite this article as:
Madeira, A., Martins, M.A., Barbosa, L.S. et al. Form Asp Comp (2015) 27: 375. doi:10.1007/s00165-014-0327-6

Abstract

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 reconfigurable systems, i.e., systems with reconfiguration mechanisms governing the dynamic evolution of their execution configurations in response to both external stimuli or internal performance measures. A formal representation of such systems is through transition structures whose states correspond to the different configurations they may adopt. Therefore, each node is endowed with, for example, an algebra, or a first-order structure, to precisely characterise the semantics of the services provided in the corresponding configuration. This paper characterises equivalence and refinement for these sorts of models in a way which is independent of (or parametric on) whatever logic (propositional, equational, fuzzy, etc) is found appropriate to describe the local configurations. A Hennessy–Milner like theorem is proved for hybridised logics.

Keywords

Hybridisation Bisimulation Refinement 

Copyright information

© British Computer Society 2014

Authors and Affiliations

  • Alexandre Madeira
    • 1
  • Manuel A. Martins
    • 2
  • Luís S. Barbosa
    • 1
  • Rolf Hennicker
    • 3
  1. 1.HASLab INESC TEC and Univ. MinhoBragaPortugal
  2. 2.CIDMA-Center for R&D in Mathematics and Applications, Department of MathematicsUniv. AveiroAveiroPortugal
  3. 3.Ludwig-Maximilians-Universität MünchenMunichGermany

Personalised recommendations