Please use this identifier to cite or link to this item:
|Title:||Completeness and decidability results for hybrid(ised) logics|
Martins, Manuel A.
Barbosa, Luís S.
|Publisher:||Springer International Publishing|
|Abstract:||Adding to the modal description of transition structures the ability to refer to specific states, hybrid(ised) logics provide an interesting framework for the specification of reconfigurable systems. The qualifier ‘hybrid(ised)’ refers to a generic method of developing, on top of whatever specification logic is used to model software configurations, the elements of an hybrid language, including nominals and modalities. In such a context, this paper shows how a calculus for a hybrid(ised) logic can be generated from a calculus of the base logic and that, moreover, it preserves soundness and completeness. A second contribution establishes that hybridising a decidable logic also gives rise to a decidable hybrid(ised) one. These results pave the way to the development of dedicated proof tools for such logics used in the design of reconfigurable systems.|
|Appears in Collections:||CIDMA - Capítulo de livro|
AGG - Capítulo de livro
Files in This Item:
|submittedversion.pdf||Documento principal||393.56 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.