@article{GolasBiermannEhrigetal.2011, author = {Golas, Ulrike and Biermann, E. and Ehrig, Hartmut and Ermel, Claudia}, title = {A Visual Interpreter Semantics for Statecharts Based on Amalgamated Graph Transformation}, series = {ECEASST}, volume = {39}, journal = {ECEASST}, pages = {1 -- 24}, year = {2011}, language = {en} } @article{GolasEhrigHermann2011, author = {Golas, Ulrike and Ehrig, Hartmut and Hermann, Frank}, title = {Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions}, series = {ECEASST}, volume = {39}, journal = {ECEASST}, pages = {1 -- 26}, year = {2011}, language = {en} } @article{GolasHoffmannEhrigetal.2011, author = {Golas, Ulrike and Hoffmann, Kathrin and Ehrig, Hartmut and Rein, A. and Padberg, J.}, title = {Functorial Analysis of Algebraic Higher-Order Net Systems with Applications to Mobile Ad-Hoc Networks}, series = {ECEASST}, volume = {40}, journal = {ECEASST}, pages = {1 -- 20}, year = {2011}, language = {en} } @inproceedings{ChabarekGolas2011, author = {Chabarek, F. and Golas, Ulrike}, title = {Interaktive Vervollst{\"a}ndigung der Szenariobasierten Spezifikation eines Parkassistenzsystems}, series = {Proceedings of GI-ASE 2011}, booktitle = {Proceedings of GI-ASE 2011}, editor = {Heiß, H.-U. and Pepper, P. and Schlingloff, H. and Schneider, J{\"o}rg}, year = {2011}, language = {en} } @article{EhrigGolasHabeletal.2012, author = {Ehrig, Hartmut and Golas, Ulrike and Habel, A. and Lambers, L. and Orejas, Fernando}, title = {M-Adhesive Transformation Systems with Nested Application Conditions. Part 2}, series = {Fundamenta Informaticae}, volume = {118}, journal = {Fundamenta Informaticae}, number = {1-2}, doi = {10.3233/FI-2012-705}, pages = {35 -- 63}, year = {2012}, language = {en} } @inproceedings{SobollGolas2012, author = {Soboll, T. and Golas, Ulrike}, title = {A Local-Global Model for Multiagent Systems - Sheaves on the Category MAS}, series = {Proceedings of ICAART 2012}, volume = {2}, booktitle = {Proceedings of ICAART 2012}, editor = {Filipe, J. and Fred, A.}, publisher = {SciTePress}, pages = {331 -- 334}, year = {2012}, language = {en} } @article{GolasLambersEhrigetal.2012, author = {Golas, Ulrike and Lambers, L. and Ehrig, Hartmut and Orejas, Fernando}, title = {Attributed Graph Transformation with Inheritance}, series = {Theoretical Computer Science}, volume = {424}, journal = {Theoretical Computer Science}, doi = {10.1016/j.tcs.2012.01.032}, pages = {46 -- 68}, year = {2012}, language = {en} } @inproceedings{Golas2012, author = {Golas, Ulrike}, title = {A General Attribution Concept for Models in M-Adhesive Transformation Systems}, series = {Proceedings of ICGT 2012}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_13}, pages = {187 -- 202}, year = {2012}, language = {en} } @inproceedings{GolasLambersEhrigetal.2012, author = {Golas, Ulrike and Lambers, L. and Ehrig, Hartmut and Giese, H.}, title = {Towards Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammars - Flexible Relations between Source and Target Elements}, series = {Proceedings of ICGT 2012}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_10}, pages = {141 -- 155}, year = {2012}, language = {en} } @inproceedings{HeckelEhrigGolasetal.2012, author = {Heckel, R. and Ehrig, Hartmut and Golas, Ulrike and Hermann, Frank}, title = {Parallelism and Concurrency of Stochastic Graph Transformations}, series = {Proceedings of ICGT 2012}, volume = {7562}, booktitle = {Proceedings of ICGT 2012}, editor = {Ehrig, Hartmut and Engels, G. and Kreowski, H.-J. and Rozenberg, G.}, publisher = {Springer}, doi = {10.1007/978-3-642-33654-6_7}, pages = {96 -- 110}, year = {2012}, language = {en} } @inproceedings{OrejasBoronatGolasetal.2013, author = {Orejas, Fernando and Boronat, Artur and Golas, Ulrike and Mylonakis, Nikos}, title = {Checking Bisimilarity for Attributed Graph Transformation}, series = {Foundations of Software Science and Computation Structures. Proceedings of FOSSACS 2013}, volume = {7794}, booktitle = {Foundations of Software Science and Computation Structures. Proceedings of FOSSACS 2013}, editor = {Pfenning, Frank}, publisher = {Springer}, doi = {10.1007/978-3-642-37075-5_8}, pages = {113 -- 128}, year = {2013}, language = {en} } @article{GolasHabelEhrig, author = {Golas, Ulrike and Habel, A. and Ehrig, Hartmut}, title = {Multi-Amalgamation of Rules with Application Conditions in M-Adhesive Categories}, series = {Mathematical Structures in Computer Science}, volume = {24}, journal = {Mathematical Structures in Computer Science}, number = {4}, doi = {10.1017/S0960129512000345}, pages = {1 -- 68}, language = {en} } @article{HermannEhrigGolasetal., author = {Hermann, Frank and Ehrig, Hartmut and Golas, Ulrike and Orejas, Fernando}, title = {Formal Analysis of Model Transformations Based on Triple Graph Grammars}, series = {Mathematical Structures in Computer Science}, volume = {24}, journal = {Mathematical Structures in Computer Science}, number = {4}, doi = {10.1017/S0960129512000370}, pages = {1 -- 57}, language = {en} } @article{EhrigGolasHabeletal., author = {Ehrig, Hartmut and Golas, Ulrike and Habel, A. and Lambers, L. and Orejas, Fernando}, title = {M-Adhesive Transformation Systems with Nested Application Conditions. Part 1: Parallelism, Concurreny and Amalgamation}, series = {Mathematical Structures in Computer Science}, volume = {24}, journal = {Mathematical Structures in Computer Science}, number = {4}, doi = {10.1017/S0960129512000357}, pages = {1 -- 48}, language = {en} } @article{GabrielBraatzEhrigetal., author = {Gabriel, Karsten and Braatz, Benjamin and Ehrig, Hartmut and Golas, Ulrike}, title = {Finitary M-Adhesive Categories}, series = {Mathematical Structures in Computer Science}, volume = {24}, journal = {Mathematical Structures in Computer Science}, number = {4}, doi = {10.1017/S0960129512000321}, pages = {1 -- 40}, language = {en} } @book{EhrigErmelGolasetal., author = {Ehrig, Hartmut and Ermel, Claudia and Golas, Ulrike and Hermann, Frank}, title = {Graph and Model Transformation}, publisher = {Springer-Verlag Berlin Heidelberg}, isbn = {978-3-662-47979-7}, doi = {10.1007/978-3-662-47980-3}, abstract = {This book is a comprehensive explanation of graph and model transformation. It contains a detailed introduction, including basic results and applications of the algebraic theory of graph transformations, and references to the historical context. Then in the main part the book contains detailed chapters on M-adhesive categories, M-adhesive transformation systems, and multi-amalgamated transformations, and model transformation based on triple graph grammars. In the final part of the book the authors examine application of the techniques in various domains, including chapters on case studies and tool support. The book will be of interest to researchers and practitioners in the areas of theoretical computer science, software engineering, concurrent and distributed systems, and visual modelling.}, language = {en} } @inproceedings{TaentzerGolas, author = {Taentzer, Gabriele and Golas, Ulrike}, title = {Towards Local Confluence Analysis for Amalgamated Graph Transformation}, series = {Graph Transformations. Proceedings of ICGT 2015}, volume = {9151}, booktitle = {Graph Transformations. Proceedings of ICGT 2015}, editor = {Parisi-Presicce, F. and Westfechtel, B.}, publisher = {Springer}, doi = {10.1007/978-3-319-21145-9_5}, pages = {69 -- 86}, abstract = {Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analysis (CPA) can be used to show local confluence of graph transformation systems. It is an open challenge to lift the CPA to amalgamated graph transformation systems, especially since infinite many pairs of amalgamated rules occur in general. As a first step towards an efficient local confluence analysis of amalgamated graph transformation systems, we show that the analysis of a finite set of critical pairs suffices to prove local confluence.}, language = {en} } @misc{Golas, author = {Golas, Ulrike}, title = {A General Attribution Concept for Models in M- adhesive Transformation Systems: Long Version}, issn = {1438-0064}, doi = {10.1007/978-3-642-33654-6_13}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-15547}, abstract = {Attributes are an important concept for modeling data in practical applications. Up to now there is no adequate way to define attributes for different kinds of models used in M-adhesive transformation systems, which are a special kind of graph transformation systems based on M-adhesive categories. Especially a proper representation and definition of attributes and their values as well as a suitable handling of the data does not fit well with other graph transformation formalisms. In this paper, we propose a new method to define attributes in a natural, but still formally precise and widely applicable way. We define a new kind of adhesive category, called W-adhesive, that can be used for transformations of attributes, while the underlying models are still M-adhesive ones. As a result, attributed models can be used as they are intended to be, but with a formal background and proven well-behavior.}, language = {en} } @misc{TaentzerGolas, author = {Taentzer, Gabriele and Golas, Ulrike}, title = {Local Confluence Analysis for Amalgamated Graph Transformation: Long Version}, issn = {1438-0064}, doi = {10.1007/978-3-319-21145-9_5}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-54943}, abstract = {Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analysis (CPA) can be used to show local confluence of graph transformation systems. It is an open challenge to lift the CPA to amalgamated graph transformation systems, especially since infinite many pairs of amalgamated rules occur in general. As a first step towards an efficient local confluence analysis of amalgamated graph transformation systems, we show that the analysis of a finite set of critical pairs suffices to prove local confluence.}, language = {en} }