Hybridisation at Work

Neves, Renato; Madeira, Alexandre; Martins, Manuel A.; Barbosa, Lu­ís Soares

doi:10.1007/978-3-642-40206-7_28

Cited by 10 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Typical candidates are equational, partial algebra or firstorder logic (FOL), but one may equally resort to multivalued logics or even to hybrid logic itself equipping, in the last case, each state with another (local) transition system. Verification resorts to a parametrised translation to FOL (developed in [14] and [15]), but at the cost of losing decidability and adding extra complexity.…”

Section: Contextmentioning

confidence: 99%

Completeness and Decidability Results for Hybrid(ised) Logics

Neves

Martins

Barbosa

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Contextmentioning

confidence: 99%

Completeness and Decidability Results for Hybrid(ised) Logics

Neves

Martins

Barbosa

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently an hybrid version of CASL, called HCASL, as well as the suitable encoding into CASL, were integrated directly in HETS [11]. This provides effective tool support to specifications in the logics discussed in this paper since both are subsumed in HCASL and HETS offers a very stable and mature tool support for the specification in CASL.…”

Section: Tool Supportmentioning

confidence: 96%

When Even the Interface Evolves...

Madeira

Neves

Martins³

et al. 2013

2013 International Symposium on Theoretical Aspects of Software Engineering

Self Cite

View full text Add to dashboard Cite

This paper extends the authors' previous work on a formal approach to the specification of reconfigurable systems, introduced in [7], in which configurations are taken as local states in a suitable transition structure. The novelty is the explicit consideration that not only the realisation of a service may change from a configuration to another, but also the set of services provided and even their functionality, may themselves vary. In other words, interfaces may evolve, as well.

show abstract

“…Such a methodology was introduced in [MFMB11], and provided with effective, computerbased proof support through the recent implementation [NMMB13] of the hybridisation method in the Hets platform [MML07].…”

Section: Discussionmentioning

confidence: 99%

Refinement in hybridised institutions

Madeira

Martins²,

Barbosa

et al. 2015

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Hybridisation at Work

Cited by 10 publications

References 8 publications

Completeness and Decidability Results for Hybrid(ised) Logics

Completeness and Decidability Results for Hybrid(ised) Logics

When Even the Interface Evolves...

Refinement in hybridised institutions

Contact Info

Product

Resources

About