Hybridization of Institutions

  • Manuel A. Martins
  • Alexandre Madeira
  • Răzvan Diaconescu
  • Luís S. Barbosa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6859)


Modal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new results and techniques as well as applications to software specification.

In this context, the first contribution of this paper is an attempt to ‘universalize’ the hybridization idea. Following the lines of [15], where a method to modalize arbitrary institutions is presented, the paper introduces a method to hybridize logics at the same institution-independent level. The method extends arbitrary institutions with Kripke semantics (for multi-modalities with arbitrary arities) and hybrid features. This paves the ground for a general result: any encoding (expressed as comorphism) from an arbitrary institution to first order logic (\(\mathcal{FOL}\)) determines a comorphism from its hybridization to \(\mathcal{FOL}\). This second contribution opens the possibility of effective tool support to specification languages based upon logics with hybrid features.


Institution theory hybrid logic formal specification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Areces, C., Blackburn, P., Delany, S.R.: Bringing them all together. Journal of Logic and Computation 11, 657–669 (2001)zbMATHCrossRefGoogle Scholar
  2. 2.
    Blackburn, P.: Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic Journal of IGPL 8(3), 339–365 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Borzyszkowski, T.: Logical systems for structured specifications. Theoretical Computer Science 286(2), 197–245 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Braüner, T.: Natural deduction for first-order hybrid logic. Journal of Logic, Language and Information 14, 173 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Braüner, T.: Hybrid Logic and its Proof-Theory. Applied Logic Series, vol. 37. Springer, Heidelberg (2011)zbMATHCrossRefGoogle Scholar
  6. 6.
    Braüner, T., de Paiva, V.: Intuitionistic hybrid logic. J. Applied Logic 4(3), 231–255 (2006)zbMATHCrossRefGoogle Scholar
  7. 7.
    Burstall, R., Goguen, J.: The semantics of Clear, a specification language. In: Bjorner, D. (ed.) 1979 Copenhagen Winter School on Abstract Software Specification. LNCS, vol. 86, pp. 292–332. Springer, Heidelberg (1980)Google Scholar
  8. 8.
    Cengarle, M.V.: The temporal logic institution. Technical report, Universitat Munchen, Insitut fur informatik (1998)Google Scholar
  9. 9.
    Chadha, R., Macedonio, D., Sassone, V.: A hybrid intuitionistic logic: Semantics and decidability. Journal of Logic and Computation 16, 2006 (2005)MathSciNetGoogle Scholar
  10. 10.
    Codescu, M., Găină, D.: Birkhoff completeness in institutions. Logica Universalis 2(2), 277–309 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Demri, S., Lazic, R., Nowak, D.: On the freeze quantifier in constraint ltl: decidability and complexity. Technical Report LSV-05-03, Laboratoire Specification et Verification (2005)Google Scholar
  12. 12.
    Diaconescu, R.: Elementary diagrams in institutions. Journal of Logic and Computation 14(5), 651–674 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Diaconescu, R.: Institution-independent Model Theory. Birkhäuser, Basel (2008)zbMATHGoogle Scholar
  14. 14.
    Diaconescu, R.: Quasi-boolean encodings and conditionals in algebraic specification. Journal of Logic and Algebraic Programming 79(2), 174–188 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Diaconescu, R., Stefaneas, P.S.: Ultraproducts and possible worlds semantics in institutions. Theor. Comput. Sci. 379(1-2), 210–230 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Goguen, J., Burstall, R.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Goguen, J., Roşu, G.: Institution morphisms. Formal Aspects of Computing 13, 274–307 (2002)zbMATHCrossRefGoogle Scholar
  18. 18.
    Hansen, J., Bolander, T., Braüner, T.: Many-valued hybrid logic. In: Areces, C., Goldblatt, R. (eds.) Advances in Modal Logic, pp. 111–132. College Publications (2008)Google Scholar
  19. 19.
    Kara, A., Lange, M., Schwentick, T., Weber, V.: On the hybrid extension of CTL and CTL+. In: CoRR, abs/0906.2541 (2009)Google Scholar
  20. 20.
    Martins, M., Madeira, A., Barbosa, L.: Reasoning about complex requirements in a uniform setting. Technical report, DI-CCTC-2-1-2011 (2011)Google Scholar
  21. 21.
    Passy, S., Tinchev, T.: An essay in combinatory dynamic logic. Inf. Comput. 93, 263–332 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  22. 22.
    Prior, A.N.: Past, Present and Future. Oxford University Press, Oxford (1967)zbMATHGoogle Scholar
  23. 23.
    Sattler, U., Vardi, M.Y.: The hybrid μ-calculus. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 76–91. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  24. 24.
    Weber, V.: On the complexity of branching-time logics. In: Grädel, E., Kahle, R. (eds.) CSL 2009. LNCS, vol. 5771, pp. 530–545. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Manuel A. Martins
    • 1
  • Alexandre Madeira
    • 1
    • 2
    • 4
  • Răzvan Diaconescu
    • 3
  • Luís S. Barbosa
    • 2
  1. 1.Department of MathematicsUniversity of AveiroPortugal
  2. 2.Department of InformaticsMinho UniversityPortugal
  3. 3.Institute of Mathematics “Simion Stoilow” of the Romanian AcademyRomania
  4. 4.Critical Software S.A.Portugal

Personalised recommendations