Formal methods & Tools UCb CUPPAAL CUPPAAL Efficient Minimum-Cost Reachability for Linearly Priced Timed Automata Gerd Behrman, Ed Brinksma, Ansgar Fehnker,

Slides:



Advertisements
Similar presentations
UCb Kim Guldstrand Larsen Symbolic Model Checking …and Verification Options How UPPAAL really works & How to make UPPAAL really work.
Advertisements

UCb Symbolic Reachability and Beyound or how UPPAAL really works Kim Guldstrand Larsen
Based on customer demand, estimate:  ω s : minimum required amount of material s For final products, ω s is the customer demand Calculated once µ i is.
1 Fault Diagnosis for Timed Automata Stavros Tripakis VERIMAG.
Hardware and Petri nets Symbolic methods for analysis and verification.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Sequential Synthesis.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
Timed Automata.
UPPAAL T-shirt to (identifiable)
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Solving POMDPs Using Quadratically Constrained Linear Programs Christopher Amato.
Predicate Complete Testing * Thomas Ball * Thomas Ball, A Theory of Predicate-Complete Test Coverage and Generation, Technical Report MSR-TR ,
1 Error-Free Garbage Collection Traces: How to Cheat and Not Get Caught ACM SIGMETRICS, 2002.
© Anvesh Komuravelli IC3/PDR Overview of IC3/PDR Anvesh Komuravelli Carnegie Mellon University.
National Institute of Science & Technology TECHNICAL SEMINAR-2004 Dipanwita Dash [1] UNIT COMMITMENT Under the guidance of Mr. Debasisha Jena Presented.
UCb Tools and Application of Timed Automata UPPAAL & Optimal Scheduling Kim G. Larsen
An Optimal Algorithm of Adjustable Delay Buffer Insertion for Solving Clock Skew Variation Problem Juyeon Kim, Deokjin Joo, Taehan Kim DAC’13.
Reachability, Schedulability and Optimality
Verification of Parameterized Timed Systems Parosh Aziz Abdulla Uppsala University Johann Deneux Pritha Mahata Aletta Nylen.
Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks Faranak Heidarian Julien Schmaltz Frits Vaandrager.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Courseware Path-Based Scheduling Sune Fallgaard Nielsen Informatics and Mathematical Modelling Technical University of Denmark Richard Petersens Plads,
1 8. Safe Query Languages Safe program – its semantics can be at least partially computed on any valid database input. Safety is tied to program verification,
Scheduling Using Timed Automata Borzoo Bonakdarpour Wednesday, April 13, 2005 Selected Topics in Algorithms and Complexity (CSE960)
High-Level System Design Using Foresight Giovanna Di Marzo Serugendo IT / CE.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Optimal Fixed-Size Controllers for Decentralized POMDPs Christopher Amato Daniel.
NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.
1 Verification Options & Beyond Reachability or how to make UPPAAL perform better and more Kim Guldstrand Larsen
1 Efficient Verification of Timed Automata Kim Guldstrand Larsen Paul PetterssonMogens Nielsen
Least Cost System Operation: Economic Dispatch 1
Computer Process Control Application. Computer process control In computer process control, a digital computer is used to direct the operations of a manufacturing.
Timed UML State Machines Ognyana Hristova Tutor: Priv.-Doz. Dr. Thomas Noll June, 2007.
By: Er. Sukhwinder kaur.  Computation Computation  Algorithm Algorithm  Objectives Objectives  What do we study in Theory of Computation ? What do.
ULB, November 2004 As cheap as possible: Linearly Priced Timed Automata Gerd Behrmann, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson,
ECE 720T5 Winter 2014 Cyber-Physical Systems Rodolfo Pellizzoni.
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
Department of Mechanical Engineering The University of Strathclyde, Glasgow Hybrid Systems: Modelling, Analysis and Control Yan Pang Department of Mechanical.
RANI NALAMARU DEPARTMENT OF COMPUTER SCIENCE BALL STATE UNIVERSITY RANI NALAMARU DEPARTMENT OF COMPUTER SCIENCE BALL STATE UNIVERSITY Efficient Transmission.
Dina Workshop Analysing Properties of Hybrid Systems Rafael Wisniewski Aalborg University.
Lazy Abstraction Jinseong Jeon ARCS, KAIST CS750b, KAIST2/26 References Lazy Abstraction –Thomas A. Henzinger et al., POPL ’02 Software verification.
1 Context-dependent Product Line Practice for Constructing Reliable Embedded Systems Naoyasu UbayashiKyushu University, Japan Shin NakajimaNational Institute.
1 P. David, V. Idasiak, F. Kratz P. David, V. Idasiak, F. Kratz Laboratoire Vision et Robotique, UPRES EA 2078 ENSI de Bourges - Université d'Orléans 10.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
Warm-Up 3.4 1) Solve the system. 2) Graph the solution.
Class Schedule: Class Announcements Homework Questions 3.4 Notes Begin Homework.
1 Outline:  Optimization of Timed Systems  TA-Modeling of Scheduling Tasks  Transformation of TA into Mixed-Integer Programs  Tree Search for TA using.
Scheduling Lacquer Productions with Uppaal AXXOM case study of the Ametist project Angelika Mader Distributed and Embedded Systems Group, University of.
15.082J and 6.855J March 4, 2003 Introduction to Maximum Flows.
D Nagesh Kumar, IIScOptimization Methods: M6L5 1 Dynamic Programming Applications Capacity Expansion.
Optimization Problems
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.
Xi He Golisano College of Computing and Information Sciences Rochester Institute of Technology Rochester, NY THERMAL-AWARE RESOURCE.
CES 592 Theory of Software Systems B. Ravikumar (Ravi) Office: 124 Darwin Hall.
ECE/CS 584: Verification of Embedded Computing Systems Model Checking Timed Automata Sayan Mitra Lecture 09.
The Time-abstracting Bisimulation Equivalence  on TA states: Preserve discrete state changes. Abstract exact time delays. s1s2 s3  a s4  a 11 s1s2.
CHAPTER 1 INTRODUCTION TO COMPILER SUNG-DONG KIM, DEPT. OF COMPUTER ENGINEERING, HANSUNG UNIVERSITY.
Engineering Economics (2+0)
IIT Kharagpur & Kingston Uni
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 3
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 3
James D. Z. Ma Department of Electrical and Computer Engineering
Stochastic Modelling and Analysis
On Using Linearly Priced Timed Automata for Flow Analysis
Timed Automata Formal Systems Pallab Dasgupta Professor,
Computer Programming.
Discrete Controller Synthesis
Fast Min-Register Retiming Through Binary Max-Flow
Integer Linear Programming
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 3
Presentation transcript:

Formal methods & Tools UCb CUPPAAL CUPPAAL Efficient Minimum-Cost Reachability for Linearly Priced Timed Automata Gerd Behrman, Ed Brinksma, Ansgar Fehnker, Thomas Hune, Kim Larsen, Paul Pettersson, Judi Romijn, Frits Vaandrager

VHS meeting Kim G. Larsen UCb 2 Overview 1.Introduction 2.Linear Priced Timed Automata 3.Priced Zones and Facets 4.Operations on Priced Zones 5.Algorithm 6.First Experimental Findings 7.Conclusion

VHS meeting Kim G. Larsen UCb 3 Observation Many scheduling problems can be phrased naturally as reachability problems for timed automata! INTRODUCTION

VHS meeting Kim G. Larsen UCb 4 Observation Many scheduling problems can be phrased naturally as reachability problems for timed automata! UNSAFE SAFE At most 2 crossing at a time Need torch At most 2 crossing at a time Need torch Mines Can they make it within 60 minutes ? Can they make it within 60 minutes ? INTRODUCTION

VHS meeting Kim G. Larsen UCb 5 Observation Many scheduling problems can be phrased naturally as reachability problems for timed automata! UNSAFE SAFE Mines INTRODUCTION

VHS meeting Kim G. Larsen UCb 6 Steel Production Plant Machine 1 Machine 2Machine 3 Machine 4Machine 5 Buffer Continuos Casting Machine Storage Place Crane B Crane A zA. Fehnker, T. Hune, K. G. Larsen, P. Pettersson zCase study of Esprit-LTR project VHS zPhysical plant of SIDMAR located in Gent, Belgium. zPart between blast furnace and hot rolling mill. Objective: model the plant, obtain schedule and control program for plant. Lane 1 Lane 2 INTRODUCTION

VHS meeting Kim G. Larsen UCb 7 Batch Processing Plant (VHS) hbrine water store mbrine heat water heater cooling water pump cooling water water salt INTRODUCTION

VHS meeting Kim G. Larsen UCb 8 Earlier work zAsarin & Maler (1999) Time optimal control using backwards fixed point computation zVHS consortium (1999) Steel plant and chemical batch plant case studies zNiebert, Tripakis & Yovine (2000) Minimum-time reachability using forward reachability zBehrmann, Fehnker et all (2000) Minimum-time reachability using branch-and-bound INTRODUCTION

VHS meeting Kim G. Larsen UCb 9 Advantages Easy and flexible modeling of systems whole range of verification techniques becomes available Controller/Program synthesis Disadvantages Existing scheduling approaches perform somewhat better Our goal See how far we get; Integrate model checking and scheduling theory. INTRODUCTION

VHS meeting Kim G. Larsen UCb 10 More general cost function zIn scheduling theory one is not just interested in shortest schedules; also other cost functions are considered zThis leads us to introduce a model of linear priced timed automata which adds prices to locations and transitions zThe price of a transition gives the cost of taking it, and the price of a location specifies the cost per time unit of staying there. INTRODUCTION

Formal methods & Tools UCb Linearly Priced Timed Automata

VHS meeting Kim G. Larsen UCb 12 Example PRICED AUTOMATA

VHS meeting Kim G. Larsen UCb 13 EXAMPLE : Optimal rescue plan for important persons (Presidents and Actors) UNSAFE SAFE Mines GORECLINTON BUSH DIAZ OPTIMAL PLAN HAS ACCUMULATED COST=195 and TOTAL TIME=65! PRICED AUTOMATA

VHS meeting Kim G. Larsen UCb 14 Definition PRICED AUTOMATA

VHS meeting Kim G. Larsen UCb 15 Definition PRICED AUTOMATA

VHS meeting Kim G. Larsen UCb 16 Example of execution PRICED AUTOMATA

VHS meeting Kim G. Larsen UCb 17 Cost zThe cost of a finite execution is the sum of the prices of all the transitions occuring in it zThe minimal cost of a location is the infimum of the costs of the finite executions ending in the location zThe minimum-cost problem for LPTAs is the problem to compute the minimal cost of a given location of a given LPTA zIn the example below, mincost(C ) = 7 PRICED AUTOMATA ? DECIDABILITY ?

Formal methods & Tools UCb Priced Zones

VHS meeting Kim G. Larsen UCb 19 Zones Operations PRICED ZONES

VHS meeting Kim G. Larsen UCb 20 Canonical Datastructure for Zones Difference Bounded Matrices x1-x2<=4 x2-x1<=10 x3-x1<=2 x2-x3<=2 x0-x1<=3 x3-x0<=5 x1-x2<=4 x2-x1<=10 x3-x1<=2 x2-x3<=2 x0-x1<=3 x3-x0<=5 x1x2 x3x x1x2 x3x Shortest Path Closure O(n^3) Bellman’58, Dill’89 PRICED ZONES

VHS meeting Kim G. Larsen UCb 21 New Canonical Datastructure Minimal collection of constraints x1-x2<=4 x2-x1<=10 x3-x1<=2 x2-x3<=2 x0-x1<=3 x3-x0<=5 x1-x2<=4 x2-x1<=10 x3-x1<=2 x2-x3<=2 x0-x1<=3 x3-x0<=5 x1x2 x3x x1x2 x3x x1x2 x3x Shortest Path Closure O(n^3) Shortest Path Reduction O(n^3) 3 Space worst O(n^2) practice O(n) RTSS 1997 PRICED ZONES

VHS meeting Kim G. Larsen UCb 22 Priced Zone PRICED ZONES x y 4 2 Z

VHS meeting Kim G. Larsen UCb 23 Reset x y 4 2 Z PRICED ZONES

VHS meeting Kim G. Larsen UCb 24 Reset x y 4 2 Z {y}Z PRICED ZONES

VHS meeting Kim G. Larsen UCb 25 Reset x y 4 2 Z {y}Z4 PRICED ZONES

VHS meeting Kim G. Larsen UCb 26 Reset x y 4 2 Z {y}Z4 1 PRICED ZONES 2 A split of {y}Z 4

VHS meeting Kim G. Larsen UCb 27 Facets The solution PRICED ZONES

VHS meeting Kim G. Larsen UCb 28 OPERATIONS ON PZONES

VHS meeting Kim G. Larsen UCb 29 Delay x y 4 3 Z PRICED ZONES

VHS meeting Kim G. Larsen UCb 30 Delay x y 4 3 Z Delay in a location with cost-rate PRICED ZONES

VHS meeting Kim G. Larsen UCb 31 Delay x y 4 3 Z PRICED ZONES A split of

VHS meeting Kim G. Larsen UCb 32 Facets The solution PRICED ZONES

VHS meeting Kim G. Larsen UCb 33 OPERATIONS ON PZONES

VHS meeting Kim G. Larsen UCb 34 Optimal Forward Reachability Example PRICED ZONES

VHS meeting Kim G. Larsen UCb 35 OPERATIONS ON PZONES

VHS meeting Kim G. Larsen UCb 36 OPERATIONS ON PZONES

Formal methods & Tools UCb Algorithm

VHS meeting Kim G. Larsen UCb 38 Branch & Bound Algorithm ALGORITHM

VHS meeting Kim G. Larsen UCb 39 ALGORITHM

VHS meeting Kim G. Larsen UCb 40 ALGORITHM

Formal methods & Tools UCb Experiments

VHS meeting Kim G. Larsen UCb 42 EXAMPLE : Optimal rescue plan for important persons (Presidents and Actors) UNSAFE SAFE Mines GORECLINTON BUSH DIAZ OPTIMAL PLAN HAS ACCUMULATED COST=195 and TOTAL TIME=65! EXPERIMENTS

VHS meeting Kim G. Larsen UCb 43 Experiments MC Order COST-rates SCHEDULE COSTTIME #Expl#Pop’d G5G5 C 10 B 20 D 25 Min Time CG> G C CG> G G GD> G G CG> G C CD> C C BD> B C time< EXPERIMENTS

VHS meeting Kim G. Larsen UCb 44 Optimal Broadcast Router1 Router2 Router3 Router4 A B Given particular subscriptions, what is the cheapest schedule for broadcasting k? Given particular subscriptions, what is the cheapest schedule for broadcasting k? k=1k=0 costA 1, costB 1 costA 2, costB 2 costA 3, costB 3 costA 4, costB 4 Basecost EXPERIMENTS costB 1 costA 1 3 sec 5 sec

VHS meeting Kim G. Larsen UCb 45 Experimental Results COST-rates SCHEDULE COSTTIME #Expl BCR1R1 R2R2 R3R3 R4R4 Min Time 1>3(B) ; ( 3>4(B) | 1>2(A) ) :31:31:31:31:31:31:31:3 1>4(A) ; 3>4(A) ; 4>2(A) >3(B) ; ( 3>4(B) | 1>2(A) ) :30 5 :15 1:31:36:26:2 1>3(A) ; 3>2(A) ; 3>4(A) >4(A) ; 4>3(B) ; 4>2(B) >4(B) ; ( 1>3(A) | 4>2(B) ) t<=10 1>4(B) ; 4>2(B) ; 4>3(B) t<=8 1>4(B) ; ( 1>3(A) | 4>2(B) ) EXPERIMENTS

VHS meeting Kim G. Larsen UCb 46 Scaling Up ? z# Schedules x4 routers: 120 x5 routers: x6 routers: ?????????? zFinding Feasible Schedule using UPPAAL (6 routers) x expl. symb. st. (with Active Clock Reduction) zMinimum Time Schedule (6 routers) x using Minimum Time Reachability (Ansgar) x using Minimum Cost Reachability (BC=1, all other cost=0) time optimal schedule takes 12 seconds. EXPERIMENTS

VHS meeting Kim G. Larsen UCb 47 Current & Future Work IMPLEMENTATION – thorough analysis  Applications – (Gossing Girls, Production Plant)  Generalization Minimum Cost Reachability under timing constraints avoiding certain states  Minimum Time Reachability under cost constraints  Maximum Cost between two types of states  Relationships to Reward Models Parameterized Extension  Extensions to Optimal Controllability