Kim G. Larsen Peter Bulychev, Alexandre David, Dehui Du, Axel Legay, Guangyuan Li, Marius Mikucionis, Danny B. Poulsen, Amalie Stainer, Zheng Wang TexPoint.

Slides:



Advertisements
Similar presentations
INTERVAL Next Previous 13/02/ Timed extensions to SDL Analysis requirements –Assumptions on moments and duration Semantics with controllable time.
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
An improved on-the-fly tableau construction for a real-time temporal logic Marc Geilen 12 July 2003 /e.
S4 S4 System Synthesis and Supervision, Scenarios Benoît Caillaud 20 March 2012.
The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement Allison Lewko The University of Texas at Austin TexPoint fonts used in.
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
SPEED: Precise & Efficient Static Estimation of Symbolic Computational Complexity Sumit Gulwani MSR Redmond TexPoint fonts used in EMF. Read the TexPoint.
Distributed Markov Chains P S Thiagarajan School of Computing, National University of Singapore Joint work with Madhavan Mukund, Sumit K Jha and Ratul.
Game-theoretic approach to the simulation checking problem Peter Bulychev Vladimir Zakharov Lomonosov Moscow State University.
Solving Timed Games with Variable Observations: Proof of Concept Peter Bulychev Franck Cassez Alexandre David Kim G. Larsen Jean-François Raskin Pierre-Alain.
UPPAAL Introduction Chien-Liang Chen.
Timed Automata.
Verification of Hybrid Systems An Assessment of Current Techniques Holly Bowen.
Dynamic Bayesian Networks (DBNs)
CDA6530: Performance Models of Computers and Networks Chapter 5: Generating Random Number and Random Variables TexPoint fonts used in EMF. Read the TexPoint.
Possibilistic and probabilistic abstraction-based model checking Michael Huth Computing Imperial College London, United Kingdom.
Peter Bulychev Alexandre David Kim G. Larsen Marius Mikucionis TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A.
Probabilistic CEGAR* Björn Wachter Joint work with Holger Hermanns, Lijun Zhang TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Yongjian Li The State Key Laboratory of Computer Science Chinese Academy of Sciences William N. N. HungSynopsys Inc. Xiaoyu SongPortland State University.
An Optimization Approach to Improving Collections of Shape Maps Andy Nguyen, Mirela Ben-Chen, Katarzyna Welnicka, Yinyu Ye, Leonidas Guibas Computer Science.
Systems Engineering for Automating V&V of Dependable Systems John S. Baras Institute for Systems Research University of Maryland College Park
Core-based SoCs Testing Julien Pouget Embedded Systems Laboratory (ESLAB) Linköping University Julien Pouget Embedded Systems Laboratory (ESLAB) Linköping.
1 Formal Engineering of Reliable Software LASER 2004 school Tutorial, Lecture1 Natasha Sharygina Carnegie Mellon University.
Swiss Federal Institute of Technology Computer Engineering and Networks Laboratory Influence of different system abstractions on the performance analysis.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Antoine Girard VAL-AMS Project Meeting April 2007 Behavioral Metrics for Simulation-based Circuit Validation.
Monte Carlo Simulation 1.  Simulations where random values are used but the explicit passage of time is not modeled Static simulation  Introduction.
Computer Simulation A Laboratory to Evaluate “What-if” Questions.
IE 594 : Research Methodology – Discrete Event Simulation David S. Kim Spring 2009.
CHAPTER 15 S IMULATION - B ASED O PTIMIZATION II : S TOCHASTIC G RADIENT AND S AMPLE P ATH M ETHODS Organization of chapter in ISSO –Introduction to gradient.
Petros OikonomakosBashir M. Al-Hashimi Mark Zwolinski Versatile High-Level Synthesis of Self-Checking Datapaths Using an On-line Testability Metric Electronics.
Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
Texas A&M University Page 1 9/16/ :22:47 PM Wei Zhao Texas A&M University Is Computer Stuff Science, Engineering, or Something else?
Verification of Information Flow Properties in Cyber-Physical Systems Ravi Akella, Bruce McMillin Department of Computer Science Missouri University of.
CRESCENDO Full virtuality in design and product development within the extended enterprise Naples, 28 Nov
Monte Carlo Simulation CWR 6536 Stochastic Subsurface Hydrology.
Systems Engineering for the Transportation Critical Infrastructure The Development of a Methodology and Mathematical Model for Assessing the Impacts of.
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
Sampling Methods  Sampling refers to how observations are “selected” from a probability distribution when the simulation is run. 1.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Modeling and simulation of systems Model building Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Highway Risk Mitigation through Systems Engineering.
Jeffrey Zheng School of Software, Yunnan University August 4, nd International Summit on Integrative Biology August 4-5, 2014 Chicago, USA.
PODC Distributed Computation of the Mode Fabian Kuhn Thomas Locher ETH Zurich, Switzerland Stefan Schmid TU Munich, Germany TexPoint fonts used in.
Lecture 2 Basics of probability in statistical simulation and stochastic programming Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius,
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation --- Discrete-Time Simulation TexPoint fonts used in EMF. Read the.
Radhamanjari Samanta *, Soumyendu Raha * and Adil I. Erzin # * Supercomputer Education and Research Centre, Indian Institute of Science, Bangalore, India.
Verification & Validation By: Amir Masoud Gharehbaghi
CONCURRENT SIMULATION: A TUTORIAL Christos G. Cassandras Dept. of Manufacturing Engineering Boston University Boston, MA Scope of.
CS 351/ IT 351 Modeling and Simulation Technologies Review ( ) Dr. Jim Holten.
Designing Factorial Experiments with Binary Response Tel-Aviv University Faculty of Exact Sciences Department of Statistics and Operations Research Hovav.
Highway Risk Mitigation through Systems Engineering.
 Simulation enables the study of complex system.  Simulation is a good approach when analytic study of a system is not possible or very complex.  Informational,
Avoiding small subgraphs in the Achlioptas process Torsten Mütze, ETH Zürich Joint work with Reto Spöhel and Henning Thomas TexPoint fonts used in EMF.
Anders Nielsen Technical University of Denmark, DTU-Aqua Mark Maunder Inter-American Tropical Tuna Commission An Introduction.
Euro-Par, HASTE: An Adaptive Middleware for Supporting Time-Critical Event Handling in Distributed Environments ICAC 2008 Conference June 2 nd,
Sequential Off-line Learning with Knowledge Gradients Peter Frazier Warren Powell Savas Dayanik Department of Operations Research and Financial Engineering.
OPERATING SYSTEMS CS 3502 Fall 2017
SS 2017 Software Verification Bounded Model Checking, Outlook
Daniil Chivilikhin and Vladimir Ulyantsev
Analytics and OR DP- summary.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
Husam Abu-Haimed David L. Dill Sergey Berezin
ECE/CS 584: Verification of Embedded Computing Systems
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Boltzmann Machine (BM) (§6.4)
Functional Safety Solutions for Automotive
Overview: Chapter 2 Localization and Tracking
Presentation transcript:

Kim G. Larsen Peter Bulychev, Alexandre David, Dehui Du, Axel Legay, Guangyuan Li, Marius Mikucionis, Danny B. Poulsen, Amalie Stainer, Zheng Wang TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AA A AA AA AA A A A Statistical Model Checking, Refinement Checking, Optimization,.. Stochastic Hybrid Systems Statistical Model Checking, Refinement Checking, Optimization,.. for Stochastic Hybrid Systems

IDEA 4 CPS Foundations for CPS FORMATS, Sep 2012 Kim Larsen [2] I D E A Inst. of Software Chinese Academy of Sciences, Beijing, China Technical University of Denmark, Lyngby, Denmark East China Normal University, Shanghai, China Aalborg University, Denmark

Cyber-Physical Systems  Complex systems that tightly integrate multiple, networked computing elements (hardware and software) with non- computing physical elements such as electrical or mechanical components. FORMATS, Sep 2012 Kim Larsen [3] Smart X Hybrid Systems

Trustworthiness  (TCPS).. by which we mean CPS on which reliance can justifiably be placed.  (wiki).. of a component is.. defined by how well it secures a set of functional and non-functional properties, deriving from its architecture, construction, and environment, and evaluated as appropriate. FORMATS, Sep 2012 Kim Larsen [4] Probabilities Confidence

Current State FORMATS, Sep 2012 Kim Larsen [5] Stochastic Hybrid Systems Probabilistic Temporal Logic Statistical Model Checking

Overview  Stochastic Hybrid Systems  Weighted Metric Interval Temporal Logic  UPPAAL SMC (Demo)  Energy Aware Buildings  SMC and Refinement Checking  SMC and Optimization  Conclusion FORMATS, Sep 2012 Kim Larsen [6]

Stochastic Hybrid Systems  A Bouncing Ball FORMATS, Sep 2012 Kim Larsen [7/52] Simulate 5 [<=20] {p} Pr[ (time >=12 && p >= 4))

Hybrid Automata H=(L, l 0, §, X,E,F,Inv) where  L set of locations  l 0 initial location  § = § i [ § o set of actions  X set of continuous variables valuation º : X ! R (=R X )  E set of edges (l,g,a, Á,l’) with g µ R X and Á µ R X £ R X and a 2 §  For each l a delay function F(l): R >0 £ R X ! R X  For each l an invariant Inv(l) µ R X FORMATS, Sep 2012 Kim Larsen [8]

Hybrid Automata FORMATS, Sep 2012 Kim Larsen [9] Semantics  States (l, º ) where º 2 R X  Transitions (l, º ) ! d (l, º ’) where º ’=F(l)(d)( º ) provided º ’ 2 Inv(l) (l, º ) ! a (l’, º ’) if there exists (l,g,a, Á,l’) 2 E with º 2 g and ( º, º ’) 2 Á and º ’ 2 Inv(l’)

Stochastic Hybrid Automata FORMATS, Sep 2012 Kim Larsen [10] * Dirac’s delta functions for deterministic delays / next state Stochastic Semantics For each state s=(l, º ) Delay density function * ¹ s : R >0 ! R Output Probability Function ° s : § o ! [0,1] Next-state density function * ´ a s : St ! R where a 2 §.

Stochastic Hybrid Automata FORMATS, Sep 2012 Kim Larsen [11] * Dirac’s delta functions for deterministic delays / next state Stochastic Semantics For each state s=(l, º ) Delay density function * ¹ s : R >0 ! R Output Probability Function ° s : § o ! [0,1] Next-state density function * ´ a s : St ! R where a 2 §. UPPAAL Uniform distributions (bounded delay) Exponential distributions (unbounded delay) Syntax for discrete probabilistic choice Distribution on next state by use of random Hybrid flow by use of ODEs Networks Repeated races between components for outputting

Pr[c T.T3) ? Stochastic Semantics NTAs Composition = Race between components for outputting Kim Larsen [12] FORMATS, Sep 2012 Pr[time T.T3) ?

Stochastic Semantics of NHAs Assumptions: Component SHAs are: Input enabled Deterministic Disjoint set of output actions ¼ ( s, a 1 a 2 …. a n ) : the set of maximal runs from s with a prefix t 1 a 1 t 2 a 2 … t n a k for some t 1,…, t n 2 R. Kim Larsen [13] FORMATS, Sep 2012

Metric Interval Temporal Logic  MITL ≤ syntax: ϕ ::=σ | ¬ϕ | ϕ 1 ∧ ϕ 2 | Oϕ | ϕ 1 U ≤d ϕ 2 where d ∈ ℕ is a natural number.  MITL ≤ semantics [ r=(a 1,t 1 )(a 2,t 2 )(a 3,t 3 ) … ]:  r ⊨σ if a 1 = σ  r ⊨¬ϕ if r ⊭ ϕ  r ⊨ ϕ 1 ∧ ϕ 2 if r ⊨ ϕ 1 and r ⊨ ϕ 2  r ⊨Oϕ if (a 2,t 2 )(a 3,t 3 )… ⊨ ϕ  r ⊨ ϕ 1 U ≤d ϕ 2 if 9 i. (a i,t i )(a i+1,t i+1 )… ⊨ ϕ 2 with t 1 +t 2 +…+t i ≤d and (a j,t j )(a j+1,t j+1 )… ⊨ ϕ 1 for j<i FORMATS, Sep 2012 Kim Larsen [14]

Logical Properties– WMITL FORMATS, Sep 2012 Kim Larsen [15] MODEL M Á = Pr M ( Á ) = ??

Statistical Model Checking FORMATS, Sep 2012 Kim Larsen [16] M Á µ, ² Generator Validator Core Algorithm Inconclusive Pr M ( Á ) 2 [a- ²,a+ ² ] with confidence µ p, ® Pr M ( Á ) ¸ p at significance level ® } < T p [FORMATS11, RV12]

Logical Properties– WMITL FORMATS, Sep 2012 Kim Larsen [17] 95% confidence interval: [0.215,0.225] MODEL M OBSERVER (det) Á =

Statistical Model Checking [LPAR2012] FORMATS, Sep 2012 Kim Larsen [18] M Á µ, ² Generator Validator Core Algorithm Inconclusive Pr M ( Á ) 2 [a- ²,a+ ² ] with confidence µ p, ® Pr M ( Á ) ¸ p at significance level ® CASAAL OÁOÁ UÁUÁ AÁAÁ } acc M | O Á M | U Á

Experiments FORMATS, Sep 2012 Kim Larsen [19] How exact is the O/U? 1000 random formulas 2, 3, 4 actions 15 connectives New exact method for full MITL [a,b] using rewriting [RV12]

Energy Aware Buildings Fehnker, Ivancic. Benchmarks for Hybrid Systems Verification. HSCC04 With Alexandre David, Dehui Du Marius Mikucionis Arne Skou

Stochastic Hybrid Systems FORMATS, Sep 2012 Kim Larsen [21] on/off Room 1 Room 2 Heater simulate 1 [<=100]{Temp(0).T, Temp(1).T} simulate 10 [<=100]{Temp(0).T, Temp(1).T} Pr[ Temp(0).T >= 10) Pr[ Temp(1).T 30) >= 0.2

Framework FORMATS, Sep 2012 Design Space Exploration Kim Larsen [22]

Rooms & Heaters – MODELS FORMATS, Sep 2012 Kim Larsen [23]

Control Strategies – MODELS FORMATS, Sep 2012 Temperature Threshold Strategies Kim Larsen [24]

Weather & User Profile – MODELS FORMATS, Sep 2012 Kim Larsen [25]

Results – Simulations FORMATS, Sep 2012 simulate 1 [<=2*day] { T[1], T[2], T[3], T[4], T[5] } simulate 1 [<=2*day] { Heater(1).r, Heater(2).r, Heater(3).r } Kim Larsen [26]

Results – Discomfort FORMATS, Sep 2012 Pr[ time>0 && Monitor.Discomfort) Kim Larsen [27]

Results – Comfort FORMATS, Sep 2012 Pr[comfort time>=2*day) Kim Larsen [28]

Results – Energy FORMATS, Sep 2012 Pr[Monitor.energy time>=2*day) Kim Larsen [29]

Result – User Profile FORMATS, Sep 2012 Pr[Monitor.energy time>=2*day) Kim Larsen [30]

Refinement FORMATS, Sep 2012 Kim Larsen [31]

const int Tenv=7; const int k=2; const int H=20; const int TB[4]= {12, 18, 25, 28}; Controller Synthesis FORMATS, Sep 2012 Kim Larsen [32] on/off ?? const int Tenv=7; const int k=2; const int H=20; const int TB[4]= {12, 18, 25, 28}; low normal high critical high critical low Room Heater

Unfolding FORMATS, Sep 2012 Kim Larsen [33] low normal high critical high critical low

Timing FORMATS, Sep 2012 Kim Larsen [34] low normal high critical high critical low

TA Abstraction FORMATS, Sep 2012 Kim Larsen [35] const int uL[3]={3,5,2}; const int uU[3]={4,6,3}; const int dL[3]={3,9,15}; const int dU[3]={4,10,16}

Validation by Simulation FORMATS, Sep 2012 Kim Larsen [36]

Validation by Simulation FORMATS, Sep 2012 Kim Larsen [37] const int uL[3]={3,8,2}; const int uU[3]={4,9,3}; const int dL[3]={3,9,15}; const int dU[3]={4,10,16}

Optimization FORMATS, Sep 2012 Kim Larsen [38]

Time Bounded L-problem [Qest12] WATA, Dresden, May 30, 2012 Kim Larsen [39] simulate 1 [time<=5] {C, x, y} Problem: Determine schedule that maximizes time until out of energy

Time Bounded L-problem [Qest12] WATA, Dresden, May 30, 2012 Kim Larsen [40] Pr[time C<0 )

TEST Time Bounded L-problem [Qest12] WATA, Dresden, May 30, 2012 Kim Larsen [41] simulate [time =7 && Test.GOOD Pr [time time>=7 && Test.GOOD Can we do better? Can we do better?

RESTART Method FORMATS, Sep 2012 Kim Larsen [42]

Meta Modeling FORMATS, Sep 2012 Kim Larsen [43] RESTART Approach

Meta Modeling FORMATS, Sep 2012 Kim Larsen [44] Direct Approach

Meta Analysis FORMATS, Sep 2012 Kim Larsen [45] Direct Approach RESTART Approach

Meta Analysis FORMATS, Sep 2012 Kim Larsen [46]

Meta Analysis FORMATS, Sep 2012 Kim Larsen [47]

Other Case Studies FIREWIRE BLUETOOTH 10 node LMAC ROBOT Kim Larsen [48] FORMATS, Sep 2012 Energy Aware Buildings Genetic Oscilator (HBS) Schedulability Analysis for Mix Cr Sys Passenger Seating in Aircraft

Contribution & More  Natural stochastic semantics of networks of stochastic hybrid systems.  Efficient implementation of SMC algorithms:  Estimation of  Sequential testing ¸ p  Sequential probability comparison ¸  Parameterized comparison  Distributed Implementation of SMC ! FORMATS, Sep 2012 Kim Larsen [49]

Thank You ! FORMATS, Sep 2012 Kim Larsen [50]