Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL Cybernetix case study for AMETIST project.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

1
Slide 1 Insert your own content. Slide 2 Insert your own content.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
8-4 Factoring ax2 + bx + c Warm Up Lesson Presentation Lesson Quiz
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Counting and Number 1 to 15Order the numbers Numbers to 15.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
Multiplying monomials & binomials You will have 20 seconds to answer the following 15 questions. There will be a chime signaling when the questions change.
0 - 0.
2 pt 3 pt 4 pt 5pt 1 pt 2 pt 3 pt 4 pt 5 pt 1 pt 2pt 3 pt 4pt 5 pt 1pt 2pt 3 pt 4 pt 5 pt 1 pt 2 pt 3 pt 4pt 5 pt 1pt Simplify All mixed up Misc. AddingSubtract.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING Think Distributive property backwards Work down, Show all steps ax + ay = a(x + y)
Addition Facts
Year 6 mental test 5 second questions
ZMQS ZMQS
Photo Slideshow Instructions (delete before presenting or this page will show when slideshow loops) 1.Set PowerPoint to work in Outline. View/Normal click.
Treasure Map By: Gage Gwin Haven Beagle START. Step 1 23 tiles south CONTINUE.
Turing Machines.
PP Test Review Sections 6-1 to 6-6
EIS Bridge Tool and Staging Tables September 1, 2009 Instructor: Way Poteat Slide: 1.
2 |SharePoint Saturday New York City
O X Click on Number next to person for a question.
© S Haughton more than 3?
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
1 public class Newton { public static double sqrt(double c) { double epsilon = 1E-15; if (c < 0) return Double.NaN; double t = c; while (Math.abs(t - c/t)
Twenty Questions Subject: Twenty Questions
Copyright © 2012, Elsevier Inc. All rights Reserved. 1 Chapter 7 Modeling Structure with Blocks.
Take from Ten First Subtraction Strategy -9 Click on a number below to go directly to that type of subtraction problems
1 RA III - Regional Training Seminar on CLIMAT&CLIMAT TEMP Reporting Buenos Aires, Argentina, 25 – 27 October 2006 Status of observing programmes in RA.
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Squares and Square Root WALK. Solve each problem REVIEW:
CONTROL VISION Set-up. Step 1 Step 2 Step 3 Step 5 Step 4.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Limits (Algebraic) Calculus Fall, What can we do with limits?
Properties of Exponents
Chapter 5 Test Review Sections 5-1 through 5-4.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
Analyzing Genes and Genomes
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
Essential Cell Biology
Intracellular Compartments and Transport
O X Click on Number next to person for a question.
PSSA Preparation.
Essential Cell Biology
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
Immunobiology: The Immune System in Health & Disease Sixth Edition
How Cells Obtain Energy from Food
Energy Generation in Mitochondria and Chlorplasts
Insertion Sort Introduction to Algorithms Insertion Sort CSE 680 Prof. Roger Crawfis.
On Cyclic Plans for Scheduling of a Smart Card Personalisation System Tim Nieberg Universiteit Twente, EWI/TW DWMP-Group.
Modeling Car Periphery Supervision (CPS) System Robert Bosch GmbH case study for AMETIST project Tomas Krilavičius¹ & Biniam Gebremichael² ¹ - University.
Extending the smart-card personalisation system by the graphical treatment Angelika Mader University of Twente.
Cybernetix – Cost Driven UPPAAL and Insights Angelika Mader University of Twente Ametist meeting December 2002 Dortmund.
Presentation transcript:

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL Cybernetix case study for AMETIST project

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 2 Outline Informal description UPPAAL model General description of model Comparison with SMV model Model Demo Tested configurations Results List of experiments Result of experiments Plans Conclusions

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 3 Informal description CYBERNETIX Case Study, Informal description Sarah ALBERT, Cybernetix Recherche Smart Card Personalisation Machine in SMV, AMETIST: Cybernetix Case Study Biniam GEBREMICHAEL, Frits VAANDRAGER, University of Nijmegen Smart Card Personalisation Machine Smart card personalisation machine takes a pile of the blank smart cards as a raw material, programs them with the personalised data, prints them and tests them. Objectives Synthesis of correct and optimal schedules Model&tool for Cybernetix

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 4 UPPAAL model Simplified configuration Conveyor Unloader/Loader Personalisation stations Several versions Chronological ordering by unloader Chronological ordering by personalisation stations Configurable parameters conveyor length number and positions of personalisation stations temporal aspects: personalisation time, conveyor speed, unload/load time Standard UPPAAL (timed automata with extensions)

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 5 Comparison with SMV model Smart Card Personalisation Machine in SMV, AMETIST: Cybernetix Case Study Biniam GEBREMICHAEL, Frits VAANDRAGER, University of Nijmegen Both models are very abstract models Differences SMV modelUPPAAL model Conveyor moves all the timeConveyor can stop Chronological ordering is done by personalisation stations Chronological ordering is done by loader personalisation stations No unloading/loading timeUnloading/loading time

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 6 Conveyor: belt and conveyor movement int[0,2*CARDS] c[CELLS] - the conveyor belt, where CELLS is the length of the conveyor belt, (0..CELLS-1) CARDS – the number of the cards in the batch (1..CARDS – unpersonalised cards, CARDS+1..2*CARDS – personalised)

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 7 Unloader: unloads the cards on the conveyor one by one

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 8 Loader: removes the cards from the conveyor one by one

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 9 Personalisation station

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 10 Demonstration on UPPAAL

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 11 Tested configurations Chronological ordering by unloader by personalisation stations Number of personalisation stations and cards in the batch 2 personalisation stations, 2..8 cards 3 personalisation stations, 2..6 cards 4 personalisation stations, 2..5 cards Timing information personalisation time = 10 time units unloading/loading time = 2 time units one conveyor step = 1 time unit

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 12 Results: Experiments list Cards Stations (4 cells) (5 cells) (6 cells) personalisation = 10, unloading/loading = 2 time units, conveyor step = 1

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 13 Results: 2 stations, 6 cards and 3 stations, 5 cards Step Station Step Station \14\4\4 23\2\5\5 32\3\35

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 14 Results: 4 stations 4 cards and 5 cards Step Station Step Station

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 15 Interpretation of results Unloading/loading stations are bottlenecks – the cards should be spread to get better results If unloading/loading is instant, the super single mode and the batches algorithms are both optimal Several schedules can be optimal; to find the scheduling algorithm it would be useful to have tools, which allow to get all optimal traces

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 16 Plans Models with more stations and more cards, several batches of cards Models with bi-directional conveyor Models with Graphical personalisation stations Testing & reject stations Flip over stations Specialised versions of UPPAAL Other tools

Tomas Krilavičius & Yaroslav Usenko Smart Card Personalisation Machine in UPPAAL 17 Conclusions: early stage Smart card personalisation machine Different abstractions of the system can be made A fixed benchmark configuration is desirable to compare the results More information about the system would be useful UPPAAL It is possible to model the system in UPPAAL For small numbers of stations and cards it is possible to find optimal schedules automatically For automatic analysis of larger systems additional features could be useful diagnostic information (number of states, precise run-time information) batch mode access to the underlying transition system guided search question: is UPPAAL a right tool to model such systems (discrete time systems, deterministic systems)

Tomas Krilavičius & Yaroslav Usenko Thats all...