Model Repair in Systems Design. Panagiotis Katsaros Aristotle University of Thessaloniki (GR)

Similar documents
Abstract Model Repair

Abstract Model Repair

A Greedy Approach for the Efficient Repair of Stochastic Models

ABSTRACT MODEL REPAIR

ABSTRACT MODEL REPAIR

3-Valued Abstraction-Refinement

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1

Towards An Accurate Reliability, Availability and Maintainability Analysis Approach for Satellite Systems Based on Probabilistic Model Checking

Joint work with Marie-Aude Esteve, Joost-Pieter Katoen, Bart Postma and Yuri Yushtein.

Temporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.

SFM-11:CONNECT Summer School, Bertinoro, June 2011

Statistical Model Checking as Feedback Control

Solving Influence Problems on the DeGroot Model with a Probabilistic Model Checking Tool

A Brief Introduction to Model Checking

Revising Distributed UNITY Programs is NP-Complete

PRISM An overview. automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation,

Abstractions and Decision Procedures for Effective Software Model Checking

PLEASE DO NOT REMOVE THIS PAGE

Probabilistic verification and approximation schemes

PRISM: Probabilistic Model Checking for Performance and Reliability Analysis

Quantitative Safety Analysis of Non-Deterministic System Architectures

A Probabilistic Model Checking Approach to Analysing Reliability, Availability, and Maintainability of a Single Satellite System

Duality in Probabilistic Automata

Model Checking: An Introduction

Partial model checking via abstract interpretation

Finite-State Model Checking

A brief history of model checking. Ken McMillan Cadence Berkeley Labs

ONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies. Calin Belta

Revising Distributed UNITY Programs is NP-Complete

Probabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford

Revising UNITY Programs: Possibilities and Limitations 1

Model Checking. Temporal Logic. Fifth International Symposium in Programming, volume. of concurrent systems in CESAR. In Proceedings of the

Probabilistic Model Checking (1)

Verification Using Temporal Logic

Probabilistic model checking with PRISM

Fine Grain Quality Management

Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties and its Application to Cyber-Physical Systems

Caching Strategies for Run-time Probabilistic Model Checking

INFAMY: An Infinite-State Markov Model Checker

Formal Analysis of Fault Tree using Probabilistic Model Checking: A Solar Array Case Study

Chapter 4: Computation tree logic

Lecture 2: Symbolic Model Checking With SAT

Model checking the basic modalities of CTL with Description Logic

Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking

Semantic Equivalences and the. Verification of Infinite-State Systems 1 c 2004 Richard Mayr

CONTROLLER DEPENDABILITY ANALYSIS BY PROBABILISTIC MODEL CHECKING. Marta Kwiatkowska, Gethin Norman and David Parker 1

Formal Verification via MCMAS & PRISM

A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes

The State Explosion Problem

Temporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

Computation Tree Logic (CTL) & Basic Model Checking Algorithms

ProbVerus: Probabilistic Symbolic Model Checking

Counterexample-Guided Abstraction Refinement

Model Update for System Modifications. Yulin Ding. A thesis submitted for the degree of Doctor of Philosophy at University of Western Sydney

Bounded Model Checking with SAT/SMT. Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39

Evaluating the Reliability of NAND Multiplexing with PRISM

Symmetry Reduction for Probabilistic Model Checking

Probabilistic Model Checking and Strategy Synthesis for Robot Navigation

FORMAL METHODS LECTURE IV: COMPUTATION TREE LOGIC (CTL)

Reasoning about Strategies: From module checking to strategy logic

Summary. Computation Tree logic Vs. LTL. CTL at a glance. KM,s =! iff for every path " starting at s KM," =! COMPUTATION TREE LOGIC (CTL)

Symbolic Control of Incrementally Stable Systems

Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study

Alternating Time Temporal Logics*

On-the-Fly Exact Computation of Bisimilarity Distances

Modeling and Analysis of Probabilistic Timed Systems

Formal Verification Techniques. Riccardo Sisto, Politecnico di Torino

On the Synergy of Probabilistic Causality Computation and Causality Checking

Model Checking. Boris Feigin March 9, University College London

Double Header. Model Checking. Model Checking. Overarching Plan. Take-Home Message. Spoiler Space. Topic: (Generic) Model Checking

How to Build a Living Cell in Software or Can we computerize a bacterium?

Fault Tolerance. Dealing with Faults

Probabilistic Model Checking for Biochemical Reaction Systems

Limiting Behavior of Markov Chains with Eager Attractors

Dependability Engineering of Silent Self-Stabilizing Systems

FORMAL METHODS LECTURE V: CTL MODEL CHECKING

Models for Efficient Timed Verification

Software Science: How Far Could Mathematics and Rigor Take Us?

State-Space Exploration. Stavros Tripakis University of California, Berkeley

Scenario Graphs and Attack Graphs

A Markov Reward Model for Software Reliability

An Informal introduction to Formal Verification

Verification. Arijit Mondal. Dept. of Computer Science & Engineering Indian Institute of Technology Patna

Balancing and Control of a Freely-Swinging Pendulum Using a Model-Free Reinforcement Learning Algorithm

Considering Security Aspects in Safety Environment. Dipl.-Ing. Evzudin Ugljesa

Revising Specifications with CTL Properties using Bounded Model Checking

Stochastic, Hybrid and Real-Time Systems: From Foundations To Applications with Modest

Symbolic Semantics and Verification of Stochastic Process Algebras. Symbolische Semantik und Verifikation stochastischer Prozessalgebren

From High-Level Component-Based Models to Distributed Implementations

A Gentle Introduction to Reinforcement Learning

Planning Under Uncertainty II

Software Verification with Abstraction-Based Methods

Symbolic Trajectory Evaluation (STE): Orna Grumberg Technion, Israel

Trusted Machine Learning: Model Repair and Data Repair for Probabilistic Models

Overview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?

State Explosion in Almost-Sure Probabilistic Reachability

Counterexamples for Robotic Planning Explained in Structured Language

On Distribution Based Bisimulations for Probabilistic Automata

Transcription:

Model Repair in Systems Design Panagiotis Katsaros Aristotle University of Thessaloniki (GR)

Model-Based Design for Space Systems @ AUTh Design Validation Studies Using COMPASS! Bozzano, Cimatti, Katoen, Katsaros, Mokos, Nguyen, Noll, Postmac, Roveri. Spacecraft early design validation using formal methods, Reliability Engineering and System Safety, 2014! Mandaras, Early design validation of the GOES I-M system, Master Thesis, AUTh, 2015 Ongoing ESA TRP studies! Catalogue of System & Software Properties with EPFL RiSD Lab and TAS - Requirements catalogue & formalization - Ontology-based semantics modeling & reasoning (Prof. Bassiliades) - Rigorous architecture based design (Prof. Sifakis)! Model-Based Schedulability Analysis for Cached & Multicore Processors (working for CERTH) with Verimag Lab, Cobham Gaisler, Deimos Space

The Model Repair problem! Extension of model checking used for design refinement: Given a system model M and some temporal logic property ϕ, where M does not satisfy ϕ find a new model M such that M satisfies ϕ and the changes in M to derive M are minimal with respect to all such M.! Variants from the bibliography: " with constraints (preserve properties) " with controllable states (repair options)

Applications! Model Repair for incorporating fault tolerance in a distributed algorithm Bonakdarpour, Kulkarni, Abujarad. Symbolic synthesis of masking fault-tolerant programs, 2012! Model Repair for fault recovery in componentbased models Bonakdarpour, Bozga, Goessler. A theory of fault recovery for component-based models, 2011! Model Repair for concurrent programs Attie, Cherri, Al Bab, Sakr, Saklawi. Model and Program Repair via SAT Solving, 2015! Model Repair for probabilistic systems Bartocci, Grosu, Katsaros, Ramakrishnan, Smolka, Model repair for probabilistic systems, 2011 Pathak, Abraham, Jansen, Tacchella, Katoen. A Greedy Approach for the Efficient Repair of Stochastic Models, 2015

Model Repair solutions for probabilistic systems I Bartocci, Grosu, Katsaros, Ramakrishnan, Smolka, Model repair for probabilistic systems, TACAS, 2011 For DTMCs and CTMCs,! using parametric probabilistic model checking the problem is reduced to a nonlinear optimization problem with a minimal-cost objective function! solution feasibility & optimality conditions are provided! an implementation of the solution technique is provided! " # "#$% "#$% "#&$% '%! $ # "#&$%! % # "#$%&' ( %! "#$)' ( % %" '"!" (% &" $" (% "#$%*' #" ( % P!0.3 [F s = 2 " s = 5] # 8v 2 1 + 2 4v 2 1 + 3! 0.3 0/%078-./0+1-%% "#$% (% +%!" $(+'" $(+" $(*'" $(*" $()'" $()" #-%",$('"! " # "#$%+%) ' %! $ # "#&$%+%) & % "#$%(%) ' % '% $" ' ( % "#&$%+%)! %! % # Z "#$%(%*) &% +%)!,%,-./0+01023%4-5067%% P!b [F s = 2 " s = 5] 8v 1 2 + 2 4v 1 2 + 3! b $('"

Model Repair solutions for probabilistic systems II For MDPs, Chen, Hahn, Han, Kwiatkowska, Qu, Zhang, Model Repair for Markov Decision Processes, TASE, 2013! Region refinement through the parameter space (approximation)! Sampling-based search through the parameter space For DTMCs + CTMCs, Pathak, Abraham, Jansen, Tacchella, Katoen. A Greedy Approach for the Efficient Repair of Stochastic Models, 2015! From initial parameter assignment, iteratively changes the parameter values by local repair steps

Abstract Model Repair for transition systems I Remove State d S Add May d 1 s s Remove Must d S α(s) γ(ŝ) α(s ) Remove May d S 2 Change Label d S ŝ Add State d 1 Add Must d S Chatzieleftheriou, Bonakdarpour, Katsaros, Smolka. Abstract Model Repair, NASA Formal Methods 2012 + Logical Methods in Computer Science 2015! Model Repair CTL properties using abstraction & refinement to tackle state space explosion: " Concrete model is a Kripke Structure " Abstract model is a (Kripke) Modal Transition System " A pair of abstraction & concretization functions (a, γ) is defined! A metric space over Kripke structures is defined to quantify their structural differences.! Partial ordering of basic abstract repair operations in terms of the structural changes implied for the concrete model.

Abstract Model Repair for transition systems II Failure Initial Concrete Model (KS) M Abstraction α(m) Abstract Model (KMTS) ˆM = α(m) Refinement Failure Repaired Abstract Model (KMTS) ˆM Abstract Model Repair α Refined (M) No Abstract MC ( ˆM,ŝ) = ϕ? Undefined γ( ˆM ) Concretization Repaired Concrete Model (KS) M Repaired γ( ˆM ) Yes (M,s) = ϕ

Conclusions! Model Repair solutions for probabilistic systems! Abstract Model Repair framework & algorithm " proved sound for the full CTL and complete for a subset of CTL (excluding only the AND operator) " complexity: upper bounded by a polynomial expression in the size of the abstract model " constraints in model repair undermine completeness! Towards Design Repair " better criteria for quantifying changes and minimality (structural differences, only good for abstract repair) " define basic repair operations in rigorous system design languages (e.g. SLIM, BIP) and assess their cost " introduce architecture specific repair options in the design/verification front-end

THANK YOU! katsaros@csd.auth.gr