Stochastic Modelling and Analysis

Slides:



Advertisements
Similar presentations
Technische universiteit eindhoven PROGRESS 11 December 2002www.ics.ele.tue.nl/~btheelen1 Performance Modelling of Complex Hardware/Software Systems B.D.
Advertisements

How Fast and Fat Is Your Probabilistic Model Checker? an experimental performance comparison David N. Jansen 3,1, Joost-Pieter Katoen 1,2, Marcel Oldenkamp.
Formal methods & Tools UCb CUPPAAL CUPPAAL Efficient Minimum-Cost Reachability for Linearly Priced Timed Automata Gerd Behrman, Ed Brinksma, Ansgar Fehnker,
Performance Model Checking Scenario-Aware Dataflow Bart Theelen, Marc Geilen, Jeroen Voeten.
Automatic Verification Book: Chapter 6. What is verification? Traditionally, verification means proof of correctness automatic: model checking deductive:
Game-theoretic simulation checking tool Peter Bulychev, Vladimir Zakharov, Igor Konnov Moscow State University.
Game-theoretic approach to the simulation checking problem Peter Bulychev Vladimir Zakharov Lomonosov Moscow State University.
Timed Automata.
Framework for comparing power system reliability criteria Evelyn Heylen Prof. Geert Deconinck Prof. Dirk Van Hertem Durham Risk and Reliability modelling.
Energy and Mean-Payoff Parity Markov Decision Processes Laurent Doyen LSV, ENS Cachan & CNRS Krishnendu Chatterjee IST Austria MFCS 2011.
Statistical Probabilistic Model Checking Håkan L. S. Younes Carnegie Mellon University.
How Fast and Fat Is Your Probabilistic Model Checker? an experimental performance comparison David N. Jansen 3,1, Joost-Pieter Katoen 1,2, Marcel Oldenkamp.
Model Checking for Probabilistic Timed Systems Jeremy Sproston Università di Torino VOSS Dagstuhl seminar 9th December 2002.
1 Formal Models for Stability Analysis : Verifying Average Dwell Time * Sayan Mitra MIT,CSAIL Research Qualifying Exam 20 th December.
May 9, 2008IPA Lentedagen, Rhenen1 Dynamic Fault Tree analysis using Input/Output Interactive Markov Chains Hichem Boudali 1, Pepijn Crouzen 2, and Mariëlle.
1 Petri Nets H Plan: –Introduce basics of Petri Net models –Define notation and terminology used –Show examples of Petri Net models u Calaway Park model.
Branching Bisimulation Congruence for Probabilistic Transition Systems
Approximate Abstraction for Verification of Continuous and Hybrid Systems Antoine Girard Guest lecture ESE601: Hybrid Systems 03/22/2006
1 IFM 2005 – November 30, 2005 EXP.OPEN 2.0 A flexible tool integrating partial order, compositional, and on-the-fly verification methods Frédéric Lang.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Influence of different system abstractions on the performance analysis.
Jun. Sun Singapore University of Technology and Design Songzheng Song and Yang Liu National University of Singapore.
02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
1 Endgame Logistics  Final Project Presentations  Tuesday, March 19, 3-5, KEC2057  Powerpoint suggested ( to me before class)  Can use your own.
Planning and Verification for Stochastic Processes with Asynchronous Events Håkan L. S. Younes Carnegie Mellon University.
Process Algebra (2IF45) Probabilistic Branching Bisimulation: Exercises Dr. Suzana Andova.
ACPN2010, Rostock, September 22nd Advanced solution methods for Stochastic Petri Nets Prof.ssa Susanna Donatelli Universita’ di Torino, Italy
Pisa, 11/25/2002Susanna Donatelli1 Modelling process and heterogeneous model construction Susanna Donatelli Modelling and evaluation groups.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
UML’03 Stochastic Evaluation of the 1st Axxom Case Study Holger Hermanns Yaroslav S. Usenko (Saarbrücken & Twente) (Twente) with contributions of Henrik.
WP6: Static Analysis Presented by Flemming Nielson Informatics and Mathematical Modelling Technical University of Denmark at the 3nd review of DEGAS in.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
Concur 2001 August 21, 2001 Performance Evaluation := (Process Algebra + Model Checking) x Markov Chains Holger Hermanns and Joost-Pieter Katoen with.
Toulouse, September 2003 Page 1 JOURNEE ALTARICA Airbus ESACS  ISAAC.
Scheduling Lacquer Productions with Uppaal AXXOM case study of the Ametist project Angelika Mader Distributed and Embedded Systems Group, University of.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Dana Nau: Lecture slides for Automated Planning Licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License:
2 April, 2008AADL/UML workshop - Belfast1 Arcade: A formal, extensible, model-based dependability evaluation framework Hichem Boudali 1, Pepijn Crouzen.
International Telecommunication Union © ITU-T Study Group 17 Integrated Application of SDL Amardeo Sarma NEC Europe Ltd.
Shinya Umeno Nancy Lynch’s Group CSAIL, MIT TDS seminar September 18 th, 2009 Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event.
Properties as Processes : FORTE slide Properties as Processes: their Specification and Verification Joel Kelso and George Milne School of Computer.
Tomás BarrosMonday, April 18, 2005FIACRE Toulouse p. 1 Behavioural Models for Hierarchical Components Tomás Barros, Ludovic Henrio and Eric Madelaine.
Process Algebra (2IF45) Abstraction Parallel composition (short intro) Suzana Andova.
Dissemination Exploitation and Use Ametist review 23/11/04.
Communicating Timed Automata Pavel Krčál Wang Yi Uppsala University [CAV’06]
Sub-fields of computer science. Sub-fields of computer science.
OPERATING SYSTEMS CS 3502 Fall 2017
Probabilistic Timed Automata
Machine Learning for Computer Security
Modular Software Development for Dealing with Uncertainty
SS 2017 Software Verification Probabilistic modelling – DTMC / MDP
Prof. Dr. Holger Schlingloff 1,2 Dr. Esteban Pavese 1
Synthesis from scenarios and requirements
Role and Potential of TAs for Industrial Scheduling Problems
Introduction to Software Testing Chapter 5.1 Syntax-based Testing
Review for the Midterm Exam
Gabor Madl Ph.D. Candidate, UC Irvine Advisor: Nikil Dutt
A Test Bed for Manufacturing Planning and Scheduling Discussion of Design Principles Sept Claude Le Pape Director R&D Manufacturing Planning and.
Relatively Complete Refinement Type System for Verification of Higher-Order Non-deterministic Programs Hiroshi Unno (University of Tsukuba) Yuki Satake.
Joey F. George, Dinesh Batra, Joseph S. Valacich, Jeffrey A. Hoffer
Internet of Things A Process Calculus Approach
Luís Ferreira Pires Dick Quartel Remco Dijkman Marten van Sinderen
Statistical Model-Checking of “Black-Box” Probabilistic Systems VESTA
Markov Decision Problems
Linköping University, IDA, ESLAB
Introduction to Software Testing Chapter 5.1 Syntax-based Testing
Metrics for real time probabilistic processes
Presentation transcript:

Stochastic Modelling and Analysis Ed Brinksma University of Twente 2nd year Ametist Review Brussels, May 10th, 2004 AMETIST

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Relevance Stochastic Modelling stochastic system features average measures: delay, throughput, etc. variation, jitter soft timing constraints e.g.: 99.9% of the requests gets a response within 1 ms operational vs. absolute correctness e.g.: 99.9% of the request gets a correct response stochastic evaluation performance analysis: transient & stationary behaviour reward modelling: risk analysis, cost optimization abstraction complex systems may have simple stochastic models

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Stochastic Process Algebra Compositional theories for the integration of functional behaviour with stochastic delays uses & extends concepts from classical process algebra can be used to obtain evaluation models (CTMC, CTSMC, GSMP) directly from extended, structured functional specifications AMETIST contributions integration and overview: Hermanns, Herzog, Katoen 2002 (Markovian case) Bravetti, D’Argenio 2002 (General case) Brinksma 2003 (Markovian & General case) compositional abstraction to timed automata D’Argenio 2002

Modelling Languages AMETIST contributions: Stochastic extensions to UML Statecharts Jansen, Hermanns, Katoen 2003 well-received by UML community MoDeST/Motor modelling environment Bohnenkamp, Hermanns, Katoen, Klaren 2003 extensive stochastic modelling features & evaluation via stochastic activity networks

An Extended UML-Statechart stochastic features It models a car damage assessment process.

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Probabilistic Model Checking requirements system Not biased towards most probable scenarios formalizing modelling error location prop. spec. sys. model model checking violated & counter example simulation satisfied out of memory

Probabilistic Model Checking AMETIST contributions: Model-checking discrete time reward models Andova, Hermanns, Katoen 2003 (PCTL, numerical) Daws 2004 (PCTL, symbolic) Model-checking continuous timed systems Baier, Haverkort, Hermanns, Katoen 2003 (CSL, CTMC) Baier, Haverkort, Hermanns, Katoen 2004 (min/max prob, CTMDP) Haverkort, Cloth, Hermanns, Katoen, Baier 2002 (CSRL,CTMRM)

Abstraction Techniques AMETIST contributions: Weak equivalences and pre-orders Baier, Katoen, Hermanns, Haverkort 2002 (weak simulation, CTMC). Baier, Hermanns, Katoen 2004 (pol. decidability weak simulation, CTMC) Baier, Hermanns, Katoen, Wolf 2003 (branching-time spectrum DTMC & CTMC) Andova, Willemse 2004 (branching bisimulation, alternating model). Reduction techniques Jeannet, D’Argenio, Larsen 2002 (MDP, Rapture) D’Argenio and Niebert 2004 (MDP, PO reduction)

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Stochastic Scheduling AMETIST contributions: Abdeddaïm, Asarin, Maler 2003 (backward reachability, acyclic CTMDP) Sand, Engell 2004a (stochastic integer programming) Sand, Engell 2004b (risk guided scheduling)

Outline Relevance of stochastic modelling Stochastic modelling Stochastic process algebra Modelling languages Stochastic analysis Model checking probabilistic systems Abstraction techniques Stochastic Scheduling Tools & case studies Outlook & future developments

Tools AMETIST has contributed to the development of: ETMCC CADP a tool for CTMC model checking CADP extension of this well-known tool environment for functional analysis with performance and dependability analysis modules Rapture verification tool for quantified reachability properties over MDPs. MoDeST/MOTOR broad-spectrum modelling language /discrete event simulator

Case Studies Stochastic modelling/analysis has been relevant for: Bohnenkamp, Hermanns, Klaren, Mader, Usenko 2004. Synthesis and stochastic assessment of schedules for lacquer production (Axxom case study). Bohnenkamp, Van der Stok, Hermanns, Vaandrager 2003. Cost-optimisation of the IPv4 zeroconf protocol. See also: Andova, Hermanns, Katoen 2003; Daws 2004 Daws, Kwiatkowska, Norman 2004. Automatic verification of the IEEE 1394 root contention protocol.

Outlook & Future Development Theory Extend results CTMDPs e.g. time-bounded reachability for non-uniform CTMDPs Further research & evaluation symbolic techniques contain the effect of numerical errors Modelling Languages/Tools Extend general modelling/analysis tool environments MoDeST/MOTOR Case studies Evaluate generic vs specific approaches for stochastic aspects of timed systems e.g. specific stochastic scheduling techniques vs model checking CTMCs or CTMDPs