Beyond HyTech Presented by: Ben Horowitz and Rupak Majumdar Joint work with Tom Henzinger and Howard Wong-Toi.

Slides:



Advertisements
Similar presentations
1 Verification by Model Checking. 2 Part 1 : Motivation.
Advertisements

Hybrid BDD and All-SAT Method for Model Checking Orna Grumberg Joint work with Assaf Schuster and Avi Yadgar Technion – Israel Institute of Technology.
Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
Model Checking for an Executable Subset of UML Fei Xie 1, Vladimir Levin 2, and James C. Browne 1 1 Dept. of Computer Sciences, UT at Austin 2 Bell Laboratories,
1 of 13 STABILIZING a SWITCHED LINEAR SYSTEM by SAMPLED - DATA QUANTIZED FEEDBACK 50 th CDC-ECC, Orlando, FL, Dec 2011, last talk in the program! Daniel.
1 of 14 LIMITED - INFORMATION CONTROL of SWITCHED and HYBRID SYSTEMS via PROPAGATION of REACHABLE SETS HSCC, Philadelphia, April 2013 Daniel Liberzon Coordinated.
A Survey of Runtime Verification Jonathan Amir 2004.
Chapter 16 : KRONOS (Model Checking of Real-time Systems)
Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
50.530: Software Engineering Sun Jun SUTD. Week 10: Invariant Generation.
UPPAAL Introduction Chien-Liang Chen.
Hybrid System Verification Synchronous Workshop 2003 A New Verification Algorithm for Planar Differential Inclusions Gordon Pace University of Malta December.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
Timed Automata.
Zonotopes Techniques for Reachability Analysis Antoine Girard Workshop “Topics in Computation and Control” March 27 th 2006, Santa Barbara, CA, USA
Verification of Hybrid Systems An Assessment of Current Techniques Holly Bowen.
Combining Symbolic Simulation and Interval Arithmetic for the Verification of AMS Designs Mohamed Zaki, Ghiath Al Sammane, Sofiene Tahar, Guy Bois FMCAD'07.
Succinct Approximations of Distributed Hybrid Behaviors P.S. Thiagarajan School of Computing, National University of Singapore Joint Work with: Yang Shaofa.
1 Verification and Synthesis of Hybrid Systems Thao Dang October 10, 2000.
Discrete Abstractions of Hybrid Systems Rajeev Alur, Thomas A. Henzinger, Gerardo Lafferriere and George J. Pappas.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
1 8. Safe Query Languages Safe program – its semantics can be at least partially computed on any valid database input. Safety is tied to program verification,
Automatic Rectangular Refinement of Affine Hybrid Automata Tom Henzinger EPFL Laurent Doyen ULB Jean-François Raskin ULB FORMATS 2005 – Sep 27 th - Uppsala.
Verification and Controller Synthesis for Timed Automata : the tool KRONOS Stavros Trypakis.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation
Sanjit A. Seshia and Randal E. Bryant Computer Science Department
Approximate Abstraction for Verification of Continuous and Hybrid Systems Antoine Girard Guest lecture ESE601: Hybrid Systems 03/22/2006
The Symbolic Approach to Hybrid Systems Tom Henzinger University of California, Berkeley.
Hybrid Systems a lecture over: Tom Henzinger’s The Theory of Hybrid Automata Anders P. Ravn Aalborg University PhD-reading course November 2005.
Efficient Simulation of Physical System Models Using Inlined Implicit Runge-Kutta Algorithms Vicha Treeaporn Department of Electrical & Computer Engineering.
Ordinary Differential Equations (ODEs) 1Daniel Baur / Numerical Methods for Chemical Engineers / Implicit ODE Solvers Daniel Baur ETH Zurich, Institut.
Lazy Abstraction Tom Henzinger Ranjit Jhala Rupak Majumdar Grégoire Sutre.
Hybrid automata Rafael Wisniewski Automation and Control, Dept. of Electronic Systems Aalborg University, Denmark Hybrid Systems October 9th 2009.
Formal verification Marco A. Peña Universitat Politècnica de Catalunya.
Abstract Verification is traditionally done by determining the truth of a temporal formula (the specification) with respect to a timed transition system.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Regular Model Checking Ahmed Bouajjani,Benget Jonsson, Marcus Nillson and Tayssir Touili Moran Ben Tulila
1 DISTRIBUTION A. Approved for public release; Distribution unlimited. (Approval AFRL PA # 88ABW , 09 April 2014) Reducing the Wrapping Effect.
Bert Pluymers Johan Suykens, Bart De Moor Department of Electrotechnical Engineering (ESAT) Research Group SCD-SISTA Katholieke Universiteit Leuven, Belgium.
CSE 541 Rick Parent ELEMENTARY NUMERICAL METHODS Winter 2012.
Department of Mechanical Engineering The University of Strathclyde, Glasgow Hybrid Systems: Modelling, Analysis and Control Yan Pang Department of Mechanical.
Hybrid automata and temporal logics
Computational Methods in Physics PHYS 3437 Dr Rob Thacker Dept of Astronomy & Physics (MM-301C)
Proving Non-Termination Gupta, Henzinger, Majumdar, Rybalchenko, Ru-Gang Xu presentation by erkan.
The Verification of an Inequality Roger W. Barnard, Kent Pearce, G. Brock Williams Texas Tech University Leah Cole Wayland Baptist University Presentation:
Control Synthesis and Reconfiguration for Hybrid Systems October 2001 Sherif Abdelwahed ISIS Vanderbilt University.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.
Predicate Abstraction. Abstract state space exploration Method: (1) start in the abstract initial state (2) use to compute reachable states (invariants)
CS 351/ IT 351 Modeling and Simulation Technologies Review ( ) Dr. Jim Holten.
Symbolic Algorithms for Infinite-state Systems Rupak Majumdar (UC Berkeley) Joint work with Luca de Alfaro (UC Santa Cruz) Thomas A. Henzinger (UC Berkeley)
ECE/CS 584: Verification of Embedded Computing Systems Model Checking Timed Automata Sayan Mitra Lecture 09.
( = “unknown yet”) Our novel symbolic execution framework: - extends model checking to programs that have complex inputs with unbounded (very large) data.
ECE/CS 584: Verification of Embedded Computing Systems Timed to Hybrid Automata Sayan Mitra (edited by Yu Wang) Lecture 10.
Håkan L. S. YounesDavid J. Musliner Carnegie Mellon UniversityHoneywell Laboratories Probabilistic Plan Verification through Acceptance Sampling.
Nonlinear balanced model residualization via neural networks Juergen Hahn.
NUMERICAL ANALYSIS I. Introduction Numerical analysis is concerned with the process by which mathematical problems are solved by the operations.
The Time-abstracting Bisimulation Equivalence  on TA states: Preserve discrete state changes. Abstract exact time delays. s1s2 s3  a s4  a 11 s1s2.
Hybrid BDD and All-SAT Method for Model Checking
Learning Invariants using Decision Trees and Implication Counterexamples Pranav Garg Amazon India.
Instructor: Rajeev Alur
Arithmetic Constraints and Automata
CSCI1600: Embedded and Real Time Software
Compute convex lower bounding function and optimize it instead!
CSCI1600: Embedded and Real Time Software
CSCI1600: Embedded and Real Time Software
Chapter 2: Analysis and Verification of Non-Real-Time Systems
Course: CS60030 FORMAL SYSTEMS
Presentation transcript:

Beyond HyTech Presented by: Ben Horowitz and Rupak Majumdar Joint work with Tom Henzinger and Howard Wong-Toi.

Structure of this talk n Hybrid automata n Symbolic model checking n HyTech n Interval numerics n HyTech’s algorithm n Extending HyTech’s dynamics n Thermostat example

Hybrid automata n (V, E, X, pre, post, init, flow, jump, inv, Σ)

Symbolic model checking n State space of a hybrid automaton is infinite. n Thus, verification algorithms must be symbolic. n To have a symbolic algorithm, we need: u finite representation of infinite state sets; u Pre, Boolean operations as primitives on state sets.

HyTech n Symbolic model checker for hybrid automata. n Automata must be polyhedral: u flow conditions are polyhedra; u invariants, pre, post, etc. are also polyhedra; u state sets are unions of convex polyhedra; u Pre implemented as polyhedral manipulation.

HyTech cont. n HyTech has been used to verify several realistic examples: u audio control protocol, u steam boiler, u auto engine in cutoff controller mode, u...

Shortcomings of HyTech n HyTech allows only restrictive dynamics: u polyhedral automata n For example, in the cutoff control study: u dynamics required extensive manual approximation before HyTech could be applied.

Current ways to avoid shortcomings n For a large system, one may: u Simulate via numerical integration: F not appropriate for verification: may miss events, round-off errors; u Massage into HyTech-acceptable form: F messy, F time-consuming.

Avoiding shortcomings, cont. n Massaging input with rate translation: u Replace nonlinear x with linear x. u Bound (d/dt)x by upper & lower constants. u Split location v into several locations to yield better approximation.

Massaging input, cont. Thermostat becomes: State explosion!

Our objective n Our aim is to provide both a more direct and a more accurate analysis of hybrid systems. u More direct: dynamics may be modeled directly. u More accurate: bounds obtained are tighter. n We have implemented a prototype.

Interval numerical methods n Arithmetic operators on intervals instead of reals. u [2.7818, ] n Numerical ODE solvers available. n ODE solutions lie within validated intervals. n In worst case, solution is unacceptably wide. u But solution is never false.

HyTech’s algorithm n Maintain two sets of regions: u R : already-explored regions, u R’ : to-be-explored regions. n Initially, R =  and R’ is the initial region. n while (R’   ): u remove region r from R’, u compute r’s event and time successors S, u add non-visited successors to R’, u R := R  { r }.

n Maintain two sets of regions: u R : already-explored region, u R’ : to-be-explored region. n Initially, R =  and R’ is the initial region. n while (R’  ): u remove region r from R’, u compute r’s event and time successors S, u add non-visited successors to R’, u R := R  { r }. Our algorithm

r Computing time successors n Start with: u exit region e, u initial rectangle r. n Use interval numerical integration to compute time successors of r. n Stop when we hit e. e

Example: thermostat

Tighter bounds for thermostat n Using HyTech, it was shown that 0  x  4. n Using a 20-state approximation, HyTech obtains the bounds.28  x  n Using interval numerical methods, the new HyTech shows that.367  x  3.64.

Nuclear reactor n Example from [ACHH]. n HyTech with old algorithm gives t = 2 for controllability. n New Algorithm gives t = n Other (small) examples in the HyTech example suite also work.

Future work n Try larger examples, e.g. cutoff control. n Investigate whether interval numerical methods can be used on polyhedra or ellipsoids. n Redesign HyTech’s input language and implementation.