Runtime Model Predictive Verification on Embedded Platforms 1
|
|
- Coral Hood
- 5 years ago
- Views:
Transcription
1 Runtime Model Predictive Verification on Embedded Platforms 1 Pei Zhang, Jianwen Li, Joseph Zambreno, Phillip H. Jones, Kristin Yvonne Rozier Presenter: Pei Zhang Iowa State University peizhang@iastate.edu September 28, Work supported by NASA ECF NNX16AR57G and NSF CAREER Award CNS / 32
2 Overview 1 Introduction Overview 2 Preliminary State Space Model 3 Methodology Hardware Monitor Model Predictive Runtime Verification 4 Evaluation Simulation of MPRV Disturbance Effect WCET Analysis 5 Conclusion 6 Related Work 2 / 32
3 Introduction Motivation Light weight monitor for embedded platform; Unobstrusive to a certified safety-critical system; Providing timely information; Runtime safety monitor 3 / 32
4 Introduction Overview Overview of Design Architecture Controllers Supervisory Controller On-chip Feedback Control Future Time Monitor Environment AP 1 AP n Conversion Function Sensor Figure: High level architecture of model predictive runtime verication. 4 / 32
5 Introduction Overview Overview of Design Architecture Controllers Supervisory Controller Model Predictor Feedback Control On-chip Future Time Monitor Environment AP 1 AP n AP 1 AP m Predictor Model Controller Sensor Figure: High level architecture of model predictive runtime verication. 5 / 32
6 Preliminary Extending LTL for Safety Properties: MLTL Mission-Time Linear Temporal Logic (MLTL) reasons about bounded timelines: finite set of atomic propositions {p q} Boolean connectives:,,, and temporal connectives with time bounds: Symbol Operator Timeline p p p p p [2,6] p Always [2,6] p [0,7] p Eventually [0,7] p p q pu [1,5] q Until [1,5] q q q p,q pr [3,8] q Release [3,8] / 32
7 Preliminary Model Predictive Function F Σ Σ. Definition (Predictive MLTL Semantics) Let π be a finite trace over Σ. The predictive truth value of the MLTL formula ϕ with respect to π, denoted as [π ϕ] p, is an element of {true, false,?} defined as follows: true if π Σ (π F(π) π ) ϕ; [π ϕ] p = false if π Σ (π F(π) π ) / ϕ;? (skip) Otherwise. 7 / 32
8 Preliminary State Space Model State Space Model A discrete state-space model defines what state a system will be in one-time step into the future: x k+1 = Ax k + Bu k (1) y k = Cx k + Du k (2) x k represents the state of the system at time k u k represents the input acting on the system at time k y k represents outputs of the system at time k A is a matrix that defines the internal dynamics of the system B is a matrix that defines how the input acting upon the system impact its state C is a matrix that transforms states of the system into outputs (y k ) 8 / 32
9 Methodology Hardware Monitor Abstract Syntax Tree (AST) Q: How can we check MLTL satisfication in hardware? Compile the MLTL formula into assembly code: e.g. [0,2] (!a0) Line 0 Line 1 Line 2 s0 load (a0, time) s1 s0 s2 [0,2] s1 Each instruction are stored in a data structure called Shared Connection Queue (SCQ). 9 / 32
10 Methodology Hardware Monitor Computation Core CORE Instruction Memory FSM PC RAW Sensor Signals (binary) Filters AP[1] Var Mem ATOMICs... v1 v2... L / / U AP[N] Queue Management PTR τ e I1 I1 I2 I SCQ I1 I2... L LOAD NEGATE / AND/OR RAM / GLOBAL/FUTURE U UNTIL Empty Increase PC Fetch Instruction Search SCQ Find Data Observer Algorithm Write Back (a) Observer Processing Core. (b) State machine transitions. Figure: Hardware design for embedded MLTL observer processor. 10 / 32
11 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 1 Convert sensor data into atomic propositions (APs) using predefined atomic conversion functions. 11 / 32
12 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 2 Observer processing core conducts runtime verification over the newly received APs. 12 / 32
13 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 3 Model Predictive Control (MPC) for a specified prediction horizon length is executed to estimate future states of the system. 13 / 32
14 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 4 Contents of the SCQs are cached. 14 / 32
15 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 5 Observer processing core conducts runtime verification over the generated trace of estimated future system states. 15 / 32
16 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 6 Restore cached SCQs contents. Thereby, placing the observer processing core back into its original state. 16 / 32
17 Methodology Model Predictive Runtime Verification Model Predictive Runtime Verification Processing Flow 1 Read Sensor 3 2 Model Prediction Runtime Verification Cache Restore Step 7 Return to step 1), once the next sensor sampling period starts. 17 / 32
18 Evaluation Simulation of MPRV MPRV on Moving a Point Mass Position (m) position planned trajectory Time (s) Figure: Model predictive control of the height of a point mass. Control input force [-1N, 1N]. Cost weighting: 2 with the error in mass position and 1 with its speed. Prediction horizon: 100. Controller actuation update rate to 10 Hz. a0: absolute speed < 0.1m/s. a1: absolute value of trajectory error < 0.08m. 18 / 32
19 Evaluation Simulation of MPRV True ( [5]a1) a0 False No Prediction Predict 10 (1.0s) Predict 50 (5.0s) Time (sec) Figure: MPRV responsiveness for different prediction horizons: No prediction, 10 steps (1s), 50 steps (5s). True a1 U [5,20]a0 False No Prediction Predict 10 (1.0s) Predict 50 (5.0s) Time (sec) 19 / 32
20 Evaluation Simulation of MPRV Disturbance Position (m) position planned trajectory Time (s) Figure: Unexpected disturbance taken place during control. The disturbance is marked in by the yellow rectangle. an external disturbance force being applied at time 14.6s and 35.0s. a0: absolute speed < 0.5m/s. a1: absolute value of trajectory error < 0.04m. 20 / 32
21 Evaluation Simulation of MPRV Disturbance Position (m) position planned trajectory Time (s) True a1 [15]a0 False No Prediction Predict 50 (5.0s) Time (sec) Figure: Comparasion between MPRV and normal RV with disturbance. 21 / 32
22 Evaluation Simulation of MPRV Disturbance Position (m) position planned trajectory Time (s) True a1 [15]a0 False No Prediction Predict 50 (5.0s) Time (sec) Figure: Comparasion between MPRV and normal RV with disturbance. 22 / 32
23 Evaluation Simulation of MPRV Utilize the MPRV Predictions under Disturbance 1 Case 1: Disturbance instantly breaks MLTL rule. 2 Case 2: Disturbance does not instantly break the MLTL rule. 3 Case 3: Disturbance adverts the system from breaking the MLTL in the future. 23 / 32
24 Evaluation Simulation of MPRV Sensor Noise and Prediction Horizon Length 100% 80% 100% 80% Accuracy 60% 40% 20% 0% a0 a1 a2 a4 [15] a1 [15] a1 [15] a4 ( [5] a3) a1 (a3 U [5,20] a1) Noise Standard Deviation Accuracy 60% 40% 20% 0% a0 a1 a2 a4 [15] a1 [15] a1 [15] a4 ( [5] a3) a1 (a3 U [5,20] a1) Prediction Step Length (P) (a) Sensor noise impact on MPRV accuracy. Prediction horizon length is 10 (1s) (b) Prediction horizon length impact on MPRV accuracy. Sensor noise standard deviation is Figure: Impact of sensor noise and prediction horizon length on MPRV accuracy. a0: absolute value of trajectory error < 0.04m a1: absolute value of trajectory error < 0.08m a2: absolute value of trajectory error < 0.20m a3: absolute speed > 0.6 m/s a4: position > 1.0 m/s 24 / 32
25 Evaluation WCET Analysis Worst Case Execution Time (WCET) Analysis where, N.t = t basic + t loop N.X C N.X (3) (N.iSCQ) N.X = P + 1 N is binary operator N is unary operator t basic is the time for Fetch Instruction and Increase PC etc. in Fig. 3(b) t loop is the time for Observer Algorithm C is a constant associated with the hardware computation core pipeline. In our design, the execution time is bounded by C = 24e 8 (unit: second) 2. (4) 2 Based on our hardware running at a clock frequency of 100 MHz. 25 / 32
26 Evaluation WCET Analysis a0 3[15] a0 800 (3[15] a3) a1 600 N (N.X ) (3[50] a3) a1 (a3 U[5,20] a1) (3[20] a4) (a3 U[5,20] a1) U[10,15] a Prediction Step Length (P) 100 Figure: Relationship between N.X and prediction horizon length for MLTL formulas of varying complexity. MPRV computational complexity: O(max(S, n P)), S is the total SCQ memory usage, n is the total number of operators, P is the prediction step length. 26 / 32
27 Conclusion Summary of Work The primary contribution of this work is providing predictive runtime verificaiton based on system model: extension to an existing state-of-the-art RV tool, R2U2; better mitigation of faults by enabling future-time requirements to be evaluated; hardware realiable by bounding resource usage; 27 / 32
28 Conclusion The End 28 / 32
29 Conclusion References I Ebru Aydin Gol, Mircea Lazar, and Calin Belta, Temporal logic model predictive control, Automatica 56 (2015), Hong Lu and Alessandro Forin, The design and implementation of p2v, an architecture for zero-overhead online verification of software programs, Tech. Report MSR-TR , Microsoft Research, August Gary Nutt, Tutorial: Computer system monitors, Computer 8 (1975), no. 11, R. Pellizzoni, P. Meredith, M. Caccamo, and G. Rosu, Hardware runtime monitoring for dependable cots-based real-time embedded systems, 2008 Real-Time Systems Symposium, Nov 2008, pp / 32
30 Conclusion References II Vasumathi Raman, Alexandre Donzé, Mehdi Maasoumy, Richard M Murray, Alberto Sangiovanni-Vincentelli, and Sanjit A Seshia, Model predictive control with signal temporal logic specifications, Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on, IEEE, 2014, pp Thomas Reinbacher, Kristin Yvonne Rozier, and Johann Schumann, Temporal-logic based runtime observer pairs for system health management of real-time systems, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer, 2014, pp / 32
31 Related Work Hardware Monitor for Temporal Logic Related Hardware Monitor: 1975 as Nutt [Nut75] proposed using hardware to monitor computer systems. An FPGA-based hardware monitor, called BusMOP [PMCR08]. Hong created an automated tool, called P2V [LF07]. R2U2: soft-coded hardware monitor [RRS14]. 31 / 32
32 Related Work Predictive Runtime Verification Interdisciplinary work between RV and control. Model Predictive Control with Signal Temporal Logic Specifications [RDM + 14]. Temporal logic model predictive control [GLB15] 32 / 32
Course Runtime Verification
Course Martin Leucker (ISP) Volker Stolz (Høgskolen i Bergen, NO) INF5140 / V17 Chapters of the Course Chapter 1 Recall in More Depth Chapter 2 Specification Languages on Words Chapter 3 LTL on Finite
More informationNCU EE -- DSP VLSI Design. Tsung-Han Tsai 1
NCU EE -- DSP VLSI Design. Tsung-Han Tsai 1 Multi-processor vs. Multi-computer architecture µp vs. DSP RISC vs. DSP RISC Reduced-instruction-set Register-to-register operation Higher throughput by using
More informationarxiv: v1 [cs.ro] 12 Mar 2019
Arithmetic-Geometric Mean Robustness for Control from Signal Temporal Logic Specifications *Noushin Mehdipour, *Cristian-Ioan Vasile and Calin Belta arxiv:93.5v [cs.ro] Mar 9 Abstract We present a new
More informationOnline Horizon Selection in Receding Horizon Temporal Logic Planning
Online Horizon Selection in Receding Horizon Temporal Logic Planning Vasumathi Raman 1 and Mattias Fält 2 and Tichakorn Wongpiromsarn 3 and Richard M. Murray 1 Abstract Temporal logics have proven effective
More informationPreface. Motivation and Objectives
Preface Motivation and Objectives In control theory, complex models of physical processes, such as systems of differential or difference equations, are usually checked against simple specifications, such
More informationVerification. Arijit Mondal. Dept. of Computer Science & Engineering Indian Institute of Technology Patna
IIT Patna 1 Verification Arijit Mondal Dept. of Computer Science & Engineering Indian Institute of Technology Patna arijit@iitp.ac.in Introduction The goal of verification To ensure 100% correct in functionality
More informationModel Checking: An Introduction
Model Checking: An Introduction Meeting 3, CSCI 5535, Spring 2013 Announcements Homework 0 ( Preliminaries ) out, due Friday Saturday This Week Dive into research motivating CSCI 5535 Next Week Begin foundations
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationExploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units
Exploring the Potential of Instruction-Level Parallelism of Exposed Datapath Architectures with Buffered Processing Units Anoop Bhagyanath and Klaus Schneider Embedded Systems Chair University of Kaiserslautern
More informationFPGA Implementation of a Predictive Controller
FPGA Implementation of a Predictive Controller SIAM Conference on Optimization 2011, Darmstadt, Germany Minisymposium on embedded optimization Juan L. Jerez, George A. Constantinides and Eric C. Kerrigan
More informationPredicting Time-Delays under Real-Time Scheduling for Linear Model Predictive Control
23 International Conference on Computing, Networking and Communications, Workshops Cyber Physical System Predicting Time-Delays under Real-Time Scheduling for Linear Model Predictive Control Zhenwu Shi
More informationTime-Constrained Temporal Logic Control of Multi-Affine Systems
Time-Constrained Temporal Logic Control of Multi-Affine Systems Ebru Aydin Gol Calin Belta Boston University, Boston, MA 02215, USA e-mail: {ebru,cbelta}@bu.edu Abstract: We consider the problem of controlling
More informationFormal Verification of Systems-on-Chip
Formal Verification of Systems-on-Chip Wolfgang Kunz Department of Electrical & Computer Engineering University of Kaiserslautern, Germany Slide 1 Industrial Experiences Formal verification of Systems-on-Chip
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 13: Specification and
More informationFailure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements
Failure Diagnosis of Discrete-Time Stochastic Systems subject to Temporal Logic Correctness Requirements Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Dept. of Elec. & Comp. Eng., Iowa
More informationSpecification Mining of Industrial-scale Control Systems
100 120 Specification Mining of Industrial-scale Control Systems Alexandre Donzé Joint work with Xiaoqing Jin, Jyotirmoy V. Deshmuck, Sanjit A. Seshia University of California, Berkeley May 14, 2013 Alexandre
More informationOnline Model Predictive Torque Control for Permanent Magnet Synchronous Motors
Online Model Predictive Torque Control for Permanent Magnet Synchronous Motors Gionata Cimini, Daniele Bernardini, Alberto Bemporad and Stephen Levijoki ODYS Srl General Motors Company 2015 IEEE International
More informationFinite-State Model Checking
EECS 219C: Computer-Aided Verification Intro. to Model Checking: Models and Properties Sanjit A. Seshia EECS, UC Berkeley Finite-State Model Checking G(p X q) Temporal logic q p FSM Model Checker Yes,
More informationFormal Fault Analysis of Branch Predictors: Attacking countermeasures of Asymmetric key ciphers
Formal Fault Analysis of Branch Predictors: Attacking countermeasures of Asymmetric key ciphers Sarani Bhattacharya and Debdeep Mukhopadhyay Indian Institute of Technology Kharagpur PROOFS 2016 August
More informationProvably Correct Persistent Surveillance for Unmanned Aerial Vehicles Subject to Charging Constraints
Provably Correct Persistent Surveillance for Unmanned Aerial Vehicles Subject to Charging Constraints Kevin Leahy, Dingjiang Zhou, Cristian-Ioan Vasile, Konstantinos Oikonomopoulos, Mac Schwager, and Calin
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationFall 2008 CSE Qualifying Exam. September 13, 2008
Fall 2008 CSE Qualifying Exam September 13, 2008 1 Architecture 1. (Quan, Fall 2008) Your company has just bought a new dual Pentium processor, and you have been tasked with optimizing your software for
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationState-Space Exploration. Stavros Tripakis University of California, Berkeley
EE 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2014 State-Space Exploration Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE
More informationCSE507. Course Introduction. Computer-Aided Reasoning for Software. Emina Torlak
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/14au/ Course Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review
More informationCompiling Techniques
Lecture 11: Introduction to 13 November 2015 Table of contents 1 Introduction Overview The Backend The Big Picture 2 Code Shape Overview Introduction Overview The Backend The Big Picture Source code FrontEnd
More informationIntroduction to Model Checking. Debdeep Mukhopadhyay IIT Madras
Introduction to Model Checking Debdeep Mukhopadhyay IIT Madras How good can you fight bugs? Comprising of three parts Formal Verification techniques consist of three parts: 1. A framework for modeling
More informationComp487/587 - Boolean Formulas
Comp487/587 - Boolean Formulas 1 Logic and SAT 1.1 What is a Boolean Formula Logic is a way through which we can analyze and reason about simple or complicated events. In particular, we are interested
More informationEAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties
EAHyper: Satisfiability, Implication, and Equivalence Checking of Hyperproperties Bernd Finkbeiner, Christopher Hahn, and Marvin Stenger Saarland Informatics Campus, Saarland University, Saarbrücken, Germany
More informationSENSE: Abstraction-Based Synthesis of Networked Control Systems
SENSE: Abstraction-Based Synthesis of Networked Control Systems Mahmoud Khaled, Matthias Rungger, and Majid Zamani Hybrid Control Systems Group Electrical and Computer Engineering Technical University
More informationChapter 3. Digital Design and Computer Architecture, 2 nd Edition. David Money Harris and Sarah L. Harris. Chapter 3 <1>
Chapter 3 Digital Design and Computer Architecture, 2 nd Edition David Money Harris and Sarah L. Harris Chapter 3 Chapter 3 :: Topics Introduction Latches and Flip-Flops Synchronous Logic Design Finite
More informationANALYZING REAL TIME LINEAR CONTROL SYSTEMS USING SOFTWARE VERIFICATION. Parasara Sridhar Duggirala UConn Mahesh Viswanathan UIUC
ANALYZING REAL TIME LINEAR CONTROL SYSTEMS USING SOFTWARE VERIFICATION Parasara Sridhar Duggirala UConn Mahesh Viswanathan UIUC Real-Time Systems Linear Control Systems Verification Verification Control
More informationOn Real-time Monitoring with Imprecise Timestamps
On Real-time Monitoring with Imprecise Timestamps David Basin 1, Felix Klaedtke 2, Srdjan Marinovic 1, and Eugen Zălinescu 1 1 Institute of Information Security, ETH Zurich, Switzerland 2 NEC Europe Ltd.,
More informationICS 233 Computer Architecture & Assembly Language
ICS 233 Computer Architecture & Assembly Language Assignment 6 Solution 1. Identify all of the RAW data dependencies in the following code. Which dependencies are data hazards that will be resolved by
More informationMotion planning applications of Satisfiability Modulo Convex Optimization
Motion planning applications of Satisfiability Modulo Convex Optimization Yasser Shoukry (1) and Paulo Tabuada (2) (1) Department of Electrical and Computer Engineering, UMD (2) Electrical and Computer
More informationOptimal Control of Mixed Logical Dynamical Systems with Linear Temporal Logic Specifications
Optimal Control of Mixed Logical Dynamical Systems with Linear Temporal Logic Specifications Sertac Karaman, Ricardo G. Sanfelice, and Emilio Frazzoli Abstract Recently, Linear Temporal Logic (LTL) has
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationFAULT-TOLERANT CONTROL OF CHEMICAL PROCESS SYSTEMS USING COMMUNICATION NETWORKS. Nael H. El-Farra, Adiwinata Gani & Panagiotis D.
FAULT-TOLERANT CONTROL OF CHEMICAL PROCESS SYSTEMS USING COMMUNICATION NETWORKS Nael H. El-Farra, Adiwinata Gani & Panagiotis D. Christofides Department of Chemical Engineering University of California,
More informationLinear Temporal Logic (LTL)
Chapter 9 Linear Temporal Logic (LTL) This chapter introduces the Linear Temporal Logic (LTL) to reason about state properties of Labelled Transition Systems defined in the previous chapter. We will first
More informationDigital System Clocking: High-Performance and Low-Power Aspects. Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M.
Digital System Clocking: High-Performance and Low-Power Aspects Vojin G. Oklobdzija, Vladimir M. Stojanovic, Dejan M. Markovic, Nikola M. Nedovic Wiley-Interscience and IEEE Press, January 2003 Nov. 14,
More informationCMP 338: Third Class
CMP 338: Third Class HW 2 solution Conversion between bases The TINY processor Abstraction and separation of concerns Circuit design big picture Moore s law and chip fabrication cost Performance What does
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationCSE507. Introduction. Computer-Aided Reasoning for Software. Emina Torlak courses.cs.washington.edu/courses/cse507/17wi/
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/17wi/ Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review of
More informationMotion Planning for LTL Specifications: A Satisfiability Modulo Convex Optimization Approach
Motion Planning for LTL Specifications: A Satisfiability Modulo Convex Optimization Approach Yasser Shoukry UC Berkeley, UCLA, and UPenn Joint work with Pierluigi Nuzzo (UC Berkeley), Indranil Saha (IIT
More informationExploiting System Structure in Formal Synthesis
CDC 2015 Pre-Conference Workshop Exploiting System Structure in Formal Synthesis Murat Arcak with Sam Coogan and Eric Kim Electrical Engineering and Computer Sciences, UC Berkeley This Talk: Formal synthesis,
More informationFinite State Machine (FSM)
Finite State Machine (FSM) Consists of: State register Stores current state Loads next state at clock edge Combinational logic Computes the next state Computes the outputs S S Next State CLK Current State
More informationOperational Semantics
Operational Semantics Semantics and applications to verification Xavier Rival École Normale Supérieure Xavier Rival Operational Semantics 1 / 50 Program of this first lecture Operational semantics Mathematical
More informationINF2270 Spring Philipp Häfliger. Lecture 8: Superscalar CPUs, Course Summary/Repetition (1/2)
INF2270 Spring 2010 Philipp Häfliger Summary/Repetition (1/2) content From Scalar to Superscalar Lecture Summary and Brief Repetition Binary numbers Boolean Algebra Combinational Logic Circuits Encoder/Decoder
More informationTennis player segmentation for semantic behavior analysis
Proposta di Tennis player segmentation for semantic behavior analysis Architettura Software per Robot Mobili Vito Renò, Nicola Mosca, Massimiliano Nitti, Tiziana D Orazio, Donato Campagnoli, Andrea Prati,
More informationLecture 13. Real-Time Scheduling. Daniel Kästner AbsInt GmbH 2013
Lecture 3 Real-Time Scheduling Daniel Kästner AbsInt GmbH 203 Model-based Software Development 2 SCADE Suite Application Model in SCADE (data flow + SSM) System Model (tasks, interrupts, buses, ) SymTA/S
More informationEmbedded Systems Development
Embedded Systems Development Lecture 3 Real-Time Scheduling Dr. Daniel Kästner AbsInt Angewandte Informatik GmbH kaestner@absint.com Model-based Software Development Generator Lustre programs Esterel programs
More informationCS156: The Calculus of Computation
CS156: The Calculus of Computation Zohar Manna Winter 2010 It is reasonable to hope that the relationship between computation and mathematical logic will be as fruitful in the next century as that between
More informationCS 700: Quantitative Methods & Experimental Design in Computer Science
CS 700: Quantitative Methods & Experimental Design in Computer Science Sanjeev Setia Dept of Computer Science George Mason University Logistics Grade: 35% project, 25% Homework assignments 20% midterm,
More informationCase Studies of Logical Computation on Stochastic Bit Streams
Case Studies of Logical Computation on Stochastic Bit Streams Peng Li 1, Weikang Qian 2, David J. Lilja 1, Kia Bazargan 1, and Marc D. Riedel 1 1 Electrical and Computer Engineering, University of Minnesota,
More informationEfficient Robust Monitoring for STL
100 120 Efficient Robust Monitoring for STL Alexandre Donzé 1, Thomas Ferrère 2, Oded Maler 2 1 University of California, Berkeley, EECS dept 2 Verimag, CNRS and Grenoble University May 28, 2013 Efficient
More informationDistributed and Real-time Predictive Control
Distributed and Real-time Predictive Control Melanie Zeilinger Christian Conte (ETH) Alexander Domahidi (ETH) Ye Pu (EPFL) Colin Jones (EPFL) Challenges in modern control systems Power system: - Frequency
More informationSynthesis of Nonlinear Control of Switching Topologies of Buck-Boost Converter Using Fuzzy Logic on Field Programmable Gate Array (FPGA)
Journal of Intelligent Learning Systems and Applications, 2010, 2: 36-42 doi:10.4236/jilsa.2010.21005 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Synthesis of Nonlinear Control
More informationEE241 - Spring 2006 Advanced Digital Integrated Circuits
EE241 - Spring 2006 Advanced Digital Integrated Circuits Lecture 20: Asynchronous & Synchronization Self-timed and Asynchronous Design Functions of clock in synchronous design 1) Acts as completion signal
More informationUsing Patterns and Composite Propositions to Automate the Generation of LTL Specifications
Using Patterns and Composite Propositions to Automate the Generation of LTL Specifications Salamah Salamah, Ann Q. Gates, Vladik Kreinovich, and Steve Roach Dept. of Computer Science, University of Texas
More informationStatistical Model Checking Applied on Perception and Decision-making Systems for Autonomous Driving
Statistical Model Checking Applied on Perception and Decision-making Systems for Autonomous Driving J. Quilbeuf 1 M. Barbier 2,3 L. Rummelhard 3 C. Laugier 2 A. Legay 1 T. Genevois 2 J. Ibañez-Guzmán 3
More information19. Extending the Capacity of Formal Engines. Bottlenecks for Fully Automated Formal Verification of SoCs
19. Extending the Capacity of Formal Engines 1 19. Extending the Capacity of Formal Engines Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin Verification
More informationONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies. Calin Belta
ONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies Provable safety for animal inspired agile flight Calin Belta Hybrid and Networked Systems (HyNeSs) Lab Department of
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationarxiv: v1 [cs.sy] 26 Mar 2012
Time-Constrained Temporal Logic Control of Multi-Affine Systems Ebru Aydin Gol Calin Belta Boston University, Boston, MA 02215, USA e-mail: {ebru,cbelta}@bu.edu arxiv:1203.5683v1 [cs.sy] 26 Mar 2012 Abstract:
More informationRevising UNITY Programs: Possibilities and Limitations 1
Revising UNITY Programs: Possibilities and Limitations 1 Ali Ebnenasir, Sandeep S. Kulkarni, and Borzoo Bonakdarpour Software Engineering and Network Systems Laboratory Department of Computer Science and
More informationCPSC 3300 Spring 2017 Exam 2
CPSC 3300 Spring 2017 Exam 2 Name: 1. Matching. Write the correct term from the list into each blank. (2 pts. each) structural hazard EPIC forwarding precise exception hardwired load-use data hazard VLIW
More informationECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University
ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University Prof. Mi Lu TA: Ehsan Rohani Laboratory Exercise #4 MIPS Assembly and Simulation
More informationLTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees Xu Chu (Dennis) Ding Stephen L. Smith Calin Belta Daniela Rus Department of Mechanical Engineering, Boston University, Boston,
More informationSafety and Reliability of Embedded Systems. (Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues
(Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues Content What are Events? Examples for Problematic Event Semantics Inhibit, Enabler / Conditioning
More informationChapter 3. Chapter 3 :: Topics. Introduction. Sequential Circuits
Chapter 3 Chapter 3 :: Topics igital esign and Computer Architecture, 2 nd Edition avid Money Harris and Sarah L. Harris Introduction Latches and Flip Flops Synchronous Logic esign Finite State Machines
More informationQuantum Computing Approach to V&V of Complex Systems Overview
Quantum Computing Approach to V&V of Complex Systems Overview Summary of Quantum Enabled V&V Technology June, 04 Todd Belote Chris Elliott Flight Controls / VMS Integration Discussion Layout I. Quantum
More informationTracking board design for the SHAGARE stratospheric balloon project. Supervisor : René Beuchat Student : Joël Vallone
Tracking board design for the SHAGARE stratospheric balloon project Supervisor : René Beuchat Student : Joël Vallone Motivation Send & track a gamma-ray sensor in the stratosphere with a meteorological
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationFormal Synthesis of Embedded Control Software: Application to Vehicle Management Systems
Formal Synthesis of Embedded Control Software: Application to Vehicle Management Systems T. Wongpiromsarn, U. Topcu, and R. M. Murray Control and Dynamical Systems, California Institute of Technology,
More informationLinear-time Temporal Logic
Linear-time Temporal Logic Pedro Cabalar Department of Computer Science University of Corunna, SPAIN cabalar@udc.es 2015/2016 P. Cabalar ( Department Linear oftemporal Computer Logic Science University
More informationDynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics
Dynamic Semantics Operational Semantics Denotational Semantic Dynamic Semantics Operational Semantics Operational Semantics Describe meaning by executing program on machine Machine can be actual or simulated
More informationA brief history of model checking. Ken McMillan Cadence Berkeley Labs
A brief history of model checking Ken McMillan Cadence Berkeley Labs mcmillan@cadence.com Outline Part I -- Introduction to model checking Automatic formal verification of finite-state systems Applications
More informationCS470: Computer Architecture. AMD Quad Core
CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationDesign and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources
Design and Analysis of Time-Critical Systems Response-time Analysis with a Focus on Shared Resources Jan Reineke @ saarland university ACACES Summer School 2017 Fiuggi, Italy computer science Fixed-Priority
More informationLecture 16: Computation Tree Logic (CTL)
Lecture 16: Computation Tree Logic (CTL) 1 Programme for the upcoming lectures Introducing CTL Basic Algorithms for CTL CTL and Fairness; computing strongly connected components Basic Decision Diagrams
More informationLecture 13: Sequential Circuits, FSM
Lecture 13: Sequential Circuits, FSM Today s topics: Sequential circuits Finite state machines 1 Clocks A microprocessor is composed of many different circuits that are operating simultaneously if each
More informationCS156: The Calculus of Computation Zohar Manna Autumn 2008
Page 3 of 52 Page 4 of 52 CS156: The Calculus of Computation Zohar Manna Autumn 2008 Lecturer: Zohar Manna (manna@cs.stanford.edu) Office Hours: MW 12:30-1:00 at Gates 481 TAs: Boyu Wang (wangboyu@stanford.edu)
More informationIntroduction to Artificial Intelligence Propositional Logic & SAT Solving. UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010
Introduction to Artificial Intelligence Propositional Logic & SAT Solving UIUC CS 440 / ECE 448 Professor: Eyal Amir Spring Semester 2010 Today Representation in Propositional Logic Semantics & Deduction
More informationAccurate Estimation of Cache-Related Preemption Delay
Accurate Estimation of Cache-Related Preemption Delay Hemendra Singh Negi Tulika Mitra Abhik Roychoudhury School of Computing National University of Singapore Republic of Singapore 117543. [hemendra,tulika,abhik]@comp.nus.edu.sg
More informationTiming Issues. Digital Integrated Circuits A Design Perspective. Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolić. January 2003
Digital Integrated Circuits A Design Perspective Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolić Timing Issues January 2003 1 Synchronous Timing CLK In R Combinational 1 R Logic 2 C in C out Out 2
More informationUsing Patterns and Composite Propositions to Automate the Generation of Complex LTL Specifications
Using Patterns and Composite Propositions to Automate the Generation of Complex LTL Specifications Salamah Salamah, Ann Q. Gates, Vladik Kreinovich, and Steve Roach Dept. of Computer Science, University
More informationComputational Complexity and Intractability: An Introduction to the Theory of NP. Chapter 9
1 Computational Complexity and Intractability: An Introduction to the Theory of NP Chapter 9 2 Objectives Classify problems as tractable or intractable Define decision problems Define the class P Define
More informationww.padasalai.net
t w w ADHITHYA TRB- TET COACHING CENTRE KANCHIPURAM SUNDER MATRIC SCHOOL - 9786851468 TEST - 2 COMPUTER SCIENC PG - TRB DATE : 17. 03. 2019 t et t et t t t t UNIT 1 COMPUTER SYSTEM ARCHITECTURE t t t t
More informationCS/COE0447: Computer Organization
CS/COE0447: Computer Organization and Assembly Language Logic Design Review Sangyeun Cho Dept. of Computer Science Logic design? Digital hardware is implemented by way of logic design Digital circuits
More informationA Multi-Periodic Synchronous Data-Flow Language
Julien Forget 1 Frédéric Boniol 1 David Lesens 2 Claire Pagetti 1 firstname.lastname@onera.fr 1 ONERA - Toulouse, FRANCE 2 EADS Astrium Space Transportation - Les Mureaux, FRANCE November 19, 2008 1 /
More informationWorst-Case Execution Time Analysis. LS 12, TU Dortmund
Worst-Case Execution Time Analysis Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 02, 03 May 2016 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 53 Most Essential Assumptions for Real-Time Systems Upper
More informationModel checking the basic modalities of CTL with Description Logic
Model checking the basic modalities of CTL with Description Logic Shoham Ben-David Richard Trefler Grant Weddell David R. Cheriton School of Computer Science University of Waterloo Abstract. Model checking
More informationAutomata-based Verification - III
CS3172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20/22: email: howard.barringer@manchester.ac.uk March 2005 Third Topic Infinite Word Automata Motivation Büchi Automata
More informationLow-Complexity Switching Controllers for Safety using Symbolic Models
Low-Complexity Switching Controllers for Safety using Symbolic Models Antoine Girard Laboratoire Jean Kuntzmann, Université de Grenoble, B.P. 53, 38041 Grenoble, France (e-mail: Antoine.Girard@imag.fr).
More informationTHE classical objectives considered in automatic control
Control Barrier Functions for Signal Temporal Logic Tasks Lars Lindemann, Student Member, IEEE, and Dimos V. Dimarogonas, Senior Member, IEEE Abstract The need for computationally-efficient control methods
More information3. (2) What is the difference between fixed and hybrid instructions?
1. (2 pts) What is a "balanced" pipeline? 2. (2 pts) What are the two main ways to define performance? 3. (2) What is the difference between fixed and hybrid instructions? 4. (2 pts) Clock rates have grown
More informationCS 267: Automated Verification. Lecture 1: Brief Introduction. Transition Systems. Temporal Logic LTL. Instructor: Tevfik Bultan
CS 267: Automated Verification Lecture 1: Brief Introduction. Transition Systems. Temporal Logic LTL. Instructor: Tevfik Bultan What do these people have in common? 2013 Leslie Lamport 2007 Clarke, Edmund
More informationAnalog Circuit Verification by Statistical Model Checking
16 th Asian Pacific Design Automation ti Conference Analog Circuit Verification by Statistical Model Checking Author Ying-Chih Wang (Presenter) Anvesh Komuravelli Paolo Zuliani Edmund M. Clarke Date 2011/1/26
More information