2016
DOI: 10.1016/j.scico.2016.05.001
|View full text |Cite
|
Sign up to set email alerts
|

A method for rigorous design of reconfigurable systems

Abstract: Reconfigurability, understood as the ability of a system to behave differently in different modes of operation and commute between them along its lifetime, is a cross-cutting concern in modern Software Engineering. This paper introduces a specification method for reconfigurable software based on a global transition structure to capture the system's reconfiguration space, and a local specification of each operation mode in whatever logic (equational, first-order, partial, fuzzy, probabilistic, etc.) is found ex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 83 publications
0
5
0
Order By: Relevance
“…Moreover, although M, w 3 ♦q, we can verify that M, w 1 ♦♦q since M, w 2 ♦q. Finally, we point out that the formula (p ∧ ¬p) is false in every world but M, w 4 (p ∧ ¬p). This holds because, by definition, (p ∧ ¬p) holds at w 4 if p ∧ ¬p is valid on each successor state of w 4 .…”
Section: Modal Logicmentioning
confidence: 75%
See 1 more Smart Citation
“…Moreover, although M, w 3 ♦q, we can verify that M, w 1 ♦♦q since M, w 2 ♦q. Finally, we point out that the formula (p ∧ ¬p) is false in every world but M, w 4 (p ∧ ¬p). This holds because, by definition, (p ∧ ¬p) holds at w 4 if p ∧ ¬p is valid on each successor state of w 4 .…”
Section: Modal Logicmentioning
confidence: 75%
“…This holds because, by definition, (p ∧ ¬p) holds at w 4 if p ∧ ¬p is valid on each successor state of w 4 . Since there is no sucessor state of w 4 , M, w 4 (p ∧ ¬p).…”
Section: Modal Logicmentioning
confidence: 99%
“…Dynamic networks of interactions similar to the ones arising in membrane budding are essentially discrete reconfigurable systems; hence, it is natural to formalize them as Kripke structures whose states/worlds correspond to network configurations (specific arrangements of organelles, proteins, cargo molecules, etc., at a given time) and whose transitions capture reconfigurations (like those occurring during budding or fission). This opens the possibility to use standard modal-logic formalisms as in [7,21,11,18,30], among other, to specify and reason about reconfigurations.…”
Section: Initiation Budding Fission Uncoating Fusionmentioning
confidence: 99%
“…The topic is duly receiving growing attention in the formal-methods literature, notably through new mathematical models as well as specification and reasoning tools based on modal and hybrid(ized) logics that explore the intrinsic connection between reconfigurability and Kripke structures (e.g., [21,18,8,10]). In their most basic form, hybrid logics enrich ordinary modal logics with nominalsdesignating states in Kripke structures -and a local-satisfaction operator that enables a change of perspective from the state under consideration to another state that is named (e.g., [1,4]).…”
Section: Introductionmentioning
confidence: 99%
“…Finally, it is worth noting that this work is framed in our long term research on demand driven generation of specification logics, parametric to the specificities of some classes of complex systems (e.g. [2,20,21]).…”
Section: Lemma 11 (Truth Lemma)mentioning
confidence: 99%