Evaluation of resilience in self-adaptive systems using probabilistic model-checking

Author(s):  
Javier Camara ◽  
Rogerio de Lemos
Author(s):  
Yong-Jun Shin ◽  
Eunho Cho ◽  
Doo-Hwan Bae

AbstractProactive adaptation, in which the adaptation for a system’s reliable goal achievement is performed by predicting changes in the environment, is considered as an effective alternative to reactive adaptation, in which adaptation is performed after observing changes. When predicting the environmental changes, the prediction may be uncertain, so it is necessary to verify and confirm an adaptation’s consequences before execution. To resolve the uncertainty, probabilistic model checking (PMC) has been utilized for verification of adaptation tactics’ effects on the goal of a self-adaptive system (SAS). However, PMC-based approaches have limitations on the state-explosion problem of complex SAS model verification and the modeling languages supported by the model checkers. In this paper, to overcome the limitations of the PMC-based approaches, we propose an efficient Proactive Adaptation approach based on STAtistical model checking (PASTA). Our approach allows SASs to mitigate the uncertainty of the future environment, faster than the PMC-based approach, by producing statistically sufficient samples for verification of adaptation tactics based on statistical model checking (SMC) algorithms. We provide algorithmic processes, a reference architecture, and an open-source implementation skeleton of PASTA for engineers to apply it for SAS development. We evaluate PASTA on two SASs using actual data and show that PASTA is efficient comparing to the PMC-based approach. We also provide a comparative analysis of the advantages and disadvantages of PMC- and SMC-based proactive adaptation to guide engineers’ decision-making for SAS development.


Author(s):  
Christel Baier ◽  
Clemens Dubslaff ◽  
Sascha Klüppelholz ◽  
Marcus Daum ◽  
Joachim Klein ◽  
...  

Trains scheduling is an important problem in railway transportation. Many companies use fixed train timetabling to handle this problem. Train delays can affect the pre-defined timetables and postpone destination arrival times. Besides, delay propagation may affect other trains and degrade the performance of a railway network. An optimal timetable minimizes the total propagated delays in a network. In this paper, we propose a new approach to compute the expected propagated delays in a railway network. As the main contribution of the work, we use Discrete-time Markov chains to model a railway network with a fixed timetable and use probabilistic model checking to approximate the expected delays and the probability of reaching destinations with a desired delay. We use PRISM model checker to apply our approach for analyzing the impact of different train scheduling in double line tracks.


2016 ◽  
Vol 29 (2) ◽  
pp. 287-299 ◽  
Author(s):  
Shashank Pathak ◽  
Luca Pulina ◽  
Armando Tacchella

Author(s):  
Joachim Klein ◽  
Christel Baier ◽  
Philipp Chrszon ◽  
Marcus Daum ◽  
Clemens  Dubslaff ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document