Renate Ristov Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer 17. Juli 2008 Synthesizing State Machines from Live Sequence Charts Software Quality.

Slides:



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

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Using Matrices in Real Life
Advanced Piloting Cruise Plot.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
UNITED NATIONS Shipment Details Report – January 2006.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
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.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
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)
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Year 6 mental test 10 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
Richmond House, Liverpool (1) 26 th January 2004.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Turing Machines.
ABC Technology Project
1 Undirected Breadth First Search F A BCG DE H 2 F A BCG DE H Queue: A get Undiscovered Fringe Finished Active 0 distance from A visit(A)
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
Name Convolutional codes Tomashevich Victor. Name- 2 - Introduction Convolutional codes map information to code bits sequentially by convolving a sequence.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
“Start-to-End” Simulations Imaging of Single Molecules at the European XFEL Igor Zagorodnov S2E Meeting DESY 10. February 2014.
Factor P 16 8(8-5ab) 4(d² + 4) 3rs(2r – s) 15cd(1 + 2cd) 8(4a² + 3b²)
Squares and Square Root WALK. Solve each problem REVIEW:
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
CSCE 668 DISTRIBUTED ALGORITHMS AND SYSTEMS Fall 2011 Prof. Jennifer Welch CSCE 668 Set 14: Simulations 1.
Chapter 5 Test Review Sections 5-1 through 5-4.
SIMOCODE-DP Software.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
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
Complexity ©D.Moshkovits 1 Where Can We Draw The Line? On the Hardness of Satisfiability Problems.
Januar MDMDFSSMDMDFSSS
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
Immunobiology: The Immune System in Health & Disease Sixth Edition
CpSc 3220 Designing a Database
1 Decidability continued…. 2 Theorem: For a recursively enumerable language it is undecidable to determine whether is finite Proof: We will reduce the.
Traktor- og motorlære Kapitel 1 1 Kopiering forbudt.
Presentation transcript:

Renate Ristov Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer 17. Juli 2008 Synthesizing State Machines from Live Sequence Charts Software Quality and Safety

Renate Ristov Synthesis of State Machines from LSCs - 2 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Motivation Intra-object behaviorInter-object behavior ?

Renate Ristov Synthesis of State Machines from LSCs - 3 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Coffee Vending Machine

Renate Ristov Synthesis of State Machines from LSCs - 4 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Play-in/Play-out

Renate Ristov Synthesis of State Machines from LSCs - 5 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Problem of Consistency Find an object system that satisfies the LSC specification: For every chart and every run, whenever the prechart holds the run must satisfy the chart LSC specification has to be consistent

Renate Ristov Synthesis of State Machines from LSCs - 6 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Deciding Consistency DFA for every LSC Product Automaton Eliminating Bad States and Transitions

Renate Ristov Synthesis of State Machines from LSCs - 7 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Not Consistent Specification Restricted messages: prep_coffee

Renate Ristov Synthesis of State Machines from LSCs - 8 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer DFA for every LSC All messages without insert_coin All messages not in the chart and not prep_coffee

Renate Ristov Synthesis of State Machines from LSCs - 9 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Product Automaton

Renate Ristov Synthesis of State Machines from LSCs - 10 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions DFA for every LSC Product Automaton Eliminating Bad States and Transitions

Renate Ristov Synthesis of State Machines from LSCs - 11 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States

Renate Ristov Synthesis of State Machines from LSCs - 12 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States

Renate Ristov Synthesis of State Machines from LSCs - 13 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States Bad Transition: Environment Messages from Non-Accepting States

Renate Ristov Synthesis of State Machines from LSCs - 14 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States Bad Transition: Environment Messages from Non-Accepting States

Renate Ristov Synthesis of State Machines from LSCs - 15 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States Bad Transition: Environment Messages from Non- Accepting States Bad State: Accepting States, where Environment Message leads to Deadlock

Renate Ristov Synthesis of State Machines from LSCs - 16 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States Bad Transition: Environment Messages from Non- Accepting States Bad State: Accepting States, where Environment Message leads to Deadlock

Renate Ristov Synthesis of State Machines from LSCs - 17 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions Bad Transition: System Messages from Accepting States Bad Transition: Environment Messages from Non- Accepting States Bad State: Accepting States, where Environment Message leads to Deadlock

Renate Ristov Synthesis of State Machines from LSCs - 18 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Eliminating Bad States and Transitions No object system found to satisfy the LSCs LSC specification not consistent

Renate Ristov Synthesis of State Machines from LSCs - 19 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Corrected Specification Restricted messages: prep_coffee

Renate Ristov Synthesis of State Machines from LSCs - 20 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Global System Automaton

Renate Ristov Synthesis of State Machines from LSCs - 21 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer DFA for every LSC Product Automaton Eliminating Bad States and Transitions Distributing the Global System Automaton Distributing the GSA

Renate Ristov Synthesis of State Machines from LSCs - 22 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Distributing the GSA Controller Object Controller Object in size of GSA Every Object size of 1 Full Duplication Every Object in size of GSA Partial Duplication Every Object size smaller than GSA But overall at least size of GSA

Renate Ristov Synthesis of State Machines from LSCs - 23 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Complexity Size of Global System Automaton (GSA) is dependent on size of LSC specification Size of LSC specification dependent Number of Objects Number of Charts Number of Messages Fix one number exponential in the size of other numbers Fix every number polynomial in the size of LSC specification Construction of GSA is polynomial in the size of GSA

Renate Ristov Synthesis of State Machines from LSCs - 24 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Discussion Very simple LSCs: No variables No conditions No complex constructs like alternatives, loops, etc. For large systems too much time and space needed to be practical

Renate Ristov Synthesis of State Machines from LSCs - 25 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Another approach Using smart play-out to find consistency Encode play-out in a transition system (only one of many) Model Checking: ii Technique not complete: Another transition system can be correct, but the algorithm did not find it LSCs have to be very detailed to bound the complexity (EF(AG( for all universal charts m (active m = 1)))

Renate Ristov Synthesis of State Machines from LSCs - 26 Fachgebiet Softwaretechnik Prof. Dr. Wilhelm Schäfer Summary Object System satisfies LSC specification iff LSC specification is consistent Very simple LSCs Not practical for large systems Another approach: Encoding with Smart Play-Out and Model Checking Richer LSCs Not complete DFA for every LSC Product Automaton Eliminating Bad States and Transitions Distributing the Global System Automaton