Formalization of resilience for constraint-based dynamic systems

Schwind, Nicolas; Magnin, Morgan; Inoue, Katsumi; Okimoto, Tenda; Sato, Taisuke; Minami, Kazuhiro; Maruyama, Hiroshi

doi:10.1007/s40860-015-0016-0

Cited by 6 publications

(5 citation statements)

References 42 publications

(127 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As it was observed by Schwind et al [ 17 ], using this definition, resilience is strongly interconnected with the three previous properties: by setting the parameter z to 1 or | SST |, resilience becomes equivalent to r -resistance or r -functionality, respectively. Moreover, Schwind et al [ 17 ] proved that “a finite SST is 〈 p , q 〉-recoverable if it is 〈 z , ( p + q / z )〉-resilient ∀ z ∈ {1, …, | SST |}”.…”

Section: Resilience and Resilient Properties In Probabilistic Modelsmentioning

confidence: 81%

“…Summing up our work, we adapted the CBS/DS-based formalization of resilience given by Schwind et al [ 17 ] (composed of the resilient properties of resistance, functionality, and recoverability) to the timed probabilistic framework of hidden Markov models. To do so, we defined the extended framework of c-HMMs.…”

Section: Discussionmentioning

confidence: 99%

“…This work re-interprets a formal definition of resilience (for dynamic systems) [ 2 ] using the probabilistic framework of hidden Markov models and enriching it with a cost function. In this section, we recall and combine together a number of definitions that are derived from recent research work on formal resilience in dynamic non-deterministic constraint-based models [ 2 , 17 ] and timed probabilistic models [ 18 ].…”

Section: Resilience and Resilient Properties In Probabilistic Modelsmentioning

confidence: 99%

See 2 more Smart Citations

Assessing the resilience of stochastic dynamic systems under partial observability

et al. 2018

Self Cite

View full text Add to dashboard Cite

Resilience is a property of major interest for the design and analysis of generic complex systems. A system is resilient if it can adjust in response to disruptive shocks, and still provide the services it was designed for, without interruptions. In this work, we adapt a formal definition of resilience for constraint-based systems to a probabilistic framework derived from hidden Markov models. This allows us to more realistically model the stochastic evolution and partial observability of many complex real-world environments. Within this framework, we propose an efficient and exact algorithm for the inference queries required to construct generic property checking. We show that the time complexity of this algorithm is on par with other state-of-the-art inference queries for similar frameworks (that is, linear with respect to the time horizon). We also provide considerations on the specific complexity of the probabilistic checking of resilience and its connected properties, with particular focus on resistance. To demonstrate the flexibility of our approach and to evaluate its performance, we examine it in four qualitative and quantitative example scenarios: (1) disaster management and damage assessment; (2) macroeconomics; (3) self-aware, reconfigurable computing for aerospace applications; and (4) connectivity maintenance in robotic swarms.

show abstract

Section: Resilience and Resilient Properties In Probabilistic Modelsmentioning

confidence: 81%

Section: Discussionmentioning

confidence: 99%

Section: Resilience and Resilient Properties In Probabilistic Modelsmentioning

confidence: 99%

See 1 more Smart Citation

Assessing the resilience of stochastic dynamic systems under partial observability

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…They clearly need to be secured as viable as could be expected, yet the genuine inquiry is would they say they will go additional miles for that? [19]. Once this data is gathered and analysed, it is possible to identify some of the users' characteristics as well as the activities that they could perform in the system, avoiding a security-usability conflict.…”

Section: B Design Science Research Methodologymentioning

confidence: 99%

Bridging Usability and Accessibility of User Authentication using Usable Accessed (UAce) for Online Payment Applications

Mohamed

Fudzee

Ramli

et al. 2021

JOIV : Int. J. Inform. Visualization

View full text Add to dashboard Cite

Usability and accessibility are significant authentication aspects for online applications. Despite the fact that there are ongoing efforts to improve the interface design, some existing research only focuses on a single aspect of it. Thus, it is vital to investigate how to merge these two features into a practical and workable solution. This study presents a preliminary process for designing accessible and usable applications for online banking payment using Usable Accessed (UAce by adopting Design Science Research (DSR) as its methodology. The UAce standard considers attributes and characteristics from the user authentication. The standard establishes a development method and tool for assessing subjectively and quantitatively usable, as well as the user authentication while taking into account specific elements, qualities, and features. The DSR technique for developing highly usable and accessible interactive apps was utilized in designing this approach.

show abstract

“…From the conceptual perspective, robustness is the ability to withstand adversarial conditions without negative impact on performance [8,2]. Recoverability, on the other hand, is the capability to restore the functionality of the system after disturbance [9]. Both notions have been separately formalized in TF and analyzed from the computational viewpoint [3,2]: the decision problems related to robust TF and recoverable TF have been shown to be respectively NP-complete and -complete.…”

Section: Related Workmentioning

confidence: 99%

Algorithms for partially robust team formation

Schwind

Demirović

Inoue

et al. 2023

Auton Agent Multi-Agent Syst

Self Cite

View full text Add to dashboard Cite

In one of its simplest forms, Team Formation involves deploying the least expensive team of agents while covering a set of skills. While current algorithms are reasonably successful in computing the best teams, the resilience to change of such solutions remains an important concern: Once a team has been formed, some of the agents considered at start may be finally defective and some skills may become uncovered. Two recently introduced solution concepts deal with this issue proactively: 1) form a team which is robust to changes so that after some agent losses, all skills remain covered, and 2) opt for a recoverable team, i.e., it can be "repaired" in the worst case by hiring new agents while keeping the overall deployment cost minimal. In this paper, we introduce the problem of partially robust team formation (PR-TF). Partial robustness is a weaker form of robustness which guarantees a certain degree of skill coverage after some agents are lost. We analyze the computational complexity of PR-TF and provide two complete algorithms for it. We compare the performance of our algorithms with the existing methods for robust and recoverable team formation on several existing and newly introduced benchmarks. Our empirical study demonstrates that partial robustness offers an interesting trade-off between (full) robustness and recoverability in terms of computational efficiency, skill coverage guaranteed after agent losses and repairability. This paper is an extended and revised version of as reported by (Schwind et al., Proceedings of the 20th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'21), pp. 1154(AAMAS'21), pp. -1162(AAMAS'21), pp. , 2021.

show abstract

Formalization of resilience for constraint-based dynamic systems

Cited by 6 publications

References 42 publications

Assessing the resilience of stochastic dynamic systems under partial observability

Assessing the resilience of stochastic dynamic systems under partial observability

Bridging Usability and Accessibility of User Authentication using Usable Accessed (UAce) for Online Payment Applications

Algorithms for partially robust team formation

Contact Info

Product

Resources

About