How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...

More documents

Recommendations

Info

Queries on <strong>Graph</strong>-<strong>Based</strong> <strong>Models</strong> Make Implicit Knowledge Explicit ► Since graph-based models are a mess, we try <strong>to</strong> analyze them ► Knowledge is either ■ Explicit, I.e., represented in the model as edges and nodes ■ Implicit, I.e., hidden, not directly represented, and must be analyzed ► Query and analysis problems try <strong>to</strong> make implicit knowledge explicit ■ E.g. Does the graph have one root? <strong>How</strong> many leaves do we have? Is this subgraph a tree? Can I reach that node from this node? ► Determining features of nodes and edges ■ Finding certain nodes, or patterns ► Determining global features of the model ■ Finding paths between two nodes (e.g., connected, reachable) ■ Finding paths that satisfy additional constraints ■ Finding subgraphs that satisfy additional constraints Prof. Uwe Aßmann, Softwaretechnologie II 38
Queries on <strong>Graph</strong>s Check Consistency ► Queries can be used <strong>to</strong> find out whether a graph is consistent ► Due <strong>to</strong> the graph-logic isomorphism, constraint specifications can be phrased in logic and applied <strong>to</strong> graphs ► Business people call constraint specifications business rules ► Example: ■ if a person hasn't died yet, its <strong>to</strong>wn should not list her in the list of dead people ■ if a car is exported <strong>to</strong> England, steering wheel and pedals should be on the right side; otherwise on the left Prof. Uwe Aßmann, Softwaretechnologie II 39
Page 1 and 2: How to</st
Page 3 and 4: Obligatory Reading
Page 5 and 6: Goals ► Understand that software
Page 7 and 8: The Problem: How <
Page 9 and 10: Partially Collapsed Prof. Uwe Aßma
Page 11 and 12: Requirements for Modelling in Requi
Page 13 and 14: Example: Rename Refacto</st
Page 15 and 16: Refactoring on Def
Page 17 and 18: Data-Flow Graphs
Page 19 and 20: Precise Call Graph
Page 21 and 22: Types of Graphs in
Page 23 and 24: Definitions ► Fan-in ■ In-degre
Page 25 and 26: Trees ► One source (root) ► Man
Page 27 and 28: Directed Graphs (D
Page 29 and 30: Reducible Graphs (
Page 31 and 32: Strength of Assertions in M
Page 33 and 34: Structuring Improves Worst Case Lis
Page 35 and 36: Methods and Tools for Analysis of <
Page 37: Graphs and Fact Da
Page 41 and 42: Layering of Systems ► To be compr
Page 43 and 44: Pattern and Rules ► Parenthood ca
Page 45 and 46: Same Generation ► Beyond sisters
Page 47 and 48: Same Generation Introduces Layers
Page 49 and 50: Searching Graphs -
Page 51 and 52: Same Generation Datalog Program isP
Page 53 and 54: Description Logic (DL) ► Is a spe
Page 55 and 56: Application Areas of Datalog, DL, O
Page 57 and 58: Answer Alternative category text Ex
Page 59 and 60: Example: Web Queries with Logic ►
Page 61 and 62: Who is Descendant of Whom? ► Some
Page 63 and 64: Impact of Basic Rule GustavAdolf Ad
Page 65 and 66: [S|M][S|M]PP Path Problems: Variant
Page 67 and 68: Exercise: Railway Routes ► Base (
Page 69 and 70: Central Theorem of Datalog/DL/EARS
Page 71 and 72: Applications of Graph</stro
Page 73 and 74: Generic Datalog Queries ► Transit
Page 75 and 76: Example 1: Consistency Checking for
Page 77 and 78: Second Idea ► Analyze</st
Page 79 and 80: Example 2: Consistency Checking of
Page 81 and 82: Second Idea ► Write queries that
Page 83 and 84: Example 3: UML Specifications in So
Page 85 and 86: Answer Alternative category text Ex
Page 87 and 88: Third Idea: Use Onto</stron
Page 89:
The End Softwaretechnologie II, ©
show all

How to Analyze Graph-Based Models - Www-st.inf.tu-dresden.de ...

Create successful ePaper yourself

Delete template?

Save as template?