Model repair for probabilistic systems

  • Authors:
  • Ezio Bartocci;Radu Grosu;Panagiotis Katsaros;C. R. Ramakrishnan;Scott A. Smolka

  • Affiliations:
  • Department of Applied Math and Statistics, Stony Brook University, Stony Brook, NY;Department of Computer Science, Stony Brook University, Stony Brook, NY;Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Computer Science, Stony Brook University, Stony Brook, NY;Department of Computer Science, Stony Brook University, Stony Brook, NY

  • Venue:
  • TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the problem of Model Repair for Probabilistic Systems as follows. Given a probabilistic system M and a probabilistic temporal logic formula φ such that M fails to satisfy φ, the Model Repair problem is to find an M′ that satisfies v and differs from M only in the transition flows of those states in M that are deemed controllable. Moreover, the cost associated with modifying M's transition flows to obtain M′ should be minimized. Using a new version of parametric probabilistic model checking, we show how the Model Repair problem can be reduced to a nonlinear optimization problem with a minimal-cost objective function, thereby yielding a solution technique. We demonstrate the practical utility of our approach by applying it to a number of significant case studies, including a DTMC reward model of the Zeroconf protocol for assigning IP addresses, and a CTMC model of the highly publicized Kaminsky DNS cache-poisoning attack.