theory of graph transformations
|
|
- Laurel Williams
- 6 years ago
- Views:
Transcription
1 theory of graph transformations University of Bremen speaker : Helge Wiemann hwiemann@tzi.de theory of graph transformations 1
2 theory of graph transformations Die großartige Schönheit eines Graphen besteht darin, dass er unklare, schwer durchschaubare Rätsel auf ein wunderbares Ding aus Linien und Knotenpunkten reduzieren kann. D. Olivastro. Das chinesische Dreieck: die kniffligsten mathematischen Rätsel aus Jahren. Droemer Knauer, München, 1995, S.273 theory of graph transformations 2
3 theory of graph transformations Pacman graph movepacman killpacman theory of graph transformations 3
4 ++ topics ++ short repetition and introduction graph rewriting category theory subgraphs graph morphism gluing condition algebraic approach double-pushout approach (DPO) single-pushout approach (SPO) example DPO comparison between SPO and DPO theory of graph transformations 4
5 ++ repetition and introduction ++ graphs for representing data structures states of concurrent and distributed systems states of sets of objects with relations between them important examples: flow diagrams Petri nets UML diagrams Entity-Relationship diagrams finite automata maps (of roads or countries) theory of graph transformations 5
6 ++ repetition and introduction ++ various kinds: directed and undirected labeled and unlabeled simple and multiple with binary edges or hyperedges to represent complex relations between objects as the basic data structure for transportation and tour planning problems to represent various control flows theory of graph transformations 6
7 ++ repetition and introduction ++ graph (multiple, directed, edge-labeled) as a system: G = (V, E, s, t, l) finite set of nodes (V) and edges (E) mapping s,t: E -> V: assigns a source s(e) and target t(e) node to every edge in E mapping l: E -> G: assigns a label to every edge in E theory of graph transformations 7
8 category theory abstract way to deal with mathematical structures and relationships between them our example : category of graphs a category C consists of: a class ob(c) of objects a class mor(c) of morphisms with a unique source object a and target object b (f: a b) for every three objects a, b and c: composition: mor(a, b) mor(b, c) mor(a, c)associativity: f : a b, g : b c and h : c d then h (g f) = (h g) f identity: 1x : x x called the identity morphism for x theory of graph transformations 8
9 subgraphs (1) G is a subgraph of H (G H), if V G V H (all nodes of G exist also in H) E G E H (all edges of G exist also in H) s G (e) = s H (e) (every edge of G has the same source node in H) t G (e) = t H (e) (every edge of G has the same target node in H) l G (e) = l H (e) (every edge of G has the same label in H) obtaining a subgraph G: removing some nodes and edges with the condition that the removal of a node is accompanied by the removal of all its adjacent edges theory of graph transformations 9
10 G = (V, E, s, t, l) graph rewriting -> subgraphs (2) pair of sets of nodes and edges : X = (V X, E X ) in (V, E) optaining subgraph H: H = G X = (V V X, E E X, s', t', l') s'(e) = s(e), t'(e) = t(e) and l'(e) = l(e) for all e in E E X G1, G2, G3 are subgraphs of G theory of graph transformations 10
11 graph morphisms given two graphs G and H a graph morphism g: G -> H is a pair of functions g V : V G -> V H (node mappings) g E : E G -> E H (edge mappings) that are structure-preserving the image of G in H is called a match of G in H the match of G in H according to the morphism g is the subgraph g(g) in H, induced by the pair (g(v), g(e)) possible sequence of morphisms with additional graph F: f: F -> G and g: G -> H yields the morphism g o f: F -> H theory of graph transformations 11
12 gluing condition (1) a match maintains the gluing condition with the following two single conditions: 1) identification condition: two elements x and y of L may only not be mapped injectively, if they will be not deleted by the rule mappings: o(x) = o(y), if x=y or x,y in L R 2) dangling condition: an edge e of M g(l) neither has its source node nor its target node in g(l) g(k). (means: if you delete one node, you have to delete all edges that are adjacent) identification condition + dangling condition = gluing condition theory of graph transformations 12
13 gluing condition (2) rule r : graph M : identification condition ok, but dangling condition hurts: identification condition and dangling condition ok: theory of graph transformations 13
14 algebraic approach based upon the category theory (category of graphs) rule-based transformation of graphs as the method to perform local changes on graphs specify formally and visually the semantics of rule-based systems rules to express which part of a graph is to be replaced by another graph general production p: L -> R i) valid graph transformation, if the match satifies the gluing condition ii) the action of gluing two graphs is a construction, in the category of graphs and graph morphisms, called pushout theory of graph transformations 14
15 double-pushout approach (DPO) frequently used approach for graph transformations used graph transformation rule: which parts are replaced by other ones which kinds of transformations are allowed formal rule r = (L <- K -> R) or (L K R) three graphs: L, K, R (K is a subgraph of L and R) left-hand side (L), gluing graph (K) and right-hand side (R) DPO-production as a pair (L <- K -> R) of two graphmorphisms in the category of graphs with an interface graph K, where K -> L is injective theory of graph transformations 15
16 double-pushout approach (DPO) rule p: L -> R construction of the graph G final graph H by match O L : L -> G adding of R\L in D (satifies the gluing condition) building the temporary graph D as subgraph of G by deleting the matching elements the dangling condition ensures that D is graph theory of graph transformations 16
17 application example: DPO (1) given: rule r = (L -> K <- R) and graph M rule first step: find match L in M, maintains the gluing condition theory of graph transformations 17
18 application example: DPO (2) second step: building a temporary graph Z: Z = M (g(l) g(k) theory of graph transformations 18
19 application example: DPO (3) third step: building the final transformed graph N: N = Z + (R - K) theory of graph transformations 19
20 single-pushout approach (SPO) case where the interface graph K is only a set of nodes graphical rule representation without an interface graph by depicting only the graphs L and R formal rule/production r: L -> R direct derivation as single-pushout from the host graph L to the target graph R with only one rewriting step graph rewriting rule only with a single morphism theory of graph transformations 20
21 comparison between SPO and DPO DPO is more frequently used than the SPO SPO: direct derivation without an interface graph K between the host graph G and the target graph H SPO operates with no identification + dangling condition!! more powerful than DPO more dangerous because a transformation can destroy the graph, e.g. delete edges DPO operates real structure preserving theory of graph transformations 21
22 Any questions left Thanks for your attention! theory of graph transformations 22
23 ++ references ++ [1] Grzegorz Rozenberg, edito: Handbook of Graph Grammars and Computing by Graph Transformation. Vol.1: Foundations. World Scientific,Singapore,1997. [2] H.-J. Kreowski, R. Klempien-Hinrichs, S. Kuske: Some Essentials of Graph Transformation. University of Bremen, Department of Computer Science. Bremen [3] H.-J. Kreowski: Formale Sprachen: Graphtransformation. Universität Bremen, Sommersemester 2004 [4] theory of graph transformations 23
Theory of Graph Transformations
Theory of Graph Transformations Helge Wiemann University of Bremen studies of computer science hwiemann@tzi.de Abstract This paper shall give an introduction into the theory of rule-based graph transformation
More informationGraph Grammars. Marc Provost McGill University February 18, 2004
Graph Grammars Marc Provost McGill University marc.provost@mail.mcgill.ca February 18, 2004 Abstract This presentation introduces graph transformations. Typeset by FoilTEX Structure of the talk Graph Theory
More informationSome Essentials of Graph Transformation
Some Essentials of Graph Transformation Hans-Jörg Kreowski, Renate Klempien-Hinrichs, and Sabine Kuske University of Bremen, Department of Computer Science P.O.Box 04 40, 84 Bremen, Germany {kreo,rena,kuske}@informatik.uni-bremen.de
More informationA Matching Algorithm and AGG Overview
A Matching Algorithm and AGG Overview Marc Provost McGill University marc.provost@mail.mcgill.ca March 29, 2004 Abstract This presentation go over the basic features of agg for graph rewriting. Typeset
More informationGraph Transformation Units An Overview
Graph Transformation Units An Overview Hans-Jörg Kreowski 1,SabineKuske 1, and Grzegorz Rozenberg 2 1 University of Bremen, Department of Computer Science P.O. Box 33 04 40, 28334 Bremen, Germany {kreo,kuske}@informatik.uni-bremen.de
More informationApproaches for Quantifying
Approaches for Quantifying Multicast AW 2 15. 5. 2014 1 duction and Basics 2 3 4 Robustness with 5 duction Motivation High complexity leads to low predictability varies in different algorithms Long-Term
More informationTowards an integrated graph-based semantics for UML
Softw Syst Model DOI 10.1007/s10270-008-0101-4 REGULAR PAPER Towards an integrated graph-based semantics for UML Sabine Kuske Martin Gogolla Hans-Jörg Kreowski Paul Ziemann Received: 3 August 2005 / Revised:
More informationAGG: A Graph Transformation Environment for Modeling and Validation of Software
AGG: A Graph Transformation Environment for Modeling and Validation of Software Gabriele Taentzer Technische Universität Berlin, Germany gabi@cs.tu-berlin.de Abstract. AGG is a general development environment
More informationExtending the DPO Approach for Topological Validation of Metamodel-Level Graph Rewriting Rules
xtending the DPO Approach for Topological alidation of Metamodel-Level raph Rewriting Rules TIAMÉR LNDOSZKY, LÁSZLÓ LNYL, ASSAN CARAF Department of Automation and Applied Informatics Budapest University
More informationFormal Semantics of Consistent EMF Model Transformations by Algebraic Graph Transformation
SoSyM manuscript No. (will be inserted by the editor) Formal Semantics of Consistent EMF Model Transformations by Algebraic Graph Transformation Enrico Biermann 1, Claudia Ermel 1, Gabriele Taentzer 2
More informationParallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets
Electronic Notes in Theoretical Computer Science 109 (2004) 17 29 www.elsevier.com/locate/entcs Parallel Graph Transformation for Model Simulation applied to Timed Transition Petri Nets J. de Lara a,1,
More informationA Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications
A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications Hartmut Ehrig 1, Claudia Ermel 1 and Gabriele Taentzer 2 1 Technische Universität Berlin, Germany
More informationA Survey of Control Structures for Reconfigurable Petri Nets
Journal of Computer and Communications, 2015, 3, 20-28 Published Online February 2015 in SciRes. http://www.scirp.org/journal/jcc http://dx.doi.org/10.4236/jcc.2015.32002 A Survey of Control Structures
More informationTowards Formal Verification of UML Diagrams Based on Graph Transformation
Towards Formal Verification of UML Diagrams Based on Graph Transformation Yu Zhao *, Yushun Fan, Xinxin Bai, Yuan Wang, Hong Cai, Wei Ding CIM Research Center, Department of Automation, Tsinghua University,
More informationTermination Analysis of the Transformation UML to CSP
Magyar Kutatók 8. Nemzetközi Szimpóziuma 8 th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics Termination Analysis of the Transformation UML to CSP Márk Asztalos,
More informationForschungsberichte der Fakultät IV Elektrotechnik und Informatik
Forschungsberichte der Fakultät IV Elektrotechnik und Informatik A Formal Resolution Strategy for Operation-Based Conicts in Model Versioning Using Graph Modications Hartmut Ehrig 1 Claudia Ermel 1 Gabriele
More informationAutonomous Units and Their Semantics The Concurrent Case
Autonomous Units and Their Semantics The Concurrent Case Hans-Jörg Kreowski, Sabine Kuske Uniersity of Bremen, Department of Computer Science P.O.Box 330440, D-28334 Bremen, Germany {kreo,kuske}@informatik.uni-bremen.de
More informationFrom UML Sequence Diagrams to ECATNets: a Graph Transformation based Approach for modelling and analysis
From UML Sequence Diagrams to ECATNets: a Graph Transformation based Approach for modelling and analysis Allaoua Chaoui Department of Computer Science, University Mentouri Constantine, Algeria a_chaoui2001@yahoo.com
More informationA SAT-Based Graph Rewriting and Verification Tool Implemented in Haskell
A SAT-Based Graph Rewriting and Verification Tool Implemented in Haskell A SAT-Based Graph Rewriting and Verification Tool Implemented in Haskell Marcus Ermler University of Bremen, Department for Mathematics
More informationTowards a Notion of Transaction in Graph Rewriting 1
GT-VMT Towards a Notion of Transaction in Graph Rewriting P. Baldan a, A. Corradini b, F.L. Dotti c, L. Foss b,d, F. Gadducci b, L. Ribeiro d a Università Ca Foscari di Venezia, Italy b Università di Pisa,
More informationGraph Transformation by Computational Category Theory
Graph Transformation by Computational Category Theory Mark Minas 1 and Hans J. Schneider 2 1 Universität der Bundeswehr München, Germany, Mark.Minas@unibw.de 2 Universität Erlangen, Germany, schneider@informatik.uni-erlangen.de
More informationGP 2: Efficient Implementation of a Graph Programming Language
GP : Efficient Implementation of a Graph Programming Language Christopher Bak Doctor of Philosophy University of York Computer Science September 05 Abstract The graph programming language GP (Graph Programs)
More informationA Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework
A Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework Enrico Biermann, Claudia Ermel, Frank Hermann and Tony Modica Technische Universität Berlin, Germany {enrico,lieske,frank,modica}@cs.tu-berlin.de
More informationBehavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts
Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts Guilherme Rangel 1, Leen Lambers 1, Barbara König 2, Hartmut Ehrig 1, and Paolo Baldan 3 1 Institut für Softwaretechnik
More informationModel Transformation by Graph Transformation: A Comparative Study
Model Transformation by Graph Transformation: A Comparative Study Karsten Ehrig 1, Esther Guerra 2, Juan de Lara 3, Laszlo Lengyel 4, Tihamer Levendovszky 4, Ulrike Prange 1, Gabriele Taentzer 1, Daniel
More informationBehavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts
Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts Guilherme Rangel 1, Leen Lambers 1, Barbara König 2, Hartmut Ehrig 1, and Paolo Baldan 3 1 Institut für Softwaretechnik
More informationMotivation: Model-driven. driven Engineering. Semantics of Model Transformation. Reiko Heckel University of Leicester, UK
Semantics of Model Transformation Reiko Heckel University of Leicester, UK, University of Birmingham, 1 March 2007 Motivation: Model-driven driven Engineering Focus and primary artifacts are models instead
More informationManipulation of Graphs, Algebras and Pictures. Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday
Electronic Communications of the EASST Volume X (2009) Manipulation of Graphs, Algebras and Pictures Essays Dedicated to Hans-Jörg Kreowski on the Occasion of His 60th Birthday Lifting Parallel Graph Transformation
More informationParallel Rewriting of Graphs through the. Pullback Approach. Michel Bauderon 1. Laboratoire Bordelais de Recherche en Informatique
URL: http://www.elsevier.nl/locate/entcs/volume.html 8 pages Parallel Rewriting of Graphs through the Pullback Approach Michel Bauderon Laboratoire Bordelais de Recherche en Informatique Universite Bordeaux
More informationAbstract. This note presents a new formalization of graph rewritings which generalizes traditional
Relational Graph Rewritings Yoshihiro MIZOGUCHI 3 and Yasuo KAWAHARA y Abstract This note presents a new ormalization o graph rewritings which generalizes traditional graph rewritings. Relational notions
More informationGenerating Test Cases for Code Generators by Unfolding Graph Transformation Systems
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems Paolo Baldan, Barbara König 2, and ngo Stürmer 3 Dipartimento di nformatica, Università Ca Foscari di Venezia, taly 2
More informationAnalysis and Abstraction of Graph Transformation Systems via Type Graphs
Analysis and Abstraction of Graph Transformation Systems via Type Graphs Dennis Nolte Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, Germany dennis.nolte@uni-due.de
More informationA Graph Grammar to Transform a Dataflow Graph into a Multithread Graph and its Application in Task Scheduling
A Graph Grammar to Transform a Dataflow Graph into a Multithread Graph and its Simone André da Costa Cavalheiro 1 Luciana Foss 1 Cícero Augusto de S Camargo 1 Gerson Geraldo H Cavalheiro 1 Abstract: The
More informationStatic Safety Analysis of UML Action Semantics for Critical Systems Development
Static Safety Analysis of UML Action Semantics for Critical Systems Development Zsigmond Pap, Dániel Varró Dept. of Measurement and Information Systems Budapest University of Technology and Economics H-1521
More informationOverview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation
Electronic Notes in Theoretical Computer Science 152 (2006) 3 22 www.elsevier.com/locate/entcs Overview of Formal Concepts for Model Transformations Based on Typed Attributed Graph Transformation Hartmut
More informationEditor Manual. Gruppe 3 Christoph Höger, Jonas Hurrelmann, Peggy Sylopp, Sebastian Szczepanski
Editor Manual Gruppe 3 Christoph Höger, Jonas Hurrelmann, Peggy Sylopp, Sebastian Szczepanski September 5, 2007 Contents 1 Introduction 2 1.1 Motivation..................................... 2 1.2 Formal
More informationModelling Software Evolution using Algebraic Graph Rewriting
Modelling Software Evolution using lgebraic Graph Rewriting Selim iraci and Pim van den roek Software Engineering Group aculty of Electrical Engineering, Mathematics and omputer Science University of Twente
More informationOn the Recognizability of Arrow and Graph Languages
On the Recognizability of Arrow and Graph Languages Christoph Blume Sander Bruggink Barbara König Universität Duisburg-Essen, Germany Background Applications of finite automata and regular (word) languages
More informationGraph Representation of Sessions and Pipelines for Structured Service Programming
Graph Representation of Sessions and Pipelines for Structured Service Programming Liang Zhao 1,2 with Roberto Bruni 1 and Zhiming Liu 2 1 University of Pisa, Italy 2 UNU-IIST, Macao SR, China FCS 2010
More informationSupporting feature-based parametric modeling by graph rewriting
Supporting feature-based parametric modeling by graph rewriting S. Vilgertshofer a and A. Borrmann a a Chair of Computational Modeling and Simulation, Technical University of Munich, Germany E-mail: simon.vilgertshofer@tum.de,
More informationChapter 4. Capturing the Requirements. 4th Edition. Shari L. Pfleeger Joanne M. Atlee
Chapter 4 Capturing the Requirements Shari L. Pfleeger Joanne M. Atlee 4th Edition It is important to have standard notations for modeling, documenting, and communicating decisions Modeling helps us to
More informationFormal Foundations of Software Engineering
Formal Foundations of Software Engineering http://d3s.mff.cuni.cz Martin Nečaský Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Goals of the course Show methods and tools
More informationGRAPHS WITH 1-FACTORS
proceedings of the american mathematical society Volume 42, Number 1, January 1974 GRAPHS WITH 1-FACTORS DAVID P. SUMNER Abstract. In this paper it is shown that if G is a connected graph of order 2n (n>
More informationEuropean School on Graph Transformation Bremen, March 2{7, 1998 Abstracts of Lectures edited by Frank Drewes Contents 1 Michel Bauderon: Pullback rewriting....................... 2 Andrea Corradini, Hartmut
More informationUNIVERSITY OF OSLO Department of Informatics. Conquering overlapping fragments in CVL. Master thesis. Anatoly Vasilevskiy
UNIVERSITY OF OSLO Department of Informatics Conquering overlapping fragments in CVL Master thesis Anatoly Vasilevskiy Spring 2013 Conquering overlapping fragments in CVL Anatoly Vasilevskiy 30th April
More informationCOMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN
COMPUTER SCIENCE/INFORMATION SYSTEMS DEGREE PLAN YEAR 1, SEMESTER 1 YEAR 1, SEMESTER 2 Composition I 3 Composition II 3 Calculus I 5 Calculus II 5 Humanistic (Religion) 3 Physics I 5 Total Wellness 2 Statistics
More informationCourse Modelling of Concurrent Systems Summer Semester 2016 University of Duisburg-Essen
Course Modelling of Concurrent Systems Summer Semester 2016 University of Duisburg-Essen Harsh Beohar LF 265, harsh.beohar@uni-due.de Harsh Beohar Course Modelling of Concurrent Systems 1 Course handler
More informationGraph Rewrite Rules with Structural Recursion
Graph Rewrite Rules with Structural Recursion Berthold Hoffmann 1, Edgar Jakumeit 2, and Rubino Geiß 2 3 1 Universität Bremen and DFKI-Lab Bremen, Germany 2 Universität Karlsruhe (TH), Germany 3 LPA GmbH
More informationTECHNICAL REPORT. Institute for Software Integrated Systems Vanderbilt University Nashville Tennessee 37235
Institute for Software Integrated Systems Vanderbilt University Nashville Tennessee 37235 TECHNICAL REPORT TR #: ISIS-03-401 Title: Interpreter Writing Using Graph Transformations Authors: Aditya Agrawal,
More informationGenerating Diagram Editors Providing Free-Hand Editing as well as Syntax-Directed Editing
Generating Diagram Editors Providing Free-Hand Editing as well as Syntax-Directed Editing Oliver Köth and Mark Minas Lehrstuhl für Programmiersprachen Universität Erlangen-Nürnberg Martensstr. 3, 91058
More informationLecture 1: Examples, connectedness, paths and cycles
Lecture 1: Examples, connectedness, paths and cycles Anders Johansson 2011-10-22 lör Outline The course plan Examples and applications of graphs Relations The definition of graphs as relations Connectedness,
More informationCategory Theory in Ontology Research: Concrete Gain from an Abstract Approach
Category Theory in Ontology Research: Concrete Gain from an Abstract Approach Markus Krötzsch Pascal Hitzler Marc Ehrig York Sure Institute AIFB, University of Karlsruhe, Germany; {mak,hitzler,ehrig,sure}@aifb.uni-karlsruhe.de
More informationCourse Modelling of Concurrent Systems Summer Semester 2016 University of Duisburg-Essen
Course Modelling of Concurrent Systems Summer Semester 2016 University of Duisburg-Essen Harsh Beohar LF 265, harsh.beohar@uni-due.de Harsh Beohar Course Modelling of Concurrent Systems 1 Course handler
More informationHypergraph Grammars in hp-adaptive Finite Element Method
Available online at www.sciencedirect.com Procedia Computer Science 18 (2013 ) 1545 1554 2013 International Conference on Computational Science Hypergraph Grammars in hp-adaptive Finite Element Method
More informationComposability Test of BOM based models using Petri Nets
I. Mahmood, R. Ayani, V. Vlassov and F. Moradi 7 Composability Test of BOM based models using Petri Nets Imran Mahmood 1, Rassul Ayani 1, Vladimir Vlassov 1, and Farshad Moradi 2 1 Royal Institute of Technology
More informationDirected algebraic topology and applications
Department of Mathematical Sciences, Aalborg University, Denmark Discrete Structures in Algebra, Geometry, Topology and Computer Science 6ECM July 3, 2012 Algebraic Topology Homotopy Homotopy: 1-parameter
More informationA Formalism for Automated Verification of Model Transformations
Magyar Kutatók 10. Nemzetközi Szimpóziuma 10 th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics A Formalism for Automated Verification of Model Transformations
More informationSynchronization Expressions: Characterization Results and. Implementation. Kai Salomaa y Sheng Yu y. Abstract
Synchronization Expressions: Characterization Results and Implementation Kai Salomaa y Sheng Yu y Abstract Synchronization expressions are dened as restricted regular expressions that specify synchronization
More informationAnalysing Graph Transformation Rules Through OCL
Analysing Graph Transformation Rules Through OCL Jordi Cabot 1, Robert Clarisó 1, Esther Guerra 2, and Juan de Lara 3 1 Universitat Oberta de Catalunya (Spain), {jcabot,rclariso}@uoc.edu 2 Universidad
More informationConcept and Transformationen of an Application Environment for Model Transformations Based on Triple Graph Grammars and Mathematica.
Concept and Transformationen of an Application Environment for Model Transformations Based on Triple Graph Grammars and Mathematica. University: Technische Universität Berlin Institute: Institut für Softwaretechnik
More informationTechniques for the unambiguous specification of software
Formal Techniques for the unambiguous of software Objectives To explain why formal techniques help discover problems in system requirements To describe the use of algebraic techniques for interface To
More informationA MODEL CATEGORY STRUCTURE ON THE CATEGORY OF SIMPLICIAL CATEGORIES
A MODEL CATEGORY STRUCTURE ON THE CATEGORY OF SIMPLICIAL CATEGORIES JULIA E. BERGNER Abstract. In this paper we put a cofibrantly generated model category structure on the category of small simplicial
More informationInstruction Selection on SSA Graphs
Instruction Selection on SSA Graphs Sebastian Hack, Sebastian Buchwald, Andreas Zwinkau Compiler ruction Course Winter Term 2009/2010 saarland university computer science 2 Instruction Selection Load ia32
More informationIntroduction to AGG and EMF Tiger by Modeling a Conference Scheduling System
Int J Softw Tools Technol Transfer (2009) manuscript No. (will be inserted by the editor) Introduction to AGG and EMF Tiger by Modeling a Conference Scheduling System Enrico Biermann Claudia Ermel Leen
More informationComputer Aided Multi-Paradigm Modelling to Process Petri-Nets and Statecharts
Computer Aided Multi-Paradigm Modelling to Process Petri-Nets and Statecharts Juan de Lara and Hans Vangheluwe 2 ETS Informática Universidad Autónoma de Madrid Madrid Spain, Juan.Lara@ii.uam.es 2 School
More informationON THE GENUS OF THE COMPOSITION OF TWO GRAPHS
PACIFIC JOURNAL OF MATHEMATICS Vol. 41, No. 1, 1972 ON THE GENUS OF THE COMPOSITION OF TWO GRAPHS ARTHUR T. WHITE Given two graphs G and H, a new graph G(H), called the composition (or lexicographic product)
More informationStructural and Syntactic Pattern Recognition
Structural and Syntactic Pattern Recognition Selim Aksoy Department of Computer Engineering Bilkent University saksoy@cs.bilkent.edu.tr CS 551, Fall 2017 CS 551, Fall 2017 c 2017, Selim Aksoy (Bilkent
More informationProceedings of the Sixth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2007)
Electronic Communications of the EASST Volume 6 (2007) Proceedings of the Sixth International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2007) Rule-Level Verification of Business
More informationGraph theory: basic concepts
Graph theory: basic concepts Graphs and networks allow modelling many different decision problems Graphs permit to represent relationships among different kinds of entities: Cities connected by roads Computers
More informationOn Petri Nets and Predicate-Transition Nets
On Petri Nets and Predicate-Transition Nets Andrea Röck INRIA - project CODES Roquencourt - BP 105 Le Chesnay Cedex 78153, FRANCE Ray Kresman Department of Computer Science Bowling Green State University
More information4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.
UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.
More informationOn the Use of Graph Transformations for Model Refactoring
On the Use of Graph Transformations for Model Refactoring Tom Mens Service de Génie Logiciel Université de Mons-Hainaut, Belgium tom.mens@umh.ac.be http://w3.umh.ac.be/genlog Abstract. Model-driven software
More informationSemantics of ARIS Model
Semantics of ARIS Model Why is Semantics Important? Jon Atle Gulla An analysis of the ARIS ing language with respect to - conceptual foundation and - formal properties Green, P. and M. Rosemann: An Ontological
More informationChapter 3: CONTEXT-FREE GRAMMARS AND PARSING Part2 3.3 Parse Trees and Abstract Syntax Trees
Chapter 3: CONTEXT-FREE GRAMMARS AND PARSING Part2 3.3 Parse Trees and Abstract Syntax Trees 3.3.1 Parse trees 1. Derivation V.S. Structure Derivations do not uniquely represent the structure of the strings
More informationIntroduction to Software Engineering (2+1 SWS) Winter Term 2009 / 2010 Dr. Michael Eichberg Vertretungsprofessur Software Engineering Department of
Introduction to Software Engineering (2+1 SWS) Winter Term 2009 / 2010 Dr. Michael Eichberg Vertretungsprofessur Software Engineering Department of Computer Science Technische Universität Darmstadt Dr.
More informationP = NP; P NP. Intuition of the reduction idea:
1 Polynomial Time Reducibility The question of whether P = NP is one of the greatest unsolved problems in the theoretical computer science. Two possibilities of relationship between P and N P P = NP; P
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationIntroduction Attributed Graphs Rule Specification Implementation Conclusion. AGG and PROGRES. Bernhard Scholz. 27th January 2006.
AGG and PROGRES 27th January 2006 AGG and PROGRES 1 Motivation AGG Attributed Graph Grammar System TU Berlin PROGRES PROgrammed Graph REwriting Systems RTWH Aachen How do these systems work? Graph model
More informationHow can we lay cable at minimum cost to make every telephone reachable from every other? What is the fastest route between two given cities?
1 Introduction Graph theory is one of the most in-demand (i.e. profitable) and heavily-studied areas of applied mathematics and theoretical computer science. May graph theory questions are applied in this
More informationON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT
ON THE STRUCTURE OF SELF-COMPLEMENTARY GRAPHS ROBERT MOLINA DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE ALMA COLLEGE ABSTRACT A graph G is self complementary if it is isomorphic to its complement G.
More informationCHECKING BEHAVIOURAL COMPATIBILITY IN SERVICE COMPOSITION WITH GRAPH TRANSFORMATION
CHECKING BEHAVIOURAL COMPATIBILITY IN SERVICE COMPOSITION WITH GRAPH TRANSFORMATION Redouane Nouara and Allaoua Chaoui Laboratory MISC University Abdel Hamid Mehri Constantine 2, Constantine Algeria ABSTRACT
More informationThe Implementation of Graph Programming Systems
The Implementation of Graph Programming Systems Qualifying Dissertation Christopher Bak October 3, 0 Abstract Implementing a graph programming system is not a straightforward task. The challenge not only
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationSIR C R REDDY COLLEGE OF ENGINEERING
SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,
More informationInterval Graphs. Joyce C. Yang. Nicholas Pippenger, Advisor. Arthur T. Benjamin, Reader. Department of Mathematics
Interval Graphs Joyce C. Yang Nicholas Pippenger, Advisor Arthur T. Benjamin, Reader Department of Mathematics May, 2016 Copyright c 2016 Joyce C. Yang. The author grants Harvey Mudd College and the Claremont
More informationChapter 2 Graphs. 2.1 Definition of Graphs
Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,
More informationModel Driven Engineering (MDE)
Model Driven Engineering (MDE) Yngve Lamo 1 1 Faculty of Engineering, Bergen University College, Norway 26 April 2011 Ålesund Outline Background Software Engineering History, SE Model Driven Engineering
More informationA Graph-Based Formalism for Controlling Access to a Digital Library Ontology
A Graph-Based Formalism for Controlling Access to a Digital Library Ontology Subhasis Dasgupta 1 and Aditya Bagchi 2 1 Indian Statistical Institute, 203 B T Road, Kolkata 700108, India.
More informationFormal Specification and Verification of Real-Time Systems using Graph Grammars
Formal Specification and Verification of Real-Time Systems using Graph Grammars Leonardo Michelon 1, Simone André da Costa 1,2 1 1 Instituto de Informática Universidade Federal do Rio Grande do Sul Av.
More informationVisual Modelling and Analysis of Model Transformations based on Graph Transformation
The Formal Specification Column by Hartmut Ehrig Technische Universität Berlin, Fak. Elektrotechnik und Informatik Franklinstraße 28/29, D-10587 Berlin, Germany ehrig@cs.tu-berlin.de Visual Modelling and
More informationSoftware Design, Modelling and Analysis in UML
Software Design, Modelling and Analysis in UML Lecture 02: Semantical Model 2013-10-23 02 2013-10-23 main Prof. Dr. Andreas Podelski, Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents
More informationA Benchmark for Ontologies Merging Assessment
A Benchmark for Ontologies Merging Assessment Mariem Mahfoudh 1, Germain Forestier 2, and Michel Hassenforder 2 1 CNRS, LORIA, UMR 7503 615 rue du Jardin Botanique, 54506 Vandœuvre-lès-Nancy, France mariem.mahfoudh@loria.fr
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationTheoretical Computer Science
Theoretical Computer Science 429 (2012) 108 117 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Forbidding and enforcing on
More informationUsing context and model categories to define directed homotopies
Using context and model categories to define directed homotopies p. 1/57 Using context and model categories to define directed homotopies Peter Bubenik Ecole Polytechnique Fédérale de Lausanne (EPFL) peter.bubenik@epfl.ch
More informationChapter 9: Elementary Graph Algorithms Basic Graph Concepts
hapter 9: Elementary Graph lgorithms asic Graph oncepts msc 250 Intro to lgorithms graph is a mathematical object that is used to model different situations objects and processes: Linked list Tree (partial
More informationTopos Theory. Lectures 3-4: Categorical preliminaries II. Olivia Caramello. Topos Theory. Olivia Caramello. Basic categorical constructions
Lectures 3-4: Categorical preliminaries II 2 / 17 Functor categories Definition Let C and D be two categories. The functor category [C,D] is the category having as objects the functors C D and as arrows
More informationHandbook of Weighted Automata
Manfred Droste Werner Kuich Heiko Vogler Editors Handbook of Weighted Automata 4.1 Springer Contents Part I Foundations Chapter 1: Semirings and Formal Power Series Manfred Droste and Werner Kuich 3 1
More informationLesson 22: Basic Graph Concepts
Lesson 22: asic Graph oncepts msc 175 iscrete Mathematics 1. Introduction graph is a mathematical object that is used to model different relations between objects and processes: Linked list Flowchart of
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
More information