Verification in Continuous Time Recent Advances

Similar documents
Workstation Cluster. AVACS S3 Phase 2. July 28, 2011

PRISM 4.0: Verification of Probabilistic Real-Time Systems

PRISM An overview. automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation,

Improved BDD-based Discrete Analysis of Timed Systems

UPPAAL Tutorial. UPPAAL Family

An MTBDD-based Implementation of Forward Reachability for Probabilistic Timed Automata

An Introduction to UPPAAL. Purandar Bhaduri Dept. of CSE IIT Guwahati

The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification

Stochastic Games for Verification of Probabilistic Timed Automata

CAV th July 2013 Saint Petersburg, Russia. PSyHCoS. Parameter Synthesis for Hierarchical Concurrent Real-Time Systems

Developing Uppaal over 15 Years

Priced Timed Automata and Timed Games. Kim G. Larsen Aalborg University, DENMARK

Uppaal Stratego. Alexandre David Peter Gjøl Jensen Kim Guldstrand Larsen Marius Mikucionis Jakob Haahr Taankvist

Overview of Timed Automata and UPPAAL

Incremental Runtime Verification of Probabilistic Systems

ISCASMC: A Web-Based Probabilistic Model Checker

Reasoning about Timed Systems Using Boolean Methods

Probabilistic Model Checking. Mohammad Roohitavaf

CONTROLLER DEPENDABILITY ANALYSIS BY PROBABILISTIC MODEL CHECKING. Marta Kwiatkowska, Gethin Norman and David Parker

Model-based GUI testing using Uppaal at NOVO Nordisk

To Store or Not To Store

PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games

Transient Analysis Of Stochastic Petri Nets With Interval Decision Diagrams

COMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University

Symbolic and Statistical Model Checking in UPPAAL

A game-theoretic approach to real-time system testing David, Alexandre; Larsen, Kim Guldstrand; Li, Shuhao; Nielsen, Brian

A Test Case Generation Algorithm for Real-Time Systems

Further Topics in Modelling & Verification

Lecture 2. Decidability and Verification

PARAM: A Model Checker for Parametric Markov Models

Formal Methods in CPS

TTM/PAT: Specifying and Verifying Timed Transition Models

Temporal Logic and Timed Automata

Stochastic Petri nets

Quantitative analysis of real-time systems

Modeling and Verification of Real-Time Systems

Beyond Model Checking: Parameters Everywhere

Lecture 9: Reachability

Software verification for ubiquitous computing

Towards Compositional Testing of Real-Time Systems

Statistical Model Checking in UPPAAL

Model-Checking and Simulation for Stochastic Timed Systems

Statistical Model Checking in UPPAAL

Analysis of a Gossip Protocol in PRISM

Grid-enabled Probabilistic Model Checking with PRISM

The UPPAAL Model Checker. Julián Proenza Systems, Robotics and Vision Group. UIB. SPAIN

From Timed Automata to Stochastic Hybrid Games

Verification Options. To Store Or Not To Store? Inside the UPPAAL tool. Inactive (passive) Clock Reduction. Global Reduction

RT-Studio: A tool for modular design and analysis of realtime systems using Interpreted Time Petri Nets

Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM

Temporal Refinement Using SMT and Model Checking with an Application to Physical-Layer Protocols

TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets

A Modeling Framework for Schedulability Analysis of Distributed Avionics Systems. Pujie Han MARS/VPT Thessaloniki, 20 April 2018

Offline Monte Carlo Tree Search for Statistical Model Checking of Markov Decision Processes

Verification of Two Real-Time Systems Using Parametric Timed Automata

Offline Monte Carlo Tree Search for Statistical Model Checking of Markov Decision Processes

Quasimodo. under uncertainty. Alexandre David & K.G Larsen & Aalborg University, DK.

Dynamic Clock Elimination in Parametric Timed Automata

AN ABSTRACTION TECHNIQUE FOR REAL-TIME VERIFICATION

ECE 587 Hardware/Software Co-Design Lecture 12 Verification II, System Modeling

Timed Automata From Theory to Implementation

Proseminar. (with Eclipse) Jun.-Prof. Dr.-Ing. Steffen Becker. Model-Driven Software Engineering. Software Engineering Group

Aalborg Universitet. Published in: Lecture Notes in Computer Science. DOI (link to publication from Publisher): / _29

Editor. Analyser XML. Scheduler. generator. Code Generator Code. Scheduler. Analyser. Simulator. Controller Synthesizer.

want turn==me wait req2==0

Probabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford

Xuandong Li. BACH: Path-oriented Reachability Checker of Linear Hybrid Automata

Intro to UPPAAL. Gerd Behrmann Kim Larsen. BRICS & Aalborg University. Intro to UPPAAL p.1/23

TIMES A Tool for Modelling and Implementation of Embedded Systems

UPPAAL. Verification Engine, Options & Patterns. Alexandre David

Efficient Synthesis of Production Schedules by Optimization of Timed Automata

More on Verification and Model Checking

Kahina Gani, Marinette Bouet, Michel Schneider, and Farouk Toumani. 1 2

Parametric Real Time System Feasibility Analysis Using Parametric Timed Automata

A Symbolic Out-of-Core Solution Method for Markov Models

Verifying Concurrent Programs

M. De Wulf, L. Doyen,J.-F. Raskin Université Libre de Bruxelles Centre Fédéré en Vérification

Probabilistic Model Checking

With thanks to. Main collaborators on probabilistic model checking

Modeling and Verification of Priority Assignment in Real-Time Databases Using Uppaal

Strategies for simulating pedestrian navigation with multiple reinforcement learning agents

IMPLEMENTATION OF SYMBOLIC MODEL CHECKING FOR PROBABILISTIC SYSTEMS DAVID ANTHONY PARKER

Model Checking Revision: Model Checking for Infinite Systems Revision: Traffic Light Controller (TLC) Revision: 1.12

COMPASS: FORMAL METHODS FOR SYSTEM-SOFTWARE CO-ENGINEERING

Reliability and Dependability in Computer Networks. CS 552 Computer Networks Side Credits: A. Tjang, W. Sanders

Software Engineering of Robots

A Toolchain for Home Automation Controller Development

arxiv: v2 [cs.cr] 25 Jul 2013

Timed Automata: Semantics, Algorithms and Tools

arxiv: v1 [cs.se] 14 Feb 2017

Software Testing IV. Prof. Dr. Holger Schlingloff. Humboldt-Universität zu Berlin

Analysis of the Zeroconf Protocol Using UPPAAL

Temporal logic-based decision making and control. Jana Tumova Robotics, Perception, and Learning Department (RPL)

Automatic synthesis of switching controllers for linear hybrid systems: Reachability control

Lecture 2: Symbolic Model Checking With SAT

Quan%ta%ve Verifica%on: Formal Guarantees for Timeliness, Reliability and Performance

Component based Verification of Distributed Automation Systems based on Model Composition

JANI: Quantitative Model and Tool Interaction

Compositional Analysis of Discrete Time Petri nets

A Modal Specification Approach for Assuring the Safety of On-Demand Medical Cyber-Physical Systems

Transcription:

Verification in Continuous Time Recent Advances Hongyang Qu Department of Automatic Control and Systems Engineering University of Sheffield 10 March 2017

Outline Motivation Probabilistic models Real-time models Probabilistic real-time models Hybrid models Future work: Probabilistic hybrid models

Motivation Models with continuous time can be more accurate for verification of autonomous systems Sensors have time constraints Kinematic operations take time Control algorithms take time Adina Aniculaesei, Daniel Arnsberger, Falk Howar, Andreas Rausch: Towards the Verification of Safety-critical Autonomous Systems in Dynamic Environments. V2CPS@IFM 2016: 79-90

Continuous time Markov Chains (CTMCs) Transitions can be triggered at any time instant Delay is modelled by exponential distributions

Verification techniques for CTMCs Value iteration Linear programming Simulation

PRISM The most popular probabilistic model checker Support DTMC/MDP/CTMC and other probabilistic models Support PCTL/CSL/LTL logics and reward structure Various verification engines http://www.prismmodelchecker.org/screenshots.php

Continuous time Markov Decision Processes (CTMDPs) CTMC + MDP Verification techniques for CTMCs can applied to CTMDPs Need to solve scheduler selection Martin R. Neuhäußer, Lijun Zhang: Time-Bounded Reachability Probabilities in Continuous-Time Markov Decision Processes. QEST 2010: 209-218

Timed Automata (TAs) Modelling real-time clocks Clocks run at the same speed and can be reset Simple time constraints on clocks Peter Niebert, Hongyang Qu: Adding Invariants to Event Zone Automata. FORMATS 2006: 290-305

Verification techniques for TAs DBM (Difference Bound Matrices) RED (Region Encoding Diagram) CRD (Clock-Restriction Diagrams) BMC (Bounded Model Checking) BDD (Binary Decision Diagrams) Assume-Guarantee (compositional) reasoning

UPPAAL The most popular model checker for timed automata Sophisticated GUI Support TCTL logics Based on DBM http://www.uppaal.org/

RED/REDLIB Symbolic model checker for timed automata Support TCTL logics Support CRD and HRD Farn Wang: Efficient verification of timed automata with BDD-like data structures. STTT 6(1): 77-97 (2004)

PAT Automatic compositional verification of Event- Recording Automata Also support discrete models using partial order reduction and various techniques Shang-Wei Lin, Yang Liu, Jun Sun, Jin Song Dong, Étienne André: Automatic Compositional Verification of Timed Systems. FM 2012: 272-276

Timed Petri-Net Serge Haddad: Time and Timed Petri Nets. http://www.lsv.ens-cachan.fr/~haddad/disc11-part1.pdf

Probabilistic Timed Automata (PTAs) MDP + Timed automata Mohammed Y. Hazim, Hongyang Qu, Sandor M. Veres: Testing, Verification and Improvements of Timeliness in ROS Processes. TAROS 2016: 146-157

Probabilistic Timed Programs Klaus Dräger, Marta Z. Kwiatkowska, David Parker, Hongyang Qu: Local abstraction refinement for probabilistic timed programs. Theor. Comput. Sci. 538: 37-53 (2014)

Verification techniques for PTAs Digital clock Two-player stochastic games Local abstraction refinement

Timed Game Automata Controllable and uncontrollable actions Uncontrollable actions have higher priority Reachability control problem is to find a winning strategy such that all runs in the strategy satisfy a property Gerd Behrmann, Agnès Cougnard, Alexandre David, Emmanuel Fleury, Kim Guldstrand Larsen, Didier Lime: UPPAAL-Tiga: Time for Playing Games! CAV 2007: 121-125

UPPAAL-TIGA http://people.cs.aau.dk/~adavid/tiga/

Hybrid Automata Timed automata + continuous variables Linear hybrid automata can be solved by HRD Olaf Müller, Thomas Stauner: Modelling and Verification using Linear Hybrid Automata - a Case Study. Mathematical Modelling of Systems 1(1): 000-111

KeYmaera X Automated and interactive theorem prover for hybrid automata Support some non-linear fequations http://symbolaris.com/info/keymaera.html

Probabilistic hybrid models Generally undecidable Can be processed by approximation Marta Kwiatkowska, Ernst Moritz Hahn, Holger Hermanns, Arnd Hartmanns: Model Checking for Model Checking for Probabilistic Hybrid Systems. CPSWeek 2013