1 Probabilistic Model Checking of Systems with a Large State Space: A Stratified Approach Shou-pon Lin Advisor: Nicholas F. Maxemchuk Department of Electrical.

Slides:



Advertisements
Similar presentations
Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.
Advertisements

1 Concurrency: Deadlock and Starvation Chapter 6.
1 Model checking. 2 And now... the system How do we model a reactive system with an automaton ? It is convenient to model systems with Transition systems.
Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
Timed Automata.
Probabilistic Verification of Discrete Event Systems using Acceptance Sampling Håkan L. S. YounesReid G. Simmons Carnegie Mellon University.
Reliable Dynamic Analysis of Structures Using Imprecise Probability Mehdi Modares and Joshua Bergerson DEPARTMENT OF CIVIL, ARCHITECTURAL AND EVIRONMENTAL.
Ensuring Robustness via Early- Stage Formal Verification Multicore Power Management: Anita Lungu *, Pradip Bose **, Daniel Sorin *, Steven German **, Geert.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
Bowen Yu Programming Practice Midterm, 7/30/2013.
CS 267: Automated Verification Lecture 10: Nested Depth First Search, Counter- Example Generation Revisited, Bit-State Hashing, On-The-Fly Model Checking.
SAT-based verification: underlying methods Mary Sheeran Chalmers University of Technology and Prover Technology AB.
Integration of sensory modalities
Probabilistic Model Checking CS 395T. Overview uCrowds redux uProbabilistic model checking PRISM model checker PCTL logic Analyzing Crowds with PRISM.
Theoretical Program Checking Greg Bronevetsky. Background The field of Program Checking is about 13 years old. Pioneered by Manuel Blum, Hal Wasserman,
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
A Hybridized Planner for Stochastic Domains Mausam and Daniel S. Weld University of Washington, Seattle Piergiorgio Bertoli ITC-IRST, Trento.
Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.
Markov Decision Models for Order Acceptance/Rejection Problems Florian Defregger and Heinrich Kuhn Florian Defregger and Heinrich Kuhn Catholic University.
Synergy: A New Algorithm for Property Checking
Probabilistic Verification of Discrete Event Systems Håkan L. S. Younes.
The Rare Glitch Project: Verification Tools for Embedded Systems Carnegie Mellon University Pittsburgh, PA Ed Clarke, David Garlan, Bruce Krogh, Reid Simmons,
Branch and Bound Algorithm for Solving Integer Linear Programming
1 Formal Engineering of Reliable Software LASER 2004 school Tutorial, Lecture1 Natasha Sharygina Carnegie Mellon University.
Name: Mehrab Khazraei(145061) Title: Penalty or Exterior penalty function method professor Name: Sahand Daneshvar.
Algorithm design techniques
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Jun. Sun Singapore University of Technology and Design Songzheng Song and Yang Liu National University of Singapore.
Decision Procedures An Algorithmic Point of View
Final Exam Review II Chapters 5-7, 9 Objectives and Examples.
HOW TO SOLVE IT? Algorithms. An Algorithm An algorithm is any well-defined (computational) procedure that takes some value, or set of values, as input.
ECE 720T5 Winter 2014 Cyber-Physical Systems Rodolfo Pellizzoni.
Planning and Verification for Stochastic Processes with Asynchronous Events Håkan L. S. Younes Carnegie Mellon University.
The Program Development Cycle
Application of the Direct Optimized Probabilistic Calculation Martin Krejsa Department of Structural Mechanics Faculty of Civil Engineering VSB - Technical.
Some Probability Theory and Computational models A short overview.
BitTorrent Nathan Marz Raylene Yung. BitTorrent BitTorrent consists of two protocols – Tracker HTTP protocol (THP) How an agent joins a swarm How an agent.
Markov Decision Processes1 Definitions; Stationary policies; Value improvement algorithm, Policy improvement algorithm, and linear programming for discounted.
Computer Science Department Data Structure & Algorithms Lecture 8 Recursion.
Probabilistic Reasoning for Robust Plan Execution Steve Schaffer, Brad Clement, Steve Chien Artificial Intelligence.
Advanced Computer Architecture and Parallel Processing Rabie A. Ramadan http:
Method of Hooke and Jeeves
 { X n : n =0, 1, 2,...} is a discrete time stochastic process Markov Chains.
CS433 Modeling and Simulation Lecture 06 – Part 02 Discrete Markov Chains Dr. Anis Koubâa 11 Nov 2008 Al-Imam Mohammad.
Conformant Probabilistic Planning via CSPs ICAPS-2003 Nathanael Hyafil & Fahiem Bacchus University of Toronto.
Proving Non-Termination Gupta, Henzinger, Majumdar, Rybalchenko, Ru-Gang Xu presentation by erkan.
1.7 Linear Inequalities.  With an inequality, you are finding all values of x for which the inequality is true.  Such values are solutions and are said.
Probabilistic Verification of Discrete Event Systems using Acceptance Sampling Håkan L. S. Younes Carnegie Mellon University.
MaskIt: Privately Releasing User Context Streams for Personalized Mobile Applications SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference.
Branch and Bound Algorithms Present by Tina Yang Qianmei Feng.
2.1 – Linear and Quadratic Equations Linear Equations.
Grid-enabled Probabilistic Model Checking with PRISM Yi Zhang, David Parker, Marta Kwiatkowska University of Birmingham.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
1 Alan Mishchenko Research Update June-September 2008.
Håkan L. S. YounesDavid J. Musliner Carnegie Mellon UniversityHoneywell Laboratories Probabilistic Plan Verification through Acceptance Sampling.
October 20-23rd, 2015 Sandboxing and Reasoning on Malware Infection Trees Kris Ghosh 1, Jose Morales 2, Will Casey 2 and Bud Mishra 3 1. Miami University.
Let E denote some event. Define a random variable X by Computing probabilities by conditioning.
Krishnendu ChatterjeeFormal Methods Class1 MARKOV CHAINS.
Different Types of Testing
P.S.V. Nataraj and Sachin Tharewal Systems & Control Engineering,
Discrete-time markov chain (continuation)
Statistical Model-Checking of “Black-Box” Probabilistic Systems VESTA
On Statistical Model Checking of Stochastic Systems
} 2x + 2(x + 2) = 36 2x + 2x + 4 = 36 4x + 4 = x =
Javad Ghaderi, Tianxiong Ji and R. Srikant
Notes Over 1.7 Solving Inequalities
Notes Over 1.7 Solving Inequalities
‘Crowds’ through a PRISM
Discrete-time markov chain (continuation)
Probabilistic Contract Signing
Presentation transcript:

1 Probabilistic Model Checking of Systems with a Large State Space: A Stratified Approach Shou-pon Lin Advisor: Nicholas F. Maxemchuk Department of Electrical Engineering, Columbia University, New York, NY 10027

Problem: –Markov decision process or Markov chain with exceedingly large state space –Check if the Markov decision process or Markov chain satisfies a given probabilistic safety property Solution: –Not completely traverse all states, but prioritize state traversal on those states that are more likely to be reached during system execution; stop when using up all the memory –Compute probability bound by considering the uncertainty contributed by unexplored states Model checking probabilistic system 2

Probabilistic safety properties A probabilistic safety property combines a regular safety property and a probability bound between 0 and 1 For all adversary, the probability for to satisfy should be greater than or equal to 3

Reachability analysis Normally it can be done by taking the product, find the set of acceptance states, and solve a linear program to find 4

Discretized levels of probabilistic choices Given a layering parameter, probabilistic choices are categorized into several discretization levels –If  level-0 (high probability choices) –If  level-1 low probability choices –If  level-2 low probability choices –etc. 5

Stratified traversal Assign discretized levels to probabilistic transitions 6

Stratified traversal Prioritize traversal of more probable states 7

Stratified traversal Prioritize traversal of more probable states 8

Stratified traversal Prioritize traversal of more probable states 9

Stratified traversal The unexplored states are the less likely ones to be reached during system execution 10

Stratified traversal The unexplored states are the less likely ones to be reached during system execution 11

Determine if the property holds Let Suppose the procedure stops when finishing layer k 1.If, holds 2.If, is violated 3.Otherwise, whether holds or not is uncertain 12

Determine if the property holds Let Suppose the procedure stops when finishing layer k 1.If, holds 2.If, is violated 3.Otherwise, whether holds or not is uncertain 13

Preliminary results We applied stratified verification to the lock protocol that resolves conflicting reqs in our automobile application. Stratified method is able to compute the upper-bound of error probability while PRISM terminates when running out of memory 14

Future works Feasibility of integrating this method into currently available model checkers and state-of-art techniques 15

Future works Feasibility of integrating this method into currently available model checkers and state-of-art techniques 16 Thank you for your attention! Contact:

17 Thank you for your attention! Contact: