GM-CMU Collaborative Research Laboratory Temporal Logics for Analyzing Hybrid Systems Simulation Traces.

Slides:



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

The Quest for Correctness Joseph Sifakis VERIMAG Laboratory 2nd Sogeti Testing Academy April 29th 2009.
Certifying Auto-generated Flight Code Ewen Denney Robust Software Engineering NASA Ames Research Center California, USA.
Part 3: Safety and liveness
Introducing Formal Methods, Module 1, Version 1.1, Oct., Formal Specification and Analytical Verification L 5.
Based on: Petri Nets and Industrial Applications: A Tutorial
CS6133 Software Specification and Verification
Model Checker In-The-Loop Flavio Lerda, Edmund M. Clarke Computer Science Department Jim Kapinski, Bruce H. Krogh Electrical & Computer Engineering MURI.
Greedy Algorithms Be greedy! always make the choice that looks best at the moment. Local optimization. Not always yielding a globally optimal solution.
Run Time Monitoring of Reactive System Models Mikhail Auguston Naval Postgraduate School Mark Trakhtenbrot Holon Academic Institute of.
Spin Tutorial (some verification options). Assertion is always executable and has no other effect on the state of the system than to change the local.
Visual Solution to High Performance Computing Computer and Automation Research Institute Laboratory of Parallel and Distributed Systems
Models and Security Requirements for IDS. Overview The system and attack model Security requirements for IDS –Sensitivity –Detection Analysis methodology.
PTIDES: Programming Temporally Integrated Distributed Embedded Systems Yang Zhao, EECS, UC Berkeley Edward A. Lee, EECS, UC Berkeley Jie Liu, Microsoft.
CSE 555 Protocol Engineering Dr. Mohammed H. Sqalli Computer Engineering Department King Fahd University of Petroleum & Minerals Credits: Dr. Abdul Waheed.
Model Checking. Used in studying behaviors of reactive systems Typically involves three steps: Create a finite state model (FSM) of the system design.
Modeling and the simulator of Digital Circuits in Object-Oriented Programming Stefan Senczyna Department of Fundamentals of Technical Systems The Silesian.
System Design Research Laboratory Model-based Testing and Monitoring for Hybrid Embedded Systems Li Tan Jesung Kim Oleg Sokolsky Insup Lee University of.
ESE601: Hybrid Systems Introduction to verification Spring 2006.
Designing Predictable and Robust Systems Tom Henzinger UC Berkeley and EPFL.
Automata and Formal Lanugages Büchi Automata and Model Checking Ralf Möller based on slides by Chang-Beom Choi Provable Software Lab, KAIST.
School of Computer ScienceG53FSP Formal Specification1 Dr. Rong Qu Introduction to Formal Specification
1 Formal Engineering of Reliable Software LASER 2004 school Tutorial, Lecture1 Natasha Sharygina Carnegie Mellon University.
Simulink ® From Simulink® 7 Getting Started Guide.
Formal verification Marco A. Peña Universitat Politècnica de Catalunya.
DAC June Automatic Trace Analysis for Logic of Constraints Xi Chen, Harry Hsieh University of California, Riverside Felice Balarin, Yosinori Watanabe.
Bottom-Up Integration Testing After unit testing of individual components the components are combined together into a system. Bottom-Up Integration: each.
Cheng/Dillon-Software Engineering: Formal Methods Model Checking.
Static and Dynamic Analysis at JPL Klaus Havelund.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
CIS 842: Specification and Verification of Reactive Systems Lecture Specifications: Sequencing Properties Copyright , Matt Dwyer, John Hatcliff,
Computer Concepts 2014 Chapter 12 Computer Programming.
CS Winter 2010 Tree Sort. Useful Properties of Sorted Data Structures Skip Lists (as well as AVL Trees, and various other data structures we will.
On Reducing the Global State Graph for Verification of Distributed Computations Vijay K. Garg, Arindam Chakraborty Parallel and Distributed Systems Laboratory.
Semi-automatic Property Generation for the Formal Verification of a Satellite On-board System Wesley Gonçalves Silva.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Online Utility-based Supervisory Control of Water Recovery Subsystem in ALS systems Sherif Abdelwahed Wu Jian (presenter) Gautam Biswas Institute for Software.
The New Computing Curriculum An overview. Computing A high-quality computing education equips pupils to use computational thinking and creativity to understand.
September Bound Computation for Adaptive Systems V&V Giampiero Campa September 2008 West Virginia University.
Safety-Critical Systems 5 Testing and V&V T
The basics of the programming process The development of programming languages to improve software development Programming languages that the average user.
CSE 486/586, Spring 2013 CSE 486/586 Distributed Systems Global States Steve Ko Computer Sciences and Engineering University at Buffalo.
Recognizing safety and liveness Presented by Qian Huang.
Defining Liveness by Bowen Alpern and Fred B. Schneider Presented by Joe Melnyk.
- 1 -  P. Marwedel, Univ. Dortmund, Informatik 12, 05/06 Universität Dortmund Validation - Formal verification -
HACNet Simulation-based Validation of Security Protocols Vinay Venkataraghavan Advisors: S.Nair, P.-M. Seidel HACNet Lab Computer Science and Engineering.
Introduction to Simulink Matlab based Both Continuous Time and Discrete Time Simulation Based on Blocksets Model Based Design: a software model of the.
Monitors Chapter Seven Dr. Gheith Abandah1. Outline Monitors Software monitors Hardware monitors Dr. Gheith Abandah2.
Model validity, testing and analysis. Conceptual and Philosophical Foundations Model Validity and Types of Models –Statistical Forecasting models (black.
Priority Queues, Heaps, and Heapsort CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
Lecture 4 Correctness and Fairness Verification and Assurance.
Software Systems Verification and Validation Laboratory Assignment 4 Model checking Assignment date: Lab 4 Delivery date: Lab 4, 5.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
From Natural Language to LTL: Difficulties Capturing Natural Language Specification in Formal Languages for Automatic Analysis Elsa L Gunter NJIT.
CSE 486/586 CSE 486/586 Distributed Systems Global States Steve Ko Computer Sciences and Engineering University at Buffalo.
ICDCS 2006 Efficient Incremental Optimal Chain Partition of Distributed Program Traces Selma Ikiz Vijay K. Garg Parallel and Distributed Systems Laboratory.
CS Class 04 Topics  Selection statement – IF  Expressions  More practice writing simple C++ programs Announcements  Read pages for next.
Skills and products portfolio an overview Lorenzo Martinelli – Business Development Contact:
Priority Queues, Heaps, and Heapsort CSE 2320 – Algorithms and Data Structures Vassilis Athitsos University of Texas at Arlington 1.
The LC-3 – Chapter 6 COMP 2620 Dr. James Money COMP
1 Modeling Formalism (Modeling Language Foundations) System Modeling Assessment & Roadmap Working Group Meeting – SE DSIG Reston – March, 2016 Yves BERNARD.
Aspect Validation: Connecting Aspects and Formal Methods
QGen and TQL-1 Qualification
QGen and TQL Qualification
Generating Optimal Linear Temporal Logic Monitors by Coinduction
ورود اطلاعات بصورت غيربرخط
Software Verification and Validation
Software Verification and Validation
Software Verification and Validation
Presentation transcript:

GM-CMU Collaborative Research Laboratory Temporal Logics for Analyzing Hybrid Systems Simulation Traces

GM-CMU Collaborative Research Laboratory Sources of Simulation Traces VehicleSim : A software simulator for vehicle dynamics Simulation Traces from MATLAB / Simulink Physical testing of vehicles on roads Hybrid Systems Visual Tools: Ptolemy (Berkeley), CHARON (UPenn) VehicleSim Simulator MATLAB Simulink Physical Simulation Visual Tools PTOLEMY CHARON

GM-CMU Collaborative Research Laboratory Temporal Logic We can define “interesting” events and sequence of events. – Event a does not ever happen before event b – Event a is eventually followed by event b – Event a is always accompanied by event b – Event a follows event b within two time steps. Forces definition of formal correctness properties – Easier-to-use sugar-coated versions like Intel’s FORSPEC

GM-CMU Collaborative Research Laboratory Overall System Design VehicleSim Simulator MATLAB Simulink Physical Simulation Visual Tools PTOLEMY CHARON Simulation Trace Temporal Property Automated Trace Analyzer Report

GM-CMU Collaborative Research Laboratory Example Always (a <= b) The value of a never exceeds the value of b. a <= b a > b ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Example Always (a=b  X (c=100) ) If the value of a equals the value of b, then c must take the value 100 in 1 time step. True a = b c!=100 c=100 Trace: a b c ERROR

GM-CMU Collaborative Research Laboratory Research Questions How to capture the continuity of trace data ? How to capture the notion of continuous time? – Do we need a richer yet understandable logic in line with FORSPEC for Hybrid Systems? Online vs. Offline monitoring – If monitoring is offline, can we write efficient algorithms that can “look into the future”

GM-CMU Collaborative Research Laboratory Overall System Design VehicleSim Simulator MATLAB Simulink Physical Simulation Visual Tools PTOLEMY CHARON Simulation Trace Temporal Property Automated Trace Analyzer Report Your inputs?

GM-CMU Collaborative Research Laboratory

GM-CMU Collaborative Research Laboratory Robustness of Hybrid Systems and Simulation Traces If two traces have a prefix equivalent under a “robustness” assumption, we can combine them into an execution tree.