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

Size: px
Start display at page:

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

Transcription

1 Uppaal Stratego Alexandre David Peter Gjøl Jensen Kim Guldstrand Larsen Marius Mikucionis Jakob Haahr Taankvist Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, 9220 Aalborg Øst, Denmark October 30, 2014

2 Motivation - Different Uppaal versions Uppaal Uppaal-SMC

3 Motivation - Uppaal Stratego Uppaal Uppaal-SMC

4 Branches of Uppaal - Uppaal Classical Uppaal Classical timed model checking Timed Automata (TAs) Safety - A[] not (Peter.SEC1 && Kim.Done Liveness - A<> Peter.Done && Jakob.Done && Kim.Done && Marius.Done True/False answers

5 Branches of Uppaal - Timed Games (TGAs) (Controller/Environment) Find a strategy Safety - A[] Peter.Done && Jakob.Done && Kim.Done && Marius.Done imply time <= 60 Strategies (most permissive)

6 Branches of Uppaal - Uppaal-SMC Stochastic timed automata. Probabilities - Pr[<=100] (<> Peter.Done && Jakob.Done && Kim.Done && Marius.Done && time <= 60) Expectations E[<=100,1000] (max: Peter.WTime) Quantitative answers or True/False answers

7 Branches of Uppaal player games (Controller/stochastic environment) Learn a strategy Maximize/minimize (mine (Peter.WTime) [<=100]: Near optimal <> Peter.Done)

8 Contribution Merge Uppaal,, Uppaal-SMC and Make accessible Facilitate exploration of strategy-space

9 Overview timed game G abstraction (synthesis) φ time automata ((statistical)model checking) strategy Uppaal/Uppaal-SMC σ G σ P P σ stochastic priced timed game φ (synthesis) σ strategy P σ stochastic timed atomata (statistical model checking) Uppaal-SMC

10 Types of Strategies Generated by: Nondeterministic

11 Types of Strategies Generated by: Nondeterministic Abstract away probabilities Uniformize Used by: Uppaal-SMC Stochastic

12 Types of Strategies Generated by: Nondeterministic Abstract away probabilities Uniformize Used by: Uppaal-SMC Stochastic Determinize Determinize Deterministic Generated by:, Used by: Uppaal-SMC

13 Types of Strategies Generated by: Nondeterministic Abstract away probabilities Uniformize Used by: Uppaal-SMC Stochastic Determinize Determinize Zone-based Used by: Uppaal Deterministic Generated by:, Used by: Uppaal-SMC

14 Architecture of Uppaal Stratego GUI Engine Algorithms Uppaal Parser Uppaal-SMC Storage Strategies Strategies

15 Updated Query Language Strategy generators using Minimize objective strategy DS = mine (expr) [bound]: <> prop under NS Maximize objective strategy DS = maxe (expr) [bound]: <> prop under NS Strategy generators using Guarantee objective strategy NS = control: A<> prop Guarantee objective strategy NS = control: A[] prop Statistical Model Checking Queries Hypothesis testing Pr[bound](<> prop)>=0.1 under SS Evaluation Pr[bound](<> prop) under SS Comparison Pr[bound](<> prop1) under SS1 >= Pr[<=20](<> prop2) under SS2 Expected value E[bound;int](min: prop) under SS Simulations simulate int [bound]{expr1,expr2} under SS Safety Liveness A[] prop under NS A<> prop under NS Model checking queries

16 Demonstration

17 Conclusions and Further Work Conclusions Integration of Uppaal, Uppaal-SMC, and New ways of exploring First time is accessible Further work Include other versions of Uppaal Play against learned Export/import More use of (Model check of learned )

Statistical Model Checking in UPPAAL

Statistical Model Checking in UPPAAL Statistical Model Checking in UPPAAL Alexandre David, Kim G. Larsen, Marius Mikucionis Axel Legay, Wang Zheng, Peter Bulychev, Jonas van Vliet, Danny Poulsen, Dehui Du, Guangyuan Li CAV 11, PDMC 11,FORMATS

More information

Statistical Model Checking in UPPAAL

Statistical Model Checking in UPPAAL Statistical Model Checking in UPPAAL Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikucionis Wang Zheng, Peter Bulychev, Jonas van Vliet, Danny Poulsen, Dehui Du, Guangyuan Li CAV 11, PDMC 11,FORMATS

More information

Formal Methods in CPS

Formal Methods in CPS Formal Methods in CPS A Computer Science Perspective Kim G. Larsen Aalborg University, DENMARK From Timed Automata to Stochastic Hybrid Games Model Checking, Performance Evaluation and Synthesis Kim G.

More information

UPPAAL Tutorial. UPPAAL Family

UPPAAL Tutorial. UPPAAL Family UPPAAL Tutorial Beyond UPPAAL Alexandre David Paul Pettersson RTSS 05 Classic : real-time verification Cora: real-time scheduling Tron: online real-time testing Tiga: timed game Times: schedulability analysis

More information

Symbolic and Statistical Model Checking in UPPAAL

Symbolic and Statistical Model Checking in UPPAAL Symbolic and Statistical Model Checking in UPPAAL Alexandre David Kim G. Larsen Marius Mikucionis, Peter Bulychev, Axel Legay, Dehui Du, Guangyuan Li, Danny B. Poulsen, Amélie Stainer, Zheng Wang CAV11,

More information

Towards Compositional Testing of Real-Time Systems

Towards Compositional Testing of Real-Time Systems Towards Compositional Testing of Real-Time Systems Kim G Larsen, Axel Legay, Marius Mikucionis, Brian Nielsen, Ulrik Nyman Aalborg University, DENMARK Compositional Testing Integration of fully conformant

More information

Verification in Continuous Time Recent Advances

Verification in Continuous Time Recent Advances 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

More information

Validation and Performance Analysis

Validation and Performance Analysis Validation and Performance Analysis of CPS in UPPAAL Kim G. Larsen Aalborg University, DENMARK Cyber Physical Systems Discrete OPTIMAL: finding a controller for a given system such that a certain optimality

More information

TAPAS. Tests and Proofs and Synthesis. Kim G Larsen Aalborg University, DENMARK

TAPAS. Tests and Proofs and Synthesis. Kim G Larsen Aalborg University, DENMARK TAPAS Tests and Proofs and Synthesis Kim G Larsen Aalborg University, DENMARK TAPAS From Testing and Verification to Performance Analysis and Synthesis of Cyber-Physical Systems Kim G Larsen Aalborg University,

More information

Model-based GUI testing using Uppaal at NOVO Nordisk

Model-based GUI testing using Uppaal at NOVO Nordisk Model-based GUI testing using Uppaal at NOVO Nordisk Ulrik H. Hjort 2, Jacob Illum 1, Kim G. Larsen 1, Michael A. Petersen 2, and Arne Skou 1 1 Department of Computer Science, Aalborg University, Denmark

More information

Strategy Generation for Distributed Smart Production Systems based on Networks of Timed Automata

Strategy Generation for Distributed Smart Production Systems based on Networks of Timed Automata Strategy Generation for Distributed Smart Production Systems based on Networks of Timed Automata Master Thesis Group: DEIS103F18 Supervisor: Ulrik Nyman Computer Science Aalborg University 22 nd May 2018

More information

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

A game-theoretic approach to real-time system testing David, Alexandre; Larsen, Kim Guldstrand; Li, Shuhao; Nielsen, Brian Aalborg Universitet A game-theoretic approach to real-time system testing David, Alexandre; Larsen, Kim Guldstrand; Li, Shuhao; Nielsen, Brian Published in: Design, Automation and Test in Europe DOI (link

More information

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

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

More information

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

TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets Joakim Byg, Kenneth Yrke Jørgensen, and Jiří Srba Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, 9220 Aalborg

More information

Overview of Timed Automata and UPPAAL

Overview of Timed Automata and UPPAAL Overview of Timed Automata and UPPAAL Table of Contents Timed Automata Introduction Example The Query Language UPPAAL Introduction Example Editor Simulator Verifier Conclusions 2 Introduction to Timed

More information

Developing Uppaal over 15 Years

Developing Uppaal over 15 Years Developing Uppaal over 15 Years Gerd Behrmann 1, Alexandre David 2, Kim Guldstrand Larsen 2, Paul Pettersson 3, and Wang Yi 4 1 NORDUnet A/S, Copenhagen, Denmark 2 Department of Computer Science, Aalborg

More information

Further Topics in Modelling & Verification

Further Topics in Modelling & Verification Further Topics in Modelling & Verification Thursday Oct 09, 2014 Philipp Rümmer Uppsala University Philipp.Ruemmer@it.uu.se 1/34 Recap: Timed automata (TA) 2/34 Recap: Properties 3/34 Questions about TA

More information

Communication Complexity and Parallel Computing

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

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

PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games Marta Kwiatkowska 1, David Parker 2, and Clemens Wiltsche 1 1 Department of Computer Science, University of Oxford, UK

More information

Toolchain for User-Centered Intelligent Floor Heating Control

Toolchain for User-Centered Intelligent Floor Heating Control Toolchain for User-Centered Intelligent Floor Heating Control Mads Kronborg Agesen, Kim Guldstrand Larsen, Marius Mikučionis, Marco Muñiz, Petur Olsen, Thomas Pedersen, Jiří Srba, Arne Skou Department

More information

A Test Case Generation Algorithm for Real-Time Systems

A Test Case Generation Algorithm for Real-Time Systems A Test Case Generation Algorithm for Real-Time Systems Anders Hessel and Paul Pettersson Department of Information Technology Uppsala University, P.O. Box 337 SE-751 05 Uppsala, Sweden {hessel,paupet}@it.uu.se

More information

WCET Analysis of Java Bytecode Featuring Common Execution Environments

WCET Analysis of Java Bytecode Featuring Common Execution Environments WCET Analysis of Java Bytecode Featuring Common Execution Environments Kasper Søe Luckow Joint work with Christian Frost, Casper Svenning Jensen, and Bent Thomsen Department of Computer Science, Aalborg

More information

Safra's Büchi determinization algorithm

Safra's Büchi determinization algorithm Safra's Büchi determinization algorithm Aditya Oak Seminar on Automata Theory 28 Jan 2016 Introduction Proposed by S. Safra in 1988 For determinization of non-deterministic Büchi automaton Gives equivalent

More information

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

An Introduction to UPPAAL. Purandar Bhaduri Dept. of CSE IIT Guwahati An Introduction to UPPAAL Purandar Bhaduri Dept. of CSE IIT Guwahati Email: pbhaduri@iitg.ernet.in OUTLINE Introduction Timed Automata UPPAAL Example: Train Gate Example: Task Scheduling Introduction UPPAAL:

More information

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

COMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University Eugene Syriani Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science McGill University 1 OVERVIEW In the context In Theory: Timed Automata The language: Definitions and Semantics

More information

Quantitative Timing Analysis of UML Activity Digrams using Statistical Model Checking

Quantitative Timing Analysis of UML Activity Digrams using Statistical Model Checking Quantitative Timing Analysis of UML Activity Digrams using Statistical Model Checking Fan Gu 1, Xinqian Zhang 1, Mingsong Chen 1, Daniel Grosse 2 and Rolf Drechsler 2 1 Institute of CS & SE, East China

More information

A Toolchain for Home Automation Controller Development

A Toolchain for Home Automation Controller Development A Toolchain for Home Automation Controller Development Peter H. Dalsgaard, Thibaut Le Guilly, Daniel Middelhede, Petur Olsen, Thomas Pedersen, Anders P. Ravn, Arne Skou Department of Computer Science Aalborg

More information

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

Aalborg Universitet. Published in: Lecture Notes in Computer Science. DOI (link to publication from Publisher): / _29 Aalborg Universitet ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems David, Alexandre; Larsen, Kim Guldstrand; Nyman, Ulrik Mathias; Legay, Axel; Wasowski, Andrzej Published

More information

To Store or Not To Store

To Store or Not To Store To Store or Not To Store Radek Pelánek Masaryk University, Brno Gerd Behrmann, Kim G. Larsen Aalborg University To Store or Not To Store p.1/24 Reachability Problem Model: networks of timed automata with

More information

want turn==me wait req2==0

want turn==me wait req2==0 Uppaal2k: Small Tutorial Λ 16 October 2002 1 Introduction This document is intended to be used by new comers to Uppaal and verification. Students or engineers with little background in formal methods should

More information

Recognizing regular tree languages with static information

Recognizing regular tree languages with static information Recognizing regular tree languages with static information Alain Frisch (ENS Paris) PLAN-X 2004 p.1/22 Motivation Efficient compilation of patterns in XDuce/CDuce/... E.g.: type A = [ A* ] type B =

More information

From Timed Automata to Stochastic Hybrid Games

From Timed Automata to Stochastic Hybrid Games From Timed Automata to Stochastic Hybrid Games Model Checking, Performance Analysis, Optimization, Synthesis, and Machine Learning Kim G. Larsen Aalborg University, DENMARK Topics Timed Automata Decidability

More information

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

Quasimodo. under uncertainty. Alexandre David & K.G Larsen & Aalborg University, DK. Quasimodo Testing real-time systems under uncertainty Alexandre David & K.G Larsen & & Shuhaoh Li & Bi Brian Nielsen Aalborg University, DK bnielsen@cs.aau.dk FMCO, Graz, December 1, 2010 Page 1 Automated

More information

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

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

More information

Controller Synthesis for Home Automation

Controller Synthesis for Home Automation Controller Synthesis for Home Automation Mathias Grund Sørensen Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, 9220 Aalborg Øst, Denmark Abstract. A large challenge in home

More information

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach Peter Bulychev Aalborg University, Denmark pbulychev@cs.aau.dk Alexandre David Aalborg University, Denmark adavid@cs.aau.dk

More information

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

opaal: A Lattice Model Checker

opaal: A Lattice Model Checker opaal: A Lattice Model Checker Andreas Engelbredt Dalsgaard, René Rydhof Hansen, Kenneth Yrke Jørgensen, Kim Gulstrand Larsen, Mads Chr. Olesen, Petur Olsen, and Jiří Srba Department of Computer Science,

More information

CSE 203A: Randomized Algorithms

CSE 203A: Randomized Algorithms CSE 203A: Randomized Algorithms (00:30) The Minimax Principle (Ch 2) Lecture on 10/18/2017 by Daniel Kane Notes by Peter Greer-Berezovsky Game Tree Evaluation (2.1) - n round deterministic 2-player game

More information

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

Intro to UPPAAL. Gerd Behrmann Kim Larsen. BRICS & Aalborg University. Intro to UPPAAL p.1/23 Intro to UPPAAL p.1/23 Intro to UPPAAL Gerd Behrmann Kim Larsen BRICS & Aalborg University Intro to UPPAAL p.2/23 Plan of the Lecture 1. UPPAAL Architecture 2. UPPAAL Features 3. Train Gate Example 4.

More information

Towards Translating FSM-SADF to Timed Automata

Towards Translating FSM-SADF to Timed Automata Towards Translating FSM-SADF to Timed Automata Mladen Skelin Department of Engineering Cybernetics, Norwegian University of Science and Technology mladen.skelin@itk.ntnu.no Erik Ramsgaard Wognsen, Mads

More information

MANY real-time applications need to store some data

MANY real-time applications need to store some data Proceedings of the International Multiconference on Computer Science and Information Technology pp. 673 678 ISBN 978-83-60810-14-9 ISSN 1896-7094 Modeling Real-Time Database Concurrency Control Protocol

More information

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach

Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach Computing Nash Equilibrium in Wireless Ad Hoc Networks: A Simulation-Based Approach Peter Bulychev Aalborg University, Denmark pbulychev@cs.aau.dk Alexandre David Aalborg University, Denmark adavid@cs.aau.dk

More information

Towards Generation of Adaptive Test Cases from Partial Models of Determinized Timed Automata

Towards Generation of Adaptive Test Cases from Partial Models of Determinized Timed Automata Towards Generation of Adaptive Test Cases from Partial Models of Determinized Timed Automata Bernhard K. Aichernig and Florian Lorber Institute for Software Technology, Graz University of Technology, Austria

More information

Synthesizing Energy-Optimal Controllers for Multiprocessor Dataflow Applications with UPPAAL STRATEGO

Synthesizing Energy-Optimal Controllers for Multiprocessor Dataflow Applications with UPPAAL STRATEGO Synthesizing Energy-Optimal Controllers for Multiprocessor Dataflow Applications with UPPAAL STRATEGO Waheed Ahmad and Jaco van de Pol University of Twente, The Netherlands, {w.ahmad, j.c.vandepol}@utwente.nl

More information

Opaal Dalsgaard, Andreas Engelbredt; Hansen, Rene Rydhof; Jørgensen, Kenneth Yrke; Larsen, Kim Guldstrand; Olesen, Mads Chr.; Olsen, Petur; Srba, Jiri

Opaal Dalsgaard, Andreas Engelbredt; Hansen, Rene Rydhof; Jørgensen, Kenneth Yrke; Larsen, Kim Guldstrand; Olesen, Mads Chr.; Olsen, Petur; Srba, Jiri Aalborg Universitet Opaal Dalsgaard, Andreas Engelbredt; Hansen, Rene Rydhof; Jørgensen, Kenneth Yrke; Larsen, Kim Guldstrand; Olesen, Mads Chr.; Olsen, Petur; Srba, Jiri Published in: Lecture Notes in

More information

Automatic Test Generation and Mutation Analysis using UPPAAL SMC

Automatic Test Generation and Mutation Analysis using UPPAAL SMC Automatic Test Generation and Mutation Analysis using UPPAAL SMC Mälardalens Högskola Akademin för Innovation, Design och Teknik Jonatan Larsson JLN13010@student.mdh.se Bachelor of Computer Science 2017-06-04

More information

UPPAAL. Validation and Verication of Real Time Systems. Status & Developments y. Abstract

UPPAAL. Validation and Verication of Real Time Systems. Status & Developments y. Abstract UPPAAL Validation and Verication of Real Time Systems Status & Developments y Kim G Larsen z Paul Pettersson x Wang Yi x Abstract Uppaal is a tool box for validation (via graphical simulation) and verication

More information

Overview. Leader Election Protocol. Dynamic Voltage Scaling. Optimal Reconfiguration of FPGA. Memory Interface. UCb

Overview. Leader Election Protocol. Dynamic Voltage Scaling. Optimal Reconfiguration of FPGA. Memory Interface. UCb APPLICATIONS UC b Overview Leader Election Protocol Dynamic Voltage Scaling Optimal Reconfiguration of FPGA Memory Interface Leader Election Protocol UC b Leader Election 2 1 0 3 Protocol by Leslie Lamport

More information

Hardware-Software Codesign

Hardware-Software Codesign Hardware-Software Codesign 8. Performance Estimation Lothar Thiele 8-1 System Design specification system synthesis estimation -compilation intellectual prop. code instruction set HW-synthesis intellectual

More information

UPPAAL. Verification Engine, Options & Patterns. Alexandre David

UPPAAL. Verification Engine, Options & Patterns. Alexandre David UPPAAL Verification Engine, Options & Patterns Alexandre David 1.2.05 Outline UPPAAL Modelling Language Specification Language UPPAAL Verification Engine Symbolic exploration algorithm Zones & DBMs Verification

More information

Schedulability Analysis of Herschel/Planck Software using UPPAAL

Schedulability Analysis of Herschel/Planck Software using UPPAAL Schedulability Analysis of Herschel/Planck Software using UPPAAL Terma Case Study Marius Mikučionis, Kim G. Larsen, Jacob I. Rasmussen, Arne Skou, Brian Nielsen, Steen Palm, Jan Pedersen, Poul Hougaard

More information

plant OUTLINE The Same Goal: Reliable Controllers Who is Who in Real Time Systems

plant OUTLINE The Same Goal: Reliable Controllers Who is Who in Real Time Systems OUTLINE Introduction Lecture 1: Motivation, examples, problems to solve Modeling and Verication of Timed Systems Lecture 2: Timed automata, and timed automata in UAAL Lecture 3: Symbolic verification:

More information

Testing and Verification

Testing and Verification Final Review Brussels, December 12th, 2008 Achievements and Perspectives : Testing and Verification Cluster leader : Kim Guldstrand Larsen CISS, Aalborg University, DENMARK Core Partners of the Cluster

More information

(University Improving of Montreal) Generative Adversarial Networks with Denoising Feature Matching / 17

(University Improving of Montreal) Generative Adversarial Networks with Denoising Feature Matching / 17 Improving Generative Adversarial Networks with Denoising Feature Matching David Warde-Farley 1 Yoshua Bengio 1 1 University of Montreal, ICLR,2017 Presenter: Bargav Jayaraman Outline 1 Introduction 2 Background

More information

Combining Statistical and Online Model Checking based on UPPAAL and PRISM

Combining Statistical and Online Model Checking based on UPPAAL and PRISM Master Thesis Sascha Lehmann Combining Statistical and Online Model Checking based on UPPAAL and PRISM October 1, 216 supervised by: Prof. Dr. Sibylle Schupp Prof. Dr. Alexander Schlaefer Hamburg University

More information

TiPEX: A Tool Chain for Timed Property Enforcement During execution

TiPEX: A Tool Chain for Timed Property Enforcement During execution TiPEX: A Tool Chain for Timed Property Enforcement During execution Srinivas Pinisetty, Yliès Falcone, Thierry Jéron, Hervé Marchand To cite this version: Srinivas Pinisetty, Yliès Falcone, Thierry Jéron,

More information

2 after reception of a message from the sender, do one of two things: either the message is delivered to the receiver, or it is lost. The loss of a me

2 after reception of a message from the sender, do one of two things: either the message is delivered to the receiver, or it is lost. The loss of a me Protocol Verification using UPPAAL: Exercises? Lab assistant: Alexandre David Department of Computer Systems (room 1237, mailbox 26), Uppsala University, Box 325, S751 05, Uppsala. Phone: 018-18 73 41.

More information

A Tutorial on Uppaal

A Tutorial on Uppaal A Tutorial on Uppaal Updated 25th October 2005 Gerd Behrmann, Alexandre David, and Kim G. Larsen Department of Computer Science, Aalborg University, Denmark {behrmann,adavid,kgl}@cs.auc.dk. Abstract. This

More information

Specification and Analysis of Real-Time Systems Using Real-Time Maude

Specification and Analysis of Real-Time Systems Using Real-Time Maude Specification and Analysis of Real-Time Systems Using Real-Time Maude Peter Csaba Ölveczky1,2 and José Meseguer 1 1 Department of Computer Science, University of Illinois at Urbana-Champaign 2 Department

More information

Efficient Synthesis of Production Schedules by Optimization of Timed Automata

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

Formal Languages and Grammars. Chapter 2: Sections 2.1 and 2.2

Formal Languages and Grammars. Chapter 2: Sections 2.1 and 2.2 Formal Languages and Grammars Chapter 2: Sections 2.1 and 2.2 Formal Languages Basis for the design and implementation of programming languages Alphabet: finite set Σ of symbols String: finite sequence

More information

PRISM 4.0: Verification of Probabilistic Real-Time Systems

PRISM 4.0: Verification of Probabilistic Real-Time Systems PRISM 4.0: Verification of Probabilistic Real-Time Systems Marta Kwiatkowska 1,GethinNorman 2,andDavidParker 1 1 Department of Computer Science, University of Oxford, Oxford, OX1 3QD, UK 2 School of Computing

More information

Automated Formal Methods for Embedded Systems

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

Stochastic Games for Verification of Probabilistic Timed Automata

Stochastic Games for Verification of Probabilistic Timed Automata Stochastic ames for Verification of Probabilistic Timed Automata Marta Kwiatkowska, ethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. Probabilistic

More information

Real Time Software PROBLEM SETTING. Real Time Systems. Real Time Systems. Who is Who in Timed Systems. Real Time Systems

Real Time Software PROBLEM SETTING. Real Time Systems. Real Time Systems. Who is Who in Timed Systems. Real Time Systems Schedulability Analysis of Timed Systems with contributions from PROBLEM SETTING Tobias Amnell, Elena Fersma, John Håkansson, Pavel Kracal, Leonid Mokrushine, Christer Nordström, Paul Pettersson and Anders

More information

R & G Chapter 13. Implementation of single Relational Operations Choices depend on indexes, memory, stats, Joins Blocked nested loops:

R & G Chapter 13. Implementation of single Relational Operations Choices depend on indexes, memory, stats, Joins Blocked nested loops: Relational Query Optimization R & G Chapter 13 Review Implementation of single Relational Operations Choices depend on indexes, memory, stats, Joins Blocked nested loops: simple, exploits extra memory

More information

Application: Programming Language Semantics

Application: Programming Language Semantics Chapter 8 Application: Programming Language Semantics Prof. Dr. K. Madlener: Specification and Verification in Higher Order Logic 527 Introduction to Programming Language Semantics Programming Language

More information

Theory of Computations Spring 2016 Practice Final Exam Solutions

Theory of Computations Spring 2016 Practice Final Exam Solutions 1 of 8 Theory of Computations Spring 2016 Practice Final Exam Solutions Name: Directions: Answer the questions as well as you can. Partial credit will be given, so show your work where appropriate. Try

More information

Quantitative Synthesis for Concurrent Programs

Quantitative Synthesis for Concurrent Programs Quantitative Synthesis for Concurrent Programs Pavol Černý, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, and Rohit Singh IST Austria IIT Bombay Abstract. We present an algorithmic method

More information

PRISM-games: Verification and Strategy Synthesis for Stochastic Multi-player Games with Multiple Objectives

PRISM-games: Verification and Strategy Synthesis for Stochastic Multi-player Games with Multiple Objectives Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) PRISM-games: Verification and Strategy Synthesis for Stochastic Multi-player Games with Multiple Objectives Marta

More information

The Wi-Fi Roaming Game

The Wi-Fi Roaming Game The Wi-Fi Roaming Game October 26, 2007 David R. Cheriton School of computer Science, Ontario, Canada Punch Line Users sensitivity to bandwidth (and possibly delay) affects their Internet bills. The right

More information

Fault Detection of Reachability Testing with Game Theoretic Approach

Fault Detection of Reachability Testing with Game Theoretic Approach Fault Detection of Reachability Testing with Game Theoretic Approach S. Preetha Dr.M. Punithavalli Research Scholar, Karpagam University, Coimbatore. Director, Sri Ramakrishna Engineering College, Coimbatore.

More information

Distributed parameter sweep for U PPAAL models

Distributed parameter sweep for U PPAAL models Distributed parameter sweep for U PPAAL models M ASTER S THESIS, SPRING 2011 P ETER S CHMIDT F REIBERG J IMMY M ERRILD K RAG B RIAN V ILLUMSEN D EPARTMENT OF C OMPUTER S CIENCE A ALBORG U NIVERSITY J UNE

More information

Kim Guldstrand Larsen

Kim Guldstrand Larsen Validation, Synthesis and Performance Evaluation of Embedded Systems using UPPAAL Kim Guldstrand Larsen Timed Automata UPPAAL (1995- ) @AALborg Kim G Larsen Alexandre David Gerd Behrman Marius Mikucionis

More information

Regular Expression Constrained Sequence Alignment

Regular Expression Constrained Sequence Alignment Regular Expression Constrained Sequence Alignment By Abdullah N. Arslan Department of Computer science University of Vermont Presented by Tomer Heber & Raz Nissim otivation When comparing two proteins,

More information

Real Time Model Checking

Real Time Model Checking Real Time Model Checking using UPPAAL Kim G Larsen Collaborators @UPPsala Wang Yi Paul Pettersson John Håkansson Anders Hessel Pavel Krcal Leonid Mokrushin Shi Xiaochun @Elsewhere @AALborg Kim G Larsen

More information

10703 Deep Reinforcement Learning and Control

10703 Deep Reinforcement Learning and Control 10703 Deep Reinforcement Learning and Control Russ Salakhutdinov Machine Learning Department rsalakhu@cs.cmu.edu Policy Gradient I Used Materials Disclaimer: Much of the material and slides for this lecture

More information

Parsing Expression Grammars and Packrat Parsing. Aaron Moss

Parsing Expression Grammars and Packrat Parsing. Aaron Moss Parsing Expression Grammars and Packrat Parsing Aaron Moss References > B. Ford Packrat Parsing: Simple, Powerful, Lazy, Linear Time ICFP (2002) > Parsing Expression Grammars: A Recognition- Based Syntactic

More information

Modeling and Analysis of Networked Embedded Systems using UPPAAL. Ezio Bartocci

Modeling and Analysis of Networked Embedded Systems using UPPAAL. Ezio Bartocci Modeling and Analysis of Networked Embedded Systems using UPPAAL Ezio Bartocci Overview Timed Automata in UPPAAL UPPAAL modeling language Declara5ons in UPPAAL Templates in UPPAAL Urgent Channels Broadcast

More information

arxiv: v1 [cs.pl] 21 Apr 2011

arxiv: v1 [cs.pl] 21 Apr 2011 Quantitative Synthesis for Concurrent Programs, Pavol Černý1, Krishnendu Chatterjee 1, Thomas A. Henzinger 1, Arjun Radhakrishna 1, and Rohit Singh 2 arxiv:1104.4306v1 [cs.pl] 21 Apr 2011 1 IST Austria

More information

Nash equilibria in Voronoi Games on Graphs

Nash equilibria in Voronoi Games on Graphs Nash equilibria in Voronoi Games on Graphs Christoph Dürr, Nguyễn Kim Thắng (Ecole Polytechnique) ESA, Eilat October 07 Plan Motivation : Study the interaction between selfish agents on Internet k players,

More information

TIMO: Timed Mobility in Distributed Systems

TIMO: Timed Mobility in Distributed Systems TIMO: Timed Mobility in Distributed Systems Gabriel Ciobanu Romanian Academy, Institute of Computer Science, Iaşi E-mail: gabriel@info.uaic.ro Abstract A simple and expressive formalism called TIMO is

More information

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

Editor. Analyser XML. Scheduler. generator. Code Generator Code. Scheduler. Analyser. Simulator. Controller Synthesizer. TIMES - A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi? Uppsala University, Sweden Abstract. Times is a new modelling,

More information

TIMES A Tool for Modelling and Implementation of Embedded Systems

TIMES A Tool for Modelling and Implementation of Embedded Systems TIMES A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi Uppsala University, Sweden. {tobiasa,elenaf,leom,paupet,yi}@docs.uu.se.

More information

Exercises Computational Complexity

Exercises Computational Complexity Exercises Computational Complexity March 22, 2017 Exercises marked with a are more difficult. 1 Chapter 7, P and NP Exercise 1. Suppose some pancakes are stacked on a surface such that no two pancakes

More information

Theory of Computations Spring 2016 Practice Final

Theory of Computations Spring 2016 Practice Final 1 of 6 Theory of Computations Spring 2016 Practice Final 1. True/False questions: For each part, circle either True or False. (23 points: 1 points each) a. A TM can compute anything a desktop PC can, although

More information

Verification and Validation meet Planning and Scheduling

Verification and Validation meet Planning and Scheduling Verification and Validation meet Planning and Scheduling AndreA Orlandini (CNR-ISTC) Email: andrea.orlandini@istc.cnr.it National Research Council of Italy (CNR-ISTC) P&S Autonomy and V&V P&S systems are

More information

FASTER UPPER BOUNDING OF INTERSECTION SIZES

FASTER UPPER BOUNDING OF INTERSECTION SIZES FASTER UPPER BOUNDING OF INTERSECTION SIZES IBM Research Tokyo - Japan Daisuke Takuma Hiroki Yanagisawa 213 IBM Outline Motivation of upper bounding Contributions Data structure Proposal Evaluation (introduce

More information

Parallel Model Checking of ω-automata

Parallel Model Checking of ω-automata Parallel Model Checking of ω-automata Vincent Bloemen Formal Methods and Tools, University of Twente v.bloemen@utwente.nl Abstract. Specifications for non-terminating reactive systems are described by

More information

ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. CS Summer Introduction to Artificial Intelligence Midterm ˆ You have approximately minutes. ˆ The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. ˆ Mark your answers

More information

Algorithms and Data Structures for Mathematicians

Algorithms and Data Structures for Mathematicians Algorithms and Data Structures for Mathematicians Lecture 5: Sorting Peter Kostolányi kostolanyi at fmph and so on Room M-258 26 October 2017 Sorting Algorithms Covered So Far Worst-case time complexity

More information

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet.

The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. CS Summer Introduction to Artificial Intelligence Midterm You have approximately minutes. The exam is closed book, closed calculator, and closed notes except your one-page crib sheet. Mark your answers

More information

Nondeterministic Query Algorithms

Nondeterministic Query Algorithms Journal of Universal Computer Science, vol. 17, no. 6 (2011), 859-873 submitted: 30/7/10, accepted: 17/2/11, appeared: 28/3/11 J.UCS Nondeterministic Query Algorithms Alina Vasilieva (Faculty of Computing,

More information

A Game-Theoretic Framework for Congestion Control in General Topology Networks

A Game-Theoretic Framework for Congestion Control in General Topology Networks A Game-Theoretic Framework for Congestion Control in General Topology SYS793 Presentation! By:! Computer Science Department! University of Virginia 1 Outline 2 1 Problem and Motivation! Congestion Control

More information

Published in: Proceedings of the Eighth Danish Human-Computer Interaction Research Symposium, 20th November 2008

Published in: Proceedings of the Eighth Danish Human-Computer Interaction Research Symposium, 20th November 2008 Downloaded from vbn.aau.dk on: marts 26, 2019 Aalborg Universitet The WPU Project Jensen, Janne Jul; Skov, Mikael B.; Stage, Jan Published in: Proceedings of the Eighth Danish Human-Computer Interaction

More information

Formal modelling and verification in UPPAAL

Formal modelling and verification in UPPAAL Budapest University of Technology and Economics Department of Measurement and Information Systems Fault Tolerant Systems Research Group Critical Embedded Systems Formal modelling and verification in UPPAAL

More information

Using Hybrid Automata for Early Spacecraft Design Evaluation

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

Improved BDD-based Discrete Analysis of Timed Systems

Improved BDD-based Discrete Analysis of Timed Systems Improved BDD-based Discrete Analysis of Timed Systems Truong Khanh Nguyen 1, Jun Sun 2, Yang Liu 1, Jin Song Dong 1 and Yan Liu 1 1 School of Computing National University of Singapore 2 Information System

More information

Model-Checking and Simulation for Stochastic Timed Systems

Model-Checking and Simulation for Stochastic Timed Systems Model-Checking and Simulation for Stochastic Timed Systems QUASIMODO FMCO 2010, Graz Universität des Saarlandes Outline 1. Stochastic Timed Automata STA Submodels Modest 2. Model-Checking mcpta PTA Case

More information