Verification of quantitative properties of logic systems using model checker for hybrid automata

Size: px
Start display at page:

Download "Verification of quantitative properties of logic systems using model checker for hybrid automata"

Transcription

1 Verification of quantitative properties of logic systems using model checker for hybrid automata Z. Juarez, B. Denis, J.-J. Lesage LURPA, ENS de Cachan

2 Outlines Motivation Why use a hybrid models for the formal verification of logic systems? Modular modeling of hybrid systems Network of Hybrid Input Output Automata with Typed Synchronizations Verification of quantitative properties case study 1: displacement axis of the test station case study 2: production of batch (cooling process)

3 Motivation: Dependable Control of Discrete Event Systems Targets: critical automated systems Power plant Transport Strategy of development Off line approaches (during design and realization): - Fault Prevention (Synthesis, ) - Fault Forecasting (FT Analysis, ) - Fault Tolerance (Redundant solutions, ) - Fault Removal (Verification, Test, ) On line approaches (during operation): - FDI, Diagnosis, Prognostics, - Dynamic reconfiguration, Today talk Requirements Analysis Specification & Design of the DES Specif. & Design of the Controller Specification, Design Spéc. & Design Soft. Spec., Design & Coding Realization Realization Integ. Valid. & Test Soft. Integration Valid. & Test Of the Controller Of the Hardware Of the Plant Off line approaches On line approaches Optimization, Operation, Maintenance Integration, Valid. & test of the DES

4 Motivation: structure of target systems Logic signals Timed subsystem Inputs Controller Program Monitor Outputs Plant Hybrid subsystem For economic reasons logic interfaces between plant and controller are often preferred Then the controller deal with a discrete event abstraction of the plant Is the program correct? (in accordance with the awaited system behavior)

5 Motivation: quantitative properties Example: displacement axis of a test station To perform successfully the test, stop precision must be 1.5 mm Test station Logical control orders: - Go_to_test - Go_to_load Logical sensors information: - Load_pos - Test_pos 0 Conveyor X M Motor Load_pos Test_pos Unload_pos click on picture to play video

6 Motivation: Formal verification Model-checking formal method with exhaustive state space exploration Inputs - S: model of system behavior (automaton) - φ: model of properties (temporal formula) Question - Does the system model S satisfy the set of properties φ? Outputs - Yes or no (+ counterexample) Polyhedral model checker Outputs can also include the reachable region System to be verified Formal model of system: S (automaton) model-checker? S φ Expected properties Formal model of properties: φ (temporal formula) Yes / No (+ diagnosis)

7 Motivation: Existing approaches of verification Program alone Model without time [Moon 92] Controller alone (program+monitor) Model without time [Moon 94], [Mertke 01], [Rossi 03] Timed model [Kowalewski 99], [Gourcuff 05] Program Controller Plant in the loop Model without time [Raush 98], [Machado 06] Timed model [Krogh 00], [Stursberg 97] Hybrid model [Engell, 2005] Controller Plant This presentation focus on qualitative properties

8 Verification of quantitative properties of logic systems Problem definition How to guarantee quantitative properties on the plant when a logic controller has been selected? Principle of the solution Because of the logic abstraction, controller can t guarantee on-line the quantitative properties on the plant The designer verifies off-line the quantitative properties using a hybrid plant model in closed-loop with a controller model Selected model checker: PHAVer [Frehse 06] Formal model of system: S Controller timed model Plant hybrid model model-checker? S φ Formal model of properties: φ (temporal formula) Yes / No (+ diagnosis)

9 Modular modeling of hybrid systems Requirements Modular formalism to take into account large systems Expressive formalism to easily coordinate different kind for modules (program + monitor + plant) Formalism close to PHAVer input formalism

10 Modular modeling of hybrid systems Condition initiale x 1 =0 Invariant source location x x& 1 1 q 5 = 2 label flows Guard Affectation l 1, x 1 3, x 1 : = 5 l 2, x 1 =1, -1 x 1 0 Definition of Hybrid Input Output Automata HIOA = <,,,,,,,Init > destination location q x x& 1 2 a set of locations = I U O U L a set of input, output and local variables = I U O U L a set of input, output and local variables = x x x a set of transition with a set of guard a function which associates affectations to transition (q,l,g,q ) a function which associates flows to location q a function which associates invariant to location q Init a initial state l 1 x 1 x 2 x 3 Synchronization A x 4 Data exchange l 2 l 3 x 5 x 6 A=<,,,,,,,Init> 3 l 1 I (x 1, x 2, x 3 ) I 2 (l 2, l 3 ) O x 4 L 2 (x 5, x 6 ) O

11 Modular modeling of hybrid systems Hybrid Input Output Automata with Typed Synchronization HIOA TS = <HIOA, > where HIOA is a Hybrid Input Output Automata and is a function which associates a role to each label : {!,?, }! stand for synchronization sender? stand for blocking receiver stand for non blocking receiver

12 Modular modeling of hybrid systems Chart of typed synchronizations Implications of type on label role Blocking Rendezvous e HIOA_A e HIOA_B e HIOA_C HIOA_A P1 P2!e g1 HIOA_B Q1 Q2?e g2 HIOA_C R1 R2?e g3 Typed synchronizations Non blocking Rendezvous Mixed Rendezvous e HIOA_A e HIOA_A e HIOA_B e HIOA_C e HIOA_B e HIOA_C HIOA_A P1 P2 HIOA_A P1 P2!e g1!e g1 HIOA_B Q1 Q2 e g2 HIOA_B Q1 Q2?e g2 HIOA_C R1 R2 HIOA_C R1 R2 e g3 e g3

13 Modular modeling of hybrid systems Example of system 2 roads with a crossing 2 cars less (or equal) than 1 car on crossroad area Véhicule X x = -1 Finish y =10 y 0 Finish x = 10 x Modular model start_x stop_x Feu X tx Véhicule X Start -10 x -7 Feu X Feu Y y = -1 stop_y start_y Feu Y Véhicule Y Start -10 y -7 Véhicule Y ty

14 Modular modeling of hybrid systems Model HIOA TS!stop_x tx 2 tx := 0 Feu X FXR1 tx = 0 FXR2 tx 2?stop_y tx = 1!start_x tx 2 tx := 0 FXV tx 2 tx = 1 0 tx 2!stop_y ty 2 ty : = 0 Feu Y FYR1 ty = 0 FYR2 ty 2 ty = 1!start_y ty 2 ty := 0 FYV ty 2 ty = 1?stop_x ty:= 0-10 x -7 VXC x 10 x& = 1-10 y -7 VYC y 10 y& = 1 start_x x <-1 stop_x -7 x -1 start_y y <-1 stop_y -7 y -1 Véhicule X VXR x -1 x & = 0.5 Véhicule Y VYR y -1 y & = 0.5 start_x x < 10!vx x -1!vx x 10 start_y y < 10!vy y -1!vy y 10 VXA x& = 0 VYA y& = 0

15 Modular modeling of hybrid systems Hybrid Input Output Automata with Typed Synchronizations A parallel composition of HIOA TS was formally defined to express the operational semantic of a network of HIOA TS - parallel composition transform a network HIOA TS of into a single HA A algorithm to translate a network of HIOA TS to a network of HIOA was constructed to import a network of HIOA TS into PHAVer

16 Modular modeling of hybrid systems Example of translation HIOA TS to HIOA q 1 l 1 g 1 q l 1 g 2!l 2 g 3 q 3 HIOA TS q 2 q 1 l 1 g 1 q l 1 g2 l 1 ( g 1 g 2 ) l 2 g 3 q 3 PHAVer Automaton q 2 Presentation of HIOA TS toolbox

17 Verification of quantitative properties Case study 1 Displacement axis of the test station - To have successfully test, precision of the stop position must be 1.5 mm Case study 2 Batch production (cooling process) - Determination of the production time depending of the cooling strategy

18 Conclusions Hybrid model allows the checking of quantitative properties for logic system An extension for HIOA has been introduced HIOA with typed synchronization (send/receiver, blocking/non-blocking) Parallel composition allows translation from a network of HIOA TS to one HA An algorithm allows to translate a network of HIOA TS to a network of HIOA

19 Thank you!

20 Annexes Developed toolbox Case study 1

21 Modular modeling of hybrid systems: toolbox A software toolbox was developed: to validated algorithms (parallel composition, translation), to provide a chart of automata and their analyses Toolbox input neutral textual format for HIOA TS networks and theirs analyses Toolbox contents HA_grapher: generate picture of automata (based on Graphviz tool) HIOAts2HA: generate parallel composition of a HIOA TS networks HIOAts2HIOA: translate HIOA TS networks to HIOA network HIOA2PHAVer: generate a model according PHAVer input syntax HA_analyser: perform analysis using PHAVer and generate picture of 2D region (based on plotutils tools) HTMLreport: generate full analysis report according WEB page format

22 analysis report Modular modeling of hybrid systems: toolbox

23 analysis report Modular modeling of hybrid systems: toolbox

24 Modular modeling of hybrid systems: toolbox analysis report

25 analysis report Modular modeling of hybrid systems: toolbox

26 Displacement axis of the test station SFC 1 S0 Spécification du contrôle Moniteur du contrôle tc = [tc min,tc max ] (t1) S1 (t2) S2 (t3) SFC2.X10 N go_forward test_pos SFC3.X20 Logical control orders: - Go_forward - Go_backward x min AV Conveyor Logical sensors information: - Load_pos - Test_pos - Unload_pos Δx x max X Conveyer position S3 N go_forward M (t4) S4 (t5) unload_pos SFC4.X30 x = V Motor AR Load_pos x_test x_unload Test_pos Unload_pos S5 N go_backward (t6) load_pos Position (mm) Speed (mm/s) Monitor cycle time (ms) S5 x_load = 0 Nominal Dispersion % Nominal Jitter % x_test = 30 ± % % x_unload = 120

27 Logic controller S1 Mow t1, t2,t3,t4,t5,t6 Plant S1 t1, t2,t3,t4,t5,t6 SFC1 load_pos test_pos unload_pos Monitor TD swatchm ρ tc t1,t2,t3,t4 Output1 go_forwards t5, t6 Mow Axe go_forwards x go_backwards Sensor_load x load_pos Sensor_test x test_pos Output2 go_backwards Sensor_unload x unload_pos

28 EDC1-PLC-HIOATS Monitor TD SFC1 Output1 Local variable: swatchm Output label: syncmow Input labels: syncs1, syncs1t1, syncs1t2, syncs1t3, syncs1t4, syncs1t5, syncs1t6 tc -tc*ptc swatchm tc+tc*ptc!syncmow swatchm tc-tc*ptc swatchm := 0 Start of cycle swatchm 0 swatchm = 1 Traitement swatchm tc+tc*ptc swatchm?syncs1,?syncs1t1,?syncs1t2,?syncs1t3,?syncs1t4,?syncs1t5,?syncs1t6 swatchm 0 swatchm := 0 ptc*= demi étendue de la gigue du temps de cycle (%) = 0.5% de la valeur de tc = 1 Input variables: load_pos, test_pos, unload_pos Constants: SFC2_step10=1, SFC3_step20=0, SFC4_step30=0 Output labels: syncs1, syncs1t1, syncs1t2, syncs1t3, syncs1t4, syncs1t5, syncs1t6!syncs1t6 load_pos = 1!syncS1 SFC2_step10 = 0 Step0!syncS1t1 SFC2_step10 = 1!syncS1 Step1 test_pos = 0!syncS1t2 test_pos = 1!syncS1 Step2 SFC3_step20 = 0!syncS1t3 SFC3_step20 = 1!syncS1 unload_pos = 0 Step3!syncS1t4 unload_pos = 1!syncS1 Step4 SFC4_step30 = 0!syncS1t5 SFC4_step30 = 1!syncS1 Step5 load_pos = 0 Output label: go_forwards Input labels: syncs1t1, syncs1t2, syncs1t3, syncs2t4 output forwards go _ forwards = 0 Output label: go_forwards go_forwards = 0 Output2 Input labels: syncs1t5, syncs1t6 output backwards go _ backwards = 0 go_backwards = 0?:syncS1t1, syncs1t3 go_forwards : = 1?:syncS1t2, syncs1t4 go_forwards : = 0?syncS1t5 go_backwards : = 1?syncS1t6 go_backwards : = 0

29 EDC1-PLANT-HIOATS Plant_axe Plant_sensor_ load Plant_sensor_test Plant_sensor_ unload Output variable: x Local label: syncpaxe Input label: syncmow Output variable: load_pos Local label: syncpsl Output variable: test_pos Local label: syncpst test_pos = 0 Output variable: unload_pos Local label: syncpsu unload_pos = 0!syncPaxe x x_max syncmow go_forwards = 0 go_bacwards = 0!syncPaxe x x_min forward x < x_max x = V syncmow syncmow!syncpsl!syncpsl go_forwards = 1 go_forwards = 0 x x_load e x x_load e go_bacwards = 0 go_bacwards = 0 load_pos : = 1 load_pos : = 0 load stop x = 0 load_pos = 1 x x_load e x x_load + e x = 0 backward x x_min x = V syncmow go_forwards = 0 go_bacwards = 1!syncPsl x x_load + e load_pos : = 0 behind_load x x_load - e load _ pos = 0 load _ pos = 0 ahead_load x x_load + e load _ pos = 0!syncPsl x x_load + e load_pos : = 1 behind_test x x_test - e test _ pos = 0!syncPst!syncPst x x_test e x x_test e test_pos : = 1 test_pos : = 0 test x x_test e x x_test + e test _ pos = 0!syncPst!syncPst x x_test + e x x_test + e test_pos : = 0 test_pos : = 1 ahead_load x x_load + e test _ pos = 0!syncPsu x x_unload e unload_pos : = 1!syncPsu x x_unload + e unload_pos : = 0 behind_unload x x_unload - e unload _ pos = 0 unload x x_unload e x x_unload + e unload _ pos = 0 ahead_unload x x_unload + e unload _ pos = 0!syncPsu x x_unload e unload_pos : = 0!syncPsu x x_unload + e unload_pos : = 1

30

Analysis of a Boost Converter Circuit Using Linear Hybrid Automata

Analysis of a Boost Converter Circuit Using Linear Hybrid Automata Analysis of a Boost Converter Circuit Using Linear Hybrid Automata Ulrich Kühne LSV ENS de Cachan, 94235 Cachan Cedex, France, kuehne@lsv.ens-cachan.fr 1 Introduction Boost converter circuits are an important

More information

Software Verification

Software Verification Software Verification Grégoire Sutre LaBRI, University of Bordeaux, CNRS, France Summer School on Verification Technology, Systems & Applications September 2008 Grégoire Sutre Software Verification VTSA

More information

Alan Bundy. Automated Reasoning LTL Model Checking

Alan 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 information

Abstractions and Decision Procedures for Effective Software Model Checking

Abstractions 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 information

Timed Automata VINO 2011

Timed Automata VINO 2011 Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.

More information

Models for Efficient Timed Verification

Models for Efficient Timed Verification Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model

More information

Automatic Generation of Polynomial Invariants for System Verification

Automatic Generation of Polynomial Invariants for System Verification Automatic Generation of Polynomial Invariants for System Verification Enric Rodríguez-Carbonell Technical University of Catalonia Talk at EPFL Nov. 2006 p.1/60 Plan of the Talk Introduction Need for program

More information

Software Verification with Abstraction-Based Methods

Software Verification with Abstraction-Based Methods Software Verification with Abstraction-Based Methods Ákos Hajdu PhD student Department of Measurement and Information Systems, Budapest University of Technology and Economics MTA-BME Lendület Cyber-Physical

More information

Verification of Logic Controllers for Continuous Plants Using Timed Condition/Event-System Models 1

Verification of Logic Controllers for Continuous Plants Using Timed Condition/Event-System Models 1 Automatica - Special Issue on Hybrid Systems, 35:3, March, 1999. Verification of Logic Controllers for Continuous Plants Using Timed Condition/Event-System Models 1 S. Kowalewski, S. Engell, J. Preußig

More information

The algorithmic analysis of hybrid system

The algorithmic analysis of hybrid system The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton

More information

IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata

IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata ICTAC 09 IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata Étienne ANDRÉ Laboratoire Spécification et Vérification LSV, ENS de Cachan & CNRS Étienne ANDRÉ (LSV) ICTAC 09

More information

Stéphane Lafortune. August 2006

Stéphane Lafortune. August 2006 UNIVERSITY OF MICHIGAN DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE LECTURE NOTES FOR EECS 661 CHAPTER 1: INTRODUCTION TO DISCRETE EVENT SYSTEMS Stéphane Lafortune August 2006 References for

More information

Formal Synthesis of Embedded Control Software: Application to Vehicle Management Systems

Formal 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 information

An Introduction to Hybrid Systems Modeling

An Introduction to Hybrid Systems Modeling CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical

More information

Lecture 9 Synthesis of Reactive Control Protocols

Lecture 9 Synthesis of Reactive Control Protocols Lecture 9 Synthesis of Reactive Control Protocols Nok Wongpiromsarn Singapore-MIT Alliance for Research and Technology Richard M. Murray and Ufuk Topcu California Institute of Technology EECI, 16 May 2012

More information

Plasma: A new SMC Checker. Axel Legay. In collaboration with L. Traonouez and S. Sedwards.

Plasma: A new SMC Checker. Axel Legay. In collaboration with L. Traonouez and S. Sedwards. Plasma: A new SMC Checker Axel Legay In collaboration with L. Traonouez and S. Sedwards. 1 Plasma Lab A PLAtform for Statistical Model Analysis A library of statistical model-checking algorithms (Monte-Carlo,

More information

Lecture 6: Reachability Analysis of Timed and Hybrid Automata

Lecture 6: Reachability Analysis of Timed and Hybrid Automata University of Illinois at Urbana-Champaign Lecture 6: Reachability Analysis of Timed and Hybrid Automata Sayan Mitra Special Classes of Hybrid Automata Timed Automata ß Rectangular Initialized HA Rectangular

More information

Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems

Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems Computer Journal Lecture - 22nd June 2009 Manfred Broy Technische Universität München Institut für Informatik

More information

Part I. Principles and Techniques

Part I. Principles and Techniques Introduction to Formal Methods Part I. Principles and Techniques Lecturer: JUNBEOM YOO jbyoo@konkuk.ac.kr Introduction Text System and Software Verification : Model-Checking Techniques and Tools In this

More information

CEGAR:Counterexample-Guided Abstraction Refinement

CEGAR:Counterexample-Guided Abstraction Refinement CEGAR: Counterexample-guided Abstraction Refinement Sayan Mitra ECE/CS 584: Embedded System Verification November 13, 2012 Outline Finite State Systems: Abstraction Refinement CEGAR Validation Refinment

More information

Reasoning about Time and Reliability

Reasoning about Time and Reliability Reasoning about Time and Reliability Probabilistic CTL model checking Daniel Bruns Institut für theoretische Informatik Universität Karlsruhe 13. Juli 2007 Seminar Theorie und Anwendung von Model Checking

More information

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Sanjit A. Seshia and Randal E. Bryant Computer Science Department Carnegie Mellon University Verifying Timed Embedded Systems

More information

Linear Time Logic Control of Discrete-Time Linear Systems

Linear Time Logic Control of Discrete-Time Linear Systems University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada

More information

Computer Science Laboratory, SRI International. Hybrid Systems. Ashish Tiwari SRI International

Computer Science Laboratory, SRI International. Hybrid Systems. Ashish Tiwari SRI International Computer Science Laboratory, SRI International Hybrid Systems Ashish Tiwari SRI International Hybrid Dynamical Systems A hybrid dynamical system consists of hybrid-space: X N n R m That is, some variables

More information

ENES 489p. Verification and Validation: Logic and Control Synthesis

ENES 489p. Verification and Validation: Logic and Control Synthesis 11/18/14 1 ENES 489p Verification and Validation: Logic and Control Synthesis Mumu Xu mumu@umd.edu November 18, 2014 Institute for Systems Research Aerospace Engineering University of Maryland, College

More information

Control Synthesis of Discrete Manufacturing Systems using Timed Finite Automata

Control Synthesis of Discrete Manufacturing Systems using Timed Finite Automata Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application

More information

Quantum Computing Approach to V&V of Complex Systems Overview

Quantum 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 information

Georgios E. Fainekos, Savvas G. Loizou and George J. Pappas. GRASP Lab Departments of CIS, MEAM and ESE University of Pennsylvania

Georgios E. Fainekos, Savvas G. Loizou and George J. Pappas. GRASP Lab Departments of CIS, MEAM and ESE University of Pennsylvania Georgios E. Fainekos, Savvas G. Loizou and George J. Pappas CDC 2006 Math free Presentation! Lab Departments of CIS, MEAM and ESE University of Pennsylvania Motivation Motion Planning 60 50 40 π 0 π 4

More information

Lecture 7 Synthesis of Reactive Control Protocols

Lecture 7 Synthesis of Reactive Control Protocols Lecture 7 Synthesis of Reactive Control Protocols Richard M. Murray Nok Wongpiromsarn Ufuk Topcu California Institute of Technology AFRL, 25 April 2012 Outline Review: networked control systems and cooperative

More information

Using Theorem Provers to Guarantee Closed-Loop Properties

Using Theorem Provers to Guarantee Closed-Loop Properties Using Theorem Provers to Guarantee Closed-Loop Properties Nikos Aréchiga Sarah Loos André Platzer Bruce Krogh Carnegie Mellon University April 27, 2012 Aréchiga, Loos, Platzer, Krogh (CMU) Theorem Provers

More information

A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware

A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware A Formal Model of Clock Domain Crossing and Automated Verification of Time-Triggered Hardware Julien Schmaltz Institute for Computing and Information Sciences Radboud University Nijmegen The Netherlands

More information

MODEL CHECKING TIMED SAFETY INSTRUMENTED SYSTEMS

MODEL CHECKING TIMED SAFETY INSTRUMENTED SYSTEMS TKK Reports in Information and Computer Science Espoo 2008 TKK-ICS-R3 MODEL CHECKING TIMED SAFETY INSTRUMENTED SYSTEMS Jussi Lahtinen ABTEKNILLINEN KORKEAKOULU TEKNISKA HÖGSKOLAN HELSINKI UNIVERSITY OF

More information

APPROXIMATING SWITCHED CONTINUOUS SYSTEMS BY RECTANGULAR AUTOMATA

APPROXIMATING SWITCHED CONTINUOUS SYSTEMS BY RECTANGULAR AUTOMATA European Control Conference 99, Karlsruhe (Germany), August 31 st - September 3 rd, 1999 APPROXIMATING SWITCHED CONTINUOUS SYSTEMS BY RECTANGULAR AUTOMATA O. Stursberg, S. Kowalewski Keywords: Approximation,

More information

THEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006

THEORY OF SYSTEMS MODELING AND ANALYSIS. Henny Sipma Stanford University. Master class Washington University at St Louis November 16, 2006 THEORY OF SYSTEMS MODELING AND ANALYSIS Henny Sipma Stanford University Master class Washington University at St Louis November 16, 2006 1 1 COURSE OUTLINE 8:37-10:00 Introduction -- Computational model

More information

Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture

Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture D.Bresolin, D. Della Monica, A. Montanari, P. Sala, G. Sciavicco ICE-TCS, School of Computer Science, Reykjavik University,

More information

The State Explosion Problem

The 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 information

Algebraic Synthesis of Transition Conditions of a State Model

Algebraic Synthesis of Transition Conditions of a State Model Algebraic Synthesis of Transition Conditions of a State Model Yann Hietter, Jean-Marc Roussel, Jean-Jacques Lesage To cite this version: Yann Hietter, Jean-Marc Roussel, Jean-Jacques Lesage. Algebraic

More information

HybridSAL Relational Abstracter

HybridSAL Relational Abstracter HybridSAL Relational Abstracter Ashish Tiwari SRI International, Menlo Park, CA. ashish.tiwari@sri.com Abstract. In this paper, we present the HybridSAL relational abstracter a tool for verifying continuous

More information

Verification of Hybrid Systems with Ariadne

Verification of Hybrid Systems with Ariadne Verification of Hybrid Systems with Ariadne Davide Bresolin 1 Luca Geretti 2 Tiziano Villa 3 1 University of Bologna 2 University of Udine 3 University of Verona An open workshop on Formal Methods for

More information

FAULT-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. 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 information

Lecture 4 Model Checking and Logic Synthesis

Lecture 4 Model Checking and Logic Synthesis Lecture 4 Model Checking and Logic Synthesis Nok Wongpiromsarn Richard M. Murray Ufuk Topcu EECI, 18 March 2013 Outline Model checking: what it is, how it works, how it is used Computational complexity

More information

A new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation

A new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation A new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation Hao Ren 1 (ren@iastate.edu), Jing Huang 2 (freescaler@live.com), Shengbing Jiang 3 (shengbing.jiang@gm.com)

More information

Safety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty

Safety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty 2008 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 2008 WeAI01.6 Safety Verification of Fault Tolerant Goal-based Control Programs with Estimation Uncertainty Julia

More information

Computation Tree Logic (CTL) & Basic Model Checking Algorithms

Computation 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 information

An introduction to Uppaal and Timed Automata MVP5 1

An introduction to Uppaal and Timed Automata MVP5 1 An introduction to Uppaal and Timed Automata MVP5 1 What is Uppaal? (http://www.uppaal.com/) A simple graphical interface for drawing extended finite state machines (automatons + shared variables A graphical

More information

Hybrid systems and computer science a short tutorial

Hybrid systems and computer science a short tutorial Hybrid systems and computer science a short tutorial Eugene Asarin Université Paris 7 - LIAFA SFM 04 - RT, Bertinoro p. 1/4 Introductory equations Hybrid Systems = Discrete+Continuous SFM 04 - RT, Bertinoro

More information

Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method

Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method Laurent Fribourg and Ulrich Kühne LSV ENS de Cachan, 94235 Cachan, France {kuehne,fribourg}@lsv.ens-cachan.fr Abstract.

More information

Recent results on Timed Systems

Recent results on Timed Systems Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.

More information

Model Checking I. What are LTL and CTL? dack. and. dreq. and. q0bar

Model Checking I. What are LTL and CTL? dack. and. dreq. and. q0bar Model Checking I What are LTL and CTL? q0 or and dack dreq q0bar and 1 View circuit as a transition system (dreq, q0, dack) (dreq, q0, dack ) q0 = dreq and dack = dreq & (q0 + ( q0 & dack)) q0 or and D

More information

SINPLEX - Small Integrated Navigator for PLanetary EXploration Stephen Steffes October 24, 2012 ADCSS 2012

SINPLEX - Small Integrated Navigator for PLanetary EXploration Stephen Steffes October 24, 2012 ADCSS 2012 www.dlr.de Chart 1 > SINPLEX > Stephen Steffes October 24, 2012 SINPLEX - Small Integrated Navigator for PLanetary EXploration Stephen Steffes October 24, 2012 ADCSS 2012 www.dlr.de Chart 2 > SINPLEX >

More information

Program Analysis Part I : Sequential Programs

Program Analysis Part I : Sequential Programs Program Analysis Part I : Sequential Programs IN5170/IN9170 Models of concurrency Program Analysis, lecture 5 Fall 2018 26. 9. 2018 2 / 44 Program correctness Is my program correct? Central question for

More information

Logic Model Checking

Logic Model Checking Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment

More information

The Montana Toolset: Formal Analysis of AADL Specifications

The Montana Toolset: Formal Analysis of AADL Specifications Fremont Associates Process Project QA The Montana Toolset: Formal Analysis of AADL Specifications SAE AS-2 2 Working Group Seal Beach, California 27 January 2005 Outline Origins, Origins, Goals, Plans

More information

Embedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal.

Embedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal. Embedded Systems 2 REVIEW: Actor models A system is a function that accepts an input signal and yields an output signal. The domain and range of the system function are sets of signals, which themselves

More information

Time Petri Nets. Miriam Zia School of Computer Science McGill University

Time Petri Nets. Miriam Zia School of Computer Science McGill University Time Petri Nets Miriam Zia School of Computer Science McGill University Timing Specifications Why is time introduced in Petri nets? To model interaction between activities taking into account their start

More information

Testing with model checkers: A survey

Testing with model checkers: A survey COMPETENCE NETWORK SOFTNET AUSTRIA Testing with model checkers: A survey SNA-TR-2007-P2-04 Gordon Fraser, Franz Wotawa, Paul E. Ammann SNA TECHNICAL REPORT NOVEMBER 2007 Competence Network Softnet Austria,

More information

FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION. Andrés Marcos

FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION. Andrés Marcos FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION 2003 Louisiana Workshop on System Safety Andrés Marcos Dept. Aerospace Engineering and Mechanics, University of Minnesota 28 Feb,

More information

Scalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa

Scalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa Scalable and Accurate Verification of Data Flow Systems Cesare Tinelli The University of Iowa Overview AFOSR Supported Research Collaborations NYU (project partner) Chalmers University (research collaborator)

More information

Ranking Verification Counterexamples: An Invariant guided approach

Ranking Verification Counterexamples: An Invariant guided approach Ranking Verification Counterexamples: An Invariant guided approach Ansuman Banerjee Indian Statistical Institute Joint work with Pallab Dasgupta, Srobona Mitra and Harish Kumar Complex Systems Everywhere

More information

Lecture Notes on Software Model Checking

Lecture Notes on Software Model Checking 15-414: Bug Catching: Automated Program Verification Lecture Notes on Software Model Checking Matt Fredrikson André Platzer Carnegie Mellon University Lecture 19 1 Introduction So far we ve focused on

More information

CS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics

CS256/Spring 2008 Lecture #11 Zohar Manna. Beyond Temporal Logics CS256/Spring 2008 Lecture #11 Zohar Manna Beyond Temporal Logics Temporal logic expresses properties of infinite sequences of states, but there are interesting properties that cannot be expressed, e.g.,

More information

Controlling probabilistic systems under partial observation an automata and verification perspective

Controlling probabilistic systems under partial observation an automata and verification perspective Controlling probabilistic systems under partial observation an automata and verification perspective Nathalie Bertrand, Inria Rennes, France Uncertainty in Computation Workshop October 4th 2016, Simons

More information

Automatic Synthesis of Distributed Protocols

Automatic Synthesis of Distributed Protocols Automatic Synthesis of Distributed Protocols Rajeev Alur Stavros Tripakis 1 Introduction Protocols for coordination among concurrent processes are an essential component of modern multiprocessor and distributed

More information

Decomposition of planning for multi-agent systems under LTL specifications

Decomposition of planning for multi-agent systems under LTL specifications Decomposition of planning for multi-agent systems under LTL specifications Jana Tumova and Dimos V. Dimarogonas KTH Royal Institute of Technology R E C O N F I G December 14, 2015 General Motivation and

More information

Modeling and Analysis of Hybrid Systems

Modeling and Analysis of Hybrid Systems Modeling and Analysis of Hybrid Systems Algorithmic analysis for linear hybrid systems Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen University SS 2015 Ábrahám - Hybrid Systems

More information

Compositional Verification of Industrial Control Systems

Compositional Verification of Industrial Control Systems Compositional Verification of Industrial Control Systems Methods and Case Studies Dissertation zur Erlangung des akademischen Grades Doktor der Naturwissenschaften (Dr. rer. nat.) der Technischen Fakultät

More information

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1 using Predicate Abstraction and Iterative Refinement: Part 1 15-414 Bug Catching: Automated Program Verification and Testing Sagar Chaki November 28, 2011 Outline Overview of Model Checking Creating Models

More information

Formal Verification of an Autonomous Vehicle System

Formal Verification of an Autonomous Vehicle System Submitted, 2008 Conference on Decision and http://www.cds.caltech.edu/~murray/papers/wm08-cdc.html Formal Verification of an Autonomous Vehicle System Tichakorn Wongpiromsarn and Richard M. Murray Abstract

More information

Why fault tolerant system?

Why fault tolerant system? Why fault tolerant system? Non Fault-Tolerant System Component 1 Component 2 Component N The reliability block diagram of a series systemeach element of the system must operate correctly for the system

More information

IC3 and Beyond: Incremental, Inductive Verification

IC3 and Beyond: Incremental, Inductive Verification IC3 and Beyond: Incremental, Inductive Verification Aaron R. Bradley ECEE, CU Boulder & Summit Middle School IC3 and Beyond: Incremental, Inductive Verification 1/62 Induction Foundation of verification

More information

Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties

Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties Application to autonomous satellites Louise Travé-Massuyès 5 February 29 Motivation Control and autonomy of complex dynamic systems

More information

Lecture 4. Applications

Lecture 4. Applications Lecture 4. Applications Summary Tools such as HyTech, CheckMate, Uppaal, Kronos have been used in many contexts typically to verify safety of a control design or to get tight bounds on parameters (e.g.

More information

Testing System Conformance for Cyber-Physical Systems

Testing System Conformance for Cyber-Physical Systems Testing System Conformance for Cyber-Physical Systems Testing systems by walking the dog Rupak Majumdar Max Planck Institute for Software Systems Joint work with Vinayak Prabhu (MPI-SWS) and Jyo Deshmukh

More information

Verifying Safety Properties of Hybrid Systems.

Verifying Safety Properties of Hybrid Systems. Verifying Safety Properties of Hybrid Systems. Sriram Sankaranarayanan University of Colorado, Boulder, CO. October 22, 2010. Talk Outline 1. Formal Verification 2. Hybrid Systems 3. Invariant Synthesis

More information

Hybrid Systems Modeling, Analysis and Control

Hybrid Systems Modeling, Analysis and Control Hybrid Systems Modeling, Analysis and Control Radu Grosu Vienna University of Technology Lecture 6 Continuous AND Discrete Systems Control Theory Continuous systems approximation, stability control, robustness

More information

Lecture 2 Automata Theory

Lecture 2 Automata Theory Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray Outline: Transition systems Linear-time properties Regular propereties EECI, 14 May 2012 This short-course is on this picture applied

More information

Theoretical Foundations of the UML

Theoretical Foundations of the UML Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.

More information

Verification and Anomaly Detection for Event-Based Control of Manufacturing Systems

Verification and Anomaly Detection for Event-Based Control of Manufacturing Systems Verification and Anomaly Detection for Event-Based Control of Manufacturing Systems by Lindsay Victoria Allen A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor

More information

Temporal Logic of Actions

Temporal Logic of Actions Advanced Topics in Distributed Computing Dominik Grewe Saarland University March 20, 2008 Outline Basic Concepts Transition Systems Temporal Operators Fairness Introduction Definitions Example TLC - A

More information

Symbolic Verification of Hybrid Systems: An Algebraic Approach

Symbolic Verification of Hybrid Systems: An Algebraic Approach European Journal of Control (2001)71±16 # 2001 EUCA Symbolic Verification of Hybrid Systems An Algebraic Approach Martin v. Mohrenschildt Department of Computing and Software, Faculty of Engineering, McMaster

More information

Automata, Logic and Games: Theory and Application

Automata, Logic and Games: Theory and Application Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June

More information

Lecture 2 Automata Theory

Lecture 2 Automata Theory Lecture 2 Automata Theory Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 March 2013 Outline Modeling (discrete) concurrent systems: transition systems, concurrency and interleaving Linear-time

More information

Bridging the Gap between Reactive Synthesis and Supervisory Control

Bridging the Gap between Reactive Synthesis and Supervisory Control Bridging the Gap between Reactive Synthesis and Supervisory Control Stavros Tripakis University of California, Berkeley Joint work with Ruediger Ehlers (Berkeley, Cornell), Stéphane Lafortune (Michigan)

More information

Benchmarks for Temporal Logic Requirements for Automotive Systems

Benchmarks for Temporal Logic Requirements for Automotive Systems EPiC Series in Computer Science Volume 34, 5, Pages 5 3 ARCH4-5. st and nd International Workshop on Applied verification for Continuous and Hybrid Systems Benchmarks for Temporal Logic Requirements for

More information

Diagnosis of Dense-Time Systems using Digital-Clocks

Diagnosis of Dense-Time Systems using Digital-Clocks Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code 480-106-390 Warren, MI 48090-9055 Email: shengbing.jiang@gm.com Ratnesh Kumar Dept. of Elec. & Comp. Eng.

More information

On the Synergy of Probabilistic Causality Computation and Causality Checking

On the Synergy of Probabilistic Causality Computation and Causality Checking Technical Report soft-13-01, Chair for Software Engineering, University of Konstanz, Copyright by the Authors 2013 On the Synergy of Probabilistic Causality Computation and Causality Checking Florian Leitner-Fischer

More information

Model Checking. Boris Feigin March 9, University College London

Model Checking. Boris Feigin March 9, University College London b.feigin@cs.ucl.ac.uk University College London March 9, 2005 Outline 1 2 Techniques Symbolic 3 Software 4 Vs. Deductive Verification Summary Further Reading In a nutshell... Model checking is a collection

More information

Supervisory Control of Hybrid Systems

Supervisory Control of Hybrid Systems X.D. Koutsoukos, P.J. Antsaklis, J.A. Stiver and M.D. Lemmon, "Supervisory Control of Hybrid Systems, in Special Issue on Hybrid Systems: Theory and Applications, Proceedings of the IEEE, P.J. Antsaklis,

More information

Formal Methods in Software Engineering

Formal Methods in Software Engineering Formal Methods in Software Engineering Modeling Prof. Dr. Joel Greenyer October 21, 2014 Organizational Issues Tutorial dates: I will offer two tutorial dates Tuesdays 15:00-16:00 in A310 (before the lecture,

More information

ONR 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. 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 information

Assume-Guarantee Reasoning for Hybrid I/O-Automata by Over-Approximation of Continuous Interaction

Assume-Guarantee Reasoning for Hybrid I/O-Automata by Over-Approximation of Continuous Interaction Assume-Guarantee Reasoning for Hybrid I/O-Automata by Over-Approximation of Continuous Interaction Goran Frehse, Zhi Han, Bruce Krogh Department of Electrical and Computer Engineering, Carnegie Mellon

More information

Finite-State Model Checking

Finite-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 information

Fault Detection and Isolation in Manufacturing Systems with an Identi ed Discrete Event Model

Fault Detection and Isolation in Manufacturing Systems with an Identi ed Discrete Event Model Fault Detection and Isolation in Manufacturing Systems with an Identi ed Discrete Event Model Matthias Roth, Stefan Schneider, Jean-Jacques Lesage, Lothar Litz To cite this version: Matthias Roth, Stefan

More information

Reachability Analysis for Hybrid Dynamic Systems*

Reachability Analysis for Hybrid Dynamic Systems* Reachability nalysis for Hybrid Dynamic Systems* Olaf Stursberg Faculty of Electrical Engineering and Information Technology Technische Universität München * Thanks to: Matthias lthoff, Edmund M. Clarke,

More information

Lecture 11: Timed Automata

Lecture 11: Timed Automata Real-Time Systems Lecture 11: Timed Automata 2014-07-01 11 2014-07-01 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC (un)decidability This Lecture:

More information

Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66

Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66 Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66 Teknillisen korkeakoulun tietojenkäsittelyteorian laboratorion tutkimusraportti 66 Espoo 2000 HUT-TCS-A66

More information

Determining the Existence of DC Operating Points in Circuits

Determining the Existence of DC Operating Points in Circuits Determining the Existence of DC Operating Points in Circuits Mohamed Zaki Department of Computer Science, University of British Columbia Joint work with Ian Mitchell and Mark Greenstreet Nov 23 nd, 2009

More information

Real-Time Systems. Lecture 10: Timed Automata Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany main

Real-Time Systems. Lecture 10: Timed Automata Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany main Real-Time Systems Lecture 10: Timed Automata 2013-06-04 10 2013-06-04 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: PLC, PLC automata This Lecture:

More information

Safety Verification and Failure Analysis of Goal-Based Hybrid Control Systems

Safety Verification and Failure Analysis of Goal-Based Hybrid Control Systems Safety Verification and Failure Analysis of Goal-Based Hybrid Control Systems Thesis by Julia M. B. Braman In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute

More information

(Refer Slide Time: 00:01:30 min)

(Refer Slide Time: 00:01:30 min) Control Engineering Prof. M. Gopal Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 3 Introduction to Control Problem (Contd.) Well friends, I have been giving you various

More information