/department of mathematics and computer science Visualization of Transition Systems Hannes Pretorius Visualization Group

Slides:



Advertisements
Similar presentations
© Telelogic AB Modeling DoDAF Compliant Architectures Operational Systems Technical.
Advertisements

Tintu David Joy. Agenda Motivation Better Verification Through Symmetry-basic idea Structural Symmetry and Multiprocessor Systems Mur ϕ verification system.
Visualizing State Transition Graphs Hannes Pretorius Visualization Group, TU/e 17 October 2007
Game-theoretic approach to the simulation checking problem Peter Bulychev Vladimir Zakharov Lomonosov Moscow State University.
INTRODUCTION TO MODELING
Kellan Hilscher. Definition Different perspectives on the components, behavioral specifications, and interactions that make up a software system Importance.
Lecture # 2 : Process Models
Unit 2. Software Lifecycle
1 Chapter 4 - Part 1 Software Processes. 2 Software Processes is: Coherent (logically connected) sets of activities for specifying, designing, implementing,
Chapter 1 Introduction to Modeling DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall.
Chapter 1 Introduction to Modeling DECISION MODELING WITH MICROSOFT EXCEL Copyright 2001 Prentice Hall Publishers and Ardith E. Baker.
May 14, May 14, 2015May 14, 2015May 14, 2015 Azusa, CA Sheldon X. Liang Ph. D. Software Engineering in CS at APU Azusa Pacific University, Azusa,
Gene selection using Random Voronoi Ensembles Stefano Rovetta Department of Computer and Information Sciences, University of Genoa, Italy Francesco masulli.
An Automata-based Approach to Testing Properties in Event Traces H. Hallal, S. Boroday, A. Ulrich, A. Petrenko Sophia Antipolis, France, May 2003.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Software Metrics II Speaker: Jerry Gao Ph.D. San Jose State University URL: Sept., 2001.
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Overview of Software Requirements
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
1 Software Requirements Specification Lecture 14.
© 2006 Pearson Addison-Wesley. All rights reserved2-1 Chapter 2 Principles of Programming & Software Engineering.
Meaningful Modeling: What’s the Semantics of “Semantics”? David Harel, Weizmann Institute of Science Bernhard Rumpe, Technische Universität Braunschweig.
1 Software Testing Techniques CIS 375 Bruce R. Maxim UM-Dearborn.
Data Structures and Programming.  John Edgar2.
LÊ QU Ố C HUY ID: QLU OUTLINE  What is data mining ?  Major issues in data mining 2.
02/06/05 “Investigating a Finite–State Machine Notation for Discrete–Event Systems” Nikolay Stoimenov.
System Design Chapter 8. Objectives  Understand the verification and validation of the analysis models.  Understand the transition from analysis to.
1 Conceptual Modeling of User Interfaces to Workflow Information Systems Conceptual Modeling of User Interfaces to Workflow Information Systems By: Josefina.
Unit 2: Engineering Design Process
/department of mathematics and computer science April 07, 2006 UNSW / NICTA, Sydney1 mCRL2 and Visualization of State Spaces Bas Ploeger
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 6 Slide 1 Chapter 6 Requirements Engineering Process.
IS 466 ADVANCED TOPICS IN INFORMATION SYSTEMS LECTURER : NOUF ALMUJALLY 22 – 10 – 2011 College Of Computer Science and Information, Information Systems.
Applying Belief Change to Ontology Evolution PhD Student Computer Science Department University of Crete Giorgos Flouris Research Assistant.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 6 Slide 1 Requirements Engineering Processes l Processes used to discover, analyse and.
©Ian Sommerville 2000, Mejia-Alvarez 2009 Slide 1 Software Processes l Coherent sets of activities for specifying, designing, implementing and testing.
Software Processes lecture 8. Topics covered Software process models Process iteration Process activities The Rational Unified Process Computer-aided.
Assessing the Suitability of UML for Modeling Software Architectures Nenad Medvidovic Computer Science Department University of Southern California Los.
Model-based Methods for Web Service Verification.
Effective Requirements Management – an overview Kristian Persson Field Product Manager, Telelogic Asia/Pacific.
What is a Business Analyst? A Business Analyst is someone who works as a liaison among stakeholders in order to elicit, analyze, communicate and validate.
Sharing lessons through effective modelling Hilary Dexter University of Manchester Tom Franklin Franklin Consulting.
INTERACTIVE ANALYSIS OF COMPUTER CRIMES PRESENTED FOR CS-689 ON 10/12/2000 BY NAGAKALYANA ESKALA.
Unit 2: Engineering Design Process
Recuperação de Informação B Cap. 10: User Interfaces and Visualization , , 10.9 November 29, 1999.
1 Software Requirements l Specifying system functionality and constraints l Chapters 5 and 6 ++
PowerPoint Presentation for Dennis, Wixom, & Tegarden Systems Analysis and Design with UML, 3rd Edition Copyright © 2009 John Wiley & Sons, Inc. All rights.
April 28, 2003 Early Fault Detection and Failure Prediction in Large Software Systems Felix Salfner and Miroslaw Malek Department of Computer Science Humboldt.
Software Architecture Evaluation Methodologies Presented By: Anthony Register.
Scenario-Based Analysis of Software Architecture Rick Kazman, Gregory Abowd, Len Bass, and Paul Clements Presented by Cuauhtémoc Muñoz.
Requirements Validation
© 2006 Pearson Addison-Wesley. All rights reserved 2-1 Chapter 2 Principles of Programming & Software Engineering.
Architecture View Models A model is a complete, simplified description of a system from a particular perspective or viewpoint. There is no single view.
Verification & Validation By: Amir Masoud Gharehbaghi
/ PSWLAB Thread Modular Model Checking by Cormac Flanagan and Shaz Qadeer (published in Spin’03) Hong,Shin Thread Modular Model.
Lectures 2 & 3: Software Process Models Neelam Gupta.
Supporting the design of interactive systems a perspective on supporting people’s work Hans de Graaff 27 april 2000.
Reinforcement Learning for Mapping Instructions to Actions S.R.K. Branavan, Harr Chen, Luke S. Zettlemoyer, Regina Barzilay Computer Science and Artificial.
Science and Engineering Practices K–2 Condensed Practices3–5 Condensed Practices6–8 Condensed Practices9–12 Condensed Practices Developing and Using Models.
Exploring High-D Spaces with Multiform Matrices and Small Multiples Presented by Ray Chen and Sorelle Friedler Authors: MacEachren, A., Dai, X., Hardisty,
 The processes used for RE vary widely depending on the application domain, the people involved and the organisation developing the requirements.  However,
FACTOR ANALYSIS CLUSTER ANALYSIS Analyzing complex multidimensional patterns.
Algorithms and Problem Solving
State Space Representation
Software Processes.
CSc4730/6730 Scientific Visualization
CSc4730/6730 Scientific Visualization
State Space Analysis UNIT-V.
Chapter 9 Architectural Design.
Algorithms and Problem Solving
Some Important Skills Every Software Testers Should Have
Presentation transcript:

/department of mathematics and computer science Visualization of Transition Systems Hannes Pretorius Visualization Group

/department of mathematics and computer science Outline 1.Transition systems 2.Motivation 3.Existing results 4.Process 5.Experiment 1: projection 6.Experiment 2: simulation 7.Experiment 3: clustering 8.General conclusions

/department of mathematics and computer science Transition systems Used to analyze and verify systems Explicit descriptions of system behavior: –All system states –Transitions between these Describe systems whose states evolve over time

/department of mathematics and computer science Transition systems

/department of mathematics and computer science Motivation 1.Facilitate insight: –Tools and techniques to understand systems –Address size and complexity 2.“Gestalt”: –Associate visual form with abstract formalism –Enhances communication

/department of mathematics and computer science Motivation Frank van Ham’s FSMView: –Shows global structure and symmetries New approaches: –FSMView excels at what it was designed for –Investigate techniques with more focus on attributes (data, transition labels, …) –More interaction

/department of mathematics and computer science Process Formal specification LPE LTS Σ ValidateSimulateSpecify Real world

/department of mathematics and computer science Experiment 1: projection Σ Validate Simulate Specify

/department of mathematics and computer science Data communication Data is stored –States: vectors of data values –Multidimensional points Experiment 1: approach [1,1,0,2] [1,1,2,1][2,2,1,0]

/department of mathematics and computer science Experiment 1: approach Data Visual mapping Visual mapping Overview (dims) 2D projection Visual mapping Select subset

/department of mathematics and computer science Experiment 1: overview State Dimension s1s1 s2s2 s3s3 a b c d

/department of mathematics and computer science Experiment 1: projecting to 2D s1s1 s2s2 s3s3

/department of mathematics and computer science Experiment 1: demo

/department of mathematics and computer science Experiment 1: results Identify: –Superfluous variables –Correlations spanning multiple dimensions –States with specific valuations of variables –Phases of behavior Interaction: –Coupling of two views important “Data-centric” view: –Does not reveal enough about behavior

/department of mathematics and computer science Experiment 2: simulation Validate Simulate Specify

/department of mathematics and computer science Experiment 2: approach Simulation: –Quick and incremental checking of specification Text-based output: –Time consuming analysis –Not intuitive –Prone to human error

/department of mathematics and computer science Experiment 2: approach Automated parking garage Custom plug-in: –Maps current system state onto 2D floor plan Visual cues: –Lift position –Status of parking space (free, occupied,…) –Status of shuttles

/department of mathematics and computer science Experiment 2: visual mapping LiftShuttle Occupied Free Conveyor belt

/department of mathematics and computer science Experiment 2: demo

/department of mathematics and computer science Experiment 2: results Efficiency of analysis: –Saves time –Intuitively clear and easy to follow –Identified and corrected serious errors early on Stakeholders: –Convinced colleagues of merit of visualization –Means to communicate abstract ideas to client Shows behavior

/department of mathematics and computer science Experiment 3: clustering Σ Validate Simulate Specify

/department of mathematics and computer science Experiment 3: approach Directed graph: –Reduce size and complexity Associate meaning with states and transitions: –Reduce in meaningful way –Ability to take behavior into account

/department of mathematics and computer science Experiment 3: initial ideas Linear representation: –Predictable –Suggests ordered analysis –Effective way to show patterns Initial clustering: –Ranking (BFS, DFS) –Based on local behavior (fan-in, fan-out of transition labels at every state)

/department of mathematics and computer science Experiment 3: initial ideas

/department of mathematics and computer science Experiment 3: approach Every state is annotated: –Tuple with coordinates –Every coordinate has associated type –Every type has a domain Partition states based on equivalence relation: –Select subset of coordinates –Cluster domain of associated type

/department of mathematics and computer science Experiment 3: approach Define eq. rel. Data Eq. rel Cluster Clustered data Visual mapping Selection info. Vis. Select

/department of mathematics and computer science Experiment 3: approach First partitioning: coordinate i Original transition system

/department of mathematics and computer science Experiment 3: approach Second partitioning: coordinate j Original transition system

/department of mathematics and computer science Experiment 3: approach Allows for clustering based on: –Existing attributes –Derived attributes (structural properties, equivalence classes, …) –Construct hierarchy of clusters

/department of mathematics and computer science Experiment 3: demo

/department of mathematics and computer science Experiment 3: results Definition of equivalence relation on the fly: –Select subset of components –Cluster type domains Assumption: –User associates meaning with components Combination of clusters and hierarchy promising Work in progress: –Interaction –Derived attributes (behavior-related)

/department of mathematics and computer science General conclusions Experiments: –Gap between abstract and real world –Address sub-problems –Better understanding of problem (focus on behavior, clustering more general, …) Looking ahead: –Include insights in current tool –Add more functionality to current tool (annotation, selection, may- and must- transitions)

/department of mathematics and computer science General conclusions Open questions: – How to move from one clustering to the next –Simulation works really well, how to generalize? –User requirements ? ?

/department of mathematics and computer science Questions