Toward a UCM-Based Approach for Recovering System Availability Requirements from Execution Traces

Author(s):  
Jameleddine Hassine ◽  
Abdelwahab Hamou-Lhadj
2018 ◽  
Vol 96 ◽  
pp. 78-93 ◽  
Author(s):  
Jameleddine Hassine ◽  
Abdelwahab Hamou-Lhadj ◽  
Luay Alawneh

Energies ◽  
2021 ◽  
Vol 14 (13) ◽  
pp. 3956
Author(s):  
Khaled Guerraiche ◽  
Latifa Dekhici ◽  
Eric Chatelet ◽  
Abdelkader Zeblah

The design of energy systems is very important in order to reduce operating costs and guarantee the reliability of a system. This paper proposes a new algorithm to solve the design problem of optimal multi-objective redundancy of series-parallel power systems. The chosen algorithm is based on the hybridization of two metaheuristics, which are the bat algorithm (BA) and the generalized evolutionary walk algorithm (GEWA), also called BAG (bat algorithm with generalized flight). The approach is combined with the Ushakov method, the universal moment generating function (UMGF), to evaluate the reliability of the multi-state series-parallel system. The multi-objective design aims to minimize the design cost, and to maximize the reliability and the performance of the electric power generation system from solar and gas generators by taking into account the reliability indices. Power subsystem devices are labeled according to their reliabilities, costs and performances. Reliability hangs on an operational system, and implies likewise satisfying customer demand, so it depends on the amassed batch curve. Two different design allocation problems, commonly found in power systems planning, are solved to show the performance of the algorithm. The first is a bi-objective formulation that corresponds to the minimization of system investment cost and maximization of system availability. In the second, the multi-objective formulation seeks to maximize system availability, minimize system investment cost, and maximize the capacity of the system.


2020 ◽  
Vol 11 (1) ◽  
pp. 38
Author(s):  
Orlando Durán ◽  
Javier Aguilar ◽  
Andrea Capaldo ◽  
Adolfo Arata

Resilience is an intrinsic characteristic of systems. Through it, the capacity of a system to react to the existence of disruptive events is expressed. A series of metrics to represent systems’ resilience have been proposed, however, only one indicator relates the availability of the system to this characteristic. With such a metric, it is possible to relate the topological aspects of a system and the resources available in order to be able to promptly respond to the loss of performance as a result of unexpected events. This work proposes the adaptation and application of such a resilience index to assess the influence of different maintenance strategies and topologies in fleets’ resilience. In addition, an application study considering an actual mining fleet is provided. A set of critical assets was identified and represented using reliability block diagrams. Monte Carlo simulation experiments were conducted and the system availability data were extracted. Resilience indexes were obtained in order to carry out the definition of the best maintenance policies in critical equipment and the assessment of the impact of modifying system redundancies. The main results of this work lead to the overall conclusion that redundancy is an important system attribute in order to improve resiliency along time.


Author(s):  
Md Rubel Ahmed ◽  
Hao Zheng ◽  
Parijat Mukherjee ◽  
Mahesh C. Ketkar ◽  
Jin Yang

Author(s):  
Giles Reger ◽  
David Rydeheard

AbstractParametric runtime verification is the process of verifying properties of execution traces of (data carrying) events produced by a running system. This paper continues our work exploring the relationship between specification techniques for parametric runtime verification. Here we consider the correspondence between trace-slicing automata-based approaches and rule systems. The main contribution is a translation from quantified automata to rule systems, which has been implemented in Scala. This then allows us to highlight the key differences in how the two formalisms handle data, an important step in our wider effort to understand the correspondence between different specification languages for parametric runtime verification. This paper extends a previous conference version of this paper with further examples, a proof of correctness, and an optimisation based on a notion of redundancy observed during the development of the translation.


Sign in / Sign up

Export Citation Format

Share Document