Hybrid Systems Analysis of Periodic Control Systems using Continuization
|
|
- Sabrina Carpenter
- 6 years ago
- Views:
Transcription
1 Hybrid Systems Analysis of Periodic Control Systems using Continuization Stanley Bak Air Force Research Lab Information Directorate June 2015 DISTRIBUTION A. Approved for public release; Distribution unlimited. (Approval AFRL PA # 88ABW , 26 May 2015)
2 Outline Background: RTA and Hybrid Automata Periodically controlled Cyber-Physical Systems Continuization for Analysis 2
3 Run-Time Assurance Run-Time Assurance (RTA) methods protect an untrusted controller with a verified backup The key for safe RTA mechanisms is guarantees the switch to the backup happens while it can still recover RTA Architecture 3
4 RTA Design Extensive Simulation Solving Linear Matrix Inequalities Hybrid Systems Reachability *More details in Sandboxing Controllers for Cyber-Physical Systems, Bak et al., ICCPS
5 Hybrid Automaton Model for of continuous/discrete computation Simulation Reachability 5
6 X (temperature) Flowpipe Construction Flowpipe construction explores the reachable states symbolically θ highest θ high θ low θ lowest Post C Post C Post C Post C Intersection Intersection Intersection Computation Steps 6
7 Continuous Post Track sets of states at different instants in time Continuous Post Operation 7
8 Intersection Overapproximate tracked states when performing intersection operations Leads to some error Overapproximation for Intersection 8
9 Outline Background: RTA and Hybrid Automata Periodically controlled Cyber-Physical Systems Continuization for Analysis 9
10 Periodic Control System Apply a digital controller to a physical system Depending on the implementation, different hybrid automaton representation Strictly Periodic Real-time Scheduled* 10
11 Periodic Control System Reachability Reachability tools experience error on each discrete transition Periodic control systems have lots of discrete transitions Controller may run tens or hundreds of times per second 11
12 Example Simple system: point moving along a line x = vel vel = accel (accel is a PD-controller) Controlled at 20 Hz (T=0.05) Reachability from x=[0,0.1] SpaceEx: Scalable Verification of Hybrid Systems, Frehse et al., CAV 2011 Flow*: An Analyzer for Non-Linear Hybrid Systems, Chen et al., CAV
13 Outline Background: RTA and Hybrid Automata Periodically controlled Cyber-Physical Systems Continuization for Analysis 13
14 Continuization Approximate a quickly-switching discrete system by a continuous system with bounded noise (nondeterminism) Previously used to analyze properties about hardware circuits (phase-locked loops) Key challenge: how much nondeterminism? Formal Verification of Phase-Locked Loops using Reachability Analysis and Continuization, Althoff et al., CACM
15 Continuization of a Sine Wave controller_update(t) = sin(t) t in [0, π] Controller period, T =
16 Process for Sine Wave Example 1. Derivative of sin(t) is cos(t) 2. Bound on cos(t) from 0 to π is K=[-1, 1] 3. Maximum deviation is [-T, 0] * K = [-0.2, 0] * [-1, 1] = [-0.2, 0.2] 16
17 Local Analysis Domains - Example Bound in each domain is [-T, 0] * K i Domains overlap by T = 0.2 (why?) 17
18 Observations Accuracy can be improved either through local analysis domains, or by considering smaller periods (multiply by [-T, 0]) Contrast with reachability of direct models Intuitively, sampling at a higher frequency more closely matches the continuous system Trade-off of analysis domains versus number of discrete transitions (time-triggered support) The continuized system also accounts for variations from real-time scheduling 18
19 Point-Line Example (accuracy can be improved either through local analysis domains, or by considering smaller periods) 19
20 Domain Checks Process is : (1) symbolic derivative (2) compute bounds K in domain (3) multiply [-T, 0] * K Step (2) can be tricky, since if the domain is wrong, the bounds will be wrong. 20
21 Domain Check - Line-Point Example Derivative is vel + 30*x 30, what ranges of x and vel should be considered? Chicken and egg problem X range is [0.05, 1.18] X range is [0, 1.45] 21
22 Domain Check - Line-Point Example (2) Solution: (1) iteratively try bigger values and (2) add check to reachability analysis to ensure domains are respected Both x and velocity domains were too small, and this was detected by the tool. 22
23 Hyst Implementation Continuization was implemented in the Hyst model transformation tool. Input is: Hybrid Automaton Model Description File Controller period T Periodically-Controlled Variable Name Symbolic Derivative (for now) Times for Analysis Domains Bloating Terms for Analysis Domains Time Variable Name (optional) Hyst: A Source Transformation and Translation Tool for Hybrid Automaton Models, Bak et al., HSCC
24 Yaw-Damper for a 747 Aircraft Case study from Matlab control systems toolbox LTI dynamics, MIMO system 2 inputs (rudder, aileron); 2 outputs (yaw rate, bank angle); 5 internal states (sideslip angle, yaw rate, roll rate, bank angle, and washout filter variable) Control goal: prevent oscillations while maintaining spiral mode in aileron-to-bank angle impulse response Yaw Damper Design for a 747 Jet Aircraft 24
25 Yaw-Damper Direct Reachability The spiral mode is the apparent offset in the steady-state in the aileton-to-bank angle impulse response We analyze a real-time scheduled periodic version of this model running at T=0.005 (200Hz) 25
26 Yaw-Damper with Continuization 26
27 Future Directions Local analysis domains based on system state, not just time Automation of iterative approach for domain splitting and choice of bloat terms Different way to analyze controllers than classical control theory; what about design? Application on Toyota Powertrain Benchmark Powertrain control verification benchmark, Jin et al., HSCC
28 Questions?
29 Backup Slides
30 RTA and Hybrid Systems Run-time assurance frameworks must provably constrain the system to a set of allowable states where an unverified, possibly adaptive and nondeterministic controller may actuate the system. Determining this set of states can be done using approaches including extensive simulation, LMI-based computation, or through hybrid systems reachability computation. This talk presents fundamental methods to improve scalability of hybrid systems reachability computations for periodic control systems which interact with a physical system model. In particular, the technique of continuization, that is, abstracting a fast-switching hybrid system by a nondeterministic continuous one, is shown to greatly improve the scalability of hybrid systems reachability tools. The key to this approach is introduce enough nondeterminism to capture all the behaviors of the periodic system, but not too much that the reachable set diverges. This talk discusses methods to ensure such properties.
31 Challenges for Formal System Design and Analysis using Hybrid Automata Tools Chair: Stanley Bak Air Force Research Lab Information Directorate June 2015 DISTRIBUTION A. Approved for public release; Distribution unlimited. (Approval AFRL PA # 88ABW , 26 May 2015)
32 Link with Run-Time Assurance Run-Time Assurance (RTA) methods protect an untrusted controller with a verified backup
33 RTA Design Extensive Simulation Solving Linear Matrix Inequalities Hybrid Systems Reachability
34 X (temperature) Flowpipe Construction Flowpipe construction explores the reachable states symbolically θ highest θ high θ low θ lowest Post C Post C Post C Post C Intersection Intersection Intersection Computation Steps
35 Analysis Methods Simulation Falsification (guided random search) Flow-pipe construction Invariant-based approaches barrier certificates SMT solving Simulation-based reachability
36 Warm Up Who has used reachability or other hybrid systems analysis tools? What was your experience? What stopped you from going further? Was anything lacking in these tools? -or- Why are you interested in Hybrid Systems analysis? Which domains do you see applications? Can you think of any properties you d want to prove that need both a physical and a cyber model?
37 Discussion Questions Are there remaining challenges with low-dimensional problems? Clearly, large models require tools that scale to a large number of variables. Are there also interesting problems for models with 1-4 variables? What are these challenges? Which features are fundamental to problems faced by reachability, such that they should have first-class support inside the tool? For example, time-triggered dynamics, pure discrete variables, urgent transitions, differential inclusions, more complex (discrete) data structures, networked automata support, others? What are the strengths and weaknesses of tools based on SMT solving (dreach, HySat) versus flow-pipe construction methods (SpaceEx, Flow*, HyCreate)? Is there a fair way to compare different reachability tools and methods? What would such a comparison look like? Is the hard part of reachability computation the continuous successors, or the discrete successors? What are the challenges in each? If you have used some of the tools, what was your process of parameter tuning? Could this process be automated, and what would automation require to be programmatically available? Have you used falsification tools (tools which try to find counter-example traces)? What are the most-pressing challenges with these methods?
High-Level Hybrid Systems Analysis with Hypy
High-Level Hybrid Systems Analysis with Hypy Stanley Bak, Sergiy Bogomolov, Christian Schilling Air Force Research Lab (AFRL), IST Austria, University of Freiburg ARCH 2016 DISTRIBUTION A. Approved for
More informationVerified Switched Control System Design using Real- Time Hybrid Systems Reachability
Verified Switched Control System Design using Real- Time Hybrid Systems Reachability Stanley Bak, Taylor Johnson, Marco Caccamo, Lui Sha Air Force Research Lab Information Directorate Rome, NY 1 Cyber-Physical
More informationHyLAA: A Tool for Computing Simulation-Equivalent Reachability for Linear Systems
HyLAA: A Tool for Computing Simulation-Equivalent Reachability for Linear Systems Stanley Bak and Parasara Sridhar Duggirala DISTRIBUTION A: Approved for public release; distribution unlimited (#88ABW-2016-2897).
More informationUsing Hybrid-System Verification Tools in the Design of Simplex-Based Systems. Scott D. Stoller
Using Hybrid-System Verification Tools in the Design of Simplex-Based Systems Scott D. Stoller 2014 Annual Safe and Secure Systems and Software Symposium (S5) 1 Simplex Architecture Simplex Architecture
More informationTechniques and Tools for Hybrid Systems Reachability Analysis
which is funded by the German Research Council (DFG). Techniques and Tools for Hybrid Systems Reachability Analysis Stefan Schupp Johanna Nellen Erika Ábrahám RiSE4CPS, Heidelberg, Germany April 23, 2017
More information1 Real-Time Reachability for Verified Simplex Design
1 Real-Time Reachability for Verified Simplex Design TAYLOR T. JOHNSON, University of Texas at Arlington STANLEY BAK, Air Force Research Laboratory MARCO CACCAMO, University of Illinois at Urbana-Champaign
More informationThis project has received funding from the European Union s Horizon 2020 research and innovation programme under grant agreement No
This project has received funding from the European Union s Horizon 2020 research and innovation programme under grant agreement No 643921. TOOLS INTEGRATION UnCoVerCPS toolchain Goran Frehse, UGA Xavier
More informationXuandong Li. BACH: Path-oriented Reachability Checker of Linear Hybrid Automata
BACH: Path-oriented Reachability Checker of Linear Hybrid Automata Xuandong Li Department of Computer Science and Technology, Nanjing University, P.R.China Outline Preliminary Knowledge Path-oriented Reachability
More informationDistributed Autonomous Systems (Benchmark Proposal)
EPiC Series in Computing Volume XXX, 2017, Pages 1 12 ARCH17. 4th International Workshop on Applied Verification of Continuous and Hybrid Systems Distributed Autonomous Systems (Benchmark Proposal) Hoang-Dung
More informationLecture 2. Decidability and Verification
Lecture 2. Decidability and Verification model temporal property Model Checker yes error-trace Advantages Automated formal verification, Effective debugging tool Moderate industrial success In-house groups:
More informationReachability of Hybrid Systems using Support Functions over Continuous Time
Reachability of Hybrid Systems using Support Functions over Continuous Time Goran Frehse, Alexandre Donzé, Scott Cotton, Rajarshi Ray, Olivier Lebeltel, Rajat Kateja, Manish Goyal, Rodolfo Ripado, Thao
More informationLecture 9: Reachability
Lecture 9: Reachability Outline of Lecture Reachability General Transition Systems Algorithms for Reachability Safety through Reachability Backward Reachability Algorithm Given hybrid automaton H : set
More informationModel Checking for Hybrid Systems
Model Checking for Hybrid Systems Bruce H. Krogh Carnegie Mellon University Hybrid Dynamic Systems Models Dynamic systems with both continuous & discrete state variables Continuous-State Systems differential
More informationFormal Analysis of Timing Effects on Closed-loop Properties of Cyber Physical Systems
Formal Analysis of Timing Effects on Closed-loop Properties of Cyber Physical Systems Arne Hamann, Corporate Research, Robert Bosch GmbH Joint work with: Matthias Wöhrle (Bosch), Goran Frehse (Université
More informationGSPeeDI a Verification Tool for Generalized Polygonal Hybrid Systems
GSPeeDI a Verification Tool for Generalized Polygonal Hybrid Systems Hallstein A. Hansen 1 and Gerardo Schneider 2 1 Buskerud University College, Kongsberg, Norway Hallstein.Asheim.Hansen@hibu.no 2 Dept.
More informationEfficiency. Narrowbanding / Local Level Set Projections
Efficiency Narrowbanding / Local Level Set Projections Reducing the Cost of Level Set Methods Solve Hamilton-Jacobi equation only in a band near interface Computational detail: handling stencils near edge
More informationHierarchical Composition and Abstraction In Architecture Models
Hierarchical Composition and Abstraction In Architecture Models Pam Binns and Steve Vestal Honeywell Labs {pam.binns, steve.vestal}@honeywell.com Supported by the Air Force Office of Scientific Research
More informationAn Introduction to SpaceEx v0.8
An Introduction to SpaceEx v0.8 Goran Frehse Université Grenoble 1 Joseph Fourier - Verimag Centre Équation, 2 av. de Vignate, 38610 Gières, France goran.frehse@imag.fr December 2, 2010 Abstract This document
More informationUnit 2: Locomotion Kinematics of Wheeled Robots: Part 3
Unit 2: Locomotion Kinematics of Wheeled Robots: Part 3 Computer Science 4766/6778 Department of Computer Science Memorial University of Newfoundland January 28, 2014 COMP 4766/6778 (MUN) Kinematics of
More informationOutput-error model identification: linear time-invariant systems
Output-error model identification: linear time-invariant systems Dipartimento di Scienze e Tecnologie Aerospaziali, Politecnico di Milano The OE method for LTI systems 2 For linear time-invariant systems
More informationAutomated Software Synthesis for Complex Robotic Systems
Automated Software Synthesis for Complex Robotic Systems Indranil Saha Department of Computer Science and Engineering Indian Institute of Technology Kanpur Indranil Saha Automated Software Synthesis for
More informationEL6483: Basic Concepts of Embedded System ModelingSpring and Hardware-In-The-Loo
: Basic Concepts of Embedded System Modeling and Hardware-In-The-Loop Simulation Spring 2016 : Basic Concepts of Embedded System ModelingSpring and Hardware-In-The-Loo 2016 1 / 26 Overall system : Basic
More informationLanguage Overview for PHAVer version 0.35
Language Overview for PHAVer version 0.35 Goran Frehse June 22, 2006 We have tried to construct a textual input language that is as user friendly as possible, while keeping the parser simple. In the syntax,
More informationForward inner-approximated reachability of non-linear continuous systems
Forward inner-approximated reachability of non-linear continuous systems Eric Goubault 1 Sylvie Putot 1 1 LIX, Ecole Polytechnique - CNRS, Université Paris-Saclay HSCC, Pittsburgh, April 18, 2017 ric Goubault,
More informationExperiment 6 SIMULINK
Experiment 6 SIMULINK Simulink Introduction to simulink SIMULINK is an interactive environment for modeling, analyzing, and simulating a wide variety of dynamic systems. SIMULINK provides a graphical user
More informationAutomatic synthesis of switching controllers for linear hybrid systems: Reachability control
Automatic synthesis of switching controllers for linear hybrid systems: Reachability control Massimo Benerecetti and Marco Faella Università di Napoli Federico II, Italy Abstract. We consider the problem
More informationHybrid System Modeling: Operational Semantics Issues
Hybrid System Modeling: Operational Semantics Issues Edward A. Lee Professor UC Berkeley OMG Technical Meeting Feb. 4, 2004 Anaheim, CA, USA Special thanks to Jie Liu, Xiaojun Liu, Steve Neuendorffer,
More informationCONTEXT-DEPENDENT REACHABILITY ANALYSIS
The present work was submitted to the LuFG Theory of Hybrid Systems MASTER OF SCIENCE THESIS CONTEXT-DEPENDENT REACHABILITY ANALYSIS FOR HYBRID AUTOMATA Justin Winkens Examiners: Prof. Dr. Erika Ábrahám
More informationDistributed Systems Programming (F21DS1) Formal Verification
Distributed Systems Programming (F21DS1) Formal Verification Andrew Ireland Department of Computer Science School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh Overview Focus on
More informationParametric Real Time System Feasibility Analysis Using Parametric Timed Automata
Parametric Real Time System Feasibility Analysis Using Parametric Timed Automata PhD Dissertation Yusi Ramadian Advisor : Luigi Palopoli Co advisor : Alessandro Cimatti 1 Real Time System Applications
More informationEfficient Synthesis of Production Schedules by Optimization of Timed Automata
Efficient Synthesis of Production Schedules by Optimization of Timed Automata Inga Krause Institute of Automatic Control Engineering Technische Universität München inga.krause@mytum.de Joint Advanced Student
More informationOverview. Discrete Event Systems - Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems - Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two
More informationLecture VI: Constraints and Controllers
Lecture VI: Constraints and Controllers Motion Constraints In practice, no rigid body is free to move around on its own. Movement is constrained: wheels on a chair human body parts trigger of a gun opening
More informationUsing Hybrid Automata for Early Spacecraft Design Evaluation
Seminar Operating Systems: Winter Semester 18/19 Using Hybrid Automata for Early Spacecraft Design Evaluation Jafar Akhundov Motivation Motivation: Spacecraft Modelling Gaia - mission to chart a 3d-map
More informationThe Embedded Systems Design Challenge. EPFL Verimag
The Embedded Systems Design Challenge Tom Henzinger Joseph Sifakis EPFL Verimag Formal Methods: A Tale of Two Cultures Engineering Computer Science Differential Equations Linear Algebra Probability Theory
More informationLecture VI: Constraints and Controllers. Parts Based on Erin Catto s Box2D Tutorial
Lecture VI: Constraints and Controllers Parts Based on Erin Catto s Box2D Tutorial Motion Constraints In practice, no rigid body is free to move around on its own. Movement is constrained: wheels on a
More informationPV211: Introduction to Information Retrieval
PV211: Introduction to Information Retrieval http://www.fi.muni.cz/~sojka/pv211 IIR 15-1: Support Vector Machines Handout version Petr Sojka, Hinrich Schütze et al. Faculty of Informatics, Masaryk University,
More informationResearch in Computational Differential Geomet
Research in Computational Differential Geometry November 5, 2014 Approximations Often we have a series of approximations which we think are getting close to looking like some shape. Approximations Often
More informationIntegration of CAE Tools for Complete System Prototyping EASY5 User Conference May, 2000 Presented by: Joel Tollefson
Integration of CAE Tools for Complete System Prototyping 2000 User Conference May, 2000 Presented by: Joel Tollefson Presentation Focus Provide a framework to support other presentations define concepts
More informationReach Sets and the Hamilton-Jacobi Equation
Reach Sets and the Hamilton-Jacobi Equation Ian Mitchell Department of Computer Science The University of British Columbia Joint work with Alex Bayen, Meeko Oishi & Claire Tomlin (Stanford) research supported
More informationApplications of Program analysis in Model-Based Design
Applications of Program analysis in Model-Based Design Prahlad Sampath (Prahlad.Sampath@mathworks.com) 2018 by The MathWorks, Inc., MATLAB, Simulink, Stateflow, are registered trademarks of The MathWorks,
More informationDigital Image Processing
Digital Image Processing Part 9: Representation and Description AASS Learning Systems Lab, Dep. Teknik Room T1209 (Fr, 11-12 o'clock) achim.lilienthal@oru.se Course Book Chapter 11 2011-05-17 Contents
More informationA Study on Run Time Assurance for Complex Cyber Physical Systems
A Study on Run Time Assurance for Complex Cyber Physical Systems Matthew Clark, Xenofon Koutsoukos, Ratnesh Kumar, Insup Lee, George Pappas, Lee Pike, Joseph Porter, Oleg Sokolsky April 18, 2013 1 Contents
More informationDuet: Static Analysis for Unbounded Parallelism
Duet: Static Analysis for Unbounded Parallelism Azadeh Farzan and Zachary Kincaid University of Toronto Abstract. Duet is a static analysis tool for concurrent programs in which the number of executing
More informationAFRL-RI-RS-TR
AFRL-RI-RS-TR-2017-042 PERPETUAL MODEL VALIDATION MARCH 2017 FINAL TECHNICAL REPORT STINFO COPY AIR FORCE RESEARCH LABORATORY INFORMATION DIRECTORATE AIR FORCE MATERIEL COMMAND UNITED STATES AIR FORCE
More informationCyber-Physical Specification Mismatch Identification with Dynamic Analysis
Cyber-Physical Specification Mismatch Identification with Dynamic Analysis Taylor T. Johnson CPS V&V I&F Workshop 2014 December 12, 2014 Acknowledgement: AFRL Visiting Faculty Research Program (VFRP) Systems
More informationCommunication Complexity and Parallel Computing
Juraj Hromkovic Communication Complexity and Parallel Computing With 40 Figures Springer Table of Contents 1 Introduction 1 1.1 Motivation and Aims 1 1.2 Concept and Organization 4 1.3 How to Read the
More informationModel-Based Design of Connected and Autonomous Vehicles
Model-Based Design of Connected and Autonomous Vehicles Akshay Rajhans, PhD Senior Research Scientist Advanced Research and Technology Office MathWorks https://arajhans.github.io 2 nd IEEE Summer School
More informationCS1114 Section 8: The Fourier Transform March 13th, 2013
CS1114 Section 8: The Fourier Transform March 13th, 2013 http://xkcd.com/26 Today you will learn about an extremely useful tool in image processing called the Fourier transform, and along the way get more
More informationECSE-626 Project: An Adaptive Color-Based Particle Filter
ECSE-626 Project: An Adaptive Color-Based Particle Filter Fabian Kaelin McGill University Montreal, Canada fabian.kaelin@mail.mcgill.ca Abstract The goal of this project was to discuss and implement a
More informationHECTOR: Formal System-Level to RTL Equivalence Checking
ATG SoC HECTOR: Formal System-Level to RTL Equivalence Checking Alfred Koelbl, Sergey Berezin, Reily Jacoby, Jerry Burch, William Nicholls, Carl Pixley Advanced Technology Group Synopsys, Inc. June 2008
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 3: Discrete Dynamics,
More informationWhat is the best way to implement my algorithm in Simulink?
What is the best way to implement my algorithm in Simulink? By Giampiero Campa, PhD, Technical Evangelist MathWorks, 970 W 190 ST, Suite 530, Torrance, CA, 90502, USA giampiero.campa@mathworks.com 2014
More informationGuaranteeing Proper-Temporal-Embedding Safety Rules in Wireless CPS: A Hybrid Formal Modeling Approach
Guaranteeing Proper-Temporal-Embedding Safety Rules in Wireless CPS: A Hybrid Formal Modeling Approach Feng Tan *, Yufei Wang *, Qixin Wang *, Lei Bu, Rong Zheng, Neeraj Suri ** * Embedded Systems & Networking
More informationA Brief Look at Optimization
A Brief Look at Optimization CSC 412/2506 Tutorial David Madras January 18, 2018 Slides adapted from last year s version Overview Introduction Classes of optimization problems Linear programming Steepest
More informationVHDL framework for modeling fuzzy automata
Doru Todinca Daniel Butoianu Department of Computers Politehnica University of Timisoara SYNASC 2012 Outline Motivation 1 Motivation Why fuzzy automata? Why a framework for modeling FA? Why VHDL? 2 Fuzzy
More informationA Toolbox of Level Set Methods
A Toolbox of Level Set Methods Ian Mitchell Department of Computer Science University of British Columbia http://www.cs.ubc.ca/~mitchell mitchell@cs.ubc.ca research supported by the Natural Science and
More informationApplied Lagrange Duality for Constrained Optimization
Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity
More informationFormal Modeling and Analysis of Stream Processing Systems
Formal Modeling and Analysis of Stream Processing Systems Linh T.X. Phan March 2009 Computer and Information Science University of Pennsylvania 1 High performance Highly optimized requirements systems
More informationPDF NUMERICAL METHODS TEMOTHY SOLUTIONS PRODUCT CATALOG
18 January, 2018 PDF NUMERICAL METHODS TEMOTHY SOLUTIONS PRODUCT CATALOG Document Filetype: PDF 190.47 KB 0 PDF NUMERICAL METHODS TEMOTHY SOLUTIONS PRODUCT CATALOG The study of buckling loads, which often
More informationExperiment 8 SIMULINK
Experiment 8 SIMULINK Simulink Introduction to simulink SIMULINK is an interactive environment for modeling, analyzing, and simulating a wide variety of dynamic systems. SIMULINK provides a graphical user
More informationAutomated Formal Methods for Embedded Systems
Automated Formal Methods for Embedded Systems Bernd Finkbeiner Universität des Saarlandes Reactive Systems Group 2011/02/03 Bernd Finkbeiner (UdS) Embedded Systems 2011/02/03 1 / 48 Automated Formal Methods
More informationJinkun Liu Xinhua Wang. Advanced Sliding Mode Control for Mechanical Systems. Design, Analysis and MATLAB Simulation
Jinkun Liu Xinhua Wang Advanced Sliding Mode Control for Mechanical Systems Design, Analysis and MATLAB Simulation Jinkun Liu Xinhua Wang Advanced Sliding Mode Control for Mechanical Systems Design, Analysis
More informationNeuro-Dynamic Programming An Overview
1 Neuro-Dynamic Programming An Overview Dimitri Bertsekas Dept. of Electrical Engineering and Computer Science M.I.T. May 2006 2 BELLMAN AND THE DUAL CURSES Dynamic Programming (DP) is very broadly applicable,
More informationlec3:nondeterministic finite state automata
lec3:nondeterministic finite state automata 1 1.introduction Nondeterminism is a useful concept that has great impact on the theory of computation. When the machine is in a given state and reads the next
More informationE-Companion: On Styles in Product Design: An Analysis of US. Design Patents
E-Companion: On Styles in Product Design: An Analysis of US Design Patents 1 PART A: FORMALIZING THE DEFINITION OF STYLES A.1 Styles as categories of designs of similar form Our task involves categorizing
More informationFlight Test Research
Flight Test Research Principal Investigator:Mike Bragg and Tom Ratvasky Post Doc s: Andy Broeren Sam Lee Graduate Students: James Melody Edward Whalen Core Technologies SMART ICING SYSTEMS Research Organization
More informationStatic Analysis of Programs with Probabilities. Sriram Sankaranarayanan University of Colorado, Boulder, USA.
Static Analysis of Programs with Probabilities Sriram Sankaranarayanan University of Colorado, Boulder, USA. Joint Work Aleksandar Chakarov Univ. Colorado, Boulder now at Phase Change Olivier Bouissou
More informationA Modal Specification Approach for Assuring the Safety of On-Demand Medical Cyber-Physical Systems
A Modal Specification Approach for Assuring the Safety of On-Demand Medical Cyber-Physical Systems Lu Feng PRECISE Center Department of Computer and Information Science University of Pennsylvania lufeng@cis.upenn.edu
More informationUsing Heterogeneous Formal Methods in Model-Based Development LCCC Workshop on Formal Verification of Embedded Control Systems
Using Heterogeneous Formal Methods in Model-Based Development LCCC Workshop on Formal Verification of Embedded Control Systems Bruce H. Krogh Carnegie Mellon University in Rwanda Kigali, Rwanda 1 Model-Based
More informationSRQ24A. Technical data. Safety notes. Rotary actuator for ball valves Torque 16Nm Nominal voltage AC/DC 24V Control: Open-close Running time 9s
SRQ24A Rotary actuator for ball valves orque 16Nm Nominal voltage AC/DC 24V Control: Open-close Running time 9s echnical data Electrical data Nominal voltage AC 24V, 50/60Hz / DC 24V Nominal voltage range
More informationThe viscous forces on the cylinder are proportional to the gradient of the velocity field at the
Fluid Dynamics Models : Flow Past a Cylinder Flow Past a Cylinder Introduction The flow of fluid behind a blunt body such as an automobile is difficult to compute due to the unsteady flows. The wake behind
More informationPetri Nets. Petri Nets. Petri Net Example. Systems are specified as a directed bipartite graph. The two kinds of nodes in the graph:
System Design&Methodologies Fö - 1 System Design&Methodologies Fö - 2 Petri Nets 1. Basic Petri Net Model 2. Properties and Analysis of Petri Nets 3. Extended Petri Net Models Petri Nets Systems are specified
More informationThe Maude LTL Model Checker and Its Implementation
The Maude LTL Model Checker and Its Implementation Steven Eker 1,José Meseguer 2, and Ambarish Sridharanarayanan 2 1 Computer Science Laboratory, SRI International Menlo Park, CA 94025 eker@csl.sri.com
More informationSimulation of sensor failure accommodation in flight control system of transport aircraft: a modular approach
ISSN 1 746-7233, England, UK World Journal of Modelling and Simulation Vol. 11 (2015) No. 1, pp. 55-68 Simulation of sensor failure accommodation in flight control system of transport aircraft: a modular
More informationCS2 Language Processing note 3
CS2 Language Processing note 3 CS2Ah 5..4 CS2 Language Processing note 3 Nondeterministic finite automata In this lecture we look at nondeterministic finite automata and prove the Conversion Theorem, which
More informationTimed Automata From Theory to Implementation
Timed Automata From Theory to Implementation Patricia Bouyer LSV CNRS & ENS de Cachan France Chennai january 2003 Timed Automata From Theory to Implementation p.1 Roadmap Timed automata, decidability issues
More informationLecture 2: Symbolic Model Checking With SAT
Lecture 2: Symbolic Model Checking With SAT Edmund M. Clarke, Jr. School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 (Joint work over several years with: A. Biere, A. Cimatti, Y.
More informationTemporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols
Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols Lee Pike (Presenting), Galois, Inc. leepike@galois.com Geoffrey M. Brown, Indiana University geobrown@cs.indiana.edu
More informationModeling a Cache Coherence Protocol with the Guarded Action Language
Modeling a Cache Coherence Protocol with the Guarded Action Language Quentin Meunier, Yann Thierry-Mieg, Emmanuelle Encrenaz Laboratoire d Informatique de Paris 6, Sorbonne Université, Paris. The TeraScale
More informationNONBLOCKING COMMIT PROTOCOLS
Dale Skeen NONBLOCKING COMMIT PROTOCOLS MC714 Sistemas Distribuídos Nonblocking Commit Protocols Dale Skeen From a certain point onward there is no longer any turning back. That is the point that must
More informationGreedy Algorithms CLRS Laura Toma, csci2200, Bowdoin College
Greedy Algorithms CLRS 16.1-16.2 Laura Toma, csci2200, Bowdoin College Overview. Sometimes we can solve optimization problems with a technique called greedy. A greedy algorithm picks the option that looks
More information(Refer Slide Time: 0:19)
Theory of Computation. Professor somenath Biswas. Department of Computer Science & Engineering. Indian Institute of Technology, Kanpur. Lecture-15. Decision Problems for Regular Languages. (Refer Slide
More informationTowards an Integrated System Model for Testing and Verification
Towards an Integrated System Model for Testing and Verification Benjamin Hummel and Peter Braun MiSE 2008 Domain Development of controller software for production machines Special case of mechatronic system
More informationLecture 6. Abstract Interpretation
Lecture 6. Abstract Interpretation Wei Le 2014.10 Outline Motivation History What it is: an intuitive understanding An example Steps of abstract interpretation Galois connection Narrowing and Widening
More informationCPSC 340: Machine Learning and Data Mining. Density-Based Clustering Fall 2016
CPSC 340: Machine Learning and Data Mining Density-Based Clustering Fall 2016 Assignment 1 : Admin 2 late days to hand it in before Wednesday s class. 3 late days to hand it in before Friday s class. 0
More informationCuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers Isil Dillig, Thomas Dillig, and Alex Aiken Computer Science Department Stanford University Linear Arithmetic
More informationTheory of Computation Prof. Raghunath Tewari Department of Computer Science and Engineering Indian Institute of Technology, Kanpur
Theory of Computation Prof. Raghunath Tewari Department of Computer Science and Engineering Indian Institute of Technology, Kanpur Lecture 01 Introduction to Finite Automata Welcome everybody. This is
More informationMTG6 Material Thickness Gauge
MTG6 Material Thickness Gauge Conforms to the following standards : ASTM E797, EN 14127, EN15317 Page 1 of 5 With their ergonomic, rugged design, accurate and easy to use menus in multiple languages, the
More informationObject Recognition Using Pictorial Structures. Daniel Huttenlocher Computer Science Department. In This Talk. Object recognition in computer vision
Object Recognition Using Pictorial Structures Daniel Huttenlocher Computer Science Department Joint work with Pedro Felzenszwalb, MIT AI Lab In This Talk Object recognition in computer vision Brief definition
More informationState Identification In The Hybrid Automata Description Of Dynamical Systems
State Identification In The Hybrid Automata Description Of Dynamical Systems ISABELLA KOTINI, GEORGE HASSAPIS Dept. of Electrical and Computer Engineering Aristotle University of Thessaloniki 54006, Thessaloniki
More informationAircraft Stability and Performance 2nd Year, Aerospace Engineering. Dr. M. Turner
Aircraft Stability and Performance 2nd Year, Aerospace Engineering Dr. M. Turner Basic Info Timetable 15.00-16.00 Monday ENG LT1 16.00-17.00 Monday ENG LT1 Typical structure of lectures Part 1 Theory Part
More informationThe UPPAAL Model Checker. Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN
The UPPAAL Model Checker Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN The aim of this presentation Introduce the basic concepts of model checking from a practical perspective Describe
More informationGAMES Webinar: Rendering Tutorial 2. Monte Carlo Methods. Shuang Zhao
GAMES Webinar: Rendering Tutorial 2 Monte Carlo Methods Shuang Zhao Assistant Professor Computer Science Department University of California, Irvine GAMES Webinar Shuang Zhao 1 Outline 1. Monte Carlo integration
More information3D Rotations and Complex Representations. Computer Graphics CMU /15-662, Fall 2017
3D Rotations and Complex Representations Computer Graphics CMU 15-462/15-662, Fall 2017 Rotations in 3D What is a rotation, intuitively? How do you know a rotation when you see it? - length/distance is
More informationGoals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves
Block #1: Vector-Valued Functions Goals: Course Unit: Describing Moving Objects Different Ways of Representing Functions Vector-valued Functions, or Parametric Curves 1 The Calculus of Moving Objects Problem.
More informationProgram verification. Generalities about software Verification Model Checking. September 20, 2016
Program verification Generalities about software Verification Model Checking Laure Gonnord David Monniaux September 20, 2016 1 / 43 The teaching staff Laure Gonnord, associate professor, LIP laboratory,
More informationDM6 Support Vector Machines
DM6 Support Vector Machines Outline Large margin linear classifier Linear separable Nonlinear separable Creating nonlinear classifiers: kernel trick Discussion on SVM Conclusion SVM: LARGE MARGIN LINEAR
More informationECLIPSE 500. Flight Controls. Do Not Use For Flight
ECLIPSE 500 Flight Controls Do Not Use For Flight 3. Flight Controls 3.1 General The flight control system consists of primary flight controls (ailerons, rudder, and elevator) and secondary flight controls
More informationCertification of Termination for Integer Transition Systems
Certification of Termination for Integer Transition Systems Marc Brockschmidt, Sebastiaan Joosten, René Thiemann and Akihisa Yamada Sebastiaan.Joosten@uibk.ac.at Supported by FWF project Y 757 Reliable
More information