% This file was created with JabRef 2.10.
% Encoding: Cp1252
@InCollection{BEU02,
Title = {{Petri Net Transformations in the Petri Net Baukasten}},
Author = {Braatz, B. and Ehrig, H. and Urbasek, M.},
Year = {2003},
Pages = {37--65},
Abstract = {The purpose of this contribution is to give an overview of constructions and results for Petri net transformations in the ``Petri Net Baukasten'' developed by the ``DFG-Forschergruppe Petrinetz-Technologie''. The two main concepts of Petri net transformations considered in this context are net class and net model transformations. Net class transformations are transformations between different Petri net classes, like elementary nets, place/transition nets and algebraic high-level nets. Net model transformations on the other hand are transformations of the net structure for nets within one Petri net class, like place or transition refinement. The main technical results are concerning the preservation of safety resp. liveness properties of net model transformations and compatibility results between net class and net model transformations.},
Crossref = {PNTVol02},
Keywords = {Petri Nets, Transformation, Petri Net Baukasten},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEU02.pdf}
}
@InCollection{BKS04,
Title = {{S}emantical {I}ntegration of {O}bject-{O}riented {V}iewpoint {S}pecification {T}echniques},
Author = {Benjamin Braatz and Markus Klein and Gunnar Schr\"oter},
Year = {2004},
Pages = {602-626},
Abstract = {Complex systems have many heterogeneous aspects, which can be specified comprehensibly and adequately by viewpoint specification techniques dealing only with a suitable subset of these aspects. A methodology for the formal integration of collections of such viewpoint specification techniques is introduced and applied to object-oriented systems. As a main result, it is shown, how the semantical consistency of viewpoint specification techniques can be checked in this framework.},
Crossref = {EDD+04},
ISBN = {ISSN 0302-9743, ISBN 3-540-23135-8},
Keywords = {Integration, Viewpoint Specifications, Consistency}
}
@InCollection{BKS+04,
Title = {{A} {F}ormal {C}omponent {C}oncept for the {S}pecification of {I}ndustrial {C}ontrol {S}ystems},
Author = {Benjamin Braatz and Markus Klein and Gunnar Schr\"oter and Matthias Bengel},
Year = {2004},
Pages = {69-88},
Abstract = {Motivated by the wide acceptance of component based technologies in software development, a component concept for software engineering is applied to modeling in the field of production automation. Taking the modeling of a holonic transport system as an example, it is shown, how function blocks in the sense of production automation can be understood as software engineering components. Thus, the advantages of component based modeling with respect to structuring, exchange and reuse can be transferred to systems in production automation.},
Crossref = {EDD+04},
ISBN = {ISSN 0302-9743, ISBN 3-540-23135-8},
Keywords = {Components, Function Blocks, Production Automation}
}
@InProceedings{CEL+95a,
Title = {An Event Structure Semantics for Graph Grammars with Parallel Productions},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Rossi, F.},
Booktitle = {5th Int.\ Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94},
Year = {1996},
Pages = {240 - 256},
Publisher = Springer,
Series = lncs,
Volume = {1073},
Crossref = {CEER96}
}
@InCollection{Ehr04d,
Title = {{Integration of Software Specification Techniques for Applications in Engineering: Introduction and Overview of Results}},
Author = {Ehrig, H.},
Year = {2004},
Crossref = {EDD+04},
Keywords = {Software Specification, Engineering, Formal Integration}
}
@InProceedings{EKL91,
Title = {Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts},
Author = {Ehrig, H. and Korff, M. and L{\"o}we, M.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Pages = {24--37},
Publisher = Springer,
Series = lncs,
Volume = {532},
Crossref = {EKR91}
}
@InCollection{WER+02,
Title = {{The Petri Net Baukasten of the DFG-Forschergruppe PETRI NET TECHNOLOGY}},
Author = {Ehrig, H. and Reisig, W. and {Weber et al.}, H.},
Year = {2003},
Crossref = {PNTVol02},
Url = {http://user.tu-berlin.de/lieske/tfs/publikationen/Papers02/WER+02.pdf}
}
@InCollection{EBE02,
Title = {{Generation of Animation Views for Petri Nets in \textsc{GenGED}}},
Author = {Ermel, C. and Bardohl, R. and Ehrig, H.},
Booktitle = {{Advances in Petri Nets: Petri Net Technology for Communication Based Systems}},
Year = {2003},
Abstract = {Formal specification techniques like Petri nets allow the formal description and analysis of systems. In this paper, we develop a formal approach for the generic specification of animation views for different Petri net classes based on GenGED and graph transformation. The GenGED approach, developed at the TU Berlin, allows the generic description of visual modeling languages such as different Petri net classes. In our framework, the animation view of a system modeled as a Petri net consists of a domain-specific layout and an animation according to the firing behavior of the Petri net class. The basic idea is to generate visual animation rules based on visual syntax rules defining the corresponding Petri net language. We propose a view transformation from the classical Petri net layout to the animation layout.},
Crossref = {PNTVol02},
Keywords = {Petri Nets, Animation, GenGED, Visual Languages, Animation View},
Url = {http://user.tu-berlin.de/lieske/tfs/publikationen/Papers02/EBE02.pdf}
}
@InCollection{ETB05,
Title = {{Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation}},
Author = {Ermel, C. and Taentzer, G. and Bardohl, R.},
Booktitle = {{Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday}},
Year = {2005},
Abstract = {The ``classical'' approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic High-Level (AHL) nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach. },
Crossref = {KMO+05},
Keywords = {parallel graph transformation, algebraic high-level nets, Petri net semantics},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/ETB05.pdf}
}
@InProceedings{Gaj99,
Title = {{The Expert View of the Petri Net Baukasten}},
Author = {M. Gajewsky},
Year = {1999},
Pages = {243--265},
Crossref = {Coll99}
}
@InProceedings{GP01,
Title = {{Transformations between Petri Net Classes with Application to Software Development}},
Author = {Gajewsky, M. and Parisi-Presicce, F.},
Year = {2001},
Pages = {105--122},
Crossref = {Coll01}
}
@InProceedings{HEGH12,
Title = {Parallelism and Concurrency of Stochastic Graph Transformations.},
Author = {Heckel, Reiko and Ehrig, Hartmut and Golas, Ulrike and Hermann, Frank},
Booktitle = {ICGT},
Year = {2012},
Editor = {Ehrig, Hartmut and Engels, Gregor and Kreowski, Hans-Jörg and Rozenberg, Grzegorz},
Pages = {96-110},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Volume = {7562},
Added-at = {2012-09-19T00:00:00.000+0200},
Biburl = {http://www.bibsonomy.org/bibtex/2f9020f15b1e856254c83765834e17f5d/dblp},
Crossref = {conf/gg/2012},
Ee = {http://dx.doi.org/10.1007/978-3-642-33654-6_7},
Timestamp = {2012-09-19T00:00:00.000+0200},
Url = {http://dblp.uni-trier.de/db/conf/gg/icgt2012.html#HeckelEGH12}
}
@InProceedings{HKT02b,
Title = {{Confluence of Typed Attributed Graph Transformation with Constraints}},
Author = {Heckel, R. and K\"uster, J. and Taentzer, G. },
Booktitle = {Proc. of 1st Int. Conference on Graph Transformation},
Year = {2002},
Editor = {Corradini, A. and Ehrig, H. and Kreowski, H.-J. and Rozenberg. G.},
Publisher = Springer,
Series = lncs,
Volume = {2505},
Crossref = {CEKR02},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/HKT02b.pdf}
}
@InCollection{Hoff02,
Title = {{Case Study Logistics: Flexible Modeling of Business using Algebraic Higher-Order nets }},
Author = {Hoffmann, K.},
Year = {2003},
Abstract = {In this paper we present a case study logistics using Algebraic Higher-Order Nets. Algebraic Higher-Order Nets are an extension of the well defined formalism of Algebraic High-Level Nets by higher-order functions leading to a more flexible modeling technique. After an introduction of Algebraic Higher-Order Nets at an informal level we present the case study logistics and demonstrate the advantage of our approach which allows a flexible modeling of business processes including exceptions and roles without changing the net structure of our nets. },
Crossref = {PNTVol02},
Keywords = {Petri Nets, Transformation, Petri Net Baukasten, Case Study},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/Hoff02.pdf}
}
@InProceedings{Kor91,
Title = {Application of Graph Grammars to Rule-Based Systems},
Author = {Korff, M.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Pages = {505--519},
Publisher = Springer,
Series = lncs,
Volume = {532},
Crossref = {EKR91}
}
@InProceedings{Pad99,
Title = {{The Petri Net Baukasten: An Application-Oriented Petri Net Technology}},
Author = {J. Padberg},
Year = {1999},
Pages = {191--209},
Crossref = {Coll99}
}
@InCollection{PK05,
Title = {Loose Semantics of {P}etri Nets},
Author = {Padberg, J. and Kreowski, H.-J.},
Year = {2005},
Pages = {370-384},
Abstract = {In this paper, we propose a new loose semantics for place/transition nets based on transition systems and generalizing the reachability graph semantics. The loose semantics of a place/transition net reflects all its possible refinements and is given as a category of transition systems with alternative sequences of events over the net. The main result states that each plain morphism between two place/transitions nets induces a free construction between the corresponding semantic categories. },
Crossref = {KMO+05},
Keywords = {loose semantics, Petri nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/PK05.pdf}
}
@InCollection{PU02,
Title = {{Rule-Based Refinement of Petri Nets: A Survey}},
Author = {Padberg, J. and Urb\'a\v{s}ek, M.},
Booktitle = {{Advances in Petri Nets: Petri Net Technology for Communication Based Systems}},
Year = {2003},
Editor = {Ehrig, H. and Reisig, W. and Rozenberg, G. and Weber, H.},
Pages = {161--196},
Abstract = {This contribution provides a thorough survey of our work on rule-based refinement. Rule-based refinement comprises the transformation of Petri nets using rules while preserving certain system properties. Petri net rules and transformations are expressed by morphisms and pushouts. This allows an abstract formulation of our notions independent of a specific Petri net class, as place/transition nets, elementary nets, predicate/transition nets etc. Hence, it is adequate to consider our approach as rule-based refinement of Petri nets in general. We have presented various results in recent years at different conferences. So this contribution gives an overview of our work in a compact form leaving out the technical details.},
Crossref = {PNTVol02},
Keywords = {Petri Nets, rule-based refinement, transformation},
Url = {http://user.tu-berlin.de/lieske/tfs/publikationen/Papers02/PU02.pdf}
}
@TechReport{Oez01,
Title = {{S}emantische {K}onsistenzanalyse von {UML} {S}equenz- und {Z}ustandsdiagrammen},
Author = {{\"O}zhan, M.},
Institution = {TU Berlin},
Year = {2001},
Number = {2001/7},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/TB.ps}
}
@MastersThesis{Ack99,
Title = {{Entwurf und Implementierung eines Frameworks f{\"u}r verteilte Objektsysteme mit Anwendung auf einen Interpreter f{\"u}r verteilte Graphtransformation}},
Author = {Ackermann, K.},
School = {TU Berlin, FB 13},
Year = {1999}
}
@Article{AEH+99,
Title = {Graph Transformation for Specification and Programming},
Author = {Andries, M. and Engels, G. and A. Habel and B. Hoffmann and H.-J. Kreowski and S. Kuske and D. Plump and A. Sch{\"u}rr and G. Taentzer},
Journal = {Science of Computer Programming},
Year = {1999},
Pages = {1--54},
Volume = {34}
}
@TechReport{AEH+96,
Title = {Graph Transformation for Specification and Programming},
Author = {M. Andries and G. Engels and A. Habel and B. Hoffmann and H.-J. Kreowski and S. Kuske and D. Plump and A. Sch{\"u}rr and G. Taentzer},
Institution = {University of Bremen},
Year = {1996},
Number = {7/96}
}
@InProceedings{ABJ+10,
Title = {{Henshin}: Advanced Concepts and Tools for In-Place {EMF} Model Transformations},
Author = {Arendt, T. and Biermann, E. and Jurack, S. and Krause, C. and Taentzer, G.},
Booktitle = {Proc. of the ACM/IEEE 13th Intern. Conf. on Model Driven Engineering Languages and Systems (MoDELS'10)},
Year = {2010},
Editor = {Petriu, D. and Rouquette, N. and Haugen, O.},
Pages = {121--135},
Series = lncs,
Volume = {6394},
Abstract = {The Eclipse Modeling Framework (EMF) provides modeling and code generation facilities for Java applications based on structured data models. Henshin is a new language and associated tool set for in-place transformations of EMF models. The Henshin transformation language uses pattern-based rules on the lowest level, which can be structured into nested transformation units with well-defined operational semantics. So-called amalgamation units are a special type of transformation units that provide a forall-operator for pattern replacement. For all of these concepts, Henshin offers a visual syntax, sophisticated editing functionalities, execution and analysis tools. The Henshin transformation language has its roots in attributed graph transformations, which offer a formal foundation for validation of EMF model transformations. The transformation concepts are demonstrated using two case studies: EMF model refactoring and meta-model evolution.},
ISBN = {ISBN 978-3-642-16128-5},
Owner = {Claudia},
Url = {http://www.springerlink.com/content/qrlj332wxhn01227/}
}
@MastersThesis{Arl90,
Title = {Effiziente {K}onstruktion von {R}egelans"atzen f"ur algebraische {G}raphersetzung: {K}onzeption und {I}mplementierung},
Author = {Arlt, R.},
School = FB13,
Year = {1990}
}
@TechReport{AR89,
Title = {Grundlegende {D}atenstrukturen und {A}lgorithmen zur {I}mplementierung von algebraischen {G}raph {G}rammatiken},
Author = {Arlt, R. and R{\"o}der, M.},
Institution = {Technische Universit\"at Berlin},
Year = {1989},
Type = {Studienarbeit, FB Informatik}
}
@InProceedings{BEHL87,
Title = {Towards distributed graph grammars},
Author = {B{\"o}hm, P. and Ehrig, H. and Hummert, U. and L{\"o}we, M.},
Booktitle = {3rd Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1987},
Address = {Berlin},
Editor = {Ehrig, H. and Nagl, M. and Rozenberg, G. and Rosenfeld, A.},
Pages = {86--98},
Publisher = Springer,
Series = lncs,
Volume = {291}
}
@Article{BFH87,
Title = {Amalgamation of graph transformations: a synchronization mechanism},
Author = {B{\"o}hm, P. and Fonio, H.-R. and Habel, A.},
Journal = {Computer and System Sciences (JCSS)},
Year = {1987},
Pages = {377--408},
Volume = {34}
}
@TechReport{BDGGK96,
Title = {{\mbox{$\mu\!{\cal S\!Z}$}} -- {E}in {A}nsatz zur systematischen {V}erbindung von {Z} und {S}tatecharts},
Author = {Robert B{\"u}ssow and Heiko D{\"o}rr and Robert Geisler and Wolfgang Grieskamp and Marcus Klar},
Institution = {Technische Universit{\"a}t Berlin},
Year = {1996},
Month = feb,
Number = {96-32}
}
@Misc{Bal90,
Title = {{Constraints and their Normal Forms in the Framework of Specification Logics (in German)}},
Author = {Baldamus, M.},
HowPublished = {Studienarbeit (TU Berlin)},
Year = {1990}
}
@InProceedings{BCEH01,
Title = {{Compositional Modeling of Reactive Systems Using Open Nets}},
Author = {Baldan, P. and Corradini, A. and Ehrig, H. and Heckel, R.},
Booktitle = {Proc. of CONCUR 2001},
Year = {2001},
Editor = {Larsen, K. G. and Nielse, M.},
Pages = {502-518},
Publisher = Springer,
Series = lncs,
Volume = {2154}
}
@Article{BCEH05,
Title = {{Compositional Semantics of Open Petri Nets based on Deterministic processes}},
Author = {Baldan, P. and Corradini, A. and Ehrig, H. and Heckel, R.},
Journal = {MSCS},
Year = {2005},
Number = {1},
Pages = {1--35},
Volume = {15},
Abstract = { In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designated as open, represent an interface of the system towards the environment. Besides generalizing the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisig process semantics of Petri nets. We introduce a composition operation over open nets, characterized as a pushout in the corresponding category, suitable to model both interaction through open places and synchronization of transitions. The deterministic process semantics is shown to be compositional with respect to such composition operation. If a net Z3 results as the composition of two nets Z1 and Z2, having a common subnet Z0, then any two deterministic processes of Z1 and Z2 which ``agree'' on the common part, can be ``amalgamated'' to produce a deterministic process of Z3. Vice versa, any deterministic process of Z3 can be decomposed into processes of the component nets. The amalgamation and decomposition operations are shown to be inverse to each other, leading to a bijective correspondence between the deterministic processes of Z3 and pair of deterministic processes of Z1 and Z2 which agree on the common subnet Z0. Technically, our result is similar to the amalgamation theorem for data-types in the framework of algebraic specification. A possible application field of the proposed constructions and results is the modeling of interorganizational workflows, recently studied in the literature. This is illustrated by a running example. },
Keywords = {compositional semantics, open Petri nets, deterministic processes},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/BCEH05.pdf}
}
@InProceedings{BCEK08,
Title = {{Open Petri Nets: Non-deterministic Processes and Compositionality}},
Author = {Baldan, P. and Corradini, A. and Ehrig, H. and K\"onig, B.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = { We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interface. The interface towards the external environment of a ranked open net is given by a subset of places designated as open and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the non-deterministic process semantics is compositional with respect to the composition operation over ranked open nets, a result which did not hold for basic open nets.},
Keywords = {graph transformation, DPO, behavior preservation, model refactoring, borrowed context},
Location = {Leicester, UK},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/BCEK08.pdf}
}
@InCollection{BCM+99,
Title = {{Concurrent Semantics of Algebraic Graph Transformations}},
Author = {Baldan, P. and Corradini, A. and Montanari, U. and Rossi, F. and Ehrig, H. and L\"owe, M.},
Booktitle = {The Handbook of Graph Grammars and Computing by Graph Transformations, Volume 3: Concurrency, Parallelism and Distribution},
Publisher = {World Scientific},
Year = {1999},
Editor = {Rozenberg, G.},
Pages = {107--188}
}
@InProceedings{BEK06,
Title = {{Composition and Decomposition of {DPO} Transformations with Borrowed Context}},
Author = {Baldan, P. and Ehrig, H. and K\"onig, B.},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Year = {2006},
Address = {Natal, Brazil},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Month = {September},
Pages = {153--167},
Publisher = Springer,
Series = lncs,
Volume = {4178},
Abstract = {Double-pushout (DPO) transformations with borrowed context extend the standard DPO approach by allowing part of the graph needed in a transformation to be borrowed from the environment. The bisimilarity based on the observation of borrowed contexts is a congruence, thus facilitating system analysis. In this paper, focusing on the situation in which the states of a global system are built out of local components, we show that DPO transformations with borrowed context defined on a global system state can be decomposed into corresponding transformations on the local states and vice versa. Such composition and decomposition theorems, developed in the framework of adhesive categories, can be seen as a first step towards an inductive definition, in sos style, of the labelled transition system associated to a graph transformation system. As a special case we show how an ordinary DPO transformation on a global system state can be decomposed into local DPO transformations with borrowed context using the same production. },
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2},
Keywords = {graph transformation, composition decomposition, DPO approach},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/BEK06.pdf}
}
@TechReport{BEK06a,
Title = {{Composition and Decomposition of DPO Transformations with Borrowed Context}},
Author = {Baldan, P. and Ehrig, H. and K\"onig, B.},
Institution = {Universit\"at Duisburg-Essen, Abt. Informatik und Angewandte Kognitionswissenschaften},
Year = {2006},
Number = {2006-01},
Abstract = {Double-pushout (DPO) transformations with borrowed context extend the standard DPO approach by allowing part of the graph needed in a transformation to be borrowed from the environment. The bisimilarity based on the observation of borrowed contexts is a congruence, thus facilitating system analysis. In this paper, focusing on the situation in which the states of a global system are built out of local components, we show that DPO transformations with borrowed context defined on a global system state can be decomposed into corresponding transformations on the local states and vice versa. Such composition and decomposition theorems, developed in the framework of adhesive categories, can be seen as a first step towards an inductive definition, in sos style, of the labelled transition system associated to a graph transformation system. As a special case we show how an ordinary DPO transformation on a global system state can be decomposed into local DPO transformations with borrowed context using the same production. },
Keywords = {graph transformation, composition decomposition, DPO approach},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/BEK06a.pdf}
}
@InProceedings{BBC+96,
Title = {{GRAPHIT:} {G}raphical {S}upport and {I}ntegration of {F}ormal and {S}emiformal {M}ethods for {S}oftware {S}pecification and {D}evelopment},
Author = {Bardohl, B. and Bardohl, R. and Castro, P. and Ehrig, H. and Heckel, R. and Ribeiro, R. and Nunes, D. and Martini, A.},
Booktitle = {Proc. of the 3rd German-Brazilian Workshop on Information Technology, Berlin, December, 14th-15th 1995},
Year = {1996},
Editor = {St. J{\"a}hnichen, C. Lucena},
Publisher = {Forschungszentrum J{\"u}lich GmbH, Bilateral Seminars of the International Bureau, Volume 26}
}
@InProceedings{BBC+93,
Title = {{GRAPHIT:} {G}raphical {S}upport and {I}ntegration of {F}ormal and {S}emiformal {M}ethods for {S}oftware {S}pecification and {D}evelopment},
Author = {Bardohl, B. and Bardohl, R. and Castro, P. and Ehrig, H. and Korff, M. and Padberg, J. and Ribeiro, R. and Nunes, D. and Martins, J. and Martini, A.},
Booktitle = {Proc. of the Workshop on Information Technology: Cooperative Research with Industrial Partners between Germany and Brazil},
Year = {1993},
Publisher = {PUC/Rio Press}
}
@Article{Bar02,
Title = {{A Visual Environment for Visual Languages}},
Author = {Bardohl, R.},
Journal = {Science of Computer Programming (SCP)},
Year = {2002},
Number = {2},
Pages = {181--203},
Volume = {44},
ISSN = {PII: S0167-6423(02)00035-7},
Keywords = { Graph Transformation, Visual Modeling, GenGED}
}
@Book{Bar00,
Title = {{\textsc{GenGEd} -- Visual Definition of Visual Languages based on Algebraic Graph Transformation}},
Author = {Bardohl,R.},
Publisher = {Verlag Dr. Kovac},
Year = {2000},
Note = {PhD thesis, Technical University of Berlin, Dept. of Computer Science, 1999}
}
@PhdThesis{Bar99,
Title = {\textsc{GenGEd} -- Visual Definition of Visual Languages based on Algebraic Graph Transformation},
Author = {Bardohl, R.},
School = {Technical University Berlin, Dept. of Computer Science},
Year = {1999},
Note = {Verlag Dr. Kovac}
}
@InProceedings{Bar99a,
Title = {{\textsc{GenGEd} -- A Generator for VL-Editors based on Algebraic Graph Transformation and Graphical Constraint Solving}},
Author = {Bardohl, R.},
Booktitle = {Proc. Application of Graph Transformations with Industrial Relevance, Subarea Meeting on Tools},
Year = {1999},
Publisher = {RWTH Aachen},
Editors = {M.Nagl and A.Sch{\"u}rr}
}
@InProceedings{Bar98,
Title = {\textsc{GenGEd} - {A} {G}eneric {G}raphical {E}ditor for {V}isual {L}anguages based on {A}lgebraic {G}raph {G}rammars},
Author = {Bardohl,R.},
Booktitle = {Proc. IEEE Symposium on Visual Languages (VL'98)},
Year = {1998},
Pages = {48-55}
}
@TechReport{Bar97,
Title = {Application of Graph Transformation to Visual Languages},
Author = {R. Bardohl},
Institution = {Technische Unversit\"at Berlin},
Year = {1997},
Number = {10/97}
}
@TechReport{Bar96,
Title = {{GVT} - {U}ser's {M}anual},
Author = {Bardohl, R.},
Institution = {TU Berlin},
Year = {1996},
Month = {March},
Note = {available via ftp: /pub/local/tfs/papers/GVT.ps.gz},
Number = {96-11},
Type = {Technical Report},
Abstract = {Graphical support for prototyping of algebraic specifications is provided with suitable concepts to visualize term structures. These concepts are the foundations for the development of the graphical description language GVT (Graphical Visualization of Terms) and the GVT system which allows the visualization of terms over algebraic specifications. Using these concepts, prototyping tools in existing specification systems, based on term rewriting and narrowing techniques can be provided with graphical output. Within this paper the concepts of the GVT language are introduced as well as the concrete language means. The usage of the system is explained in connection with the ACT environment as underlying specification system. Suplementary some implementation details are given which may support the adaption of the GVT system to other algebraic specification systems.}
}
@MastersThesis{Bar93,
Title = {Konzept und {Implementierung der Sprache GVT zur graphischen Visualisierung von Termen algebraicher Spezifikationen}},
Author = {Bardohl, R.},
School = {TU Berlin},
Year = {1993}
}
@InProceedings{BC94,
Title = {Graphical Support for Prototyping of Algebraic Specifications},
Author = {{Bardohl},R. and {Cla\ss{}en},I.},
Booktitle = {Proc. IFIP-World Congress \& GI Fachgespr{\"a}che ``Integration of Semiformal and Formal Methods in Software Engineering''},
Year = {1994},
Abstract = {Graphical support for prototyping of algebraic specifications is provided by means of suitable concepts to visualize term structures. Using these concepts, prototyping tools in existing specification systems, based on term rewriting and narrowing techniques can be provided with graphical output.}
}
@InProceedings{BE00,
Title = {{Conceptual Model of the Graphical Editor \textsc{GenGEd} for the Visual Definition of Visual Languages}},
Author = {Bardohl, R. and Ehrig, H.},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Editor = {Ehrig, H. and Engels,G. and Kreowski, H.-J. and Rozenberg, G.},
Pages = {252--266},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{BE98,
Title = {Conceptual {M}odel of the {G}raphical {E}ditor \textsc{GenGEd}},
Author = {Bardohl,R. and Ehrig,H.},
Booktitle = {Proc. \ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Address = {Paderborn, Germany},
Month = {November},
Optnumber = {tr-ri-98-21}
}
@InProceedings{BEE00,
Title = {{Generic Description, Behavior and Animation of Visual Modeling Languages}},
Author = {Bardohl,R. and Ehrig,H. and Ermel,C.},
Booktitle = {Proc. Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Address = {Dallas (Texas), USA},
Month = {June},
Key = {BEE00}
}
@TechReport{BEL+03,
Title = {{Node Type Inheritance Concepts for Typed Graph Transformation}},
Author = {Bardohl,R. and Ehrig,H. and de Lara,J. and Runge,O. and Taentzer,G. and Weinhold,I.},
Institution = {Technical University Berlin, Dept. of Computer Science},
Year = {2003},
Month = {November},
Number = {2003--19},
Abstract = {Visual languages play a central role in modelling various system aspects. Besides standard languages like UML, a variety of domain-specific languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on visual language specifications. To define a visualanguage, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional language properties. Defining a visual language by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the language grammar. In this report, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for language definition and model manipulation. Two concrete approaches, the GenGED and the AToM3 approach, illustrate how visual languages can be defined and models can be manipulated by the techniques described above.},
ISSN = {ISSN 1436-9915},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_19.pdf}
}
@InProceedings{BELT04,
Title = {{Integrating Meta Modelling with Graph Transformation for Efficient Visual Language Definition and Model Manipulation}},
Author = {Bardohl, R. and Ehrig, H. and de Lara, J. and Taentzer, G.},
Booktitle = {Proc. Fundamental Aspects of Software Engineering 2004},
Year = {2004},
Editor = {Wermelinger, M. and Margaria-Steffens, T.},
Publisher = Springer,
Series = lncs,
Volume = {2984},
Abstract = {Visual languages (VLs) play a central role in modelling various system aspects. Besides standard languages like UML, a variety of domain-specific languages exist which are the more used the more tool support is available for them. Different kinds of generators have been developed which produce visual modelling environments based on VL specifications. To define a VL, declarative as well as constructive approaches are used. The meta modelling approach is a declarative one where classes of symbols and relations are defined and associated to each other. Constraints describe additional language properties. Defining a VL by a graph grammar, the constructive way is followed where graphs describe the abstract syntax of models and graph rules formulate the language grammar. In this paper, we extend algebraic graph grammars by a node type inheritance concept which opens up the possibility to integrate both approaches by identifying symbol classes with node types and associations with edge types of some graph class. In this way, declarative as well as constructive elements may be used for language definition and model manipulation. Two concrete approaches, the GenGED and the AToM3 approach, illustrate how VLs can be defined and models can be manipulated by the techniques described above. },
Keywords = {visual languages, graph transformation}
}
@InProceedings{BEE+02,
Title = {{\textsc{GenGEd} -- Specifying Visual Environments based on Visual Languages}},
Author = {Bardohl, R. and Ehrig, K. and Ermel, C. and Qemali, A. and Weinhold, I.},
Booktitle = {Proc. of APPLIGRAPH Workshop on Applied Graph Transformation (AGT 2002)},
Year = {2002},
Editor = {Kreowski, H.-J.},
Pages = {71--82},
Keywords = {Graph Transformation, Visual Modeling, GenGED},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/AGT02.pdf}
}
@InProceedings{BE01a,
Title = {{Visual Specification and Parsing of a Statechart Variant using \textsc{GenGEd}}},
Author = {Bardohl,R. and Ermel,C.},
Booktitle = {Statechart Modeling Contest at IEEE Symposium on Visual Languages and Formal Methods (VLFM'01)},
Year = {2001},
Address = {Stresa, Italy},
Month = {September 5--7},
Url = {http://www2.informatik.uni-erlangen.de/VLFM01/Statecharts/}
}
@TechReport{BEE01,
Title = {{Generic Description of Syntax, Behavior and Animation of Visual Models}},
Author = {Bardohl, R. and Ermel, C. and Ehrig, H.},
Institution = {Technische Universit\"at Berlin},
Year = {2001},
Number = {2001/19},
ISSN = {ISSN 1436-9915},
Keywords = {Visual Modeling, Graph Transformation, Petri Nets, Simulation, Animation},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/TR-2001-19.ps.gz}
}
@InProceedings{BEP02b,
Title = {{Transforming Specification Architectures by \textsc{GenGED}}},
Author = {Bardohl, R. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. First Int. Conference on Graph Transformation (ICGT'02)},
Year = {2002},
Address = {Barcelona, Spain},
Editor = {Corradini, A. and Ehrig, H. and Kreowski, H.-J. and Rozenberg, G.},
Month = {October},
Pages = {30-44},
Publisher = Springer,
Series = lncs,
Volume = {2505},
Abstract = {This contribution concerns transformations of specification architectures which are diagrams of sub-specifications. The graph of a diagram presents the architecture: the nodes correspond to the sub-specifications and the edges to specification morphisms. We do not fix a specific visual specification technique, so this approach is in the tradition of high-level replacement systems. We discuss how to transform such specification architectures and distinguish local and global changes. The main emphasis of this contribution is the specification and transformation of specification architectures using \GenGEDp. In GenGED, a visual language (VL) is defined by a visual alphabet and a visual syntax grammar. We define a VL for specification architectures by composing VLs for graphs and for P/T nets enhanced by Petri net morphisms. From this VL definition a syntax-directed editor is generated supporting the editing of consistent specification architectures. Local and global changes of a specific specification architecture then can easily be defined as transformation rules in our VL and visualized in the GenGED environment. },
ISSN = {ISSN 0302-9743, ISBN 3-540-44310-X},
Keywords = {Graph Transformation, GenGED, Petri nets, Architecture Description},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEP02b.pdf}
}
@InProceedings{BEP02a,
Title = {{Formal Relationship between Petri Nets and Graph Grammars as Basis for Animation Views in GenGED}},
Author = {Bardohl, R. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. IDPT 2002: Sixth World Conference on Integrated Design and Process Technology},
Year = {2002},
Publisher = {Society for Design and Process Science (SDPS)},
Keywords = {Graph Transformation, Petri Nets, Semantical Compatibility, Visual Modeling, Animation View, GenGED},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEP02a.pdf}
}
@InProceedings{BER00a,
Title = {Towards {V}isual {S}pecification and {A}nimation of {P}etri {N}et {B}ased {M}odels},
Author = {Bardohl,R. and Ermel,C. and Ribeiro,L.},
Booktitle = {Proc. GRATRA 2000 - Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems},
Year = {2000},
Month = {March},
Pages = {22--31},
Publisher = {Technische Universit{\"a}t Berlin},
Key = {BER00a}
}
@InProceedings{BER00b,
Title = {A {M}odular {A}pproch to {A}nimation of {S}imulation {M}odels},
Author = {Bardohl,R. and Ermel,C. and Ribeiro,L.},
Booktitle = {Proc. 14$^{th}$ Brazilian Symposium on Software Engineering},
Year = {2000},
Address = {Joao Pessoa, Brazil},
Month = {October},
Key = {BER00b}
}
@InProceedings{BEW02b,
Title = {{\textsc{Agg} and \textsc{GenGED}: Graph Transformation-Based Analysis Techniques for Efficient Visual Language Validation}},
Author = {Bardohl, R. and Ermel, C. and Weinhold, I.},
Booktitle = {Proc. Graph Transformation-Based Tools (GraBaTs'02), Satellite Event of ICGT'02},
Year = {2002},
Address = {Barcelona, Spain},
Editor = {Mens, T. and Sch{\"u}rr, A. and Taentzer, G.},
Month = {October},
Pages = {120-130},
Abstract = {GenGED supports the visual specification of visual languages (VLs), each specification configures the specific VL environment. The main component available in a VL environment is an editor providing either syntax-directed or free-hand editing. In the latter case, a user-defined diagram has to be analyzed according to a parse grammar. The structure of such a parse grammar is given as a Layered Graph Grammar (LGG) that is realized by the integrated Agg system for the transformation of diagrams' abstract syntax. As we show in this paper, LGGs increase the expressiveness of VL specifications and guarantee termination of the parsing process. Moreover, in order to make parsing efficient, critical pair analysis is implemented by Agg. The parsing process is explained along the specification of a variant of the well-known statechart language.},
ISSN = {ISBN: 0444513124},
Keywords = {Graph Transformation, Tool, Visual Languages, AGG, GenGED},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEW02.pdf}
}
@InProceedings{BEW03,
Title = {{GenGED - A Visual Definition Tool for Visual Modeling Environments}},
Author = {Bardohl, R. and Ermel, C. and Weinhold, I. },
Booktitle = {Proc. Application of Graph Transformations with Industrial Relevance (AGTIVE'03)},
Year = {2004},
Address = {Charlottesville/Virgina, USA},
Editor = {Pfaltz, J. and Nagl, M.},
Publisher = Springer,
Series = lncs,
Volume = {3062},
Abstract = {In this paper, we present the current version of GenGED allowing the visual definition and generation of visual modeling environments including editors, parsers, and simulators. All kinds of manipulations are based on algebraic graph transformation and graphical constraint solving techniques. XML-based storing facilities offer the basis for further processing by external tools, e.g. model checkers.},
Keywords = {Graph Transformation, Visual Modeling Environment, Visual Languages},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers03/BEW03.pdf}
}
@TechReport{BEW02,
Title = {{Specification and Analysis Techniques for Visual Languages with \textsc{GenGED}}},
Author = {Bardohl,R. and Ermel,C. and Weinhold,I.},
Institution = {Technical University Berlin, Dept. of Computer Science},
Year = {2002},
Month = {September},
Number = {2002--13},
ISSN = {ISSN 1436-9915},
Keywords = {Graph Transformation, Tool, Visual Languages, Analysis, GenGED},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2002/TR_02_13.ps.gz}
}
@InProceedings{BGS02,
Title = {{Interactive Rule-based Specification with an Application to Visual Language Definition}},
Author = {Bardohl, R. and Gro{\ss{}}e-Rhode,M. and Simeoni,M.},
Booktitle = {Recent Trends in Algebraic Development Techniques (Proc. Int. Workshop on Algebraic Development Techniques WADT'01)},
Year = {2002},
Pages = {1--20},
Publisher = Springer,
Series = lncs,
Volume = {2267},
Editors = {Cerioli, M. and Reggio, G.}
}
@InProceedings{BGS01,
Title = {{Interactive Rule-based Specification with an Application to Visual Language Definition}},
Author = {Bardohl, R. and Gro{\ss{}}e-Rhode,M. and Simeoni,M.},
Booktitle = {Proc. Int. Workshop on Algebraic Development Techniques (WADT'01)},
Year = {2001},
Month = {April},
Pages = {3--4},
Keywords = {Algebraic Specification, Graph Transformation, Visual Modeling},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers01/BGS01.pdf}
}
@InProceedings{BK98,
Title = {Specifying a {G}raph {G}rammer {E}ditor for {R}eactive {S}ystems},
Author = {Bardohl,R. and Korff-Ribeiro,L.},
Booktitle = {Proc. Workshop Brasileiro de Metodos Formais},
Year = {1998},
Address = {Porto Alegre, Brazil},
Month = {October}
}
@InProceedings{BNS00,
Title = {\textsc{GenGEd} -- {A} {D}evelopment {E}nvironment for {V}isual {L}anguages},
Author = {Bardohl, R. and Niemann,M. and Schwarze,M.},
Booktitle = {Int.\ Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE'99)},
Year = {2000},
Pages = {233--240},
Publisher = Springer,
Series = lncs,
Volume = {1779}
}
@InProceedings{BNS99,
Title = {\textsc{GenGEd} -- {A} {D}evelopment {E}nvironment for {V}isual {L}anguages},
Author = {Bardohl, R. and Niemann,M. and Schwarze,M.},
Booktitle = {Proc. Application of Graph Transformations with Industrial Relevance},
Year = {1999},
Publisher = {RWTH Aachen},
Editors = {M.Nagl and A.Sch{\"u}rr}
}
@InProceedings{BR01a,
Title = {{Towards a Compositional Approach to Define Graphical Animation of Software Applications}},
Author = {Bardohl,R. and Ribeiro,L.},
Booktitle = {Proc. Symposium on Visual Languages and Formal Methods (VLFM'01)},
Year = {2001},
Address = {Stresa, Italy},
Month = {September 5--7},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers01/BR01a.pdf}
}
@InProceedings{BST01,
Title = {{Visual Language Parsing in \textsc{GenGEd}}},
Author = {Bardohl, R. and Schultzke,T. and Taentzer, G.},
Booktitle = { Proc. 2nd International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'01)},
Year = {2001},
Address = {Crete, Greece},
Editor = {Luciano Baresi, Mauro Pezze and Gabriele Taentzer},
Month = {June 12--13},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {50 (3)},
Keywords = {Visual Modeling, Graph Transformation, Parsing Animation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers01/BST01.pdf}
}
@InProceedings{BT97,
Title = {{Defining Visual Languages by Algebraic Specification Techniques and Graph Grammars}},
Author = {R. Bardohl and G. Taentzer},
Booktitle = {Proc. of Theorie of Visual Languages'97},
Year = {1997},
Pages = {27--42}
}
@InProceedings{BTMS98,
Title = {Application of {G}raph {T}ransformation to {V}isual {L}anguages},
Author = {Bardohl,R. and Taentzer,G. and Minas,M. and Sch{\"u}rr,A.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools},
Year = {1999},
Editor = {Ehrig, H. and Engels, G. and Kreowski, H.-J. and Rozenberg, G.},
Publisher = {World Scientific}
}
@Article{BDE+07,
Title = {{M}odel {T}ransformations {S}hould be {F}unctors},
Author = {Batory, D. and Diaz, O. and Ehrig, H. and Ermel, C. and Prange, U. and Taentzer, G.},
Journal = BEATCS,
Year = {2007},
Pages = {75--81},
Volume = {92},
Abstract = {The concept of model transformations is of increasing importance in different areas of Computer Science, but up to now, there is a lack of common understanding concerning the mathematical and practical point of view. In this paper, we discuss some of the different aspects. Especially interesting is the new proposal of the POPLï¿½07 keynote speaker Don Batory claiming that model transformations should be functors. This claim is compared with different mathematical concepts of model transformation.},
ISBN = {ISSN 0252-9742},
Keywords = {model transformation, category theory},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@Unpublished{Bat99,
Title = {{Modularisierungskonzepte f{\"u}r Petrinetze}},
Author = {Battke, A.},
Note = {{Interner Bericht}},
Year = {1999}
}
@Conference{BJP91,
Title = {PAPETRI : Environment for the Analysis of PETRI nets},
Author = {Berthelot, G. and Johnen, C. and Petrucci, L.},
Booktitle = {Computer-Aided Verfication},
Year = {1991},
Editor = {Clarke, E. M. and Kushan, R. P.},
Publisher = Springer,
Series = lncs,
Volume = {531}
}
@InCollection{Bet94,
Title = {Specifying Communication Based Systems with Algebraic Attributed Graph Transformation},
Author = {Betschko, R.},
Booktitle = {Contributions to the {Q}uality of {C}ommunication-{B}ased {S}ystems --- {B}erichte zum {K}olloquium des {G}raduiertenkollegs},
Publisher = TUB,
Year = {1994},
Editor = {G. Hommel},
Note = {Technical Report 94-27},
Key = {Bet94}
}
@Unpublished{Bet94a,
Title = {Supporting the Software Development Process with Algebriac Graph Transformations},
Author = {Betschko, R.},
Note = {extended abstract for 5. int. workshop on graph transformations in Williamsburg, Virginia, USA},
Year = {1994},
Key = {Bet94a}
}
@MastersThesis{Bet92,
Title = {Parallele {G}raphgrammatiken mit {S}ynchronisation},
Author = {Betschko, R.},
School = FB13,
Year = {1992},
Type = {Studienarbeit}
}
@Manual{Bey93,
Title = {{AGG An Algebraic Graph System, User Manual}},
Author = {Beyer, M.},
Organization = {Technical University of Berlin, Department of Computer Science},
Year = {1993}
}
@Manual{Bey92,
Title = {{AGG}1.0 - Tutorial},
Author = {Beyer, M.},
Organization = {Technical University of Berlin, Department of Computer Science},
Year = {1992}
}
@MastersThesis{Bey91,
Title = {{GAG: Ein graphischer Editor f{\"u}r algebraische Graphgrammatiksysteme}},
Author = {Beyer, M.},
School = FB13,
Year = {1991}
}
@Booklet{BEL92a,
Title = {Computing by Graph Transformation ({COMPUGRAPH}): Survey, Results, and Applications},
Author = {Beyer, M. and Ehrig, H. and L{\"o}we(eds.), M.},
HowPublished = {Booklet for the presentation of ESPRIT BRWG No. 3299 (COMPUGRAPH) at CeBIT'92 in Hannover},
Year = {1992}
}
@Article{Bie11,
Title = {{Confluence analysis of consistent EMF transformations}},
Author = {Biermann, Enrico},
Journal = {ECEASST},
Year = {2011},
Volume = {38},
Abstract = {Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. For the analysis of model transformations, graph transformation techniques provide a formal basis and tool support. In this paper we aim to make use of those techniques by providing a formal foundation of consistent EMF transformations to analyze critical pairs between EMF transformation rules as well as extending the notion of confluence to EMF transformation systems. The analysis is also demonstrated on a small example simulating the firing behavior of elementary Petri nets.},
Booktitle = {Proceedings of the Fifth International Conference on Graph Transformation - Doctoral Symposium (ICGT-DS 2010)},
Editor = {Andrea Corradini},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, EMF, graph transformation, critical pairs, confluence analysis},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{BCE+07,
Title = {{Extending GMF: Generating Domain-Specific Model Editors with Complex Editing Commands}},
Author = {Biermann, E. and Crema, A. and Ehrig, K. and Ermel, C. and K\"ohler, C. and Schmutzler, R. and Taentzer, G.},
Booktitle = {Proc. Eclipse Summit Europe 2007 },
Year = {2007},
Address = {Ludwigsburg, Germany},
Month = {October},
Abstract = {GMF-generated editors offer basic editing commands to create, edit, move and delete single model elements (basic editing). Graph transformation-based editors (see e.g. Tiger) show that the generation of editors with complex editing commands is also possible. Editing e.g. activity diagrams, there might be editing commands available which insert or delete a complete decision structure in one step. In this paper, we describe how meta model-based editor design and generation performed by GMF [3], can be extended by graph transformation concepts to define and generate complex editing commands to be used in GMF-generated visual editors. },
Keywords = {Eclipse, GMF, complex editing commands, graph transformation, EMF transformation},
Url = {http://www.eclipsecon.org/summiteurope2007/presentations/ESE2007_Model-Biermann-ExtendingGMF.pdf}
}
@InCollection{BEE+10,
Title = {Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation},
Author = {Biermann, E. and Ehrig, H. and Ermel, C. and Golas, U. and Taentzer, G.},
Booktitle = {Graph Transformations and Model-Driven Engineering. Essays Dedicated to Manfred Nagl},
Publisher = Springer,
Year = {2010},
Editor = {Engels, G. and Lewerentz, C. and Sch\"afer, W. and Sch\"urr, A. and Westfechtel, B.},
Pages = {121--140},
Series = lncs,
Volume = {5765},
Abstract = {The theory of algebraic graph transformation has proven to be a suitable underlying formal framework to reason about the behavior of model transformations. In order to model an arbitrary number of actions at different places in the same model, the concept of amalgamated graph transformation has been proposed. Rule applications of certain regularity are described by a rule scheme which contains multirules modeling elementary actions and a common kernel rule for their synchronization (amalgamation). The amalgamation theorem by B{\"o}hm et al. ensures that for two multi-rules, the application of the amalgamated rule yields the same result as two iterative rule applications, respecting their common kernel rule application. In this paper, we propose an extension of the amalgamation theorem to an arbitrary finite number of synchronous rule applications. The theorem is used to show parallel independence of amalgamated graph transformations by analyzing the underlying multi-rules. As example, we specify an excerpt of a model transformation from Business Process Models (BPM) to the Business Process Execution Language (BPEL).},
ISBN = {ISSN 0302-9743},
Owner = {Claudia},
Timestamp = {2010.06.18},
Url = {http://www.springerlink.com/content/q7t7463205128n75/}
}
@InProceedings{BEE+09,
Title = {{Modeling Multicasting in Dynamic Communication-based Systems by Reconfigurable High-level Petri Nets}},
Author = {Enrico Biermann and Hartmut Ehrig and Claudia Ermel and Kathrin Hoffmann and Tony Modica},
Booktitle = {IEEE Symposium on Visual Languages and Human-Centric Computing, VL/HCC 2009, Corvallis, OR, USA, 20-24 September 2009, Proceedings},
Year = {2009},
Pages = {47-50},
Publisher = {IEEE},
Abstract = {In mobile and adaptive communication systems, communicating entities (actors) can transmit content (via channels), which is contextually interpreted. Actors may join, move in or leave so-called communication spaces, where the actors' preferences, access rights and roles are respected and define a temporary set of communicating partners and a context of interpretation for communicated data. An adequate modeling technique for such dynamic
communication-based systems (DCS) should take into account the changing communication relations between DCS actors.
Conventional modeling techniques for communicationbased systems like Petri nets or UML are restricted to model communication based on a static, immutable network topology.
In our research project ï¿½Formal modeling and analysis of flexible processes in mobile ad-hoc networksï¿½, we have proposed an appropriate integration of Petri nets and Petri net transformation rules, based on graph transformation (reconfigurable Petri nets).
In this paper, we extend this previous work on reconfigurable Petri nets on the one hand by marking-changing Petri net transformations, and on the other hand by a technique parallelizing the application of net transformation rules at several matches at once. Both extensions together allow for a flexible modeling of communication concepts in DCS, like e.g. multicasting, where one actor transmits contents to a group of selected actors. We apply our extended technique to model multicasting group communication.},
Location = {Corvallis, Oregon, USA},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/BEE+09.pdf}
}
@InProceedings{BEEH08,
Title = {{Flexible Visualization of Automatic Simulation based on Structured Graph Transformation}},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL-HCC'08)},
Year = {2008},
Editor = {Bottoni, P. and Rosson, M. B.},
Pages = {21-29},
Publisher = {IEEE Computer Society},
Abstract = { Visual modeling languages for discrete behavior modeling allow the modeler to describe how systems develop over time during system runs. Models of these languages are the basis for simulation with the purpose to validate the model with respect to its requirements. Graph transformation systems have shown to be suitable for the definition of various kinds of visual modeling languages. They define a modelï¿½s operational semantics as the set of all transformations of a model which are specified by graph transformation rules. For automatic simulation, rules have to be structured to control their application order. During simulation, the state changes after each rule application should be visualized in the concrete syntax of the modeling language. In this paper, we propose a generic approach to specify simulation environments based on a modelï¿½s concrete syntax definition and suitable rule structuring techniques. We implement our approach using TIGER, a tool for defining visual languages based on graph transformation, and generate the specified simulation environment as plug-in for ECLIPSE. We demonstrate our approach by a case study for automatic simulation of Rubikï¿½s Clock, a mechanical twosided puzzle of clocks controlled by rotating wheels.},
ISBN = {978-1-4244-2528-0},
Keywords = {graph transformation, visual editor, Eclipse, Rubik's Clock, simulation, visualization},
Location = {Herrsching, Germany},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/BEEH08.pdf}
}
@InProceedings{BEEH09,
Title = {{Generation of Simulation Views for Domain Specific Modeling Languages based on the Eclipse Modeling Framework}},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Booktitle = {Automated Software Engineering (ASE'09)},
Year = {2009},
Editor = {Taentzer, G. and Heimdahl, M.},
Organization = {IEEE},
Pages = {625 -- 629},
Publisher = {IEEE Press},
Abstract = {The generation of tools for domain specific modeling languages (DSMLs) is a key issue in model-driven development. Various tools already support the generation of domain-specific visual editors from models, but tool generation for visual behavior modeling languages is not yet supported in a satisfactory way.
In this paper we propose a generic approach to specify DSML environments visually by models and transformation rules based on the Eclipse Modeling Framework (EMF).
Editing rules define the behavior of generated visual editors, whereas simulation rules describe a model's operational semantics.
From a DSML definition (model and transformation rules), an Eclipse plug-in is generated, implementing a visual DSML environment including an editor and (possibly multiple) simulators for different simulation views on the model.
We present the basic components of Tiger2, our EMF-based generation environment, and demonstrate the environment generation process for a small DSML modeling the behavior of ants in an ant hill.},
Location = {Auckland, New Zealand, Nov. 16-20, 2009},
Owner = {Claudia},
Timestamp = {2009.08.30}
}
@TechReport{BEEH09b,
Title = {Generation of Simulation Views for Domain Specific Modeling Languages based on EMF: Long Version},
Author = {Biermann, E. and Ehrig, K. and Ermel, C. and Hurrelmann, J.},
Institution = {TU Berlin},
Year = {2009},
Note = {\url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}},
Number = {TR 2009-17},
Abstract = {The generation of tools for domain specific modeling languages (DSMLs) is a key issue in model-driven development. Various tools already support the generation of domain-specific visual editors from models, but tool generation for visual behavior modeling languages is not yet supported in a satisfactory way. In this paper we propose a generic approach to specify DSML environments visually by models and transformation rules based on the Eclipse Modeling Framework (EMF). Editing rules define the behavior of generated visual editors, whereas simulation rules describe a model's operational semantics. From a DSML definition (model and transformation rules), an Eclipse plug-in is generated, implementing a visual DSML environment including an editor and (possibly multiple) simulators for different simulation views on the model. We present the basic components of Tiger2, our EMF-based generation environment, along the environment generation process for a small DSML modeling the behavior of ants in an ant hill.},
Owner = {Claudia},
Timestamp = {2009.08.31}
}
@InCollection{BEK+06a,
Title = {Graphical Definition of In-Place Transformations in the {E}clipse {M}odeling {F}ramework},
Author = {Biermann, E. and Ehrig, K. and K\"ohler, C. and Kuhns, G. and Taentzer, G. and Weiss, E.},
Booktitle = {Proc. of the International Conference on Model Driven Engineering Languages and Systems (MoDELS'06)},
Publisher = Springer,
Year = {2006},
Address = {Berlin},
Editor = {Nierstrasz, O. and Whittle, J. and Harel, D. and Reggio, G.},
Pages = {425-439},
Series = lncs,
Volume = {4199},
Abstract = {The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. Although EMF provides basic operations for modifying EMF based models, a framework for graphical definition of rule-based modification of EMF models is still missing. In this paper we present a framework for in-place EMF model transformation based on graph transformation. Transformations are visually defined by rules on object patterns typed over an EMF core model. Defined transformation systems can be compiled to Java code building up on generated EMF classes. As running example different refactoring methods for Ecore models are considered. },
ISSN = {ISBN: 978-3-540-45772-5},
Keywords = {graph transformation, EMF, EMF transformation, Eclipse},
Location = {Genova, Italy},
Url = {http://www.springerlink.com/index/T681013811W30537.pdf}
}
@InProceedings{BEK+06,
Title = {{EMF Model Refactoring based on Graph Transformation Concepts}},
Author = {Biermann, E. and Ehrig, K. and K\"ohler, C. and Kuhns, G. and Taentzer, G. and Weiss, E.},
Booktitle = {Proc. Third International Workshop on Software Evolution through Transformations (SETra'06)},
Year = {2006},
Address = {Natal, Brazil},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Volume = {3},
Abstract = {The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. Within model driven software development based on EMF, refactoring of EMF models become a key activity. In this paper, we present an approach to define EMF model refactoring methods as transformation rules being applied in place on EMF models. Performing an EMF model refactoring, EMF transformation rules are applied and can be translated to corresponding graph transformation rules, as in the graph transformation environment AGG. If the resulting EMF model is consistent, the corresponding result graph is equivalent and can be used for validating EMF model refactoring. Results on conflicts and dependencies of refactorings for example, can help the developer to decide which refactoring is most suitable for a given model and why. },
ISSN = {ISSN 1863-2122},
Keywords = {graph transformation, EMF, refactoring, EMF transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/BEK+06.pdf}
}
@InProceedings{BE09,
Title = {{Transforming BPMN to BPEL with EMF Tiger}},
Author = {Enrico Biermann and Claudia Ermel},
Booktitle = {Proc. Graph-based Tools (GraBaTs'09)},
Year = {2009},
Abstract = {This paper describes a model transformation from the Business Process Modeling Notation (BPMN) to the Business Process Execution Language for Web Services (BPEL4WS, or BPEL for short). We give the meta-models for both source and target language as EMF models and dene EMF model transformation rules using our recently developed tool EMF Tiger, an Eclipse plug-in supporting modeling and execution for EMF model transformations, based on structured data models and graph transformation concepts. },
Owner = {Claudia},
Timestamp = {2009.09.21},
Url = {http://is.tm.tue.nl/staff/pvgorp/events/grabats2009/submissions/}
}
@InProceedings{BEHM07,
Title = {{A Visual Editor for Reconfigurable Object Nets based on the ECLIPSE Graphical Editor Framework}},
Author = {Biermann, Enrico and Ermel, Claudia and Hermann, Frank and Modica, Tony},
Booktitle = {Proc. 14th Workshop on Algorithms and Tools for Petri Nets (AWPN'07)},
Year = {2007},
Address = {Universit\"at Koblenz-Landau, Germany},
Editor = {Juhas, G. and Desel, J.},
Month = {October},
Publisher = {GI Special Interest Group on Petri Nets and Related System Models},
Abstract = { The main idea behind Reconfigurable Object Nets (RONs) is the integration of transition firing and rule-based net structure transformation of place/transition nets during system simulation. RONs are high-level nets with two types of tokens: object nets (place/transition nets) and net transformation rules (a dedicated type of graph transformation rules). Firing of high-level transitions may involve firing of object net transitions, transporting object net tokens through the high-level net, and applying net transformation rules to object nets. Net transformations include net modifications such as merging or splitting of object nets, and net refinement. This approach increases the expressiveness of Petri nets and is especially suited to model mobile distributed processes. The paper presents a visual editor for RONs which has been developed in a student project at TU Berlin in summer 2007. The visual editor itself has been realized as a plug-in for ECLIPSE using the ECLIPSE Modeling Framework (EMF) and Graphical Editor Framework (GEF) plug-ins.},
Keywords = {Petri nets, net transformation, graph transformation, visual editor, reconfigurable object net, Eclipse, GEF},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/BEHM07.pdf}
}
@InProceedings{BEJ10,
Title = {Modeling the "{Ecore to GenModel}" Transformation with {EMF Henshin}},
Author = {Biermann, E. and Ermel, C. and Jurack, S.},
Booktitle = {Proc. Transformation Tool Contest 2010 (TTC'10)},
Year = {2010},
Note = {\url{http://planet-research20.org/ttc2010/index.php?option=com_content&view=article&id=110&Itemid=152}},
Owner = {Claudia},
Timestamp = {2010.06.20},
Url = {http://planet-research20.org/ttc2010/index.php?option=com_content&view=article&id=110&Itemid=152#EcoreToGenModel}
}
@Article{BEL+10,
Title = {Introduction to {AGG} and {EMF Tiger} by Modeling a Conference Scheduling System},
Author = {Biermann, E. and Ermel, C. and Lambers, L. and Prange, U. and Taentzer, G.},
Journal = {Int. Journal on Software Tools for Technology Transfer},
Year = {2010},
Month = {Juli},
Number = {3-4},
Pages = {245--261},
Volume = {12},
Abstract = {In this paper we focus on the \emph{Conference Scheduling System}, a case study at the Tool Contest of Graph-Based Tools (GraBaTs) 2008. We took part in the contest with our graph transformation tool \textsc{AGG} and the \textsc{Eclipse}-based EMF model transformation tool \textsc{EMF Tiger}. We present the features of both tools and evaluate their abilities to model the conference scheduling system and to deal with additional contest assignments like model instance generation, property verification and interoperability.},
Doi = {10.1007/s10009-010-0154-x},
ISSN = {1433-2779 (Print) 1433-2787 (Online)},
Publisher = {Springer}
}
@Article{BEMS08,
Title = {{Implementing Petri Net Transformations using Graph Transformation Tools}},
Author = {Biermann, E. and Ermel, C. and Modica, T. and Sylopp, P.},
Journal = {ECEASST},
Year = {2008},
Volume = {14},
Abstract = {Petri net transformations have been defined formally in the abstract framework of adhesive HLR categories, which allows rule-based rewriting of graphlike structures, similar to graph transformation. In this paper we discuss differences between Petri net rewriting and graph rewriting which makes it necessary to add checks and conditions when implementing Petri net transformations using an existing graph transformation tool like AGG. The extensions concern the preservation of Petri net transition firing behavior and the mapping of markings. As a running example, we present the RON environment, a visual editor, simulator and net transformation tool for reconfigurable Petri nets which has been developed as a plug-in for ECLIPSE based on the graph transformation engine AGG.},
Booktitle = {Proc. Third International Workshop on Petri Nets and Graph Transformations},
Editor = {Baldan, P. and K\"onig, B.},
ISBN = {ISSN 1863-2122},
Keywords = {Petri net transformation, graph transformation, graph transformation tool, AGG},
Location = {Leicester, UK},
Publisher = eceasst,
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/23}
}
@Article{BESW10,
Title = {Visual Modeling of Controlled {EMF} Model Transformation using {Henshin}},
Author = {Biermann, E. and Ermel, C. and Schmidt, J. and Warning, A.},
Journal = {ECEASST},
Year = {2010},
Pages = {1--14},
Volume = {32},
Abstract = {The tool HENSHIN is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the recent extensions of HENSHIN by control structures for controlled rule applications. The control structures comprise well-known imperative structures like sequences and conditions on rule applications. Moreover, application conditions for individual rules may now be arbitrarily nested and combined by logical connectors. We present the extension of the visual EMF model transformation environment Henshin to edit and perform controlled EMF model transformations along an example modeling a reactive Web service-based application (personal mobility manager).},
Booktitle = {Proc. 4th Intern. Workshop on Graph-Based Tools (GraBaTs'10)},
ISBN = {ISSN 1863-2122},
Owner = {Claudia},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/43}
}
@InProceedings{BET08,
Title = {Precise Semantics of {EMF} Model Transformations by Graph Transformation},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Booktitle = {Proc. ACM/IEEE 11th International Conference on Model Driven Engineering Languages and Systems (MoDELS'08)},
Year = {2008},
Editor = {Czarnecki, K.},
Pages = {53--67},
Publisher = Springer,
Series = lncs,
Volume = {5301},
Abstract = { Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations wrt. functional behavior and correctness, a formal foundation is needed. In this paper, we define EMF model transformations as a special kind of typed graph transformations using node type inheritance. Containment constraints of EMF model transformations are translated to a special kind of EMF model transformation rules such that their application leads to consistent transformation results only. Thus, we identify a kind of EMF model transformations which behave like algebraic graph transformations. As a consequence, the rich theory of algebraic graph transformation can be applied to these EMF model transformations to show functional behavior and correctness. We illustrate our approach by selected refactorings of simplified statechart models.},
ISBN = {978-3540878742},
Keywords = {EMF, model transformation, Eclipse, graph transformation, precise semantics},
Location = {Toulouse, France},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/BET08.pdf}
}
@Article{BET10,
Title = {Lifting Parallel Graph Transformation Concepts to Model Transformation based on the {E}clipse Modeling Framework},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Journal = {ECEASST},
Year = {2010},
Pages = {1--20},
Volume = {26},
Abstract = {Model transformation is one of the key concepts in modeldriven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on dierent transformation aspects. This paper proposes parallel graph transformation introduced by Ehrig and Kreowski to be a suitable framework for modeling EMF model transformations with multiobject structures. Multi-object structures at transformation rule level provide a flexible way to describe the transformation of structures with a variable number of recurring structures, dependent on concrete model instances. Parallel graph transformation means massively parallelizing the application of model transformation rules synchronized at a kernel rule. We apply our extended EMF model transformation technique to model the simulation of statecharts with AND-states.},
Booktitle = {Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday},
Editor = {Frank Drewes and Annegret Habel and Berthold Hoffmann and Detlef Plump},
ISBN = {ISSN 1863-2122},
Owner = {Claudia},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/36}
}
@Article{BET11,
Title = {Formal Foundation of Consistent EMF Model Transformations by Algebraic Graph Transformation},
Author = {Biermann, E. and Ermel, C. and Taentzer, G.},
Journal = {Software and Systems Modeling (SoSyM)},
Year = {2012},
Number = {2},
Pages = {227-250},
Volume = {11},
Abstract = {Model transformation is one of the key activities in model-driven software development. An increasingly popular technology to define modeling languages is provided by the Eclipse Modeling Framework (EMF). Several EMF model transformation approaches have been developed, focusing on different transformation aspects. To validate model transformations with respect to functional behavior and correctness, a formal foundation is needed. In this paper, we define consistent EMF model transformations as a restricted class of typed graph transformations using node type inheritance. Containment constraints of EMF model transformations are translated to a special kind of graph transformation rules such that their application leads to consistent transformation results only. Thus, consistent EMF model transformations behave like algebraic graph transformations and the rich theory of algebraic graph transformation can be applied to these EMF model transformations to show functional behavior and correctness. Furthermore, we propose parallel graph transformation as a suitable framework for modeling EMF model transformations with multi-object structures. Rules extended by multi-object structures can specify a flexible number of recurring structures. The actual number of recurring structures is dependent on the application context of such a rule. We illustrate our approach by selected refactorings of simplified statechart models. Finally, we discuss the implementation of our concepts in a tool environment for EMF model transformations.},
Affiliation = {TU Berlin, Germany},
ISSN = {1619-1366},
Keyword = {Computer Science},
Publisher = {Springer},
Url = {http://dx.doi.org/10.1007/s10270-011-0199-7}
}
@InProceedings{BHP07,
Title = {Layered Architecture Consistency for MANETs: Introducing New Team Members},
Author = {Biermann, E. and Hoffmann, K. and Padberg, J.},
Booktitle = {Proc. of the 10th World Conference on Integrated Design {\&} Process Technology},
Year = {2007},
Note = {CDROM},
Pages = {13},
Abstract = {In this paper we extend our results concerning the layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher order nets (AHO nets). MANETs are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure. Workflows in MANETs can be adequately modeled using a layered architecture, where the overall workflow, the team member activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Based on a formal notion of layer consistency we extend that approach to allow changes of the interfaces of the gluing of the workflow and the mobility layer.},
Keywords = {Petri nets, mobile ad-hoc networks, layer consistency, workflow management},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/BHP07.pdf}
}
@MastersThesis{BK06,
Title = {{Konzeption und Implementierung einer regelbasierten Transformationskomponente f{\"u}r das Eclipse Modeling Framework}},
Author = {Biermann, E. and Kuhns, G.},
School = FB13,
Year = {2006},
Type = {Master's thesis},
Abstract = {Das Ziel dieser Diplomarbeit ist es, eine Softwarekomponente zur Modelltransformation f{\"u}r das Eclipse Modeling Framework (EMF) zu entwickeln und diese zu implementieren. Eine Transformation wird durch eine Menge von Regeln beschrieben. Dadurch sind {\"A}nderungen an einer Modellinstanz leichter nachzuvollziehen als bei textuellen Regeln. Bei der Form der Regeln orientieren wir uns stark am Graphtransformationsansatz. Regeln sollen nicht nur einzeln, sondern auch als Regelmenge so oft angewendet werden, bis keine Regel mehr ausgef{\"u}hrt werden kann. Auf diese Weise kann eine komplexe {\"A}nderung durch eine Reihe von einfachen Regeln beschrieben und durchgef{\"u}hrt werden. Wir haben zwei Ans{\"a}tze implementiert. Beim \textemph{Interpreter} wird eine Regel in AGG - einem Tool zur Graphtransformation - auf einen Graphen, welcher der Instanz entspricht, angewendet. Anschliessend werden die Ver{\"a}nderungen an diesem Graphen ausgewertet und auf die Instanz {\"u}bertragen. Der \textemph{Compiler} erzeugt zu jeder Regel Java-Code, der die Anwendung der Regel implementiert. Auf diese Weise k{\"o}nnen AGG-Regeln f{\"u}r ein EMF-Modell durch Regelklassen in Java ersetzt werden. Unsere Transformationskomponente f{\"u}hrt eine endogene Modelltransformation durch - das heisst Quell- und Ziel-Modell sind identisch. Die Semantik von EMF-Modellen wird soweit ber{\"u}cksichtigt, dass Teile einer Regel, die eine EMF-Instanz inkonsistent machen, nicht ausgef{\"u}hrt und eine Instanz nach einer Regelanwendung wieder konsistent gemacht wird. Alle Objekte, die durch eine Regel nicht ver{\"a}ndert werden, bleiben bestehen, sodass Referenzen von aussen auf eine Instanz auch nach einer Anwendung noch funktionieren. Dadurch kann man zum Beispiel in einem Editor Commands durch die Ausf{\"u}hrung einer Regel ersetzen. },
Keywords = {graph transformation, model transformation, Eclipse, EMF},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/BK06.pdf}
}
@InProceedings{BM08,
Title = {{Independence Analysis of Firing and Rule-based Net Transformations in Reconfigurable Object Nets}},
Author = {Biermann, E. and Modica, T.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08)},
Year = {2008},
Editor = {C. Ermel, J. de Lara and R. Heckel},
Publisher = eceasst,
Volume = {10},
Abstract = {The main idea behind Reconfigurable Object Nets (RONs) is to support the visual specification of controlled rule-based net transformations of place/transition nets (P/T nets). RONs are high-level nets with two types of tokens: object nets (place/transition nets) and net transformation rules (a dedicated type of graph transformation rules). Firing of high-level transitions may involve firing of object net transitions, transporting object net tokens through the high-level net, and applying net transformation rules to object nets, e.g. to model net reconfigurations. A visual editor and simulator for RONs has been developed as a plug-in for ECLIPSE using the ECLIPSE Modeling Framework (EMF) and Graphical Editor Framework (GEF) plug-ins. The problem in this context is to analyze under which conditions net transformations and token firing can be executed in arbitrary order. This problem has been solved formally in a previous paper. In this contribution we present an extension of our RON tool which implements the analysis of conflicts between parallel enabled transitions, between parallel applicable net transformation rules (Church-Rosser property), and between transition firing and net transformation steps. The conflict analysis is applied to a RON simulating a distributed producer-consumer system.},
ISBN = {{ISSN 1863-2122}},
Keywords = {Petri nets, net transformation, graph transformation, visual editor, reconfigurable object nets, conflict analysis, independence analysis, Eclipse, GEF},
Location = {Budapest, Hungary},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/19}
}
@TechReport{BMH07,
Title = {Categorical Foundation for Layer Consistency in AHO-Net Models Supporting Workflow Management in Mobile Ad-Hoc Networks},
Author = {Biermann, E. and Modica, T. and Hoffmann, K.},
Institution = {Technische Universit\"at Berlin,Fakult{\"a}t IV},
Year = {2007},
Number = {2007-01},
Abstract = {In this paper we present a layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (manets) using algebraic higher order nets (aho nets). manets are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure, e.g. in emergency scenarios, where an effective coordination is crucial among team members, each of them equipped with hand-held devices. Workflows in manets can be adequately modeled using a layered architecture, where the overall workflow, the team members' activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Dividing the aho net model into layers immediately rises the question of consistency. We suggest a formal notion of layer consistency requiring that the team layer is given by the mapping of the individual member's activities to the gluing of the workflow and the mobility layer. The main results concern the maintenance of the layer consistency when changing the workflow layer, the mobility layer and the team layer independently.},
Keywords = {Petri nets, mobile ad-hoc networks, layer consistency, workflow management},
Url = {http://iv.tu-berlin.de/TechnBerichte/2007/2007-01.pdf}
}
@TechReport{BMHP06,
Title = {Categorical foundation for layer consistency in {AHO}-net models for {MANET}s},
Author = {Biermann, E. and Modica, T. and Hoffmann, K.},
Institution = {TU Berlin, Fak. IV},
Year = {2006},
Number = {2006/13},
ISBN = {issn 1436-9915},
Url = {http://iv.tu-berlin.de/TechnBerichte/tb2006.html}
}
@InProceedings{BHE08,
Title = {{Verification of Architectural Refactorings by Rule Extraction}},
Author = {Bisztray, D. and Heckel, R. and Ehrig, H.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'08)},
Year = {2008},
Editor = {J.L.\ Fiadeiro and P. Inverardi},
Pages = {347--361},
Publisher = Springer,
Series = lncs,
Volume = {4961},
Abstract = {With the success of model-driven development as well as component-based and service-oriented systems, models of software architecture are key artefacts in the development process. To adapt to changing requirements and improve internal software quality such models have to evolve while preserving aspects of their behaviour. To avoid the costly verification of refactoring steps on large systems we present a method which allows us to extract a (usually much smaller) rule from the transformation performed and verify this rule instead. The main result of the paper shows that the verification of rules is indeed sufficient to guarantee the desired semantic relation between source and target models. We apply the approach to the refactoring of architectural models based on UML component, structure, and activity diagrams, with using CSP as a semantic domain.},
Doi = {10.1007/978-3-540-78743-3},
ISBN = {978-3-540-78742-6},
Keywords = {Service Oriented Architecture, UML, Refactoring, Graph Transformation, CSP},
Location = {Budapest, Hungary},
Url = {http://www.springerlink.com/content/gk5m632668x42295/}
}
@Article{BEP87,
Title = {Algebraic Specification of Modules and their Basic Interconnections},
Author = {Blum, E.K. and Ehrig, H. and {Parisi-Presicce}, F.},
Journal = {JCSS},
Year = {1987},
Number = {2/3},
Pages = {293-339},
Volume = {34}
}
@TechReport{BC89,
Title = {Executability and Transformation of {LOTOS} Data Type Specifications},
Author = {P. Boehm and I. {Cla\ss en}},
Institution = {LOTOSPHERE},
Year = {1989},
Number = {Lo/WP1/T1.2/TUB/N0006/V2}
}
@Article{BdRHM06,
Title = {{Applying Algebraic Approaches for Modeling Workflows and their Transformations in Mobile Networks}},
Author = {Bottoni, P. and {De Rosa}, F. and Hoffmann, K. and Mecella, M.},
Journal = {Journal of Mobile Information Systems},
Year = {2006},
Number = {1},
Pages = {51-76},
Volume = {2},
Abstract = {In emergency scenarios we can obtain a more effective coordination among team members, each of them equipped with hand-held devices, through the use of workflow management software. Team members constitute a Mobile Ad-hoc NETwork (MANET), whose topology both influences and is influenced by the workflow. In this paper we propose an algebraic approach for modeling workflow progress as well as its modifications as required by topology transformations. The approach is based on Algebraic Higher-Order Nets and sees both workflows and topologies as tokens, allowing their concurrent modification.},
ISSN = {1574-017x},
Keywords = {Mobile Ad-hoc NETworks (MANETs), adaptive workflow management, algebraic approaches},
Publisher = {IOS Press},
Url = {http://iospress.metapress.com/link.asp?id=5q8v39ue7yakbmre}
}
@Article{BHPT05,
Title = {{High-Level Replacement Units and their Termination Properties}},
Author = {Bottoni, P. and Hoffmann, K. and Parisi-Presicce, F. and Taentzer, G.},
Journal = {Journal of Visual Languages and Computing},
Year = {2005},
Note = {to appear},
Abstract = {Visual rewriting techniques, in particular graph transformations, are increasingly used to model transformations of systems specified through diagrammatic sentences. Several rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism; yet, for many of them, basic results concerning the formal properties of these models are still missing. In this paper, we give a contribution towards solving the termination problem for rewriting systems with external control mechanisms. In particular, we obtain results of more general validity by extending the concept of transformation unit to high-level replacement systems, a generalization of graph transformation systems. For high-level replacement units, we state and prove several abstract properties based on termination criteria. Then, we instantiate the high-level replacement systems by attributed graph transformation systems and present concrete termination criteria. We explore some types of rules and replacement units for which the criterion can be established. These are used to show the termination of some replacement units needed to express model transformations formalizing refactoring.},
ISBN = {ISSN: 1045-926X},
Keywords = {Visual transformations, transformation units, high level replacement, termination, refactoring},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/BHPT05.pdf}
}
@InProceedings{BKPT02,
Title = {{ Working on OCL with Graph Transformation }},
Author = {Bottoni, P. and Koch, M. and Parisi-Presicce, F. and Taentzer, G. },
Booktitle = { Proc. of APPLIGRAPH Workshop on Applied Graph Transformation (AGT 2002)},
Year = {2002},
Editor = {Kreowski, H.-J.},
Pages = {1 -- 10},
Keywords = {Graph Transformation, UML, OCL, Constraints},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BKTP02.pdf}
}
@InProceedings{BKPT04,
Title = {{Termination of High-Level Replacement Units with Application to Model Transformation}},
Author = {Bottoni, P. and Koch, M. and Parisi-Presicce, F. and Taentzer, G.},
Booktitle = {Proc. Workshop on Visual Languages and Formal Methods},
Year = {2004},
Editor = {Minas, M.},
Pages = {71--86},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {127/4},
Abstract = {Visual rewriting techniques are increasingly used to model transformations of systems specified through diagrammatic sentences. Graph transformations, in particular, are a widespread formalism with several applications, from parsing to model animation or transformation. Although a wealth of rewriting models have been proposed, differing in the expressivity of the types of rules and in the complexity of the rewriting mechanism, basic results concerning the formal properties of these models are still missing for many of them. In this paper, we propose a contribution towards solving the termination problem for rewriting systems with external control mechanisms for rule application. In particular, we obtain results of more general validity by extending the concept of transformation unit to high-level replacement systems, a generalization of graph transformation systems. For the resulting high-level replacement units, we state and prove several abstract properties based on termination criteria. Then, we instantiate the high-level replacement systems by attributed graph transformation systems and present concrete termination criteria. These are used to show the termination of some replacement units needed to express model transformations consequent to software refactoring. },
Keywords = {Graph Transformation, Termination, Model Transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/gBKPT04.pdf}
}
@InProceedings{BKPT01,
Title = {{A Visualization of OCL using Collaborations }},
Author = {Bottoni, P. and Koch, M. and Parisi-Presicce, F. and Taentzer, G. },
Booktitle = {UML 2001 -- The Unified Modeling Language},
Year = {2001},
Pages = {257 -- 271},
Publisher = Springer,
Series = lncs
}
@InProceedings{BKPT00,
Title = {{Consistency Checking and Visualization of OCL Constraints}},
Author = {Bottoni, P. and Koch, M. and Parisi-Presicce, F. and Taentzer, G.},
Booktitle = {UML 2000 - The Unified Modeling Language},
Year = {2000},
Publisher = Springer,
Series = lncs,
Volume = {1939}
}
@InProceedings{BPPT06,
Title = {{Maintaining Coherence between Models with Distributed Rules: from Theory to Eclipse}},
Author = {Bottoni, P. and Parisi-Presicce, F. and Pulcini, S. and Taentzer, G.},
Booktitle = {Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'06)},
Year = {2006},
Address = {Vienna, Austria},
Editor = {Varro, D. and Bruni, R.},
Month = {April},
Publisher = {Elsevier Science},
Series = entcs,
Abstract = {Integrated Development Environments supporting software and model evolution have to deal with the problem of maintaining coherence between code and model despite changes which may occur on both sides. Rather than going through model reingeneering or code regeneration, it would be better to build a full correspondence between the starting models and keep it updated in an incremental way after each evolutionary step. In a series of previous papers, it was shown how distributed graph rewriting could support such updates. Here, we show how to construct a distributed graph from individual models, through the use of synchronized rules. In particular, we discuss the case of Java code and UML models, and propose an Eclipse implementation of the approach. },
Keywords = {graph transformation, distributed graphs, model morphism, software evolution},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/BPPT06.pdf}
}
@InProceedings{BPS98,
Title = {{From Formulae to Rewriting Systems}},
Author = {Bottoni, P. and Parisi-Presicce, F. and Simeoni, M.},
Booktitle = { Proc. of the 6th Int. Workshop on Theory and Application of Graph Transformations (TAGT'98)},
Year = {1998},
Address = {Roma, Italy},
Note = {Extended abstract}
}
@InProceedings{BPT04a,
Title = {{Specifying Integrated Refactoring with Distributed Graph Transformation}},
Author = {Bottoni, P. and Parisi-Presicce, F. and Taentzer, G.},
Booktitle = {Application of Graph Transformations with Industrial Relevance (AGTIVE'03)},
Year = {2004},
Editor = {Pfaltz, J. and Nagl, M. and Boehlen, B.},
Publisher = Springer,
Series = lncs,
Volume = {3062},
Abstract = {During refactoring, the internal structure of a software system changes to improve its structure in support of subsequent reuse and maintenance, while preserving the behavior. To maintain the consistency between the code (represented as a flow graph) and the model given by several UML diagrams of different kinds, we propose a framework based on distributed graphs, where each refactoring is specified as a set of distributed graph transformations structured and organized into transformation units. This formalism could be used as the basis for important extensions to current refactoring tools.},
Keywords = {Graph Transformation, Software Refactoring}
}
@InProceedings{BPT04,
Title = {{Specifying Coherent Refactoring of Software Artefacts with Distributed Graph Transformations}},
Author = {Bottoni, P. and Parisi-Presicce, P. and Taentzer, G.},
Booktitle = {Transformation of Knowledge, Information, and Data: Theory and Applications},
Year = {2004},
Editor = {v. Bommel, P.},
Publisher = {Idea Group Publishing},
ISSN = {ISBN 1-59140-527-0},
Keywords = {Graph Transformation, UML, Java, software refactoring},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/BPT04.pdf}
}
@InProceedings{BPT02,
Title = {{Coordinated Distributed Diagram Transformation for Software Evolution}},
Author = {Bottoni, P. and Parisi-Presicce, P. and Taentzer, G.},
Booktitle = {Proc. Workshop on Software Evolution through Transformations (SET'01), Satellite Event of ICGT'02},
Year = {2002},
Editor = {Heckel, R. and Mens, T. and Wermelinger, M.},
Month = {October},
Series = entcs,
Volume = {74},
Abstract = { We present an approach to maintaining code and specification consistent in presence of refactoring, where the specification consists of several diagrams from different UML diagram families. Distributed graph transformations are applied in a coordinated way over the different diagrams. Refactoring itself is modelled as a graph transformation over a flowgraph representing the code, while the UML diagrams are taken to represent different views of the code.},
Keywords = {Graph Transformation, UML, software refactoring},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BPT02.pdf}
}
@InProceedings{BST00,
Title = {{Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation}},
Author = {Bottoni,P. and Sch{\"u}rr,A. and Taentzer,G.},
Booktitle = {Proc.\ {IEEE} {S}ymposium on {V}isual {L}anguages},
Year = {2000},
Month = {September},
Note = {Long version available as technical report SI-2000-06, University of Rom}
}
@TechReport{BST00a,
Title = {{Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation}},
Author = {Bottoni,P. and Sch{\"u}rr, A. and Taentzer,G.},
Institution = {University of Rom},
Year = {2000},
Type = {Techn. Report No. SI-2000-06}
}
@InProceedings{BT01,
Title = {{Parsing And Semantics of a Statechart Variant by Contextual Layered Graph Transformation }},
Author = {Bottoni, P. and Taentzer, G. },
Booktitle = {Statechart Modeling Contest at IEEE Symposium on Visual Languages and Formal Methods (VLFM'01)},
Year = {2001},
Address = {Stresa, Italy},
Month = {September 5--7},
Keywords = {Graph Transformation, Statecharts, Visual Modelling},
Url = {http://www2.informatik.uni-erlangen.de/VLFM01/Statecharts/}
}
@InProceedings{BKEW03,
Title = {{Konzeption und Entwicklung eines UML-basierten Funktionsblockmodells f{\"u}r den objektorientierten Steuerungsentwurf}},
Author = {Braatz, A. and Klein, M. and Ehrig, H. and Westk\"amper, E.},
Booktitle = {Tagungsband Entwicklung und Betrieb komplexer Automatisierungssysteme EKA 2003},
Year = {2003},
Organization = {Institut f{\"u}r Regelungs- und Automatisierungstechnik TU Braunschweig},
Pages = {15},
Abstract = {Das Modell des Funktionsblocks ist als Begriffsmodell verstanden der zentrale Ansatz zum Entwurf von Steuerungen in Automatisierungssystemen. Um die UML methodisch zur Entwicklung von Automatisierungssystemen nutzen zu k{\"o}nnen, ist die Abbildung dieses Begriffsmodells auf die Entwurfstechniken der UML und die Entwicklung eines allgemeinen Softwarekomponenten-Begriffes notwendig. Im Rahmen der Abbildung werden UML-Subsysteme und Klassendiagramme zur statischen Beschreibung sowie UML-Zustands- und UML-Aktivit{\"a}tsdiagramme zur dynamischen Beschreibung eingesetzt.},
ISSN = {ISBN 3-9803363-7-9},
Keywords = {Function Blocks, Unified Modeling Language, Software Components}
}
@InProceedings{Bra06b,
Title = {An Integration Concept for Complex Modelling Techniques},
Author = {Braatz, Benjamin},
Booktitle = {Proc. Workshop on Multi-Paradigm Modeling: Concepts and Tools (MPM '06)},
Year = {2006},
Address = {Genova, Italy},
Editor = {Giese, Holger and Levendovszky, Tiham{\'e}r},
Month = {October},
Pages = {81--93},
Publisher = {Department of Automation and Applied Informatics, Budapest University of Technology and Economics},
Series = {BME-DAAI Technical Report Series},
Volume = {2006/1},
Abstract = {In this paper a concept for the integratio of complex modelling techniques like e.g. UML is proposed. The integration is done by translating complex models consisting of parts following different modelling paradigms into a common low-level language, which is designed to be minimalistic enough to serve as a source for code generation and verification. On the other hand the low-level language should be ex-pressive enough to allow the integration of the most common structural, behavioural, and constraint modelling languages. As an example for a complex modelling technique a derivation of the UML, which focuses on a small subset of the UML diagrams, but also adds some additional techniques, is considered. Moreover, a low-level language for object-oriented modelling techniques is sketched.},
ISSN = {ISSN 1863-2122},
Keywords = {UML, Semantics, Integration, Behaviour Modelling},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Bra06.pdf}
}
@InProceedings{Bra08,
Title = {{A Rule-Based, Integrated Modelling Approach for Object-Oriented Systems}},
Author = {Braatz, B.},
Booktitle = {Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'06)},
Year = {2008},
Address = {Amsterdam},
Editor = {Varro, D. and Bruni, R.},
Pages = {251--260},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {211},
Abstract = {In this paper an integrated modelling approach for object-oriented systems is proposed. The integrated language consists of three layers. On the first layer UML class diagrams are used to define the structure of the modelled systems and OCL expressions specify queries, which do not modify the object configuration. On the second layer transformation rules model local state modifications of the system. On the third layer Nassi-Shneiderman diagrams describe complex control flows built over the rules and queries on the lower layers. The proposed integrated language is evaluated by a running example on modelling doubly linked lists and the mergesort algorithm. },
ISBN = {ISSN:1571-0661},
Keywords = {Rule-Based Transformation, Nassi-Shneiderman Diagrams, UML, Integration},
Location = {Vienna, Austria},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Bra06a.pdf}
}
@PhdThesis{Bra09,
Title = {Formal Modelling and Application of Graph Transformations in the Resource Description Framework},
Author = {Braatz, Benjamin},
School = {Technische Universit\"{a}t Berlin, Fakult\"{a}t IV},
Year = {2009},
Abstract = {In this thesis, a connection between two areas of research is developed. On the one hand, the Resource Desription Framework (RDF) is the basis of the Semantic Web. On the other hand, algebraic graph transformation has a long history of providing formally well-founded modification concepts for various graph and graph-like structures. By designing an algebraic transformation approach for RDF, the rich theoretical results of algebraic graph transformation are made available to the RDF world. To achieve this goal, the formal abstract syntax and semantics of RDF is first reformulated in the language of category theory which is used heavily in graph transformation. Then, an abstract, categorical transformation framework is developed which is suitable for being afterwards instantiated by RDF structures. This is necessary since the existing frameworks are not applicable in an unmodified form. The main theoretical results are a sequential composition operation for transformation rules and theorems showing the possibility to analyse and synthesise transformations for these sequentially composed rules. Moreover, these results are also available for transformation rules with negative application conditions. The applicability of the resulting concept of RDF graph transformations is shown by two application scenarios. One is a classical Semantic Web application managing bibliographical metadata, while the other uses RDF as an abstract syntax for domain-specific modelling languages.},
Url = {http://opus.kobv.de/tuberlin/volltexte/2009/2494/}
}
@TechReport{Bra03,
Title = {{Integration of Heterogeneous Modelling Techniques using High-Level Constraints}},
Author = {Braatz, B.},
Institution = {TUB},
Year = {2003},
Number = {2003-10},
Abstract = {The aim of this report is to present a formal framework for the integration of heterogeneous modelling techniques. This framework is based on the integration paradigm for data type and process modelling techniques by Ehrig and Orejas. This specification frame, consisting of integrated signatures and models, is used as common syntax and semantics for the heterogeneous techniques. The concepts are divided into layers for static parts, dynamic state spaces and processes. For the specification of properties the abstract concept of logics of constraints is used. As examples of constraints conditional equations and pre- and post-conditions of state transformations are defined. The integration of modelling techniques is also done in terms of constraints. More precisely, specifications from heterogeneous techniques are considered as so-called high-level constraints, which specify certain parts of the system.},
ISSN = {ISSN 1436-9915},
Keywords = {Integrated Semantics, High-Level Constraints, Integration Paradigm},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_10.ps.gz}
}
@InProceedings{BB08,
Title = {{Graph Transformations for the Resource Description Framework}},
Author = {Braatz, B. and Brandt, C.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08)},
Year = {2008},
Editor = {C. Ermel, J. de Lara and R. Heckel},
Publisher = eceasst,
Volume = {10},
Abstract = {The Resource Description Framework (RDF) is a standard developed by the World Wide Web Consortium (W3C) to facilitate the representation and exchange of structured (meta-)data in the ï¿½SemanticWebï¿½. While there is a large body of work dealing with inference on RDF, a concept for transformation and manipulation is still missing. Since RDF uses graphs as a formal basis, this paper proposes the use of algebraic graph transformations with their wealth of well-known constructions and results for this purpose. It turns out that RDF graphs are an interesting application area for graph transformation methods, where some significant differences to classical graphs yield practically relevant solutions for features like attribution, typing and globally unique nodes.},
ISBN = {{ISSN 1863-2122}},
Keywords = {Resource Description Framework, Algebraic Graph Transformation, Category Theory},
Location = {Budapest, Hungary},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/19}
}
@InProceedings{BBE+07,
Title = {{An approach using formally well-founded domain languages for secure coarse-grained IT system modelling in a real-world banking scenario}},
Author = {Braatz, Benjamin and Brandt, Christoph and Engel, Thomas and Hermann, Frank and Ehrig, Hartmut},
Booktitle = {Proc. Australasian Conf. on Information Systems (ACIS'07)},
Year = {2007},
Abstract = {In this paper we show how distributed coarse-grained IT systems in a real-world banking scenario can be modeled using domain concepts and languages that are standing on top of formal methods. We further show how these methods help to enforce structural security requirements, like firewall placements. In contrast to todays diagrams of IT landscapes, this approach makes use of the full power of formal methods, being at the same time completely transparent to the people using it in the scenario. This is what makes this theoretical approach applicable in a real-world environment where people are highly sensitive to set-up costs and any daily operational overhead. },
Keywords = {Exogenous component coordination, security, algebraic graph transformation, meta-modelling, domain-specific language, domain concepts},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/BBE+07.pdf}
}
@InProceedings{BEGG10,
Title = {Finitary M-Adhesive Categories},
Author = {Braatz, B. and Ehrig, H. and Gabriel, K. and Golas, U.},
Booktitle = {Proceedings of Intern. Conf. on Graph Transformation ( ICGT' 10)},
Year = {2010},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch{\"u}rr, A.},
Pages = {234--249},
Publisher = Springer,
Series = lncs,
Volume = {6372},
Abstract = {Finitary M-adhesive categories are M-adhesive categories with finite objects only, where the notion M-adhesive category is short for weak adhesive high-level replacement (HLR) category. We call an object finite if it has a finite number of M-subobjects. In this paper, we show that in finitary M-adhesive categories we do not only have all the well-known properties of M-adhesive categories, but also all the additional HLR-requirements which are needed to prove the classical results for M-adhesive systems. These results are the Local Church-Rosser, Parallelism, Concurrency, Embedding, Extension, and Local Confluence Theorems, where the latter is based on critical pairs. More precisely, we are able to show that finitary M-adhesive categories have a unique E-M-factorization and initial pushouts, and the existence of an M-initial object implies in addition finite coproducts and a unique E0-M0-pair factorization. Moreover, we can show that the finitary restriction of each M-adhesive category is a finitary M-adhesive category and finitariness is preserved under functor and comma category constructions based on M-adhesive categories. This means that all the classical results are also valid for corresponding finitary M-adhesive systems like several kinds of finitary graph and Petri net transformation systems. Finally, we discuss how some of the results can be extended to non-M-adhesive categories.},
ISBN = {ISBN 978-3-642-15927-5},
Owner = {Claudia},
Timestamp = {2010.10.15},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/BEGG10.pdf}
}
@InProceedings{BEH+02,
Title = {{Application of Graph Transformation Techniques to the Area of PetriNets}},
Author = {Braatz, B. and Ehrig, H. and Hoffmann, K. and Padberg, J. and Urb{\'a}{\v{s}}ek, M.},
Booktitle = {Proc. AGT 2002: APPLIGRAPH Workshop on Applied Graph Transformation},
Year = {2002},
Editor = {Kreowski, H.-J.},
Pages = {35--44},
Keywords = {Graph Transformation, Petri Nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers02/BEH+02.pdf}
}
@Article{BGS10,
Title = {How to Delete Categorically -- Two Pushout Complement Constructions},
Author = {Braatz, B. and Golas, U. and Soboll, T.},
Journal = {Journal of Symbolic Computation},
Year = {2010},
Pages = {1--26},
Abstract = {In category theory, most set-theoretic constructions -- union, intersection, etc. -- have direct categorical counterparts. But up to now, there is no direct construction of a deletion operation like the set-theoretic complement. In rule-based transformation systems, deletion of parts of a given object is one of the main tasks. In the double pushout approach to algebraic graph transformation, the construction of pushout complements is used in order to locally delete structures from graphs. But in general categories, even if they have pushouts, pushout complements do not necessarily exist or are unique. In this paper, two different constructions for pushout complements are given and compared. Both constructions are based on certain universal constructions in the sense of category theory. More specifically, one uses initial pushouts while the other one uses quasi-coproduct complements. These constructions are applied to examples in the categories of graphs and simple graphs.},
Doi = {http://dx.doi.org/10.1016/j.jsc.2010.09.007},
ISBN = {ISSN 0747-7171}
}
@InProceedings{BGEW01,
Title = {{UML-basierte Software-Spezifikation und Entwicklungswerkzeuge f\"ur Systeme der Automatisierungstechnik}},
Author = {Braatz, B. and Gro\"se-Rhode, M. and Ehrig, H. and Westk\"amper, E.},
Booktitle = {Proc. Engineering komplexer Automatisierungssysteme, Braunschweig},
Year = {2001},
Month = {April},
Keywords = {Integration of Modeling Techniques, UML, Production Automation}
}
@InProceedings{BH10,
Title = {{How Far Can Enterprise Modeling for Banking Be Supported by Graph Transformation?}},
Author = {Christoph Brandt and Frank Hermann},
Booktitle = {Int. Conf. on Graph Transformation (ICGT 2010)},
Year = {2010},
Editor = {Hartmut Ehrig and Arend Rensink and Grzegorz Rozenberg and Andy Sch{\"u}rr},
Pages = {3-26},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Volume = {6372},
Ee = {http://dx.doi.org/10.1007/978-3-642-15928-2_2},
ISBN = {978-3-642-15927-5},
Owner = {frank.hermann},
Timestamp = {2012.06.07}
}
@TechReport{BHEE10,
Title = {{Enterprise Modelling using Algebraic Graph Transformation - Extended Version}},
Author = {Brandt, Christoph and Hermann, Frank and Ehrig, Hartmut and Engel, Thomas},
Institution = {TU Berlin, Fak. IV},
Year = {2010},
Number = {2010/06},
ISSN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@InProceedings{BHE09,
Title = {{Modeling and Reconfiguration of critical Business Processes for the purpose of a Business Continuity Management respecting Security, Risk and Compliance requirements at Credit Suisse using Algebraic Graph Transformation}},
Author = {Brandt, Christoph and Hermann, Frank and Engel, Thomas},
Booktitle = {Enterprise Distributed Object Computing Conference Workshops, 2009. EDOCW 2009. 13th, Proc. International Workshop on Dynamic and Declarative Business Processes (DDBP 2009)},
Year = {2009},
Pages = {64-71},
Publisher = {IEEE Xplore Digital Library},
Abstract = {Critical business processes can fail. Therefore, continuity processes are needed as backup solutions. At the same time business processes are required to comply with security, risk and compliance requirements. In the context discussed here, they should be modeled in a decentralized, local and declarative way, including methodological support by tools. By discussing a simplified loan granting process in the context of a Business Continuity Management System at Credit Suisse, we show how algebraic graph transformation can contribute a methodologically sound solution being compatible with all these requirements in a coherent way. As a consequence significant benefits of automation and quality can be realized. The presented contribution is theoretically sound and implementable by the people in the field.},
Doi = {10.1109/EDOCW.2009.5332015},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/BHE09.pdf}
}
@InProceedings{BHE09a,
Title = {{Security and Consistency of IT and Business Models at Credit Suisse realized by Graph Constraints, Transformation and Integration using Algebraic Graph Theory}},
Author = {Brandt, Christoph and Hermann, Frank and Engel, Thomas},
Booktitle = {Proc. Int. Conf. on Exploring Modeling Methods in Systems Analysis and Design 2009 (EMMSAD'09)},
Year = {2009},
Address = {Heidelberg},
Pages = {339-352},
Publisher = {Springer Verlag},
Series = {LNBIP},
Volume = {29},
Doi = {10.1007/978-3-642-01862-6_28},
Url = {http://dx.doi.org/10.1007/978-3-642-01862-6_28}
}
@TechReport{BHG10,
Title = {{Modeling and Reconfiguration of critical Business Processes for the purpose of a Business Continuity Management respecting Security, Risk and Compliance requirements at Credit Suisse using Algebraic Graph Transformation: Extended Version}},
Author = {Brandt, Christoph and Hermann, Frank and Groote, {Jan-Friso}},
Institution = {TU Berlin, Fak. IV},
Year = {2010},
Number = {2010/11},
ISSN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@Article{BHG11,
Title = {{Generation and Evaluation of Business Continuity Processes; Using Algebraic Graph Transformation and the mCRL2 Process Algebra}},
Author = {Brandt, Christoph and Hermann, Frank and Groote, Jan Friso},
Journal = {Journal of Research and Practice in Information Technology},
Year = {2011},
Address = {Sydney, New South Wales, Australia},
ISSN = {1443-458X},
Owner = {User},
Publisher = {Australian Computer Society Inc.},
Timestamp = {2010.09.18}
}
@InCollection{BEEP15,
Title = {Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation},
Author = {Bucchiarone, Antonio and Ehrig, Hartmut and Ermel, Claudia and Pelliccione, Patrizio and Runge, Olga},
Booktitle = {Software, Services, and Systems},
Publisher = {Springer International Publishing},
Year = {2015},
Editor = {De Nicola, Rocco and Hennicker, Rolf},
Pages = {582-601},
Series = {Lecture Notes in Computer Science},
Volume = {8950},
Abstract = {Software systems nowadays require continuous operation despite changes both in user needs and in their operational environments. Self-adaptive systems are typically instrumented with tools to autonomously perform adaptation to these changes while maintaining some desired properties. In this paper we model and analyze self-adaptive systems by means of typed, attributed graph grammars. The interplay of different grammars representing the application and the adaptation logic is realized by an adaption manager. Within this formal framework we define consistency and operational properties that are maintained despite adaptations and we give static conditions for their verification. The overall approach is supported by the AGG tool for modeling, simulating, and analyzing graph transformation systems. A case study modeling a business process that adapts to changing environment conditions is used to demonstrate and validate the formal framework.},
Doi = {10.1007/978-3-319-15545-6_33},
ISBN = {978-3-319-15544-9},
Language = {English},
Owner = {Claudia},
Timestamp = {2015.03.19},
Url = {http://dx.doi.org/10.1007/978-3-319-15545-6_33}
}
@TechReport{BEE+13a,
Title = {Modeling and Analysis of Self-Adaptive Systems Based on Graph Transformation},
Author = {Antonio Bucchiarone and Hartmut Ehrig and Claudia Ermel and Patrizio Pelliccione and Olga Runge},
Institution = {TU Berlin},
Year = {2013},
Number = {2013/03},
Abstract = {Software systems nowadays require continuous operation despite changes both in user needs and in their operational environments. Self-adaptive systems are typically instrumented with tools to autonomously perform adaptation to these changes while maintaining some desired properties. In this paper we model and analyze self-adaptive systems by means of typed, attributed graph grammars. The interplay of different grammars representing the application and the adaptation logic is realized by an adaption manager. Within this formal framework we define consistency and operational properties that are maintained despite adaptations and we give static conditions for their verification. The overall approach is supported by the AGG tool that offers the features for modeling, simulating, and analyzing graph transformation systems. A case study modeling a business process that adapts to changing environment conditions is used to demonstrate and validate the formal framework.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@InProceedings{BPVR09,
Title = {Self-Repairing Systems Modeling and Verification using AGG},
Author = {Bucchiarone, A. and Pelliccione, P. and Vattani, C. and Runge, O.},
Booktitle = {Joint Working IEEE/IFIP Conference on Software Architecture 2009 \& European Conference on Software Architecture (WICSA'09)},
Year = {2009},
Abstract = {Self-Repairing (or healing) systems are systems equipped with a mechanism that monitors the system behaviour to determine whether it behaves within prefixed parameters. If a deviation exists, then the system itself is in charge of adapting its configuration. In this paper we show how to model self-repairing systems by means of Dynamic Software Architectures (DSAs). DSAs are formalized as Typed (hyper) Graph Grammars (TGGs) and this formalization enables verification of correctness and completeness of self-repairing systems. DSAs are modeled and verified by using the Attributed Graph Grammar system (AGG). The overall approach is applied to a traffic light system case study.},
Owner = {Claudia},
Timestamp = {2009.08.31},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/BPVR09.pdf}
}
@Book{CEW93,
Title = {Algebraic Specification Techniques and Tools for Software Development - The {ACT} Approach},
Author = {Cla{\ss}en, I. and Ehrig, H. and Wolz, D.},
Publisher = {World Scientific},
Year = {1993},
Series = {AMAST Series in Computing Vol.%7E1}
}
@TechReport{CGL96,
Title = {Dynamics in Information Systems: Specification, Construction, and Correctness},
Author = {I. Cla{\ss}en and M. Gogolla and M. L{\"o}we},
Institution = {Technische Universit\"at Berlin},
Year = {1996},
Number = {96--01}
}
@Article{CGW95,
Title = {Categorical concepts for parameterized partial specifications},
Author = {Cla{\ss}en, I. and {Gro{\ss}e--Rhode}, M. and Wolter, U.},
Journal = {Math. Struct. in Comp. Science},
Year = {1995},
Number = {2},
Pages = {153-188},
Volume = {5}
}
@Article{CGW95a,
Title = {Categorical Concepts for Parameterized Partial Specifications},
Author = {Cla{\ss}en, I. and {Gro{\ss}e--Rhode}, M. and Wolter, U.},
Journal = {Math. Struct. in Comp. Science},
Year = {1995},
Note = {A preliminary version appeared as Tech. Report 92-42, Technische Universit{\"a}t Berlin, FB Informatik, 1992},
Pages = {153--188},
Volume = {5}
}
@TechReport{CGW92,
Title = {Categorical Concepts for Parameterized Partial Specifications},
Author = {Cla{\ss}en, I. and {Gro{\ss}e--Rhode}, M. and Wolter, U.},
Institution = {Technische Universit\"at Berlin, FB Informatik},
Year = {1992},
Number = {92--42}
}
@InProceedings{CL95a,
Title = {Scheme Evolution in Object--Oriented Models},
Author = {I. Cla{\ss}en and M. L{\"o}we},
Booktitle = {ICSE--17 Workshop on Formal Methods Application in Software Engineering Practice},
Year = {1995},
Address = {Seattle, Washington},
Editor = {M. Wirsing},
Month = {April}
}
@InProceedings{CL95,
Title = {Scheme evolution in object oriented models: {A} graph transformation approach},
Author = {Cla{\ss}en, I. and L{\"o}we, M.},
Booktitle = {Proc. Workshop on Formal Methods at the ISCE'95, Seattle (U.S.A.)},
Year = {1995}
}
@TechReport{CLWW95,
Title = {Algebraic {S}emantics for {O}bject--oriented {M}odelling},
Author = {I. Cla{\ss}en and M. L{\"o}we and S. Wa{\ss}erroth and J. Wortmann},
Institution = {Technische {U}niversit{\"a}t {B}erlin},
Year = {1995},
Number = {95--10}
}
@InProceedings{CLWW94,
Title = {{Static and Dynamic Semantics of Entity-Relationship Models based on Algebraic Methoods}},
Author = {Cla{\ss}en, I. and L{\"o}we, M. and Wa{\ss}erroth, S. and Wortmann, J.},
Booktitle = {Proceedings of the IFIP-World Congress \& GI Fachgespr{\"a}ch ``Integration of Semiformal and Formal Methods in Software Engineering''},
Year = {1994},
Month = {September},
Note = {(also: internal report at the TU Berlin)}
}
@Article{CLW+94,
Title = {Static and Dynamic Semantics of {E/R} Models based on Algrabraic Methods},
Author = {Cla{\ss}en, I. and L{\"o}we, M. and Wasserroth, S. and Wortmann, J.},
Journal = {Integration von semiformalen und formalen {M}ethoden f{\"u}r die Spezifikation von Softwaresystemen, Springer Verlag, Informatik Aktuell (B.Wolfinger, ed.)},
Year = {1994},
Pages = {2 - 9}
}
@PhdThesis{Cla93,
Title = {Compositionality of Application Oriented Structuring Mechanisms for Algebraic Specification Languages with Initial Semantics},
Author = {I. {Cla\ss en}},
School = {Technische Universit\"at Berlin},
Year = {1993}
}
@Unpublished{Cla92a,
Title = {{ACT} System -- User Manual},
Author = {I. {Cla\ss en}},
Note = {Draft Version},
Month = {April},
Year = {1992}
}
@Unpublished{Cla92b,
Title = {Using {SMILE} in the {ACT} System},
Author = {I. {Cla\ss en}},
Note = {Draft Version},
Month = {May},
Year = {1992}
}
@Unpublished{Cla92c,
Title = {The {ACT} System Prototype Tool},
Author = {I. {Cla\ss en}},
Note = {Draft Version},
Month = {May},
Year = {1992}
}
@TechReport{Cla92d,
Title = {Towards Partial Algebra Semantics for Data Types in {LOTOS}},
Author = {I. {Cla\ss en}},
Institution = {LOTOSPHERE},
Year = {1992},
Number = {Lo/WP1/T1.4/TUB/N0008/V1}
}
@TechReport{Cla91a,
Title = {A Conceptual Framework for the Revision of {ACT ONE}},
Author = {I. {Cla\ss en}},
Institution = {LOTOSPHERE},
Year = {1991},
Number = {Lo/WP1/T1.4/TUB/N0002/V2}
}
@TechReport{Cla91b,
Title = {Proposal for a new Structure for Data Type Specifications with Generation of User Operations},
Author = {I. {Cla\ss en}},
Institution = {LOTOSPHERE},
Year = {1991},
Number = {Lo/WP1/\-T1.4/\-TUB/\-N0004/V2}
}
@InProceedings{Cla89,
Title = {Revised {ACT ONE}: Categorical Constructions for an Algebraic Specification Language},
Author = {I. {Cla\ss en}},
Booktitle = {Categorical Methods in Computer Science},
Year = {1989},
Pages = {124--141},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@TechReport{Cla88,
Title = {{S}emantik der revidierten {V}ersion der algebraischen {S}pe\-zi\-fi\-ka\-tions\-spra\-che {ACT ONE}},
Author = {I. {Cla\ss en}},
Institution = {Technische Universit\"at Berlin},
Year = {1988},
Number = {88/24}
}
@TechReport{Cla88a,
Title = {{A}lgebraische {G}rundlagen der {T}ermersetzung mit bedingten {G}leichungen},
Author = {I. {Cla\ss en}},
Institution = {Technische Universit\"at Berlin},
Year = {1988},
Number = {88/04}
}
@TechReport{Cla91c,
Title = {Towards a Conceptual Model for the Environment of the Algebraic Specification Language {ACT ONE}},
Author = {I. {Cla\ss en} and M. Gogolla},
Institution = {Technische Universit\"at Berlin},
Year = {1991},
Number = {91/11}
}
@TechReport{CL90,
Title = {Algebraic Development of a Syntax Directed Editor},
Author = {I. {Cla\ss en} and M. {L\"owe}},
Institution = {Technische Universit\"at Berlin},
Year = {1990},
Number = {90/37}
}
@TechReport{Con95,
Title = {Anwendung algebraischer {G}raphtransformationen auf ausgew\"ahlte {P}robleme der {W}issensrepr\"asentation und --verarbeitung},
Author = {Conrad, M.},
Institution = TUB,
Year = {1995},
Number = {95-11}
}
@Unpublished{CDG+94,
Title = {{Spe\-zi\-fi\-zieren mit Graph\-trans\-for\-ma\-tion\-en und Petri\-netz\-en am Bei\-spiel eines Graph-Edi\-tier- und Trans\-for\-ma\-tions-Systems}},
Author = {Conrad, M. and Demuth, J. and Gajewsky, M. and Holl, R. and Rudolf, M. and Weber, S.},
Note = {students project report},
Month = {May},
Year = {1994}
}
@TechReport{CGH+95,
Title = {{G}raphische {S}pezifikation ausgew{\"a}hlter {T}eile von {AGG} - einem algebraischen {G}raphgrammatiksystem},
Author = {Conrad, M. and Gajewsky, M. and Holl-Biniasz, R. and Rudolf, M. and Demuth, J. and Weber, S. and R. Heckel and J. M{\"u}ller and G. Taentzer and A. Wagner},
Institution = {TU-Berlin},
Year = {1995},
Number = {95-7}
}
@Article{Cor99,
Title = {An Overview of the Distributed System Classification and Integration Framework {DeCIF}},
Author = {Cornelius, F.},
Journal = BEATCS,
Year = {1999},
Month = {February},
Volume = {67}
}
@PhdThesis{Cor98,
Title = {{A Semantical Reference Model for the Integration of Different Dimensions of Distributed System Specifications}},
Author = {Cornelius, F.},
School = {Technische Universit\"at Berlin},
Year = {1998}
}
@Misc{Cor90a,
Title = {Fallstudie f{\"u}r den {B}ehaviour-{A}nsatz algebraischer {S}pezifikationen (in {G}erman)},
Author = {Cornelius, F.},
HowPublished = {Studienarbeit (TU Berlin)},
Year = {1990}
}
@MastersThesis{Cor90b,
Title = {Behaviour-{A}ns{\"a}tze f{\"u}r algebraische {M}odul-{S}pezifikationen (in {G}erman)},
Author = {Cornelius, F.},
School = {TU Berlin},
Year = {1990}
}
@Article{CBEO99,
Title = {{Abstract and behaviour module specifications}},
Author = {Cornelius, F. and Baldamus, M. and Ehrig, H. and Orejas, F.},
Journal = {Mathematical Structures in Computer Science},
Year = {1999},
Pages = {21-62},
Volume = {9}
}
@Article{CEOB99,
Title = {Abstract and Behaviour Module Specifications},
Author = {Cornelius, F. and Ehrig, H. and Orejas, F. and Baldamus, M.},
Journal = {MSCS},
Year = {1999},
Pages = {21--62},
Volume = {9}
}
@InCollection{CHL95,
Title = {The {K}{\sc orso} {C}ase {S}tudy for {S}oftware {E}ngineering with {F}ormal {M}ethods: {A} {M}edical {I}nformation {S}ystem},
Author = {Cornelius, F. and Hu{\ss}mann, H. and L{\"o}we, M.},
Booktitle = {{KORSO}: Methods, Languages, and Tools for the Construction of Correct Software},
Publisher = Springer,
Year = {1995},
Editor = {Broy, M. and J{\"a}hnichen, S.},
Note = {also appeared as technical report 94-5, TU Berlin},
Pages = {417-445},
Series = lncs,
Volume = {1009}
}
@TechReport{CHL94,
Title = {{The {\sc Korso} Case Study for Software Engineering with Formal Methods: A Medical Information System}},
Author = {Cornelius, F. and Hu{\ss}mann, H. and L{\"o}we, M.},
Institution = {{FB Informatik, TU Berlin}},
Year = {1994},
Number = {94--5}
}
@TechReport{CKL93,
Title = {Ein {F}allbeispiel f\"ur {K}{O}{R}{S}{O}: {I}st--{A}nalyse {H}{D}{M}{S}-{A}},
Author = {Cornelius, Felix and Klar, Marcus and L{\"o}we, Michael},
Institution = TUB,
Year = {1993},
Number = {93-28}
}
@Unpublished{CEH95,
Title = {Notes on Loose Semantics, Parameterized Specifications and Constraints for Typed Graph Grammars},
Author = {Corradini, A. and Ehrig, H. and Heckel, R.},
Note = {Internal Report, TU Berlin},
Year = {1995}
}
@InProceedings{CEL+96,
Title = {The Category of Typed Graph Grammars and their Adjunction with Categories of Derivations},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Padberg, J.},
Booktitle = {5th Int.\ Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94},
Year = {1996},
Pages = {56-74},
Publisher = Springer,
Series = lncs,
Volume = {1073}
}
@InProceedings{CELMP94,
Title = {Functorial Semantics for Safe Graph Grammars Using Prime Algebraic Domains and Event Structures},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Padberg, J.},
Booktitle = {Proc. 5th Int. Workshop on Graph Transformation, Williamsburg, Virgina, USA},
Year = {1994},
Pages = {120--126}
}
@InProceedings{CELMP94a,
Title = {Typed Graph Grammars and Their Adjunction with Categories of Derivations},
Author = {A. Corradini and H. Ehrig and M. L{\"o}we and U. Montanari and J. Padberg},
Booktitle = {Proc. 5th Int. Workshop on Graph Transformations, Williamsburg, Virginia, USA},
Year = {1994}
}
@InProceedings{CELMR94,
Title = {An Event Structure Semantics for Safe Graph Grammars},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Rossi, F.},
Booktitle = {Proc. PROCOMET'94, IFIP TC2 Working Conf., San Miniato 1994},
Year = {1994},
Pages = {417--439},
Publisher = {IFIP TCS}
}
@InProceedings{CELMR94a,
Title = {Abstract Graph Derivations in the Double Pushout Approch},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Rossi, F.},
Booktitle = {Proc. Graph Grammar Workshop Dagstuhl 93},
Year = {1994},
Pages = {86--103},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@InProceedings{CELMR94b,
Title = {Note on Standard Representation of Graphs and Graph Derivations},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Rossi, F.},
Booktitle = {Proc. Graph Grammar Workshop Dagstuhl 93},
Year = {1994},
Pages = {104--118},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@TechReport{CELMR92,
Title = {Note on Standard Representation of Graphs and Graph Derivations},
Author = {Corradini, A. and Ehrig, H. and L{\"o}we, M. and Montanari, U. and Rossi, F.},
Institution = TUB,
Year = {1992},
Number = {92-25}
}
@InProceedings{CEL+94c,
Title = {An event structure semantics for safe graph grammars},
Author = {Corradini, A. and Ehrig, H. and L\"owe, M. and Montanari, U. and Rossi, F.},
Booktitle = {{Programming Concepts, Methods and Calculi}},
Year = {1994},
Editor = {Olderog, E.-R.},
Note = {IFIP Transactions A-56},
Publisher = {North-Holland}
}
@InCollection{CGH98,
Title = {Structured transition systems as lax coalgebras},
Author = {Corradini, A. and {Gro{\ss}e-Rhode}, M. and Heckel, R.},
Booktitle = {Proc. First Workshop on Coalgebraic Methods in Computer Science (CMCS'98)},
Publisher = {Elsevier Science},
Year = {1998},
Editor = {Jacobs, B. and Moss, L. and Reichel, H. and Rutten, J.},
Pages = {23--42},
Series = entcs,
Volume = {11},
Url = {http://www.elsevier.nl:80/cas/tree/store/tcs/free/noncas/pc/volume11.htm}
}
@InCollection{CGH98b,
Title = {{An Algebra of Graph Derivations using Finite (Co--) Limit Double Theories}},
Author = {Corradini, A. and {Gro{\ss}e--Rhode}, M. and Heckel, R.},
Booktitle = {Workshop on Algebraic Development Techniques (WADT'98), at ETAPS'98, Lisbon, April 1998},
Publisher = Springer,
Year = {1999},
Editor = {Fiadeiro, J. L.},
Pages = {91--105},
Series = lncs,
Volume = {1589}
}
@Article{CGH01,
Title = { A coalgebraic presentation of structured transition systems },
Author = {Corradini, A. and Grosse-Rhode, M. and Heckel, R. },
Journal = TCS,
Year = {2001},
Pages = {27 -- 55},
Volume = {260},
Keywords = {Algebraic Specification, Graph Transformation}
}
@InProceedings{CH95,
Title = {{A compositional Approach to Structuring and Refinement of Typed Graph Grammars}},
Author = {Corradini, A. and Heckel, R.},
Booktitle = {Proc. of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA'95)},
Year = {1995},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {2}
}
@InProceedings{CHH+06,
Title = {{Sesqui-Pushout Rewriting}},
Author = {Corradini, Andrea and Heindel, Tobias and Hermann, Frank and K{\"o}nig, Barbara},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Year = {2006},
Address = {Natal, Brazil},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Month = {September},
Pages = {30--45},
Publisher = Springer,
Series = lncs,
Volume = {4178},
Abstract = {Sesqui-pushout (sqpo) rewriting -- ''sesquiï¿½ï¿½ means ``one and a half'' in Latin -- is a new algebraic approach to abstract rewriting in any category. sqpo rewriting is a deterministic and conservative extension of double-pushout (dpo) rewriting, which allows to model ``deletion in unknown context'', a typical feature of single-pushout (spo) rewriting, as well as cloning. After illustrating the expressiveness of the proposed approach through a case study modelling an access control system, we discuss sufficient conditions for the existence of final pullback complements and we analyze the relationship between sqpo and the classical dpo and spo approaches. },
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2},
Keywords = {graph transformation approach, SPO rewriting, DPO rewriting, Sesqui Pushout},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/CHH+06.pdf}
}
@Article{CHS08,
Title = {Subobject {T}ransformation {S}ystems},
Author = {Corradini, Andrea and Hermann, Frank and Soboci{\'n}ski, Pawe\l},
Journal = {Applied {C}ategorical {S}tructures},
Year = {2008},
Month = {February},
Number = {3},
Pages = {389--419},
Volume = {16},
Abstract = {Subobject transformation systems STS are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pushout (DPO) approach. They can be considered as a simplified variant of DPO rewriting, acting in the distributive lattice of subobjects of a given object of an adhesive category. This setting allows a direct analysis of all possible notions of dependency between any two productions without requiring an explicit match. In particular, several equivalent characterizations of independence of productions are proposed, as well as a local Churchï¿½Rosser theorem in the setting of STS. Finally, we show how any derivation tree in an ordinary DPO grammar leads to an STS via a suitable construction and show that relational reasoning in the resulting STS is sound and complete with respect to the independence in the original derivation tree.},
Doi = {10.1007/s10485-008-9127-6},
Publisher = {Springer},
Url = {http://www.springerlink.com/content/1648jx522426p053/}
}
@InCollection{CMR+96,
Title = {Algebraic Approaches to Graph Transformation Part {I}: Basic Concepts and Double Pushout Approach},
Author = {Corradini, A. and Montanari, U. and Rossi, F. and Ehrig, H. and Heckel, R. and L{\"o}we, M.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph transformation, Volume 1: Foundations},
Publisher = {World Scientific},
Year = {1997},
Editor = {Rozenberg, G.},
Pages = {163-246}
}
@InCollection{CMR+97,
Title = {{Algebraic Approaches to Graph Transformation {I}: Basic Concepts and {D}ouble Pushout Approach}},
Author = {Corradini, A. and Montanari, U. and Rossi, F. and Ehrig, H. and Heckel, R. and L{\"o}we, M.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations},
Publisher = {World Scientific},
Year = {1997},
Chapter = {3},
Editor = {Rozenberg, G.},
Pages = {163--245}
}
@TechReport{CMR+96a,
Title = {Algebraic Approaches to Graph Transformation Part {I}: Basic Concepts and Double Pushout Approach},
Author = {Corradini, A. and Montanari, U. and Rossi, F. and Ehrig, H. and Heckel, R. and L{\"o}we, M.},
Institution = TUB,
Year = {1996},
Number = {96-17}
}
@InProceedings{CMREL91,
Title = {Graph Grammars and Logic Programming},
Author = {Corradini, A. and Montanari, U. and Rossi, F. and Ehrig, H. and L{\"o}we, M.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Editor = {Ehrig, H. and Kreowski, H.-J. and Rozenberg, G.},
Pages = {221--237},
Publisher = Springer,
Series = lncs,
Volume = {532}
}
@InProceedings{CW93,
Title = {Jungle rewriting: an Abstract Descrption of a Lazy Narrowing Maschine},
Author = {Corradini,A. and Wolz,D.},
Booktitle = {Proc. Graph Transformation in Computer Science},
Year = {1993},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@Article{CFGG91,
Title = {Towards a Formally Based Component Description Language --- A Foundation for Reuse},
Author = {J. Cramer and W. Fey and M. Goedicke and M. {Gro{\ss}e--Rhode}},
Journal = {Structured Programming},
Year = {1991},
Pages = {91--110},
Volume = {12}
}
@Misc{ESPRESS,
Title = {{E}{S}{P}{R}{E}{S}{S}: {I}ngenieurm{\"a}{\"s}ige {E}ntwicklung sicherheitsrelevanter eingebetteter {S}ysteme, {BMBF}-{P}rojektantrag, {B}erlin },
Author = { {Daimler-Benz AG Forschung Systemtechnik, Berlin} and {Robert Bosch GmbH Forschung und Vorausentwicklung, Stuttgart} and {Fraunhofer-Einrichtung f{\"u}r Software- und Systemtechnik ISST, Berlin} and {Gesellschaft f{\"u}r Mathematik und Datenverarbeitung FIRST, Berlin} and {Technische Universit{\"a}t Berlin}},
Year = {1994},
Key = {ESP94}
}
@TechReport{LBEEPT05,
Title = {{Attributed Graph Transformation with Node Type Inheritance: Long Version}},
Author = {{de Lara}, J. and Bardohl, R. and Ehrig, H. and Ehrig, K. and Prange, U. and Taentzer, G.},
Institution = {TU Berlin},
Year = {2005},
Number = {2005/03}
}
@InProceedings{DGLW01,
Title = {{The Petri Net Baukasten: Second Installment}},
Author = {Dehnert, J. and Gajewsky, M. and Lembke, S. and Weber, H.},
Booktitle = {Proc. Uniform Approaches to Graphical Process Specification Techniques (UniGra), ETAPS 2001 Satellite Workshop},
Year = {2001},
Address = {Genova, Italy},
Editor = {H. Ehrig, C. Ermel, J. Padberg},
Series = entcs,
Volume = {44, (4)},
Url = {http://www.elsevier.nl/gej-ng/31/29/23/73/28/show/Products/notes/index.htt}
}
@Misc{DE76,
Title = {Mehrdimensionale {S}prachen},
Author = {Denert, E. and Ehrig, H.},
Note = {Vorlesungsskript, Technische Universit{\"a}t Berlin, Fachbereich Kybernetik},
Year = {1976},
Institution = FB13
}
@Article{BHE09b,
Title = {Verification of Architectural Refactorings: Rule Extraction and Tool Support},
Author = {Denes Bisztray, Reiko Heckel and Hartmut Ehrig},
Journal = {Electronic Communications of the EASST},
Year = {2009},
Volume = {16},
Abstract = {Software in use needs to be adapted to changing requirements, otherwise it becomes obsolete. Often, this involves changing the architecture of the system. To avoid the introduction of unwanted or removal of desired behaviour, these changes need verification. While verifying large systems consumes considerable resources, the verification of only the changed parts can, under certain conditions, give the required assurance. This opens the possibility of creating formally verified, reusable refactoring patterns. However, a mechanism for extracting such patterns is needed. To address this problem, a theoretical framework is presented that allow to formally reason about the rule extraction process. In order to harness the theoretical results, a visual editor and tool chain are introduced to aid developers in extracting refactoring rules and prove their behavioural correctness.},
ISBN = {ISSN 1863-2122},
Owner = {Claudia},
Timestamp = {2009.12.27},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/26}
}
@TechReport{PNT99tr,
Title = {{Initial Realization of the \"< Petri Net Baukasten\">}},
Author = {{DFG-Forschergruppe \textsc{Petri Net Technology}}},
Institution = {Humboldt-Universit{\"a}t zu Berlin},
Year = {1999},
Month = oct,
Number = {129},
Type = {Informatik-Berichte}
}
@Unpublished{Did92,
Title = {{ACT ONE{\underline{C}}: Eine Erweiterung der Spezifikationssprache ACT ONE im Hinblick auf kompakte Darstellungen von Spezifikationen}},
Author = {K. Didrich},
Note = {Diplomarbeit},
Year = {1992}
}
@Unpublished{Did91,
Title = {{B}eschreibung und {V}ergleich der algebraischen {S}pezifikationssprachen {ACT TWO}, {OBJ3}, {OBSCURE} und {PLUSS}},
Author = {K. Didrich},
Note = {Studienarbeit},
Year = {1991}
}
@TechReport{DEGR87,
Title = {Projektionsr{\"a}ume und Projektionsalgebren: Eine Algebraisierung von ultrametrischen R{\"a}umen},
Author = {Dimitrovici, C. and Ehrig, H. and Grosse-Rhode, M. and Rieckhoff, C.},
Institution = TUB,
Year = {1987},
Number = {87-7}
}
@TechReport{DH91,
Title = {Transformation und {Komposition} von {P/T-Netzen} unter {Erhaltung} wesentlicher {Eigenschaften}},
Author = {Dimitrovici, C. and Heise, A.},
Institution = {Technical University of Munich},
Year = {1991},
Month = {jul.},
Number = {342/6/91}
}
@InProceedings{DH90,
Title = {{C}omposition of {A}lgebraic {H}igh-{L}evel {N}ets},
Author = {Dimitrovici, C. and Hummert, U.},
Booktitle = {Proc. of the 7th ADT-Workshop},
Year = {1990},
Address = {Wusterhausen/Dosse},
Publisher = Springer,
Series = lncs,
Volume = {534}
}
@InProceedings{DHP91,
Title = {Composition and Net Properties of Algebraic High-Level Nets},
Author = {Dimitrovici, C. and Hummert, U. and Petrucci, L.},
Booktitle = {Advances of Petri Nets},
Year = {1991},
Publisher = Springer,
Series = lncs,
Volume = {524}
}
@MastersThesis{Din92,
Title = {{Kanonische Ableitungssequenzen im Single-Pushout Ansatz f"ur Graphtransformationen}},
Author = {Dingel, J{\"u}rgen.},
School = FB13,
Year = {1992},
Type = {Diplomarbeit}
}
@InProceedings{DXC+11,
Title = {From State- to Delta-based Bidirectional Model Transformations: The Symmetric Case},
Author = {Zinovy Diskin and Yingfei Xiong and Krzysztof Czarnecki and Hartmut Ehrig and Frank Hermann and Fernando Orejas},
Booktitle = {ACM/IEEE 14th Int. Conf. on Model Driven Engineering Languages and Systems (MoDELS'11)},
Year = {2011},
Note = {To Appear.},
Publisher = {ACM / IEEE},
Owner = {Claudia},
Timestamp = {2011.07.17}
}
@Misc{DFGSPP97,
Title = {{Integration von Techniken der Software Spezifikation f\"ur ingenieuwissenschaftliche Anwendungen}},
Author = {{Ehrig et al.}, H.},
HowPublished = {{Antrag f\"ur ein Schwerpunkprogramm an die DFG, http://www.user.tu-berlin.de/lieske/tfs/SPP/index.html}},
Note = {(akzeptiert als DFG-SPP von Januar 1998 bis Dezember 2003)},
Year = {1997}
}
@InProceedings{Ehr03,
Title = {{Behavior and Instantiation of High-Level Net Processes}},
Author = {Ehrig, H.},
Booktitle = {Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA)},
Year = {2003},
Address = {Warsaw, Poland},
Editor = {Bardohl, R. and Ehrig, H.},
Pages = {16},
Publisher = {Elsevier},
Series = entcs,
Volume = {82 (7)},
Abstract = {Processes for high-level nets N are often defined as processes of the low-level net Flat(N) which is obtained from N via the well-known flattening construction. This low-level notion of processes for high-level nets, however, is not really adequate, because the high-level structure is completely lost. For this reason we have introduced in a previous paper a new notion of high-level net processes for high-level nets which captures the high-level structure. The key notion is a high-level occurrence net K, which generalizes the well-known notion of occurrence nets from low-level to high-level nets. In contrast to the low-level case we consider high-level occurrence nets together with a set of initial markings of the input places. In this paper we show under which conditions the behavior of low-level occurrence nets and processes can be generalized to the high-level case. A key notion is the instantiation L of a high-level occurrence net K, where L is a low-level subnet of the flattening Flat(K) with isomorphic net structures of L and K. One of our main results characterizes under which conditions a high-level occurrence net - and hence a high-level net process - has unique and nonoverlapping instantiations and can be represented by the union of all its instantiations. },
ISSN = {ISSN: 0304-3975},
Keywords = {Petri Nets, Net Processes, High-Level Nets, Net Semantics},
Url = {http://www.elsevier.com/gej-ng/31/29/23/133/48/show/Products/notes/index.htt#002}
}
@InProceedings{Ehr83b,
Title = {{ Aspects of Concurrency in Graph Grammars}},
Author = {Ehrig, H.},
Booktitle = {Graph Grammars and their Application to Computer Science and Biology},
Year = {1983},
Editor = {Ehrig, H. and Nagl, M. and Rozenberg, G.},
Pages = {82--101},
Publisher = Springer,
Series = lncs,
Volume = {153}
}
@Article{Ehr10,
Title = {{From Separate Formal Specifications to Certified Integrated Visual Modelling Techniques and Environments}},
Author = {Ehrig, Hartmut},
Journal = {ECEASST},
Year = {2010},
Pages = {1--5},
Volume = {30},
Booktitle = {Proc. Int. Coll. on Graph and Model Transformation (GraMoT 2010)},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Article{Ehr74a,
Title = {{Kategorielle Theorie von Automaten}},
Author = {Ehrig, H.},
Journal = {BI-Buch: \"Uberblicke Mathematik VII},
Year = {1974},
Pages = {167--218},
Editor = {Laugwitz, D.}
}
@InProceedings{Ehr83c,
Title = {{Concurrent Transformations of Graphs and Relational Structures}},
Author = {Ehrig, H.},
Booktitle = {Proc. WG 1983, Int. Workshop on Graphtheoretic Concepts in Computer Science, Osnabr\"uck},
Year = {1983},
Editor = {Nagl, M. and Perl, J.},
Pages = {76--88},
Publisher = {Trauner Verlag}
}
@InCollection{Ehr04,
Title = {{On the Relevance of High-Level Net Processes}},
Author = {Ehrig, H.},
Booktitle = {Current Trends in Theoretical Computer Science: The Challenge of the New Century},
Publisher = {World Scientific, Singapore etc. 2004},
Year = {2004},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {89-95}
}
@InCollection{Ehr04a,
Title = {{Bigraphs Meet Double Pushouts}},
Author = {Ehrig, H.},
Booktitle = {Current Trends in Theoretical Computer Science: The Challenge of the New Century},
Publisher = {World Scientific, Singapore etc. 2004},
Year = {2004},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {27-41}
}
@InCollection{Ehr01a,
Title = {{On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000}},
Author = {Ehrig, H.},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century },
Publisher = {World Scientific, Singapore etc. 2001},
Year = {2001},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {131--133}
}
@InProceedings{Ehr93a,
Title = {{Combined Algebraic Specification Techniques for Concurrent and Distributed Systems}},
Author = {Hartmut Ehrig},
Booktitle = {Proc. GI-Annual Meeting, Dresden},
Year = {1993},
Editor = {Reichel, H.},
Pages = {528--533},
Publisher = {Informatik, Wirtschaft, Gesellschaft}
}
@InCollection{Ehr93b,
Title = {{Algebraic Specification}},
Author = {Ehrig, H.},
Booktitle = {Current Trends in Theoretical Computer Science},
Publisher = {World Scientific, Singapore etc.},
Year = {2001},
Chapter = {2},
Editor = {Rozenberg, G. and Salomaa, A.},
Pages = {49--222}
}
@Article{Ehr04b,
Title = {{Attributed Graphs and Typing: Relationship between Different Representations}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {2004},
Pages = {175-190},
Volume = {82},
Abstract = {Attributed graphs and typing play an important role in theory and applications of graph grammars, graph transformation systems, visual languages and metamodelling. Attributed graphs can be represented basically as pairs of graphs and algebras on one hand and as algebras of suitable algebraic signatures on the other hand. In this note the different notions are compared on the syntactical and on the semantical level. Two different kinds of algebraic signatures for attributed algebras are discussed leading to different results on both levels. In the case of attributed graph signatures the corresponding category of algebras is isomorphic to the category of typed attributed graphs, while we have only a non-surjective functor in the more general case of attributed algebras for graph structure signatures. An overview of all results is given in the last section of this paper.},
Keywords = {attributed graphs, typing, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/Ehr04b.pdf}
}
@Article{Ehr04c,
Title = {{Integration of Specification Techniques for Applications in Engineering 1998-2004}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {2004},
Keywords = { specification techniques, applications in engineering}
}
@Article{Ehr04e,
Title = {{Behaviour and Instantiation of High-Level Petri Net Processes}},
Author = {Ehrig, H.},
Journal = {Fundamenta Informaticae},
Year = {2004},
Pages = {1--37},
Volume = {64},
Keywords = {Petri nets, process, behavior, high-level net}
}
@Article{Ehr03a,
Title = {{On the Relevance of High-Level Net Processes}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {2003},
Month = {February},
Pages = {64--68},
Volume = {79},
Abstract = {The notion of nondeterministic and deterministic processes based on occurrence nets is an essential concept to capture the non-sequential truly concurrent behavior of Petri nets. This concept is well-known for elementary nets and safe place-transition nets and has been generalized to other low-level net classes. For high-level nets, however, the standard technique to define processes is to consider them as processes of the low-level net $Flat(N)$ which is obtained from $N$ via the well-known flattening construction. This low-level notion of processes for high-level nets, however, is not really adequate, because the high-level structure using data types is completely lost. For this reason we have introduced a new notion of high-level net processes for high-level nets which captures the high-level structure. The key notion is a high-level occurrence net $K$, which generalizes the well-known notion of occurrence nets from low-level to high-level nets. },
Keywords = {Petri Nets, High-Level Nets, Net Process, Net Semantics},
Url = {http://www.cs.tu-berlin.de/%7Eehrig/public/eEhr03a.ps.gz}
}
@TechReport{Ehr03c,
Title = {{Attributed Graphs and Typing: Relationship between Different Representations}},
Author = {H. Ehrig},
Institution = {Technical University of Berlin, Dept. of Computer Science},
Year = {2003},
Month = {September},
Number = {2003--16},
ISSN = {ISSN 1436-9915}
}
@TechReport{Ehr03d,
Title = {{Behaviour and Instantiation of High-Level Net Processes. Full Technical Version}},
Author = {Ehrig, H.},
Institution = TUB,
Year = {2003},
Number = {2003-05},
Abstract = {The notion of nondeterministic and deterministic processes based on occurrence nets is an essential concept to capture the non-sequential truly concurrent behavior of Petri nets. This concept is well-known for elementary nets and safe place-transition nets and has been generalized to other low-level net classes. For high-level nets, however, the standard technique to define processes is to consider them as processes of the low-level net $Flat(N)$ which is obtained from $N$ via the well-known flattening construction. This low-level notion of processes for high-level nets, however, is not really adequate, because the high-level structure using data types is completely lost. For this reason we have introduced a new notion of high-level net processes for high-level nets which captures the high-level structure. The key notion is a high-level occurrence net $K$, which generalizes the well-known notion of occurrence nets from low-level to high-level nets. },
ISSN = {ISSN 1436-9915},
Keywords = {Petri Nets, High-Level Nets, Net Process, Net Semantics},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_05.ps}
}
@Article{Ehr02,
Title = {{Bigraphs meet Double Pushouts}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {2002},
Pages = {72-85},
Volume = {78},
Url = {http://www.cs.tu-berlin.de/%7Emoswald/public/bigraphs-dpo.ps.gz}
}
@Article{Ehr02a,
Title = {{Review of Algebraic Specification and Component Techniques at TU Berlin}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {2002},
Pages = {84-87},
Volume = {76}
}
@TechReport{Ehr01,
Title = {{From Algebraic Module Specifications to Component Concepts and Integrated Modeling Techniques}},
Author = {Ehrig, H.},
Institution = {Technische Universit\"at Berlin},
Year = {2001},
Note = {ISSN 1436-9915},
Number = {2001--21},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/report_01_21.ps.gz}
}
@Article{Ehr01b,
Title = {{On the Roots, Birth and Childhood of ETAPS}},
Author = {Ehrig, H.},
Journal = BEACTS,
Year = {2001},
Pages = {58--60},
Volume = {74}
}
@Article{Ehr01c,
Title = {{A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation}},
Author = {Ehrig, H.},
Journal = BEACTS,
Year = {2001},
Pages = {93--96},
Volume = {75}
}
@Article{Ehr00,
Title = {{On the Role of Formal Specification Techniques: From TAPSOFT 1985 to ETAPS 2000}},
Author = {Ehrig, H.},
Journal = BEACTS,
Year = {2000},
Pages = {90--91},
Volume = {71}
}
@Article{Ehr95,
Title = {Introduction to {COMPUGRAPH}},
Author = {Ehrig, H.},
Journal = {Proc. of SEGRAGRA'95 ``Graph Rewriting and Computation''},
Year = {1995},
Volume = {2},
Series = entcs,
Url = {http://www.elsevier.nl/locate/entcs/volume2.html}
}
@InProceedings{Ehr94,
Title = {Algebraic Specification Concepts and Languages for Modular Software Systems},
Author = {Ehrig, H.},
Booktitle = {Proc. Shanghai Workshop on Software Technology},
Year = {1994},
Publisher = {Jiao Tong University}
}
@Article{Ehr94a,
Title = {{FLEX}: A Flexible Extension and Integration Concept for Software Development in {KORSO} and {COMPASS}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {1994},
Pages = {188--202},
Volume = {54}
}
@TechReport{Ehr93,
Title = {{FLEX}: {A} {F}lexible {E}xtension and {I}ntegration {C}oncept for {S}oftware Development in {KORSO} and {COMPASS}},
Author = {Hartmut Ehrig},
Institution = {TU Berlin, FB Informatik},
Year = {1993},
Month = {May},
Number = {93--17},
Type = {Report}
}
@Article{Ehr90,
Title = {{ESF-Concepts Linked with Algebraic Module Specifications}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {1990},
Pages = {138--144},
Volume = {41}
}
@Article{Ehr90a,
Title = {{Linking Schemes and Module Specifications}},
Author = {Ehrig, H.},
Journal = BEATCS,
Year = {1990},
Pages = {136--139},
Volume = {42}
}
@InProceedings{Ehr89,
Title = {A Categorical Concept of Constraints for Algebraic Specifications},
Author = {Ehrig, H.},
Booktitle = {Categorical Methods in Computer Science - with Aspects from Topology},
Year = {1989},
Pages = {1--15},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@InCollection{Ehr89a,
Title = {Concepts and Compatibility Requirements for Implementations and Transformations of Specifications},
Author = {Ehrig, H.},
Booktitle = {Algebraic Specification Column Part 6},
Publisher = {EATCS},
Year = {1989},
Pages = {79--92},
Volume = {38},
Journal = BEATCS
}
@InProceedings{Ehr89b,
Title = {On Recent Trends in Algebraic Specification},
Author = {Ehrig, H.},
Booktitle = {Invited Paper ICALP'89},
Year = {1989},
Pages = {263--288},
Publisher = Springer,
Series = lncs,
Volume = {372}
}
@InProceedings{Ehr89c,
Title = {{Algebraic Specification of Modeules and Modular Software Systems within the Framework of Specification Logics}},
Author = {Ehrig, H.},
Booktitle = {Proc. 1st Maghr. Conference on Software Engineering and Artificial Intelligence, Constantine},
Year = {1989},
Pages = {79--92}
}
@TechReport{Ehr89d,
Title = {Algebraic specification of modules and modular software systems within the framework of specification logics},
Author = {Ehrig, H.},
Institution = {TU Berlin},
Year = {1989},
Number = {89-17}
}
@InProceedings{Ehr85,
Title = {Introduction},
Author = {Ehrig, H.},
Booktitle = {Proc. ETAPSOFT, Vol. 1},
Year = {1985},
Pages = {1--3},
Publisher = Springer,
Series = lncs,
Volume = {185}
}
@InProceedings{Ehr84,
Title = {Combining initial and loose algebraic specification methods including compositionality and modules},
Author = {Ehrig, H.},
Booktitle = {Proc. Workshop on Formal Software Development, Nyborg},
Year = {1984},
Publisher = {University of Copenhagen}
}
@TechReport{Ehr84a,
Title = {An algebraic specification concept for modules (draft version)},
Author = {Ehrig, H.},
Institution = TUB,
Year = {1984},
Number = {84-04}
}
@TechReport{Ehr83,
Title = {Development, specification and semantics of strictly modular system},
Author = {Ehrig, H.},
Institution = TUB,
Year = {1983},
Number = {83-23}
}
@InProceedings{Ehr83a,
Title = {Development, specification and semantics of strictly modular system},
Author = {Ehrig, H.},
Booktitle = {Lect. Not. Seminar on State of the Art and Perspectives of Software Technology in Europe, U.S.A, and Japan, ICC Berlin},
Year = {1983},
Publisher = {ICC Berlin}
}
@InProceedings{Ehr81,
Title = {Algebraic theory of parameterized specifications with requirements},
Author = {Ehrig, H.},
Booktitle = {Proc. CAAP '81},
Year = {1981},
Pages = {1--24},
Publisher = Springer,
Series = lncs,
Volume = {112}
}
@InCollection{Ehr79,
Title = {{Introduction to the Algebraic Theory of Graph Grammars (A Survey)}},
Author = {Ehrig, H.},
Booktitle = {Graph Grammars and their Application to Computer Science and Biology},
Publisher = Springer,
Year = {1979},
Pages = {1--69},
Series = lncs,
Volume = {73}
}
@InProceedings{Ehr77,
Title = {Embedding Theorems in the Algebraic Theory of Graph Grammars},
Author = {Ehrig, H.},
Booktitle = {Fundamentals of Computation Theory {\cdot} Proceedings of the 1977 International FCT-Conference},
Year = {1977},
Pages = {245--255},
Publisher = Springer,
Series = lncs,
Volume = {56}
}
@Article{Ehr74,
Title = {F-{M}orphisms},
Author = {Ehrig, H.},
Journal = {Math. Nachr.},
Year = {1974},
Pages = {75--93},
Volume = {59}
}
@PhdThesis{Ehr71,
Title = {{\"Ubertragung universeller und spezieller Probleme in F-Morphismen-Darstellung}},
Author = {Ehrig, H.},
School = {Technische Universit\"at Berlin},
Year = {1971}
}
@Article{EA91,
Title = {{New Compatibility Results for Implementation s within the Initial Algebraic Approach}},
Author = {Ehrig, H. and Adametz, H.},
Journal = BEATCS,
Year = {1991},
Pages = {102-112},
Volume = {43}
}
@InProceedings{EA90,
Title = {{Linking Schemas and Module Specifications for Distributed Systems}},
Author = {Ehrig, H. and Arbib, M.},
Booktitle = {Proc. 2nd IEEE Workshop on Future Trends of Distributed Computing Systems},
Year = {1990},
Pages = {165--171},
Publisher = {IEEE Computing Society}
}
@InProceedings{EBHL88a,
Title = {Distributed parallelism of graph transformation},
Author = {Ehrig, H. and B{\"o}hm, P. and Hummert, U. and L{\"o}we, M.},
Booktitle = {13th Int.\ Workshop on Graph Theoretic Concepts in Computer Science},
Year = {1988},
Address = {Berlin},
Pages = {1--19},
Publisher = Springer,
Series = lncs,
Volume = {314}
}
@InProceedings{EBCO91,
Title = {Theory of Algebraic Module Specifications Including Behavioral Semantics and Constraints},
Author = {Ehrig, H. and Baldamus, M. and Cornelius, F. and Orejas, F.},
Booktitle = {Algebraic Methodology and Softwre Technology (AMAST), Iowa City},
Year = {1991},
Editor = {Nivat, M. and Rattray, C. and Rus, T. and Scollo, G.},
Pages = {145-172},
Publisher = {Springer Workshops in Computing 23}
}
@InProceedings{EBO92,
Title = {New concepts for amalgamation and extension in the framework of specification logics},
Author = {Ehrig, H. and Baldamus, M. and Orejas, F.},
Booktitle = {Proc. WADT-COMPASS-Workshop Dourdan, 1991},
Year = {1992},
Pages = {199--221},
Publisher = Springer,
Series = lncs,
Volume = {655}
}
@InProceedings{EBO91,
Title = {New concepts for amalgamation and extension in the framework of specification logics},
Author = {Ehrig, H. and Baldamus, M. and Orejas, F.},
Booktitle = {Proc. ADT-Workshop Durdan},
Year = {1991},
Address = {Durdan},
Pages = {199 -- 221},
Publisher = Springer,
Series = lncs,
Volume = {655}
}
@Article{EBO91a,
Title = {Amalgamation and {E}xtension in the {F}ramework of {S}pecification {L}ogics and {G}eneralized {M}orphisms},
Author = {Ehrig, H. and Baldamus, M. and Orejas, F.},
Journal = BEATCS,
Year = {1991},
Month = {june},
Note = {{A}lgebraic {S}pecification {C}olumn},
Pages = {129 -- 143},
Volume = {44}
}
@TechReport{EBO91b,
Title = {New Concepts for Amalgamation and Extension in the Framework of Specification Logics},
Author = {H. Ehrig and M. Baldamus and F. Orejas},
Institution = TUB,
Year = {1991},
Number = {91/05}
}
@InProceedings{EB94,
Title = {{S}pecification {T}echniques using {D}ynamic {A}bstract {D}ata {T}ypes and {A}pplication to {S}hipping {S}oftware},
Author = {Ehrig, H. and Bardohl, R.},
Booktitle = {Proc. of the International Workshop on Advanced Software Technology, Shanghai},
Year = {1994},
Pages = {70--85}
}
@InProceedings{EBC+96,
Title = {A New Integration Paradigm for Formal Specification of Safe Software Systems},
Author = {Ehrig, H. and Bardohl, R. and Cornelius, F. and Geisler, R. and {Gro{\ss}e-Rhode} and Padberg, J.},
Booktitle = {Proc. 10th Japan-Germany Forum on Information Technology},
Year = {1996},
Organization = {Gesellschaft f{\"u}r Mathematik und Datenverarbeitung}
}
@InCollection{EBF90,
Title = {Algebraic Concepts for Formal Specification and Transformation of Modular Software Systems},
Author = {Ehrig, H. and Boehm, P. and Fey, W.},
Booktitle = {Proc. 23rd Hawaii Int. Conf. on System Science, Kailua-Kona, Hawaii},
Publisher = {IEEE Comp. Sci. Press},
Year = {1990},
Pages = {153--164}
}
@InProceedings{EBK+05,
Title = {Object-Oriented Connector-Component Architectures},
Author = {Ehrig, H. and Braatz, B. and Klein, M. and Orejas, F. and P{\'e}rez, S. and Pino, E.},
Booktitle = {Proc. Second International Workshop on Formal Foundations of Embedded Software and Component-based Software Architectures (FESCA 2005)},
Year = {2005},
Pages = {123-151},
Volume = {141},
Abstract = {This paper presents an important extension of our contribution to FESCA '04, which presented a generic framework for connector architectures. These architectures were designed by components, consisting of a body specification and a set of export interfaces, and connectors, consisting of a body specification and a set of import interfaces plus connecting transformations in both cases. A major restriction of this framework was given by the assumption of non-overlapping connector interfaces. In order to make the generic framework for connector architectures more applicable, it is enriched by the possibility of handling overlapping connector interfaces. Fortunately, it is possible to extend the main results presented at FESCA '04 also to the new framework. Moreover, it is shown that the new framework can be applied to UML class diagrams, state machines and sequence diagrams as heterogeneous specification techniques. The resulting connector framework, including a concept for the composition of components and architectural reduction for UML specifications, is illustrated by a case study concerning the meta data management in Topic Maps. },
Issue = {3},
Keywords = {Modules and Interfaces, Components and Connectors, Object-Orientation },
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EBK+05.pdf}
}
@Article{ECB+91,
Title = {Algebraic Concepts for Software Development in {ACT ONE}, {ACT TWO} and {LOTOS}},
Author = {H. Ehrig and I. Cla{\ss}en and P. Boehm and W. Fey and M. Korff and M. L{\"owe}},
Journal = {Syst.\ Anal.\ Model.\ Simul.},
Year = {1991},
Note = {Also in: Informatik Fachberichte 212},
Number = {4/5},
Pages = {353--373},
Volume = {8}
}
@InProceedings{ECB+89,
Title = {Algebraic Concepts for Software Development in {ACT ONE}, {ACT TWO} and {LOTOS}},
Author = {H. Ehrig and I. Cla{\ss}en and P. Boehm and W. Fey and M. Korff and M. L{\"owe}},
Booktitle = {Informatik Fachberichte 212},
Year = {1989},
Pages = {201--224},
Publisher = Springer
}
@Article{EC90a,
Title = {{Overview of Algebraic Specification Environments and Tools}},
Author = {Ehrig, H. and Classen, I.},
Journal = BEACTS,
Year = {1990},
Pages = {172--181},
Volume = {40}
}
@Article{EC90b,
Title = {{Algebraic Specification of Software Systems}},
Author = {Ehrig, H. and Classen, I.},
Journal = BEACTS,
Year = {1990},
Pages = {145--153},
Volume = {41}
}
@Article{EC89,
Title = {{Overview of Algebraic Specification Languages}},
Author = {Ehrig, H. and Classen, I.},
Journal = BEACTS,
Year = {1989},
Pages = {103--111},
Volume = {39}
}
@InProceedings{EE05,
Title = {{Overview of Formal Concepts for Model Transformations based on Typed Attributed Graph Transformation}},
Author = {Ehrig, H. and Ehrig, K.},
Booktitle = {Proc. Int. Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Month = {September},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {152},
Abstract = {In this paper we give an overview of formal concepts for model transformations between visual languages based on typed attributed graph transformation. We start with a basic concept where visual languages are defined by attributed type graphs only and model transformations by basic typed attributed graph transformation systems. We continue with different kinds of extensions of the basic concepts taking into account application conditions, constraints, generating graph grammars and operational semantics. The main aim is to discuss formal correctness criteria for model transformations including syntactical correctness, functional behavior and semantical correctness. },
Keywords = {model transformation, typed attributed graph transformation},
Location = {Tallinn, Estonia},
Url = {http://www.sciencedirect.com/science/article/pii/S1571066106001356}
}
@InProceedings{EEE+07,
Title = {Information Preserving Bidirectional Model Transformations},
Author = {Hartmut Ehrig and Karsten Ehrig and Claudia Ermel and Frank Hermann and Gabriele Taentzer},
Booktitle = {Fundamental Approaches to Software Engineering},
Year = {2007},
Editor = {Matthew B. Dwyer and Ant\'{o}nia Lopes},
Pages = {72--86},
Publisher = Springer,
Series = lncs,
Volume = {4422},
Abstract = {Within model-driven software development, model transformation has become a key activity. It refers to a variety of operations modifying a model for various purposes such as analysis, optimization, and code generation. Most of these transformations need to be bidirectional to e.g. report analysis results, or keep coherence between models. In several application-oriented papers it has been shown that triple graph grammars are a promising approach to bidirectional model transformations. But up to now, there is no formal result showing under which condition corresponding forward and backward transformations are inverse to each other in the sense of information preservation. This problem is solved in this paper based on general results for the theory of algebraic graph transformations. The results are illustrated by a transformation of class models to relational data base models which has become a quasistandard example for model transformation.},
ISBN = {978-3-540-71288-6},
Keywords = {bidirectional model transformation, graph transformation, triple graph grammar, information-preserving},
Url = {http://www.springerlink.com/content/d3298714g2112360/}
}
@InProceedings{EEEP06,
Title = {{Construction and Correctness Analysis of a Model Transformation from Activity Diagrams to Petri Nets}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Padberg, J.},
Booktitle = {Proc. Intern. IMCAS Symposium on Mathematical Modelling (MathMod)},
Year = {2006},
Editor = {Troch, I. and Breitenecker, F.},
Publisher = {ARGESIM-Reports},
Abstract = {With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated analysis and verification in the software development process. In this paper we use the concept of typed attributed graph transformation to construct a model transformation from a simple version of activity diagrams to Petri nets. Moreover our approach allows a correctness analysis which shows that this model transformation has functional behavior and is syntactically correct. This is the basis to use well-known analysis and verification techniques of Petri nets also for activity diagrams. The model transformation has been implemented in the Tiger environment developed at TU Berlin. },
ISBN = {ISBN 3-901608-25-7},
Keywords = {graph transformation, model transformation, activity diagrams, Petri nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EEP06.pdf}
}
@InProceedings{EEEP08,
Title = {{Consistent Integration of Models Based on Views of Visual Languages}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'08)},
Year = {2008},
Editor = {J.L.\ Fiadeiro and P. Inverardi},
Pages = {62--76},
Publisher = Springer,
Series = lncs,
Volume = {4961},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modeling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete type graph and signature are known and necessary when modeling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to generalized typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeler to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result we present suitable conditions for the integration and decomposition of consistent view models. As a running example we use a visual domain-specific modeling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures.},
Doi = {10.1007/978-3-540-78743-3},
ISBN = {978-3-540-78742-6},
Keywords = {graph transformation, visual languages, views, view integration},
Location = {Budapest, Hungary},
Url = {http://www.springerlink.com/content/rp75m54262n771x1}
}
@Article{EEEP10,
Title = {{Consistent Integration of Models based on Views of Meta Models}},
Author = {Hartmut Ehrig and Karsten Ehrig and Claudia Ermel and Ulrike Prange},
Journal = {Formal Aspects of Computing},
Year = {2010},
Pages = {327-345},
Volume = {22 (3)},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system. Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system. The aim of this paper is to extend the framework of typed attributed graph morphisms to \emph{generalized} typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies. In the main result, we present suitable conditions for the integration and decomposition of consistent view models and extend these conditions to view models defined over meta models with constraints. As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.},
Doi = {10.1007/s00165-009-0127-6},
ISBN = {ISSN 0934-5043},
Owner = {Claudia},
Timestamp = {2009.09.21}
}
@TechReport{EEEP09a,
Title = {{Generalized Typed Attributed Graph Transformation Systems based on Morphisms Changing Type Graphs and Data Signatures}},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Institution = {TU Berlin},
Year = {2009},
Number = {2009-08},
Abstract = {The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modelling aims at creating small, partial models, each one of them describing some aspect of the system.
Existing formal techniques supporting view-based visual modelling are based on typed attributed graphs, where views are related by typed attributed graph morphisms. Such morphisms up to now require a meta model given by a fixed type graph, as well as a fixed data signature and domain. This is in general not adequate for view-oriented modeling where only parts of the complete meta model are known and necessary when modelling a partial view of the system.
The aim of this paper is to extend the framework of typed attributed graph morphisms to \emph{generalized} typed attributed graph morphisms, short GAG-morphisms, which involve changes of the type graph, data signature, and domain. This allows the modeller to formulate type hierarchies and views of visual languages defined by GAG-morphisms between type graphs, short GATG-morphisms. In this paper, we study the interaction and integration of views, and the restriction of views along type hierarchies.
In the main result, we present suitable conditions for the integration and decomposition of consistent view models and extend these conditions to view models defined over meta models with constraints. As a running example, we use a visual domain-specific modelling language to model coarse-grained IT components and their connectors in decentralized IT infrastructures. Using constraints, we formulate connection properties as invariants.},
Owner = {Claudia},
Timestamp = {2009.04.29},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}
}
@Article{EEEP07,
Title = {{M}odel {T}ransformations by {G}raph {T}ransformation are {F}unctors},
Author = {Ehrig, H. and Ehrig, K. and Ermel, C. and Prange, U.},
Journal = BEATCS,
Year = {2007},
Pages = {134--142},
Volume = {93},
Abstract = {In this paper, we extend our ideas on model transformations as functors discussed in the previous issue and embed this concept into the framework of graph transformation systems. We show that under certain restrictions of the rules model transformations by graph transformation are functors.},
ISBN = {ISSN 0252-9742},
Keywords = {model transformation, graph transformation},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@InProceedings{EEHP04,
Title = {Constraints and Application Conditions: From Graphs to High-Level Structures},
Author = {Ehrig, H. and Ehrig, K. and Habel, A. and Pennemann, K.-H.},
Booktitle = {Proc. 2nd Int. Conference on Graph Transformation (ICGT'04)},
Year = {2004},
Address = {Rome, Italy},
Editor = {Parisi-Presicce, F. and Bottoni, P. and Engels, G.},
Month = {October},
Pages = {287--303},
Publisher = Springer,
Series = lncs,
Volume = {3256},
Abstract = {Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different approaches have been presented in the literature already there is no adequate theory up to now which can be applied to different kinds of graphs and high-level structures. In this paper, we introduce an improved notion of graph constraints and application conditions and show under what conditions the basic results can be extended from graph transformation to high-level replacement systems. In fact, we use the new framework of adhesive HLR categories recently introduced as combination of HLR systems and adhesive categories. Our main results are the transformation of graph constraints into right application conditions and the transformation from right to left application conditions in this new framework.},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9},
Keywords = {graph constraints, application conditions, high-level structures},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EEHP04.pdf}
}
@Article{EEHP06,
Title = {{Theory of Constraints and Application Conditions: From Graphs to High-Level Structures }},
Author = {Ehrig, H. and Ehrig, K. and Habel, A. and Pennemann, K.-H.},
Journal = {Fundamenta Informaticae},
Year = {2006},
Number = {1},
Pages = {135--166},
Volume = {74},
Abstract = {Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different approaches have been presented in the literature already there is no adequate theory up to now which can be applied to different kinds of graphs and high-level structures. In this paper, we introduce a general notion of graph constraints and application conditions and show under what conditions the basic results can be extended from graph transformation to high-level replacement systems. In fact, we use the new framework of adhesive HLR categories recently introduced as combination of HLR systems and adhesive categories. Our main results are the transformation of graph constraints into right application conditions and the transformation from right to left application conditions in this new framework. The transformations are illustrated by a railroad control system with rail net constraints and application conditions.},
ISSN = {ISSN 0169-2968},
Keywords = {graph transformation, category theory, constraints, application conditions, adhesive HLR category},
Url = {http://fi.mimuw.edu.pl/vol74.html}
}
@Article{EEH08a,
Title = {{From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars}},
Author = {Ehrig, H. and Ehrig, K. and Hermann, F.},
Journal = {ECEASST},
Year = {2008},
Volume = {10},
Abstract = {Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and finally to implementation code. This paper presents model transformation and model integration as specific problem within bidirectional model transformation, which has shown to support various purposes, such as analysis, optimization, and code generation. The main purpose of model integration is to establish correspondence between various models, especially between source and target models. From the analysis point of view, model integration supports correctness checks of syntactical dependencies between different views and models. The overall concept is based on the algebraic approach to triple graph grammars, which are widely used for model transformation. The main result shows the close relationship between model transformation and model integration. For each model transformation sequence there is a unique model integration sequence and vice versa. This is demonstrated by a quasi-standard example for model transformation between class models and relational data base models.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08)},
Editor = {Ermel, C. and de Lara,J. and Heckel,R. },
ISBN = {{ISSN 1863-2122}},
Keywords = { model transformation, model integration, syntactical correctness},
Location = {Budapest, Hungary},
Publisher = {EASST},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/19}
}
@TechReport{EEH08b,
Title = {{From Model Transformation to Model Integration based on the Algebraic Approach to Triple Graph Grammars (Long Version)}},
Author = {Ehrig, H. and Ehrig, K. and Hermann, F.},
Institution = {Technische Universit{\"a}t Berlin,Fakult{\"a}t IV},
Year = {2008},
Number = {2008/03},
Abstract = {Success and efficiency of software and system design fundamentally relies on its models. The more they are based on formal methods the more they can be automatically transformed to execution models and finally to implementation code. This paper presents model transformation and model integration as specific problem within bidirectional model transformation, which has shown to support various purposes, such as analysis, optimization, and code generation. The main purpose of model integration is to establish correspondence between various models, especially between source and target models. From the analysis point of view, model integration supports correctness checks of syntactical dependencies between different views and models. The overall concept is based on the algebraic approach to triple graph grammars, which are widely used for model transformation. The main result shows the close relationship between model transformation and model integration. For each model transformation sequence there is a unique model integration sequence and vice versa. This is demonstrated by a quasi-standard example for model transformation between class models and relational data base models.},
Keywords = {model transformation, model integration, syntactical correctness},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-03.pdf}
}
@InProceedings{EEL+05,
Title = {Termination Criteria for Model Transformation},
Author = {Ehrig, H. and Ehrig, K. and de Lara, J. and Taentzer, G. and Varr\'o, D. and Varr\'o-Gyapay, S.},
Booktitle = {Proc.\ Fundamental Approaches to Software Engineering (FASE)},
Year = {2005},
Editor = {M. Wermelinger and T. Margaria-Steffen},
Pages = {214--228},
Publisher = Springer,
Series = lncs,
Volume = {2984},
Abstract = {{\em Model Transformation} has become central to most software engineering activities. It refers to the process of modifying a (usually graphical) model for the purpose of analysis (by its transformation to some other domain), optimization, evolution, migration or even code generation. In this work, we show {\em termination criteria} for model transformation based on {\em graph transformation}. This framework offers visual and formal techniques based on rules, in such a way that model transformations can be subject to analysis. Previous results on graph transformation are extended by proving the termination of a transformation if the rules applied meet certain criteria. We show the suitability of the approach by an example in which we translate a simplified version of Statecharts into Petri nets for functional correctness analysis.},
Keywords = {model transformation, graph transformation, termination},
Url = {http://www.springerlink.com/index/DKPVLNFGRN3K8XP7.pdf}
}
@Book{EEPT06,
Title = {Fundamentals of Algebraic Graph Transformation},
Author = {Ehrig, H. and Ehrig, K. and Prange, U. and Taentzer, G.},
Publisher = Springer,
Year = {2006},
Series = {EATCS Monographs in Theor. Comp. Science},
Abstract = { Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool environment. Finally the appendix covers the basics of category theory, signatures and algebras. The book addresses both research scientists and graduate students in computer science, mathematics and engineering. },
Url = {http://www.springer.com/3-540-31187-4}
}
@Article{EEPT06a,
Title = {{Fundamental Theory for Typed Attributed Graphs and Graph Transformation based on Adhesive HLR Categories}},
Author = {Ehrig, H. and Ehrig, K. and Prange, U. and Taentzer, G.},
Journal = {Fundamenta Informaticae},
Year = {2006},
Number = {1},
Pages = {31--61},
Volume = {74},
Abstract = {The concept of typed attributed graphs and graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this article we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresponding category is isomorphic to the category of algebras over a specific kind of attributed graph structure signature. This allows to prove the second main result showing that the category of typed attributed graphs is an instance of ï¿½adhesive HLR categoriesï¿½. This new concept combines adhesive categories introduced by Lack and Sobociï¿½nski with the wellknown approach of high-level replacement (HLR) systems using a new simplified version of HLR conditions. As a consequence we obtain a rigorous approach to typed attributed graph transformation providing as fundamental results the Local Church-Rosser, Parallelism, Concurrency, Embedding and Extension Theorem and a Local Confluence Theorem known as Critical Pair Lemma in the literature. },
ISSN = {0169-2968},
Keywords = {graph transformation, adhesive HLR category, typed attributed graphs},
Url = {http://fi.mimuw.edu.pl/vol74.html}
}
@InProceedings{EEPT05a,
Title = {{Formal Integration of Inheritance with Typed Attributed Graph Transformation for Efficient VL Definition and Model Manipulation}},
Author = {Ehrig, H. and Ehrig, K. and Prange, U. and Taentzer, G.},
Booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)},
Year = {2005},
Address = {IEEE Computer Society, Dallas, Texas, USA},
Month = {September},
Abstract = {Several approaches exist to define a visual language (VL). Among those the meta-modeling approach used to define the Unified Modeling Language (UML), and the graph transformation approach are very popular. Especially the combination of both, using meta-modeling to define the syntax of a VL and graph transformation for specifying model transformations has been considered conceptually and explored in a number of applications. A formal integration of both approaches has just been started by integrating classical algebraic graph grammars with a node type inheritance concept. In this paper, the integration of inheritance is extending to attributed graph transformation. More precisely, we define attributed type graphs with inheritance leading to a formal integration of inheritance with typed attributed graph transformation.},
Keywords = {inheritance, graph transformation, typed attributed graphs},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EEPT05a.pdf}
}
@InProceedings{EE96,
Title = {Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems},
Author = {Ehrig, H. and Engels, G.},
Booktitle = {Proc. Williamsburg, U.S.A.},
Year = {1996},
Pages = {137-154},
Publisher = Springer,
Series = lncs,
Volume = {1073}
}
@TechReport{EE93,
Title = {Towards a Module Concept for Graph Transformation Systems},
Author = {H. Ehrig and G. Engels},
Institution = {Leiden University (The Netherlands)},
Year = {1993},
Number = {93-34}
}
@InProceedings{EE08a,
Title = {{Semantical Correctness and Completeness of Model Transformations using Graph and Rule Transformation}},
Author = {Ehrig, H. and Ermel, C.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Pages = {194--210},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = {An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is \emph{semantically correct} if for each simulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have \emph{semantical completeness}, if for each simulation run of the target system we find a corresponding simulation run in the source system.
In our framework of graph transformation, models are given by graphs, and graph transformation rules are used to define the operational behavior of visual models (called simulation rules). In order to compare the semantics of source and target models, we assume that in both cases operational behavior can be defined by simulation rules. The model transformation from source to target models is given by another set of graph transformation rules. These rules are also applied to the simulation rules of the source model. %The result of this rule transformation is compared with the given simulation rules of the target language.% w.r.t. the generated graph languages. The main result in this paper states the conditions for model and rule transformations to be semantically correct and complete. The result is applied to analyze the behavior of a model transformation from a domain-specific visual language for production systems to Petri nets.},
Keywords = {graph transformation, model and rule transformation, visual languages, semantical correctness, semantical completeness},
Location = {Leicester, UK},
Url = {http://www.springerlink.com/index/45244x0306756185.pdf}
}
@TechReport{EE08b,
Title = {{Semantical Correctness and Completeness of Model Transformations using Graph and Rule Transformation: Long Version}},
Author = {Ehrig, H. and Ermel, C.},
Institution = {Technische Universit\"at Berlin,Fakult{\"a}t IV},
Year = {2008},
Number = {2008-13},
Abstract = {An important requirement of model transformations is the preservation of the behavior of the original model. A model transformation is \emph{semantically correct} if for each simulation run of the source system we find a corresponding simulation run in the target system. Analogously, we have \emph{semantical completeness}, if for each simulation run of the target system we find a corresponding simulation run in the source system.
In our framework of graph transformation, models are given by graphs, and graph transformation rules are used to define the operational behavior of visual models (called simulation rules). In order to compare the semantics of source and target models, we assume that in both cases operational behavior can be defined by simulation rules. The model transformation from source to target models is given by another set of graph transformation rules. These rules are also applied to the simulation rules of the source model. %The result of this rule transformation is compared with the given simulation rules of the target language.% w.r.t. the generated graph languages. The main result in this paper states the conditions for model and rule transformations to be semantically correct and complete. The result is applied to analyze the behavior of a model transformation from a domain-specific visual language for production systems to Petri nets.},
Keywords = {graph transformation, model and rule transformation, visual languages, semantical correctness, semantical completeness},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-13.pdf}
}
@Article{EEE09,
Title = {{Refactoring of Model Transformations}},
Author = {Hartmut Ehrig and Claudia Ermel and Karsten Ehrig},
Journal = {ECEASST},
Year = {2009},
Volume = {18},
Abstract = {Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models), and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations which adapts the model transformation rules to the refactored models. In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known model transformation from statecharts to Petri nets.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'09)},
Editor = { Heckel, Reiko and Boronat, Artur },
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Location = {York, UK},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/27}
}
@TechReport{EEE09a,
Title = {{Evolution of Model Transformations by Model Refactoring: Long Version }},
Author = {Hartmut Ehrig and Claudia Ermel and Karsten Ehrig},
Institution = {TU Berlin},
Year = {2009},
Number = {TR 2009-4},
Abstract = {Model-to-model transformations between visual languages are often defined by typed, attributed graph transformation systems. Here, the source and target languages of the model transformation are given by type graphs (or meta models), and the relation between source and target model elements is captured by graph transformation rules. On the other hand, refactoring is a technique to improve the structure of a model in order to make it easier to comprehend, more maintainable and amenable to change. Refactoring can be defined by graph transformation rules, too. In the context of model transformation, problems arise when models of the source language of a model transformation become subject to refactoring. It may well be the case that after the refactoring, the model transformation rules are no longer applicable because the refactoring induced structural changes in the models. In this paper, we consider a graph-transformation-based evolution of model transformations which adapts the model transformation rules to the refactored models. In the main result, we show that under suitable assumptions, the evolution leads to an adapted model transformation which is compatible with refactoring of the source and target models. In a small case study, we apply our techniques to a well-known model transformation from statecharts to Petri nets.},
ISBN = {{ISSN 1436-9915 }},
Keywords = {model transformation, graph transformation, model refactoring},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2009/tr-2009-04.pdf}
}
@Book{EEGH15,
Title = {{Graph and Model Transformation: General Framework and Applications}},
Author = {Hartmut Ehrig and Claudia Ermel and Ulrike Golas and Frank Hermann},
Publisher = {Springer Berlin Heidelberg},
Year = {2015},
Series = {Monographs in Theoretical Computer Science. An EATCS Series},
Doi = {DOI = 10.1007/978-3-662-47980-3},
ISBN = {ISBN = 978-3-662-47979-7},
Owner = {Lenovo},
Timestamp = {2016.01.02}
}
@Book{Ehrig2015,
Title = {{Graph and Model Transformation: General Framework and Applications}},
Author = {Hartmut Ehrig and Claudia Ermel and Ulrike Golas and Frank Hermann},
Publisher = {Springer Berlin Heidelberg},
Year = {2015},
Series = {Monographs in Theoretical Computer Science. An EATCS Series},
Doi = {DOI = 10.1007/978-3-662-47980-3},
ISBN = {ISBN = 978-3-662-47979-7},
Owner = {Lenovo},
Timestamp = {2016.01.02}
}
@InProceedings{EEH+12,
Title = {Confluence in Data Reduction: Bridging Graph Transformation and Kernelization},
Author = {Hartmut Ehrig and Claudia Ermel and Falk H\"uffner and Rolf Niedermeier and Olga Runge},
Booktitle = {Proc. of Int. Conf. on Computability in Europe (CiE'12)},
Year = {2012},
Editor = {S. Barry Cooper and Anuj Dawar},
Pages = {193-202},
Publisher = {Springer},
Series = {LNCS},
Volume = {7318},
Abstract = {Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A \emph{kernelization} reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter~$k$; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems \textsc{(Edge) Clique Cover} and \textsc{Partial Clique Cover} as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool.
These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.},
Owner = {Claudia},
Timestamp = {2012.05.07}
}
@Article{EEH+13,
Title = {Confluence in Data Reduction: Bridging Graph Transformation and Kernelization},
Author = {Hartmut Ehrig and Claudia Ermel and Falk H\"uffner and Rolf Niedermeier and Olga Runge},
Journal = {Computability},
Year = {2013},
Number = {1},
Pages = {31-49},
Volume = {2},
Abstract = {Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A \emph{kernelization} reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter~$k$; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems \textsc{(Edge) Clique Cover} and \textsc{Partial Clique Cover} as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.},
ISSN = {2211-3568},
Keywords = {kernelisation, graph Transformation, confluence, critical pair},
Publisher = {IOS Press}
}
@InProceedings{EEH08,
Title = {{On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Booktitle = {Proc. Third International Workshop on Graph and Model Transformation (GraMoT'08)},
Year = {2008},
Address = {New York, NY, USA},
Editor = {Karsai, G. and Taentzer, G.},
Pages = {9--16},
Publisher = {ACM},
Series = {GRaMoT '08},
Doi = {http://doi.acm.org/10.1145/1402947.1402950},
ISBN = {978-1-60558-079-1},
Keywords = {graph transformation, model transformation, triple graph grammars},
Location = {Leipzig, Germany},
Numpages = {8}
}
@InProceedings{EEH09,
Title = {{Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Booktitle = {Proc. International Conference on Fundamental Aspects of Software Engineering (FASE'09)},
Year = {2009},
Editor = {Wirsing, M. and Chechik, M.},
Pages = {325-339},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Volume = {5503},
Abstract = { E-government services usually process large amounts of confidential data, but simultaneously they shall provide simple and userfriendly graphical interfaces. Therefore, security requirements for the communication between components have to be adhered in a very strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and user-driven correction as well as possibilities for automatic analysis and verification of security requirements on the meta model level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy in order to enable the specification of relevant security requirements in this scenario. The extended theory is shown to fulfil the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable distributed critical pattern detection. },
ISBN = {978-3-642-00592-3},
Keywords = {model transformation, graph transformation, Security, E-Government, type graph with inheritance},
Location = {York, UK},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/EEH09.pdf}
}
@TechReport{EEH08c,
Title = {{On the Relationship of Model Transformations Based on Triple and Plain Graph Grammars (Long Version)}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F.},
Institution = {Technische Universit{\"a}t Berlin, Fakult{\"a}t IV},
Year = {2008},
Number = {2008/05},
Abstract = {Triple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case. Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.},
Keywords = {graph transformation, triple graphs, model transformation, plain graph grammar, flattening},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-05.pdf}
}
@Article{EEHK09,
Title = {{Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation}},
Author = {Hartmut Ehrig and Claudia Ermel and Frank Hermann and Barbara K\"onig},
Journal = BEATCS,
Year = {2009},
Pages = {117--125},
Volume = {97},
Abstract = {Our new project "Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation" funded by the German Research Council (DFG) has started in May 2008. In this contribution we present the main goals of the project and first results.},
Owner = {Claudia},
Timestamp = {2009.09.21},
Url = {http://www.eatcs.org/images/bulletin/beatcs97.pdf}
}
@InProceedings{EEHP09,
Title = {{On-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F. and Prange, U.},
Booktitle = {ACM/IEEE 12th Int. Conf. on Model Driven Engineering Languages and Systems (MODELS'09)},
Year = {2009},
Editor = {Sch{\"u}rr, A. and Selic, B.},
Pages = {241--255},
Publisher = {Springer},
Series = lncs,
Volume = {5795},
Abstract = {Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rules for bidirectional model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we continue previous work on the formal definition of model transformations based on triple graph rules with negative application conditions (NACs). The new notion of partial source consistency enables us to construct consistent model transformations on-the-fly instead of analyzing consistency of completed model transformations. We show the crucial properties termination, correctness and completeness (including NAC-consistency) for the model transformations resulting from our construction. Moreover, we define parallel independence for model transformation steps which allows us to perform partial-order reduction in order to improve efficiency. The results are applicable to several relevant model transformations and in particular to our example transformation from class diagrams to database models.},
Location = {Denver, Colorado, USA, Oct. 4-9, 2009},
Url = {http://www.springerlink.com/index/j22k27g63p51v388.pdf}
}
@TechReport{EEHP09b,
Title = {{On-the-Fly Construction, Correctness and Completeness of Model Transformations based on Triple Graph Grammars: Long Version}},
Author = {Ehrig, H. and Ermel, C. and Hermann, F. and Prange, U.},
Institution = {Technische Universit\"at Berlin},
Year = {2009},
Abstract = {Triple graph grammars (TGGs) are a formal and intuitive concept for the specification of model transformations. Their main advantage is an automatic derivation of operational rules for bidirectional model transformations, which simplifies specification and enhances usability as well as consistency. In this paper we continue previous work on the formal definition of model transformations based on triple graph rules with negative application conditions (NACs). The new notion of partial source consistency enables us to construct consistent model transformations on-the-fly instead of analyzing consistency of completed model transformations. We show the crucial properties termination, correctness and completeness (including NAC-consistency) for the model transformations resulting from our construction. Moreover, we define parallel independence for model transformation steps which allows us to perform partial-order reduction in order to improve efficiency. The results are applicable to several relevant model transformations and in particular to our example transformation from class diagrams to database models.},
Numer = {2009-11},
Owner = {Claudia},
Timestamp = {2009.05.07},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2009/tr-2009-11.pdf}
}
@TechReport{EEH+07,
Title = {Concurrency in Reconfigurable Place/Transition Systems: Independence of Net Transformations as well as Net Transformations and Token Firing},
Author = {Ehrig, H. and Ermel, C. and Hoffmann, K. and Padberg, J. and Prange, U.},
Institution = {Technische Universit\"at Berlin,Fakult{\"a}t IV},
Year = {2007},
Number = {2007-02},
Abstract = {Reconfigurable place/transition systems are Petri nets with initia lmarkings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements. For the transformation of Petri nets, adhesive high-level replacement systems have been recently introduced as a new categorical framework in the doublepushout approach. In this paper, we analyze concurrency in reconfigurable place/transition systems. We show that place/transition systems are a weak adhesive high-level replacement category, which allows us to apply the developed theory also to tranformations within reconfigurable place/transition systems. Furthermore, we analyze under which conditions net transformations and token firing can be executed in arbitrary order. As an illustrating example, reconfigurable place/transition systems are applied in a mobile network scenario.},
Keywords = {reconfigurable Petri nets, concurrency, independence, firing behaviour},
Url = {http://iv.tu-berlin.de/TechnBerichte/2007/2007-02.pdf}
}
@InProceedings{EER+10,
Title = {Formal Analysis and Verification of Self-Healing Systems},
Author = {Ehrig,H. and Ermel, C. and Runge, O. and Bucchiarone, A. and Pelliccione, P.},
Booktitle = {Proc. Intern. Conf. on Fundamental Aspects of Software Engineering (FASE'10)},
Year = {2010},
Editor = {D. Rosenblum and G. Taentzer},
Pages = {139--153},
Publisher = Springer,
Series = lncs,
Volume = {6013},
Abstract = {Self-healing (SH) systems are characterized by an automatic discovery of system failures, and techniques how to recover from these situations. In this paper, we show how to model SH systems using algebraic graph transformation. These systems are modeled as typed graph grammars enriched with graph constraints. This allows not only for formal modelling of consistency and operational properties, but also for their formal analysis and verication using the tool AGG. As main results, we present sufficient static conditions for self-healing properties, deadlock-freeness and liveness of SH-systems. The overall approach is applied to a traffic light system case study, where the corresponding properties are verified.},
ISBN = {ISSN 0302-9743},
Owner = {Claudia},
Timestamp = {2009.12.31},
Url = {http://www.springerlink.com/content/hv51032524v38321/}
}
@TechReport{EER+10b,
Title = {Formal Analysis and Verication of Self-Healing Systems: Long Version},
Author = {Ehrig, H. and Ermel, C. and Runge, O. and Bucchiarone, A. and Pelliccione, P.},
Institution = {Technische Universit\"at Berlin},
Year = {2010},
Note = {Available online at \url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}},
Number = {2010/04},
Abstract = {Self-healing (SH) systems are characterized by an automatic discovery of system failures, and techniques how to recover from these situations. In this paper, we show how to model SH systems using algebraic graph transformation. These systems are modeled as typed graph grammars enriched with graph constraints. This allows not only for formal modelling of consistency and operational properties, but also for their formal analysis and verication using the tool AGG. As main results, we present sufficient static conditions for self-healing properties, deadlock-freeness and liveness of SH-systems. The overall approach is applied to a traffic light system case study, where the corresponding properties are verified. This report is the long version (including proofs of technical theorems and the complete case study) of our paper at FASE 2010.},
ISBN = {ISSN 1436-9915},
Owner = {Claudia},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@InProceedings{EET11,
Title = {A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications},
Author = {Hartmut Ehrig and Claudia Ermel and Gabriele Taentzer},
Booktitle = {Int. Conf. on Fundamental Approaches to Software Engineering (FASE'11)},
Year = {2011},
Editor = {Dimitra Giannakopoulou and Fernando Orejas},
Pages = {202-216},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Volume = {6603},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.},
Ee = {http://dx.doi.org/10.1007/978-3-642-19811-3_15},
ISBN = {978-3-642-19810-6},
Location = {Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbr{\"u}cken, Germany, March 26-April 3, 2011},
Url = {http://www.springerlink.com/content/y722h2qp020l4217/}
}
@TechReport{EET11a,
Title = {A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications},
Author = {Hartmut Ehrig and Claudia Ermel and Gabriele Taentzer},
Institution = {TU Berlin},
Year = {2011},
Number = {2011/1},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.},
Owner = {Claudia},
Timestamp = {2010.12.16},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@TechReport{EF83,
Title = {Algebraic concepts applied to software development using parameterized specifications with requirements},
Author = {Ehrig, H. and Fey, W.},
Institution = TUB,
Year = {1983},
Number = {83-13}
}
@InCollection{EF81,
Title = {Methodology for the specification of software systems: from formal requirements to algebraic design specifications.},
Author = {Ehrig, H. and Fey, W.},
Booktitle = {Informatik Fachberichte 50},
Publisher = Springer,
Year = {1981},
Pages = {255--269}
}
@InCollection{EFH85,
Title = {Towards Abstract User Interfaces for Formal System Specifications},
Author = {Ehrig, H. and Fey, W. and Hansen, H.},
Booktitle = {Recent Trends in Data Type Specification, Informatik Fachberichte 116},
Publisher = Springer,
Year = {1985},
Pages = {73--88}
}
@TechReport{EFH83,
Title = {{ACT ONE}: An Algebraic Specification Language with two Level of Semantics},
Author = {H. Ehrig and W. Fey and H. Hansen},
Institution = {Technische Universit\"at Berlin},
Year = {1983},
Number = {83/03}
}
@InCollection{EFHLJ89,
Title = {Algebraic Concepts for the Evolution of Module Families},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D.},
Booktitle = {Proc. First Int. Conf. Algebraic Methodology and Software Technology (AMAST), University of Iowa},
Publisher = {University of Iowa},
Year = {1989},
Address = {Iowa City}
}
@InProceedings{EFHLJ89a,
Title = {Algebraic Software Development Concepts for Module and Configuration Families},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D. },
Booktitle = {Proc. 9th Conf. on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India},
Year = {1989}
}
@TechReport{EFHLJ88,
Title = {Algebraic Concepts for Software Configuration Management},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D.},
Institution = TUB,
Year = {1988},
Number = {88-19}
}
@Article{EFHLJLP89,
Title = {Algebraic Specifications of Modules and Configuration Families},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D. and Langen, A. and Parisi-Presicce, F.},
Journal = {Journal Inf. Process. Cybern. EIK 25},
Year = {1989},
Number = {6},
Pages = {205--232},
Volume = {5}
}
@TechReport{EFHLJLP88,
Title = {Algebraic Specifications of Modules and Configuration Families},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D. and Langen, A. and Parisi-Presicce, F.},
Institution = TUB,
Year = {1988},
Number = {88-17}
}
@Article{EFH+90,
Title = {{Compatibility Problems in the Development of Algebraic Module Specifications}},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Jacobs, D. and Parisi-Presicce, F.},
Journal = {Theoretical Computer Science},
Year = {1990},
Pages = {27--71},
Volume = {77}
}
@InProceedings{EFHLP89,
Title = {Categories for the Development of Algebraic Module Specification},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Parisi-Presicce, F.},
Booktitle = {Proc. Categorical Methods in Comp. Sci. with Aspects from Topology},
Year = {1989},
Pages = {157--184},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@TechReport{EFHLP87,
Title = {Algebraic Theory of Modular Specification Development},
Author = {Ehrig, H. and Fey, W. and Hansen, H. and L{\"o}we, M. and Parisi-Presicce, F.},
Institution = TUB,
Year = {1987},
Number = {87-06}
}
@InCollection{EFH83a,
Title = {{Algebraische Spezifikationen: Konzepte und Sprachen f\"ur die Software-Entwicklung}},
Author = {Ehrig, H. and Fey, W. and Hasler, K.P.},
Booktitle = {Festband 10 Jahre Informatik Dortmund},
Publisher = {Abt. Informatik, Universit\"at Dortmund},
Year = {1983}
}
@InProceedings{EFK80,
Title = {{Algebraische Spezifikationen eines St\"ucklistensystems - Eine Fallstudie}},
Author = {Ehrig, H. and Fey, W. and Kreowski, H.-J.},
Booktitle = {Proc. 2nd German Chapter of the ACM Software Engineering - Entwurf und Spezifikation, Berlin},
Year = {1980},
Pages = {75--90},
Publisher = {Teubner Verlag, Stuttgart}
}
@InProceedings{EFP86,
Title = {Distributive Laws for Composition and Union of Module Specification for Software Systems},
Author = {Ehrig, H. and Fey, W. and Parisi-Prescicce, F.},
Booktitle = {Proc. IFIP WG 2.1 Working Conf. on Program Specification and Transformation Bad-Tlz, April 1986},
Year = {1986},
Pages = {293--312},
Publisher = {North Holland}
}
@InProceedings{EFPB86,
Title = {Algebraic Theory of Module Specifications with Constraints},
Author = {Ehrig, H. and Fey, W. and Parisi-Presicce, F. and Blum, E.K.},
Booktitle = {Proc. MFCS 1986, Bratislava},
Year = {1986},
Pages = {59--77},
Publisher = Springer,
Series = lncs,
Volume = {233}
}
@TechReport{EGH92,
Title = {Specification techniques for concurrent and distributed systems},
Author = {Ehrig, H. and G{ro{\ss}e-Rhode}, M. and Heise, A.},
Institution = TUB,
Year = {1992},
Month = {jan.},
Note = {Invited paper for 2nd Maghr. Conference on Software Engineering and Artificial Intelligence, Tunis,1992},
Number = {92/5}
}
@InProceedings{EGH92a,
Title = {Specification techniques for concurrent and distributed systems},
Author = {Ehrig, H. and G{ro{\ss}e-Rhode}, M. and Heise, A.},
Booktitle = {Proc. 2nd Maghr. Conference on Software Engineering and Artificial Intelligence, Tunis},
Year = {1992}
}
@InProceedings{EGLP97,
Title = {{Reverse Petri Net Technology Transfer: On the Boundary of Theory and Application}},
Author = {Ehrig, H. and Gajewsky, M. and Lembke, S. and Padberg, J.},
Booktitle = {Formal {M}ethods {P}acific '97},
Year = {1997},
Editor = {Lindsay Groves and Steve Reeves},
Pages = {297-298},
Publisher = {Springer - {V}erlag {S}ingapore {P}te. {L}td}
}
@InProceedings{EGLP97b,
Title = {{Reverse Petri Net Technology Transfer: On the Boundary of Theory and Application }},
Author = {Ehrig, H. and Gajewsky, M. and Lembke, S. and Padberg, J.},
Booktitle = {Formal {M}ethods {P}acific '97 --- Work in Progress Papers},
Year = {1997},
Editor = {Lindsay Groves and Steve Reeves},
Publisher = {Victoria University of Wellington, New Zealand}
}
@InProceedings{EGL+97,
Title = {Reverse Petri Net Technology Transfer: On the Boundary of Theory and Applications},
Author = {Ehrig, H. and Gajewsky, M. and Lembke, S. and Padberg, J.},
Booktitle = {Proc. Formal Methods Pacific 1997},
Year = {1997}
}
@InProceedings{EGLP97a,
Title = {{Reverse Petri Net Technology Transfer: On the Boundary of Theory and Application}},
Author = {Ehrig, H. and Gajewsky, M. and Lembke, S. and Padberg, J. and Gruhn, V.},
Booktitle = {{Move-On-Workshop der DFG-Forschergruppe Petrinetz-Technologie}},
Year = {1997},
Editor = {Hartmut Ehrig and Wolfgang Reisig and Herbert Weber},
Note = {Technical Report TR 97-21, Technische Universit{\"at} Berlin},
Organization = {Forschergruppe {\sc Petrinetz-Technologie}}
}
@TechReport{EGL+97a,
Title = {Reverse Petri Net Technology Transfer: On the Boundary of Theory and Applications},
Author = {Ehrig, H. and Gajewsky, M. and Lembke, S. and Padberg, J. and Gruhn, V.},
Institution = TUB,
Year = {1997},
Number = {97-21},
Pages = {7--28}
}
@TechReport{EGP97,
Title = {Action {N}ets, {H}ierarchical {S}tate {S}paces and {A}bstract {S}tatecharts as {H}igh-{L}evel {S}tructures},
Author = {Ehrig, H. and Gajewsky, M. and Padberg, J.},
Institution = {Technical {U}niversity {B}erlin},
Year = {1997},
Number = {TR 97 - 14}
}
@InProceedings{EGP97a,
Title = {Action {N}ets and {A}bstract {S}tatecharts in the {T}heory of {H}igh-{L}evel {S}tructures},
Author = {Ehrig, H. and Gajewsky, M. and Padberg, J.},
Booktitle = {Proc.\ of {F}irst {E}uropean {GETGRATS} {W}orkshop},
Year = {1997},
Address = {Bordeaux, {F}rance},
Month = {Oct.}
}
@InCollection{EGP99,
Title = {High-{L}evel {R}eplacement {S}ystems with {A}pplications to {A}lgebraic {S}pecifications and {P}etri {N}ets},
Author = {Ehrig, H. and Gajewsky, M. and {Parisi-Presicce}, F.},
Booktitle = {{Handbook of Graph Grammars and Computing by Graph Transformations, Volume 3: Concurrency, Parallelism, and Distribution}},
Publisher = {World {S}cientific},
Year = {1999},
Chapter = {6},
Editor = {Rozenberg, G. and Montanari, U. and Ehrig, H. and Kreowski, H.-J.},
Pages = {341--400}
}
@InCollection{EGP00,
Title = {{High-Level Replacement Systems applied to Algebraic Specifications and Petri Nets}},
Author = {Ehrig, H. and Gajewsky, M. and Parisi-Presicce, F.},
Booktitle = {{Handbook of Graph Grammars and Computing by Graph Transformation. Vol 3: Concurrency, Parallelism and Distribution}},
Publisher = {World Scientific, Singapore etc.},
Year = {2000},
Pages = {341--400}
}
@InProceedings{EGW98,
Title = {From {A}bstract {D}ata {T}ypes to {A}lgebraic {D}evelopment {T}echniques: {A} {S}hift of {P}aradigms},
Author = {Ehrig, H. and Gajewsky, M. and Wolter, U.},
Booktitle = {Proc.\ of {W}orkshop on {A}lgebraic {D}evelopment {T}echniques},
Year = {1998},
Pages = {1--17},
Publisher = Springer,
Series = lncs,
Volume = {1376}
}
@InCollection{EGG+01,
Title = {On Formal Semantics and Integration of Object Oriented Modeling Languages},
Author = {Ehrig, H. and Geisler, R. and {Gro{\ss}e--Rhode}, M. and Klar, M. and Mann, S.},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century},
Publisher = {World Scientific, Singapore},
Year = {2001},
Editor = {G. Paun and G. Rozenberg and A. Salomaa},
Pages = {226--232}
}
@Article{EGG+00,
Title = {On Formal Semantics and Integration of Object Oriented Modeling Languages},
Author = {Ehrig, H. and Geisler, R. and {Gro{\ss}e--Rhode}, M. and Klar, M. and Mann, S.},
Journal = BEACTS,
Year = {2000},
Pages = {77--81},
Volume = {70}
}
@Article{EGK98,
Title = {{DFG}--{S}chwerpunktprogramm ab 1998: {I}ntegration von {T}echniken der {S}oftwarespezifikation f{\"u}r ingenieurwissenschaftliche {A}nwendungen},
Author = {Ehrig, H. and Geisler, R. and Klar, M.},
Journal = {Informatik - Forschung und Entwicklung},
Year = {1998},
Number = {1},
Pages = {43-46},
Volume = {13}
}
@InProceedings{EGKP97,
Title = {{Horizontal and Vertical Structuring Techniques for Statecharts}},
Author = {Ehrig, H. and Geisler, R. and Klar, M. and Padberg, J.},
Booktitle = { 8$^{th}$ International Conference on Concurrency Theory (CONCUR'97),Warsaw, Poland},
Year = {1997},
Editor = {Mazurkiewicz, A. and Winkowski, J.},
Pages = {181--195},
Publisher = Springer,
Series = lncs,
Volume = {1243}
}
@InProceedings{EGK+97,
Title = {Horizontal and Vertical Structuring Techniques for Statecharts},
Author = {Ehrig, H. and Geisler, R. and Klar, M. and Padberg, J.},
Booktitle = {CONCUR'97},
Year = {1997},
Pages = {181--195},
Publisher = Springer,
Series = lncs,
Volume = {1243}
}
@TechReport{EGK+96,
Title = {Horizontal and Vertical Structuring Techniques for Statecharts},
Author = {Ehrig, H. and Geisler, R. and Klar, M. and Padberg, J.},
Institution = TUB,
Year = {1996}
}
@Article{EGH10,
Title = {{Categorical Frameworks for Graph Transformation and HLR Systems based on the DPO Approach}},
Author = {Hartmut Ehrig and Ulrike Golas and Frank Hermann},
Journal = BEATCS,
Year = {2010},
Pages = {111--121},
Volume = {102},
Abstract = {Several variants of high-level replacement (HLR) and adhesive categories have been introduced in the literature as categorical frameworks for graph transformation and HLR systems based on the double pushout (DPO) approach. In addition to HLR, adhesive, and adhesive HLR categories several weak variants, especially weak adhesive HLR with horizontal and vertical variants, as well as partial variants, including partial map adhesive and partial VK square adhesive categories are reviewed and related to each other. We propose as weakest version the class of vertical weak adhesive HLR categories, short $\mathcal{M}$-adhesive categories, which are still sufficient to obtain most of the main results for graph transformation and HLR systems. The results in this paper are summarized in Fig.~\ref{f:hierarchy} showing a hierarchy of all these variants of adhesive, adhesive HLR, and $\mathcal{M}$-adhesive categories, which can be considered as different categorical frameworks for graph transformation and HLR systems.},
ISBN = {ISSN 0252-9742},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/EGH10.pdf}
}
@Article{EG94,
Title = {{Functorial Theory of Parameterized Specifications in a General Specification Framework}},
Author = {H. Ehrig and M. {Gro{\ss}e-Rhode}},
Journal = {Theoretical Computer Science},
Year = {1994},
Pages = {221 - 266},
Volume = {135}
}
@TechReport{EGO00,
Title = {{INT}: Integration of Specification Techniques with Applications in Enginering (Extended Abstracts)},
Author = {Ehrig, H. and {Gro{\ss}e--Rhode}, M. and Orejas, F.},
Institution = {TU Berlin},
Year = {2000},
Number = {2000/04}
}
@Article{EGRW98,
Title = {Applications of Category Theory to the Area of Algebraic Specification in Computer Science},
Author = {Ehrig, H. and {Gro{\ss}e-Rhode}, M. and Wolter, U.},
Journal = {Applied Categorical Structures},
Year = {1998},
Number = {1},
Pages = {1--35},
Volume = {6}
}
@TechReport{EGW95,
Title = {{On the Role of Category Theory in the Area of Algebraic Specifications}},
Author = {Ehrig, H. and Gro{\ss}e-Rhode, M. and Wolter, U.},
Institution = {TU Berlin, FB Informatik},
Year = {1995},
Month = {November},
Number = {Bericht-Nr. 95-27}
}
@TechReport{EG91,
Title = {Structural Theory of Algebraic Specifications in a Specification Logic -- {P}art 1: Functorial Parameterized Specifications},
Author = {H. Ehrig and M. {Gro\ss e-Rhode}},
Institution = {Technische Universit\"at Berlin},
Year = {1991},
Number = {91/23}
}
@InProceedings{EGRW95,
Title = {On the Role of Category Theory in the Area of Algebraic Specifications},
Author = {Ehrig, H. and {Gro\ss e-Rhode}, M. and Wolter, U.},
Booktitle = {Proc. WADT 11, Oslo},
Year = {1996},
Pages = {17--48},
Publisher = Springer,
Series = lncs,
Volume = {1130}
}
@Article{EG01,
Title = {{Integration von Techniken der Softwarespezifikation f\"ur ingenieurwissenschaftliche Anwendungen}},
Author = {Ehrig, H. and Grosse Rhode, M.},
Journal = {Informatik Forschung und Entwicklung, Springer-Verlag},
Year = {2001},
Pages = {100--117},
Volume = {16}
}
@Article{EGR92,
Title = {{Restriction Constructions in Specification Logics}},
Author = {Ehrig, H. and Grosse-Rhode, M.},
Journal = BEATCS,
Year = {1992},
Pages = {84--89},
Volume = {46}
}
@InCollection{EH85-86,
Title = {Graph grammars with application conditions},
Author = {Ehrig, H. and Habel, A.},
Booktitle = {The Book of L},
Publisher = Springer,
Year = {1985},
Editor = {Rozenberg, G. and Salomaa, A.},
Pages = {87--100}
}
@Article{gEHK92,
Title = {Introduction to Graph Grammars with Applications to Semantical Networks},
Author = {Ehrig, H. and Habel, A. and Kreowski, H.-J.},
Journal = {Computers and Mathematics with Applications},
Year = {1992},
Pages = {557-572},
Volume = {23(6-9)}
}
@Article{EHKP91,
Title = {Parallelism and Concurrency in High-Level Replacement Systems},
Author = {Ehrig, H. and Habel, A. and Kreowski, H.-J. and {Parisi-Presicce}, F.},
Journal = {Math. Struct. in Comp. Science},
Year = {1991},
Pages = {361--404},
Volume = {1}
}
@InProceedings{EHKP91b,
Title = {From Graph Grammars to high level replacement systems},
Author = {Ehrig, H. and Habel, A. and Kreowski, H.-J. and {Parisi-Presicce}, F.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Pages = {269--291},
Publisher = Springer,
Series = lncs,
Volume = {532}
}
@TechReport{EHKP90,
Title = {Parallelism and Concurrency in High Level Replacement Systems},
Author = {Ehrig, H. and Habel, A. and Kreowski, H.-J. and Parisi-Presicce, F.},
Institution = TUB,
Year = {1990},
Number = {90-35}
}
@Article{EHL10,
Title = {{Parallelism and Concurrency Theorems for Rules with Nested Application Conditions}},
Author = {Hartmut Ehrig and Annegret Habel and Leen Lambers},
Journal = {Electr. Communications of the EASST},
Year = {2010},
Pages = {1--24},
Volume = {26},
Abstract = {We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories including different kinds of graphs. The proofs of the statements are based on the corresponding statements for rules without application conditions and two Shift-Lemmas, saying that nested application conditions can be shifted over morphisms and rules.},
Booktitle = {Manipulation of Graphs, Algebras and Pictures: Essays Dedicated to Hans-J\"org Kreowski on the Occasion of His 60th Birthday},
Editor = {Frank Drewes and Annegret Habel and Berthold Hoffmann and Detlef Plump},
ISBN = {ISSN 1863-2122},
Owner = {Claudia},
Publisher = {Electronic Communications of the EASST},
Timestamp = {2009.09.28},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/36}
}
@InProceedings{EHL+10,
Title = {Local Confluence for Rules with Nested Application Conditions},
Author = {Ehrig, H. and Habel, A. and Lambers, L. and Orejas, F. and Golas, U.},
Booktitle = {Proceedings of Intern. Conf. on Graph Transformation (ICGT' 10)},
Year = {2010},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch{\"u}rr, A.},
Pages = {330--345},
Publisher = Springer,
Series = lncs,
Volume = {6372},
Abstract = {Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper however, we consider rules with more general application conditions -- also called nested application conditions -- which in the graph case are equivalent to finite first-order graph conditions. The classical critical pair notion denotes conflicting transformations in a minimal context satisfying the application conditions. This is no longer true for combinations of positive and negative application conditions -- an important special case of nested ones -- where we have to allow that critical pairs do not satisfy all the application conditions. This leads to a new notion of critical pairs which allows to formulate and prove a Local Confluence Theorem for the general case of rules with nested application conditions. We demonstrate this new theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.},
ISBN = {ISBN 978-3-642-15927-5},
Owner = {Claudia},
Timestamp = {2010.10.15},
Url = {http://www.springerlink.com/index/X273147851566804.pdf}
}
@InProceedings{EHPP04,
Title = {Adhesive High-Level Replacement Categories and Systems},
Author = {Ehrig, H. and Habel, A. and Padberg, J. and Prange, U.},
Booktitle = {Proc. 2nd Int. Conference on Graph Transformation (ICGT'04)},
Year = {2004},
Address = {Rome, Italy},
Editor = {Parisi-Presicce, F. and Bottoni, P. and Engels, G.},
Month = {October},
Pages = {144--160},
Publisher = Springer,
Series = lncs,
Volume = {3256},
Abstract = {Adhesive high-level replacement (HLR) categories and systems are introduced as a new categorical framework for graph transformation in a broad sense, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobocinski. In this paper we show that most of the HLR properties, which had been introduced ad hoc to generalize some basic results from the category of graphs to high-level structures, are valid already in adhesive HLR categories. As a main new result in a categorical framework we show the Critical Pair Lemma for local confluence of transformations. Moreover we present a new version of embeddings and extensions for transformations in our framework of adhesive HLR systems.},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9},
Keywords = {HLR categories, adhesive categories, high-level replacement categories},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EHPP04.pdf}
}
@Article{EHPP06,
Title = {{Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation}},
Author = {Ehrig, H. and Habel, A. and Padberg, J. and Prange, U.},
Journal = {Fundamenta Informaticae},
Year = {2006},
Number = {1},
Pages = {1--29},
Volume = {74},
Abstract = {Adhesive high-level replacement (HLR) systems are introduced as a new categorical framework for graph transformation in the double pushout (DPO) approach, which combines the well-known concept of HLR systems with the new concept of adhesive categories introduced by Lack and Sobociï¿½nski. In this paper we show that most of the HLR properties, which had been introduced to generalize some basic results from the category of graphs to high-level structures, are valid already in adhesive HLR categories. This leads to a smooth categorical theory of HLR systems which can be applied to a large variety of graphs and other visual models. As a main new result in a categorical framework we show the Critical Pair Lemma for the local confluence of transformations. Moreover we present a new version of embeddings and extensions for transformations in our framework of adhesive HLR systems. },
ISSN = {ISSN 0169-2968},
Keywords = {adhesive HLR category, graph transformation, category theory},
Url = {http://fi.mimuw.edu.pl/vol74.html}
}
@InProceedings{EHPP01,
Title = {{Basic Results for Two Types of High-Level Replacement Systems}},
Author = {H. Ehrig and A. Habel and F. Parisi-Presicce },
Booktitle = {Proc. GETGRATS Closing Workshop},
Year = {2002},
Editor = {M. Bauderon and A. Corradini},
Pages = {12},
Series = entcs,
Volume = {51},
Keywords = {Algebraic Specification, Graph Transformation, Integration of Modeling Techniques, High-Level Replacement Systems},
Url = {http://www.user.tu-berlin.de/lieske/tfs/public/EHPP01.ps.gz}
}
@Article{EHR86,
Title = {{Concurrent Transformation of Relational Structures}},
Author = {Ehrig, H. and Habel, A. and Rosen, B.},
Journal = FI,
Year = {1986},
Pages = {13-50},
Volume = {IX}
}
@Unpublished{EHT+03,
Title = {{Formal Notation, Results, and Research Topics for Generic Vidual Language and Transformation Approaches}},
Author = {Ehrig, H. and Habel, A. and Taentzer, G. and {Ehrig et al.}, K.},
Note = {internal paper},
Month = {December},
Year = {2003}
}
@InProceedings{EH84,
Title = {{ACT ONE}. An Algebraic Specification Language Based on Initial Algebra and Free Functor Semantics.},
Author = {Ehrig, H. and Hansen, H.},
Booktitle = {Proc. of the 10th National Summer School "Appl. of Math. in Eng." Varna},
Year = {1984},
Publisher = {University of Varna}
}
@TechReport{EHK+96b,
Title = {Algebraic Approaches to Graph Transformation, Part II: Single Pushout Approach and Comparison with Double Pushout Approach},
Author = {Ehrig, H. and Heckel, R. and Korff, M. and L{\"o}we, M. and Ribeiro, L. and Wagner, A.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-20}
}
@InCollection{EHK+97,
Title = {{Algebraic Approaches to Graph Transformation {II}: {S}ingle Pushout Approach and Comparison with Double Pushout Approach}},
Author = {Ehrig, H. and Heckel, R. and Korff, M. and L{\"o}we, M. and Ribeiro, L. and Wagner, A. and Corradini, A.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations},
Publisher = {World Scientific},
Year = {1997},
Chapter = {4},
Editor = {Rozenberg, G.},
Pages = {247--312}
}
@InCollection{EHK+96,
Title = {Algebraic Approaches to Graph Transformation {II}: Single Pushout Approach and Comparison with Double Pushout Approach},
Author = {Ehrig, H. and Heckel, R. and Korff, M. and L{\"o}we, M. and Ribeiro, L. and Wagner, A. and Corradini, A.},
Booktitle = {The Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations},
Publisher = {World Scientific},
Year = {1996},
Editor = {Rozenberg, G.},
Pages = {247-312}
}
@InProceedings{EHLO98,
Title = {Construction and Characterization of Double-Pullback Graph Transitions},
Author = {Ehrig, H. and Heckel, R. and Llabres, M and Orejas, F.},
Booktitle = {Proc.\ 6th Int. Workshop on Theory and Applications of Graph Transformation (TAGT'98)},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Number = {tr--ri--98--201},
Organization = {Universit{\"a}t--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik},
Pages = {308--315},
Series = {Reihe Informatik}
}
@TechReport{EHLO99,
Title = {Basic Properties of Double-Pullback Graph Transitions},
Author = {Ehrig, H. and Heckel, R. and Llabres, M and Orejas, F.},
Institution = TUB,
Year = {1999},
Number = {99-02}
}
@TechReport{EHL+00b,
Title = {{Basic Properties of Double-Pullback Graph Transitions}},
Author = {Ehrig, H. and Heckel, R. and Llabres, M. and Orejas, F. and Padberg, J. },
Institution = {FB Informatik, Techn. Univ. Berlin},
Year = {1999},
Number = {99--02}
}
@TechReport{EHLOP99,
Title = {Basic Properties of Double Pullback Graph Transitions},
Author = {Ehrig, H. and Heckel, R. and Llabres, M. and Orejas, F. and Padberg, J.},
Institution = TUB,
Year = {1999},
Number = {99-02}
}
@InProceedings{EHL+00a,
Title = {{Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information}},
Author = {Ehrig, H. and Heckel, R. and Llabres, M. and Orejas, F. and Padberg, J. and Rozenberg, G.},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Editor = {Ehrig, H. and Engels,G. and Kreowski, H.-J. and Rozenberg, G.},
Pages = {85--102},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{EHP+96,
Title = {{Synchronization of Views and Loose Semantics of Typed Graph Productions}},
Author = {Ehrig, H. and Heckel, R. and Padberg, J. and Taentzer, G. and Wolter, U. and Corradini, A. and Engels, G.},
Booktitle = {Report on the Dagstuhl-Seminar 9637 \emph{Graph Transformations in Computer Science}},
Year = {1996},
Note = {Lecture and abstract}
}
@InProceedings{EHRP98,
Title = {{Graph Transformations and Other Rule-Based Formalisms with Incomplete Information}},
Author = {Ehrig, H. and Heckel, R. and Rozenberg, G. and Padberg, J.},
Booktitle = {Proc. Sixth International Workshop on {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Organization = {Universit{\"a}t--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik},
Pages = {268--278},
Publisher = {Universit{\"a}t Paderborn}
}
@Unpublished{EHMT94,
Title = {{S}trukturierung und {A}nalyse algebraischer {G}raphtransformationssysteme},
Author = {Ehrig, H. and Heckel, R. and Taentzer, G. and M\"uller, J.},
Note = {DFG-Projektantrag},
Year = {1994}
}
@Article{EHP09,
Title = {{Cospan DPO Approach: An Alternative for DPO Graph Transformations}},
Author = {Hartmut Ehrig and Frank Hermann and Ulrike Prange},
Journal = BEATCS,
Year = {2009},
Pages = {139--146},
Abstract = {The DPO approach for graph transformations is based on productions and direct transformations defined by two pushouts, where, roughly spoken, in the first pushout all items in L without K are deleted and in the second one all items R without K are added, while those items in K are preserved. Intuitively, K is the intersection of L and R and, formally, p is a span of graph morphisms. In this paper, we consider productions which are cospans of graph morphisms, and K corresponds to the union of L and R. As before, direct transformations are defined by double pushouts, but now the first pushout adds all items in KnL and the second one deletes KnR. This basic idea can be extended to an alternative graph transformation approach, called cospan DPO approach. Key notions of the classical DPO approach can be reformulated in the cospan DPO approach and our main result shows in which way corresponding concepts and results are equivalent.},
Owner = {Claudia},
Timestamp = {2009.09.21},
Url = {http://www.eatcs.org/images/bulletin/beatcs98.pdf}
}
@Article{EHS09,
Title = {{Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions}},
Author = {Ehrig, Hartmut and Hermann, Frank and Sartorius, Christoph},
Journal = {ECEASST},
Year = {2009},
Volume = {18},
Abstract = {Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been inves- tigated and applied to several case studies and they show a convenient combination of formal and intuitive speci?cation abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules for the integrated model simplifies the specification and enhances usability as well as consistency. Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars. As a first main result we can extend the composi- tion/decomposition result for triple graph grammars to the case with NACs. This allows us to show completeness and correctness of model transformations based on rules with NACs and furthermore, we can extend the characterization of information preserving model transformations to the case with NACs. The presented results are applicable to several model transformations and in partic- ular to the well known model transformation from class diagrams to relational data bases, which we present as running example with NACs.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'09)},
Editor = { Heckel, Reiko and Boronat, Artur },
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, triple graph grammars, completeness, correct- ness, negative application conditions},
Location = {York, UK},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/27}
}
@TechReport{EHS09b,
Title = {{Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions (Long Version)}},
Author = {Ehrig, Hartmut and Hermann, Frank and Sartorius, Christoph},
Institution = {TU Berlin},
Year = {2009},
Number = {2009/3},
Abstract = {Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been investigated and applied to several case studies and they show a convenient combination of formal and intuitive specification abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules for the integrated model simplifies the specification and enhances usability as well as consistency. Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars. As a first main result we can extend the composition/decomposition result for triple graph grammars to the case with NACs. This allows us to show completeness and correctness of model transformations based on rules with NACs and furthermore, we can extend the characterization of information preserving model transformations to the case with NACs. The presented results are applicable to several model transformations and in particular to the well known model transformation from class diagrams to relational data bases, which we present as running example with NACs.},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2009/tr-2009-03.pdf}
}
@Article{EHSB11,
Title = {{Propagation of Constraints along Model Transformations Based on Triple Graph Grammars}},
Author = {Ehrig, H. and Hermann, F. and Sch\"olzel, H. and Brandt, C.},
Journal = {ECEASST},
Year = {2011},
Volume = {41},
Abstract = {Model transformations based on triple graph grammars (TGGs) have been applied in several practical case studies and they convince by their intuitive and descriptive way of specifying bidirectional model transformations. Moreover, fundamental properties have been extensively studied including syntactical correctness, completeness, termination and functional behaviour. But up to now, it is an open problem how domain specific properties that are valid for a source model can be preserved along model transformations such that the transformed properties are valid for the derived target model. In this paper, we analyse in the framework of TGGs how to propagate constraints from a source model to an integrated and target model such that, whenever the source model satisfies the source constraint also the integrated and target model satisfy the corresponding integrated and target constraint. In our main new results we show under which conditions this is possible. The case study shows how this result is successfully applied for the propagation of security constraints in enterprise modelling between business and IT models.},
Booktitle = {Proceedings of the International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'11)},
Editor = {Mariani, L. and Gaducci, F.},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph constraints, security requirements, triple graph grammars},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Article{EHSB13,
Title = {Propagation of constraints along model transformations using triple graph grammars and borrowed context},
Author = {Hartmut Ehrig and Frank Hermann and Hanna Sch\"olzel and Christoph Brandt},
Journal = {Visual Languages and Computing},
Year = {2013},
Number = {5},
Pages = {365-388},
Volume = {24},
Owner = {Claudia},
Timestamp = {2014.02.04}
}
@InProceedings{EH89,
Title = {{The Construct PRO of Projection Spaces: Its Internal Structure}},
Author = {Ehrig, H. and Herrlich, H.},
Booktitle = {Categorical Methods in Computer Science},
Year = {1989},
Pages = {286--293},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@InProceedings{EHS81,
Title = {{A Graph Theoretical Model for Multi-Pass Parsing}},
Author = {Ehrig, H. and Hoffmann, B. and Schmiedicke, I. R.},
Booktitle = {Proc. Workshop on Graph-Theoretical Concepts in Computer Science, Linz},
Year = {1981},
Editor = {M\"uhlbacher, J. R.},
Pages = {19--31},
Publisher = {Hanser Verlag}
}
@InProceedings{EHGP08,
Title = {{Composition and Independence of High-Level Net Processes}},
Author = {Ehrig, H. and Hoffmann, K. and Gabriel, K. and Padberg, J.},
Booktitle = {Proc. Workshop on Formal Methods for Wireless Systems (FMWS'08)},
Year = {2009},
Address = {Amsterdam},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {242(2)},
Abstract = {Mobile ad-hoc networks (manets) are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure. To model workflows in manets adequately a formal techniques is given by algebraic higher-order nets. For this modeling technique we here present a high-level net process semantics and results concerning composition and independence. Based on the notion of processes for low-level Petri nets we analyse in this paper high-level net processes defining the non-sequential behaviour of high-level nets. In contrast to taking low-level processes of the well known flattening construction for high-level nets our concept of high-level net processes preserves the high-level structure. The main results are the composition, equivalence and independence of high-level net processes under suitable conditions. Independence means that they can be composed in any order leading to equivalent high-level net processes which especially have the same input/output behaviour. All concepts and results are explained with a running example of a mobile ad-hoc network in the area of an university campus. },
Keywords = {Algebraic models, algebraic high-level nets, behavioural semantics, high-level net processes, mobility, analysis of nets, composition of processes, equivalence and independence of processes},
Location = {Toronto, Canada},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EHGP08.pdf}
}
@InProceedings{EHP06,
Title = {{Transformations of Petri Nets}},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J.},
Booktitle = {{Proceedings of the School of SegraVis Research Training Network on Foundations of Visual Modelling Techniques (FoVMT 2004)}},
Year = {2006},
Address = {Amsterdam},
Editor = {Heckel, R.},
Month = {January},
Pages = {151--172},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {148 / 1},
Abstract = { The aim of this paper is an introduction to the area of Petri net transformations, a rule-based approach for dynamic changes of the net structure of Petri nets. This is especially important for the stepwise construction of Petri nets in the sense of the software development process in software engineering. The concept of Petri net transformations is based on that of graph transformations and high-level replacement systems and it is introduced within a small case study logistics. },
ISSN = {1571-0661},
Keywords = {Petri nets, rule-based approach, transformations, high-level replacement systems, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EHP06.pdf}
}
@InCollection{EHPBH01,
Title = {High-Level Net Processes},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J. and Baldan, P. and Heckel, R.},
Booktitle = {Formal and Natural Computing},
Publisher = Springer,
Year = {2002},
Editor = {Brauer, W. and Ehrig, H. and Karhum\"aki, J. and Salomaa, A.},
Pages = {191 - 219},
Series = lncs,
Volume = {2300}
}
@InCollection{EHP+08,
Title = {{Petri Net Transformations}},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J. and Ermel, C. and Prange, U. and Biermann, E. and Modica, T.},
Booktitle = {{Petri Net Theory and Applications}},
Publisher = {I-Tech Education and Publication},
Year = {2008},
Pages = {1--16},
Abstract = { Modelling the adaption of a system to a changing environment gets more and more important. Application areas cover e.g. computer supported cooperative work, multi agent systems, dynamic process mining or mobile networks. One approach to combine formal modelling of dynamic systems and controlled model adaption are Petri net transformations. The main idea behind net transformation is the stepwise development of place/transition nets by given rules. Think of these rules as replacement systems where the left-hand side is replaced by the right-hand side while preserving a context. This approach increases the expressiveness of Petri nets and allows in addition to the well known token game a formal description of structural changes. },
ISBN = {978-3-902613-12-7},
Keywords = {graph transformation, Petri net transformation, Petri net composition},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EHP+08.pdf}
}
@InProceedings{EHP+07,
Title = {Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems},
Author = {Ehrig, H. and Hoffmann, K. and Padberg, J. and Prange, U. and Ermel, C.},
Booktitle = {Proc. of 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency},
Year = {2007},
Editor = {Jetty Kleijn and Alex Yakovlev },
Pages = {104--123},
Publisher = {Springer},
Series = lncs,
Volume = {4546},
Abstract = {Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements of the environment. In this paper we use transformation rules for place/transition systems in the sense of the double pushout approach for graph transformation. The main problem in this context is to analyze under which conditions net transformations and token firing can be executed in arbitrary order. This problem is solved in the main theorems of this paper. Reconfigurable place/transition systems are applied in a mobile network scenario. },
Keywords = {Petri net, transformation, independence, reconfigurable P/T nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/EHP+07.pdf}
}
@Article{EJO95,
Title = {Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Language},
Author = {H. Ehrig and R. M. Jimenez and F. Orejas},
Journal = {Special Issue of MSCS},
Year = {1995},
Number = {2},
Pages = {283--314},
Volume = {5}
}
@InProceedings{EJO93,
Title = {Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Language},
Author = {H. Ehrig and R. M. Jimenez and F. Orejas},
Booktitle = {Proc.\ TAPSOFT '93, Paris},
Year = {1993},
Pages = {16--30},
Publisher = Springer,
Series = lncs,
Volume = {668}
}
@Article{EH06,
Title = {Deriving {B}isimulation {C}ongruences in the {DPO} {A}pproach to {G}raph {R}ewriting with {B}orrowed {C}ontexts},
Author = {Hartmut Ehrig and Barbara K\"onig},
Journal = {Mathematical Structures in Computer Science},
Year = {2006},
Number = {6},
Pages = {1133--1163},
Volume = {16}
}
@Article{EK79a,
Title = {{Categorical Approach to Nonlinear Constant Continuous Time Systems}},
Author = {Ehrig, H. and K\"uhnel, W.},
Journal = {RAIRO},
Year = {1979},
Number = {2},
Pages = {107--133},
Volume = {13}
}
@Article{EK74,
Title = {{Topological Automata}},
Author = {Ehrig, H. and K\"uhnel, W.},
Journal = {RAIRO},
Year = {1974},
Pages = {73--91},
Volume = {3}
}
@InProceedings{EKP75,
Title = {{Diagram Characterization of Recursion}},
Author = {Ehrig, H. and K\"uhnel, W. and Pfender, M.},
Booktitle = {Proc. 1st Intern. Symp. Category Theory Applied to Computation and Control, San Francisco},
Year = {1975},
Pages = {137--143},
Publisher = Springer,
Series = lncs,
Volume = {25}
}
@Book{EKKK74,
Title = {Universal Theory of Automata},
Author = {Ehrig, H. and Kiermeier, K.D. and Kreowski, H.J. and K\"uhnel, W.},
Publisher = {B. G. Teubner},
Year = {1974},
Address = {Stuttgart}
}
@InProceedings{EK03,
Title = {{Formal Specification Techniques for Software and Systems Engineering}},
Author = {Ehrig, H. and Kluge, O.},
Booktitle = {Proc. FORMS 2003},
Year = {2003},
Address = {Budapest},
Pages = {23--36}
}
@InProceedings{EK04,
Title = {Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting},
Author = {Ehrig, H. and Koenig, B.},
Booktitle = {Proc. FOSSACS 2004},
Year = {2004},
Pages = {151-166},
Publisher = Springer,
Series = lncs,
Volume = {2987},
Abstract = { Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (double-pushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO approach, has a very constructive nature and requires only a minimum of category theory. The core part of this paper is the proof sketch that the bisimilarity based on rewriting with borrowed contexts is a congruence relation.},
ISSN = {ISBN 3-540-21298-1},
Keywords = {bisimulation, graph rewriting},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EK04.pdf}
}
@InProceedings{EK95,
Title = {Computing with Algebraic Graph Transformations: Overview of Recent Results},
Author = {H. Ehrig and M. Korff},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {G. Valiente Feruglio and F. Rosello Llompart},
Organization = {Technical Report B-19, Universitat de les Illes Balears},
Pages = {17--23},
Publisher = {Universitat de les Illes Balears}
}
@InProceedings{EK94,
Title = {Computing with Algebraic Graph Transformations: An Overview of Recent Results},
Author = {Ehrig, H. and Korff, M.},
Booktitle = {Proc. of Graph Grammar Workshop, Mallorca, Spain},
Year = {1994}
}
@TechReport{EK94a,
Title = {Computing by Graph Transformation {II} ({COMPUGRAPH II}). First Interim Report ESPRIT Basic Research Group No. 7183},
Author = {Ehrig, H. and Korff, M.},
Institution = TUB,
Year = {1994},
Number = {94-04}
}
@TechReport{EK94b,
Title = {Computing by Graph Transformation {II} ({COMPUGRAPH II}). Second Interim Report ESPRIT Basic Research Group No. 7183},
Author = {Ehrig, H. and Korff, M.},
Institution = TUB,
Year = {1994},
Number = {94-35}
}
@Article{EK93,
Title = {{Computing by Graph Transformations II, ESPRIT BRWG COMPUGRAPH}},
Author = {Ehrig, H. and Korff, M.},
Journal = BEATCS,
Year = {1993},
Pages = {105-111},
Volume = {50}
}
@TechReport{EKL90,
Title = {Tutorial Introduction to the Algebraic Approach of Graph Grammars Based on Double and Single Pushouts},
Author = {Ehrig, H. and Korff, M. and L{\"o}we, M.},
Institution = TUB,
Year = {1990},
Number = {90-21}
}
@Article{EK83,
Title = {Compatibility of Parameter Passing and Implementation of Parameterized Types},
Author = {H. Ehrig and H. J. Kreowski},
Journal = {TCS},
Year = {1983},
Pages = {255--286},
Volume = {27}
}
@Article{EKMP82,
Title = {Algebraic Implementation of Abstract Data Types},
Author = {H. Ehrig and H. J. Kreowski and B. Mahr and P. Padawitz},
Journal = {TCS},
Year = {1982},
Pages = {209--263},
Volume = {20}
}
@InProceedings{EKT+81,
Title = {Parameter Passing in Algebraic Specification Languages},
Author = {H. Ehrig and H. J. Kreowski and J. W. Thatcher and E. G. Wagner and J. B. Wright},
Booktitle = {Workshop on Program Specification, Aarhus},
Year = {1981},
Note = {Also appeared in TCS 28 (1984), pp.\ 45--81.},
Pages = {322-369},
Publisher = Springer,
Series = lncs,
Volume = {134}
}
@InProceedings{EKT+80,
Title = {Parameterized Data Types in Algebraic Specification Languages},
Author = {H. Ehrig and H. J. Kreowski and J. W. Thatcher and E. G. Wagner and J. B. Wright},
Booktitle = {Proc.\ ICALP'80},
Year = {1980},
Pages = {157--168},
Publisher = Springer,
Series = lncs,
Volume = {85}
}
@InCollection{EK99,
Title = {{Refinement and Implementation}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Algebraic Foundations of Systems Specification},
Publisher = {Springer Verlag},
Year = {1999},
Chapter = {7},
Editor = {Astesiano, E. and Kreowski, H.-J. and Krieg-Br\"uckner, B.},
Pages = {201--242},
Organization = {IFIP State-of-the-Arts Reports}
}
@Article{EK79b,
Title = {{The Skeleton of Minimal Realization}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Journal = {Studien zur Algebra und Anwendungen},
Year = {1979},
Pages = {137--154},
Volume = {7},
Editor = {Hoehnke, H.-D.},
Publisher = {Akademie-Verlag}
}
@InCollection{EK76,
Title = {Parallel Graph Grammars},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Automata, Languages, Development},
Publisher = {Amsterdam: North Holland},
Year = {1976},
Editor = {Lindenmayer, A. and Rozenberg, G.},
Pages = {425--447}
}
@InProceedings{EK79d,
Title = {{A Graph Grammar Approach to Optimal and Consistent Schedules in Data Base Systems}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Workshop WG'79 Graphentheoretische Konzepte in der Informatik, Berlin},
Year = {1979},
Editor = {Pape, U.},
Pages = {223--240},
Publisher = {Hanser-Verlag M\"unchen-Wien}
}
@InProceedings{EK82,
Title = {Parameter passing commutes with implementation of parameterized data types},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {9th Int. Coll. Automata, Languages, and Programming, Aarhu},
Year = {1982},
Pages = {197--211},
Publisher = Springer,
Series = lncs,
Volume = {149}
}
@InProceedings{EK81,
Title = {{Keywords in Context: An Algebraic Specification}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Workshop on Program Specification, Aarhus, Denmark},
Year = {1981},
Pages = {78--83},
Publisher = Springer,
Series = lncs,
Volume = {134}
}
@Article{EK80,
Title = {{Applications of Graph Grammar Theory to Consistency, Synchronization, and Scheduling in Database Systems}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Journal = {Information Systems},
Year = {1980},
Pages = {225-238},
Volume = {5}
}
@Article{EK79,
Title = {Pushout-properties: an analysis of gluing constructions for graphs},
Author = {Ehrig, H. and Kreowski, H.-J.},
Journal = {Mathematische Nachrichten},
Year = {1979},
Pages = {135--149},
Volume = {91}
}
@InProceedings{EK79c,
Title = {{Neue Aspekte algebraischer Spezifikationsschemata f\"ur Datenbanksysteme}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Workshop Formale Modelle f\"ur Informationssysteme, IFB 21},
Year = {1979},
Pages = {181--198}
}
@InProceedings{EK78,
Title = {Pushout Properties: An Analysis of Gluing Constructions for Graphs,},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Nordwestdeutsches Kategorienseminar, Bielefeld},
Year = {1978},
Pages = {69--89},
Publisher = {University of Bielefeld}
}
@InProceedings{EK78a,
Title = {{Algebraic Theory of Graph Grammars Applied to Consistency and Synchronization in Data Base Systems}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Workshop WG'78 Graphentheoretische Konzepte in der Informatik},
Year = {1978},
Pages = {227-244},
Publisher = {Hanser Verlag}
}
@InProceedings{EK76a,
Title = {Categorical theory of graphical systems and graph grammars},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Conf. Report Algebraic System Theory, Udine 1975, Lecture Notes Econ. Math. Syst. 131 (1976)},
Year = {1976},
Pages = {323--351},
Publisher = Springer
}
@InProceedings{EK76b,
Title = {Parallelism of Manipulations in Multidimensional Information Structures},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Conf. Math. Foundations of Computer Science},
Year = {1976},
Pages = {284 -- 293},
Publisher = Springer,
Series = lncs,
Volume = {45}
}
@InProceedings{EK76c,
Title = {{Minimization Concepts of Automata in Pseudoclosed Categories}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Conf. Report Algebraic System Theory, Udine 1975, Lecture Notes Econ. Math. Syst. 131 (1976)},
Year = {1976},
Pages = {359--374},
Publisher = Springer
}
@InProceedings{EK76d,
Title = {{Algebraic Graph Theory Applied in Computer Science}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. Conf. Categorical and Algebraic Methods in Comp. Science and Systems Theory, Dortmund, Germany},
Year = {1976}
}
@Article{EK76e,
Title = {{Systematic Approach to Reduction and Minimization in Automata and System Theory}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Journal = {Journal Computer Syst. Science},
Year = {1976},
Number = {3},
Pages = {269--304},
Volume = {12}
}
@InProceedings{EK75,
Title = {{Power and Initial Automata in Pseudoclosed Categories}},
Author = {Ehrig, H. and Kreowski, H.-J.},
Booktitle = {Proc. 1st Intern. Symp. Category Theory Applied to Computation and Control, San Francisco},
Year = {1975},
Pages = {144--150},
Publisher = Springer,
Series = lncs,
Volume = {25}
}
@InProceedings{EKMRW78,
Title = {{Deriving Structures from Structures}},
Author = {Ehrig, H. and Kreowski, H.-J. and Maggiolo-Schettini, A. and Rosen, B.K. and Winkowski, J.},
Booktitle = {Proc. 7th Int. Symp. on Math. Found. of Comp. Science, Zakopane},
Year = {1978},
Pages = {177--190},
Publisher = Springer,
Series = lncs,
Volume = {64}
}
@Article{EKM+81,
Title = {Transformation of structures: an algebraic approach},
Author = {Ehrig, H. and Kreowski, H.-J. and Maggiolo-Schettini, A. and Rosen, B. K. and Winkowski, J.},
Journal = {Mathematical Systems Theory},
Year = {1981},
Pages = {305--334},
Volume = {14}
}
@InProceedings{EKMP80,
Title = {{Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems}},
Author = {Ehrig, H. and Kreowski, H.-J. and Mahr, B. and Padawitz, P.},
Booktitle = {Proc. Conf. Math. Foundations of Computer Science, Rydzyna},
Year = {1980},
Pages = {231-245},
Publisher = Springer,
Series = lncs,
Volume = {88}
}
@Article{EKO97,
Title = {Correctness of Horizontal and Vertical Composition for Implementation Concepts Based on Constructors and Abstractors},
Author = {Ehrig, H. and Kreowski, H.-J. and Orejas, F.},
Journal = {REVISTA MAEMATICA de la Universidad Complutense de Madrid, vol. 10, no. 2},
Year = {1997},
Pages = {365--387}
}
@TechReport{EKO96,
Title = {Correctness of Horizontal and Vertical Composition for Implementation Concepts Based on Constructors and Abstractors},
Author = {Ehrig, H. and Kreowski, H.-J. and Orejas, F.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-12}
}
@Article{EKO95,
Title = {Correctness of Actualization for Parameterized Implementation Concepts Based on Constructors and Abstractors},
Author = {Ehrig, H. and Kreowski, H.-J. and Orejas, F.},
Journal = BEATCS,
Year = {1995},
Pages = {79--85},
Volume = {56}
}
@InProceedings{EKP80,
Title = {A Case Study of Abstract Implementation and their Correctness},
Author = {Ehrig, H. and Kreowski, H.-J. and Padawitz, P.},
Booktitle = {Proc. 4th Int. Symp. on Programming},
Year = {1980},
Pages = {108--122},
Publisher = Springer,
Series = lncs,
Volume = {83}
}
@InProceedings{EKP80a,
Title = {Algebraic implementation of abstract data types: Concept, Syntax, Semantics, and Correctness.},
Author = {Ehrig, H. and Kreowski, H.-J. and Padawitz, P.},
Booktitle = {Proc. ICALP'80},
Year = {1980},
Pages = {142--156},
Publisher = Springer,
Series = lncs,
Volume = {85}
}
@InProceedings{EKP78,
Title = {Stepwise specification and implementation of abstract data types},
Author = {Ehrig, H. and Kreowski, H.-J. and Padawitz, P.},
Booktitle = {5th Int. Coll. Automata, Languages, and Programming},
Year = {1978},
Pages = {205--226},
Publisher = Springer,
Series = lncs,
Volume = {62}
}
@Article{EKP74,
Title = {{Kategorielle Theorie der Reduktion, Minimierung und \"Aquivalenz von Automaten}},
Author = {Ehrig, H. and Kreowski, H.-J. and Pfender, M.},
Journal = {Math. Nachr.},
Year = {1974},
Pages = {105--124},
Volume = {59}
}
@InProceedings{EKT94,
Title = {Canonical Derivations for High Level Replacement Systems},
Author = {Ehrig, H. and Kreowski, H-J. and Taentzer, G.},
Booktitle = {Graph Transformation in Computer Science},
Year = {1994},
Note = {Also Technical Report 6/92, University of Bremen},
Pages = {153--169},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@Article{EKTWW84,
Title = {Parameter Passing in Algebraic Specification Languages},
Author = {Ehrig, H. and Kreowski, H.-J. and Thatcher, J.W. and Wagner, E.G. and Wright, J.B.},
Journal = TCS,
Year = {1984},
Pages = {45--81},
Volume = {28}
}
@InProceedings{EKTWW81,
Title = {Parameter Passing in Algebraic Specification Languages},
Author = {Ehrig, H. and Kreowski, H.-J. and Thatcher, J.W. and Wagner, E.G. and Wright, J.B.},
Booktitle = {Workshop on Program Specification, Aarhus},
Year = {1981},
Pages = {322--369},
Publisher = Springer,
Series = lncs,
Volume = {134}
}
@InProceedings{EKTWW80,
Title = {Parameterized data types in algebraic specification languages},
Author = {Ehrig, H. and Kreowski, H.-J. and Thatcher, J.W. and Wagner, E.G. and Wright, J.B.},
Booktitle = {Proc. ICALP '80},
Year = {1980},
Pages = {157--168},
Publisher = Springer,
Series = lncs,
Volume = {85}
}
@InProceedings{EKW78,
Title = {Algebraic specification schemes for data base systems.},
Author = {Ehrig, H. and Kreowski, H.-J. and Weber, H.},
Booktitle = {Proc. 4th Int. Conf. Very Large Data Bases},
Year = {1978},
Pages = {427--440},
Publisher = {Hahn-Meitner-Institut f{\"u}r Kernforschung, HMI-B266}
}
@Article{EL91c,
Title = {Parallel and Distributed Derivations in the Single Pushout Approach},
Author = {Ehrig, H. and L{\"o}we, M.},
Journal = {TCS},
Year = {1993},
Note = {Tech. Rep. 91/01 Technical University Berlin},
Pages = {123 - 143},
Volume = {109}
}
@Article{EL93a,
Title = {Parallel and Distributed Derivations in the Single Pushout Approach},
Author = {Ehrig, H. and L{\"o}we, M.},
Journal = TCS,
Year = {1993},
Pages = {123--143},
Volume = {109}
}
@Article{EL93b,
Title = {Parallel and Distributed Derivations in the Single Pushout Approach},
Author = {Ehrig, H. and L{\"o}we, M.},
Journal = TCS,
Year = {1993},
Note = {Also in Tech. Rep. 91/01, Technical University of Berlin},
Pages = {123 - 143},
Volume = {109}
}
@Article{EL93d,
Title = {{Categorical Principles, Techniques and Results for High-level Replacement Systems in Computer Science}},
Author = {Ehrig, H. and L{\"o}we, M.},
Journal = {Applied Categorical Structures},
Year = {1993},
Number = {1},
Pages = {21--50},
Volume = {1}
}
@Article{EL92,
Title = {From Parallel to Distributed Derivations of Graphs in the Single Pushout Approach},
Author = {Ehrig, H. and L{\"o}we, M.},
Journal = {Memorial Volume for R. Frank, Inf. Fachberichte 309, Berlin},
Year = {1992},
Pages = {47--65},
Publisher = Springer
}
@TechReport{EL92b,
Title = {Computing by graph transformation ({COMPUGRAPH}): a survey},
Author = {Ehrig, H. and L{\"o}we, M.},
Institution = FB13,
Year = {1992},
Number = {92/14}
}
@TechReport{EL92c,
Title = {Computing by graph transformation --- Final Report},
Author = {Ehrig, H. and L{\"o}we, M.},
Institution = FB13,
Year = {1992},
Note = {Short Version in EATCS Bulletin 47 (1992)},
Number = {92/08}
}
@TechReport{EL91a,
Title = {Parallel and Distributed Derivations in the Single Pushout Approach},
Author = {Ehrig, H. and L{\"o}we, M.},
Institution = FB13,
Year = {1991},
Number = {91-01}
}
@InProceedings{EL91b,
Title = {Computing by graph transformation--overall aims and new results},
Author = {Ehrig, H. and L{\"o}we(eds.), M.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Note = {also in EATCS-Bulletin 41, 1990},
Pages = {688--697},
Publisher = Springer,
Series = lncs,
Volume = {532}
}
@TechReport{EL89,
Title = {Computing by graph transformation ({Gra Gra}) --- Objectives, State-of-the-Art and Research Issues, References)},
Author = {Ehrig, H. and L{\"o}we(eds.), M.},
Institution = FB13,
Year = {1989},
Number = {89/14}
}
@Article{EL91,
Title = {Computing by graph transformation--overall aims and new results},
Author = {Ehrig, H. and L\"owe (eds.), M.},
Journal = BEATCS,
Year = {1991},
Pages = {59--73},
Volume = {45}
}
@Article{EL93,
Title = {Categorical Principles, Techniques and Results for High-Level-Replacement Systems in Computer Science},
Author = {Ehrig, H. and L\"owe, M.},
Journal = {Applied Categorical Structures (1)},
Year = {1993},
Pages = {21--50}
}
@InCollection{EL93c,
Title = {The {ESPRIT BRWG COMPUGRAPH} {C}omputing by {G}raph {T}ransformations : A Survey},
Author = {Ehrig, H. and L\"owe, M.},
Booktitle = {TCS 109},
Publisher = {North-Holland},
Year = {1993},
Pages = {3 -- 6}
}
@InProceedings{ELO95,
Title = {{Dynamic Abstract Data Types Based on Algebraic Graph Transformations}},
Author = {Ehrig, H. and L\"owe, M. and Orejas, F.},
Booktitle = {Proc. of ADT-COMPASS Workshop},
Year = {1995},
Pages = {236-254},
Publisher = Springer,
Series = lncs,
Volume = {906}
}
@TechReport{ELO94,
Title = {Dynamic abstract data types based on algebraic graph transformations},
Author = {Ehrig, H. and L\"owe, M. and Orejas, F.},
Institution = {TU Berlin},
Year = {1994},
Number = {94--37}
}
@InCollection{EL79,
Title = {{Locally Star-Gluing Formulas for a Class of Parallel Graph Grammars}},
Author = {Ehrig, H. and Liedtke, A.},
Booktitle = {1st Int.\ Workshop on Graph Grammars and their Application to Computer Science and Biology},
Publisher = Springer,
Year = {1979},
Series = lncs,
Volume = {73}
}
@InProceedings{ELH98,
Title = {DoublePB and loose Semantics(???)},
Author = {Ehrig, H. and Llabres, M. and Heckel, R.},
Booktitle = {Proc. international GraGra Workshop},
Year = {1998}
}
@InProceedings{EM97,
Title = {Future Trends of {TAPSOFT}},
Author = {Ehrig, H. and Mahr, B.},
Booktitle = {TAPSOFT'97},
Year = {1997},
Editor = {Bidoit, M. and Dauchet, M.},
Pages = {6--10},
Publisher = Springer,
Series = lncs,
Volume = {1214}
}
@InCollection{EM01,
Title = {{Algebraic Techniques in Software Development: A Review of Progress up to the Mid Nineties}},
Author = {Ehrig, H. and Mahr, B.},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century },
Publisher = {World Scientific, Singapore etc. 2001},
Year = {2001},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {134-152}
}
@InCollection{EM01a,
Title = {{Theory and Practice of Software Development: A Review of Driving Forces and Expectations of TAPSOFT from 1985 to 1997}},
Author = {Ehrig, H. and Mahr, B.},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century },
Publisher = {World Scientific, Singapore etc. 2001},
Year = {2001},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {118--130}
}
@Article{EM96,
Title = {Algebraic Techniques in Software Development - A Review of Progress within the last two Decades},
Author = {Ehrig, H. and Mahr, B.},
Journal = BEATCS,
Year = {1996},
Pages = {105-117}
}
@InProceedings{EM95,
Title = {A Decade of {TAPSOFT}: Aspects of Progress and Prospects in Theory and Practice of Software Development},
Author = {Ehrig, H. and Mahr, B.},
Booktitle = {Proc. TAPSOFT'95},
Year = {1995},
Pages = {3--24},
Publisher = Springer,
Series = lncs,
Volume = {915}
}
@TechReport{EM95a,
Title = {A Decade of {TAPSOFT}: Aspects of Progress and Prospects in Theory and Practice of Software Development},
Author = {Ehrig, H. and Mahr, B.},
Institution = TUB,
Year = {1995},
Number = {95-01}
}
@Article{EM95b,
Title = {Theory and Practice of Software Development: A Review of Driving Forces and Expectations},
Author = {Ehrig, H. and Mahr, B.},
Journal = BEATCS,
Year = {1995},
Pages = {135--144},
Volume = {57}
}
@Book{EM90,
Title = {Fundamentals of Algebraic Specification 2: Module Specifications and Constraints},
Author = {H. Ehrig and B. Mahr},
Publisher = Springer,
Year = {1990},
Address = {Berlin},
Series = {EATCS Monographs on Theoretical Computer Science},
Volume = {21}
}
@Book{EM85,
Title = {Fundamentals of Algebraic Specification 1: Equations and Initial Semantics},
Author = {H. Ehrig and B. Mahr},
Publisher = Springer,
Year = {1985},
Address = {Berlin},
Series = {EATCS Monographs on Theoretical Computer Science},
Volume = {6}
}
@Article{EM81,
Title = {Complexity of Algebraic Implementations for Abstract Data Types},
Author = {H. Ehrig and B. Mahr},
Journal = {JCSS},
Year = {1981},
Pages = {223--253},
Volume = {23}
}
@InProceedings{EM80,
Title = {{Complexity of Implementations on the Level of Algebraic Specifications}},
Author = {H. Ehrig and B. Mahr},
Booktitle = {Proc. 12th ACM Symposium Theory of Comp., Los Angeles},
Year = {1980},
Pages = {281--293}
}
@Article{EMCO92,
Title = {Introduction to Algebraic Specification -- {P}art 1: Formal Methods for Software Development},
Author = {H. Ehrig and B. Mahr and I. {Cla\ss en} and F. Orejas},
Journal = {The Computer Journal},
Year = {1992},
Number = {5},
Pages = {460--467},
Volume = {35}
}
@Book{EMC+98,
Title = {Mathematisch--strukturelle Grundlagen der Informatik},
Author = {Ehrig, H. and Mahr, B. and Cornelius, F. and {Gro{\ss}e--Rhode}, M. and Zeitz, P.},
Publisher = {Springer Verlag, Berlin Heidelberg New--York},
Year = {1998}
}
@Book{EMC+01,
Title = {Mathematisch Strukturelle Grundlagen der Informatik, 2. \"uberarbeitete Auflage},
Author = {Ehrig, H. and Mahr, B. and Cornelius, F. and Grosse-Rhode, M. and Zeitz, P. and Schr\"oter, G. and Robering, K.},
Publisher = Springer,
Year = {2001},
Keywords = {Mathematische Grundbegriffe, algebraische Strukturen, Aussagen- und Praedikatenlogik, Kategorientheorie}
}
@Article{EMO92,
Title = {Introduction to Algebraic Specification -- {P}art2: From Classical View to Foundations of System Specifications},
Author = {H. Ehrig and B. Mahr and F. Orejas},
Journal = {The Computer Journal},
Year = {1992},
Number = {5},
Pages = {468--477},
Volume = {35}
}
@TechReport{EMW98,
Title = {Categorical {C}oncepts for {L}ogical {S}ystems and {F}ormal {S}pecification in {C}omputer {S}cience},
Author = {Ehrig, H. and Martini, A. and Wolter, U.},
Institution = {Fernuniversit{\"a}t Hagen},
Year = {1998},
Number = {Band 63, Teil 1},
Type = {Seminarberichte aus dem Fachbereich Mathematik},
Pages = {131--148}
}
@Article{EMP97,
Title = {{How to Transfer Concepts of Abstract Data Types to Petri Nets}},
Author = {Ehrig, H. and Merten, A. and Padberg, J.},
Journal = BEACTS,
Year = {1997},
Pages = {106--104},
Volume = {62}
}
@TechReport{EMP97a,
Title = {How to Transfer Concepts of Abstract Data Types to Petri Nets},
Author = {Ehrig, H. and Merten, A. and Padberg, J.},
Institution = TUB,
Year = {1997},
Number = {97-21},
Pages = {29--38}
}
@InProceedings{EO01b,
Title = {{Integration Paradigm for Data Type and Process Specification Techniques}},
Author = {H. Ehrig and and F. Orejas},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century},
Year = {2001},
Editor = {G. Paun and G. Rozenberg and A. Salomaa},
Pages = {192 -- 201},
Publisher = {World Scientific, Singapore},
Keywords = {Algebraic Specification, Graph Transformation, Integration of Modeling Techniques, Petri Nets, Process Specification Techniques},
Url = {http://www.user.tu-berlin.de/lieske/tfs/public/EO01a.ps.gz}
}
@InCollection{EO01c,
Title = {{Dynamic Abstract Data Types: An Informal Proposal in 1994}},
Author = {Ehrig, H. and Orejas, F.},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century },
Publisher = {World Scientific, Singapore etc. 2001},
Year = {2001},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {180--191}
}
@InProceedings{EO02,
Title = {A generic component framework for system modeling },
Author = {Ehrig, H. and Orejas, F.},
Booktitle = {Proceedings of ETAPS-FASE (Fundamental Approaches of Software Engineering)},
Year = {2002},
Pages = {33-48},
Publisher = Springer,
Series = lncs,
Volume = {2306}
}
@TechReport{EO01,
Title = {{A Generic Component Concept for Integrated Data Type and Process Specification Techniques}},
Author = {Ehrig, H. and Orejas, F.},
Institution = {Technische Universit\"at Berlin, FB Informatik},
Year = {2001},
Number = {2001/12}
}
@InProceedings{EO01a,
Title = {{A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques}},
Author = {Ehrig, H. and Orejas, F.},
Booktitle = {Proc. GT-VMT 2001, ICALP 2001 Satellite Workshops},
Year = {2001},
Address = {Heraclion, Greece},
Pages = {201--228},
Keywords = {Algebraic Specification, Graph Transformation, Integration of Modeling Techniques, Petri Nets, Data Types, Process Modeling Techniques},
Url = {http://www.user.tu-berlin.de/lieske/tfs/public/EO01b.ps.gz}
}
@Misc{EO00a,
Title = {{Towards a Formal Model and a Component Concept for the Integration Paradigm}},
Author = {Ehrig, H. and Orejas, F.},
HowPublished = {Lecture at Dagstuhl Seminar "Semiformal and Formal Specification Techniques for Software Systems"},
Month = {October},
Year = {2000}
}
@Article{EO98,
Title = {{Integration Paradigm for Data Type and Process Specification Techniques}},
Author = {Ehrig, H. and Orejas, F.},
Journal = {Bull. EATCS 65, Formal Specification Column, Part 5},
Year = {1998},
Note = {also in \cite{PRS01}, pages 192 - 201}
}
@TechReport{EO98a,
Title = {Integration and Classification of Data Type and Process Specification Techniques},
Author = {Ehrig, H. and Orejas, F.},
Institution = TUB,
Year = {1998},
Number = {98-10}
}
@Article{EO94,
Title = {Dynamic Abstract Data Types: An Informal Proposal},
Author = {Ehrig, H. and Orejas, F.},
Journal = {Bull. EATCS 53},
Year = {1994},
Note = {also in \cite{PRS01}, pages 180 - 191},
Pages = {162--169},
Keywords = {DADT}
}
@Article{EOBKP04,
Title = {{A component framework for system modeling based on high-level replacement systems}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Journal = {Software and Systems Modeling},
Year = {2004},
Month = {3},
Pages = {114-134},
Abstract = {The aim of this paper is to present a generic component framework for system modeling that satisfies main requirements for component-based development in software engineering. In this sense, we have defined a framework that can be used, by providing an adequate instantiation, in connection with a large class of semi-formal and formal modeling techniques. Moreover, the framework is also flexible with respect to the connection of components, providing a compositional semantics of components. This means more precisely that the semantics of a system can be inferred from the semantics of its components. },
ISSN = {1619-1366},
Keywords = {system modeling,replacement systems}
}
@Article{EOBKP03,
Title = {{A Transformation-Based Component Framework for a Generic Integrated Modeling Technique}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Journal = {Journal of Integrated Design and Process Science},
Year = {2003},
Month = {June},
Number = {4},
Pages = {78--104},
Volume = {6},
Keywords = {Component Framework, Generic Integrated Modeling Technique},
Url = {http://www.cs.tu-berlin.de/%7Eehrig/public/eEhr03a.ps.gz}
}
@InProceedings{EOB+02,
Title = {{A Generic Component Concept for System Modeling}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Booktitle = {Proc. FASE 2002: Formal Aspects of Software Engineering},
Year = {2002},
Pages = {32--48},
Publisher = Springer,
Series = lncs,
Volume = {2306},
Abstract = {The aim of this paper is to present a generic component framework for system modeling which is especially useful for a large class of graph- and net-based modeling techniques. Moreover, the framework is also flexible with respect to a hierarchical connection of components, providing a compositional semantics of components. This means more precisely that the semantics and internal correctness of a system can be inferred from the semantics of its components. In contrast to constructor-based component concepts for data type specification techniques, our component framework is based on a generic notion of transformations. Refinements and transformations are used to express intradependencies, between the export interface and the body of a component, and interdependencies, between the import and the export interfaces of different components. This is shown by a small case study on modeling Java threads by high-level Petri nets in this paper.},
Keywords = {Components, Transformation Semantics, Generic Modeling Technique}
}
@TechReport{EOB+02a,
Title = {{A Transformation-Based Component Framework for a Generic Integrated Modeling Technique}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Institution = {Technische Universit\"at Berlin, FB Informatik},
Year = {2002},
Note = {ISSN 1436-9915},
Number = {2002-2},
Abstract = {This paper is based on two general ideas. The first one is the integration paradigm for data type and process modeling techniques developed by the first two authors within the last five years. The second one is a transformation-based component framework for system modeling presented at ETAPS 2002 in Grenoble. The aim of this paper is to join both ideas leading to a component framework for a generic integrated modeling technique. This component framework is based on transformations and is especially useful to be instantiated by graph- and net-based techniques. The main concepts are a self-contained semantics and internal correctness of components, based on a new idea of high-level constraints. Two main results concerning compositionality show that semantics and correctness for a system can be inferred from that of its components. The concepts are illustrated by a running example on modeling Java threads by high-level nets.},
Keywords = {Components, Integration Paradigm, High-Level Constraints}
}
@InProceedings{EOB+02b,
Title = {{A Transformation-Based Component Framework for a Generic Integrated Modeling Technique}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Booktitle = {Proc. of the Sixth World Conference on Integrated Design\& Process Technology (IDPT'02)},
Year = {2002},
Note = {CD-ROM, 15 pages},
Abstract = {This paper is based on two general ideas. The first one is the integration paradigm for data type and process modeling techniques developed by the first two authors within the last five years. The second one is a transformation-based component framework for system modeling presented at ETAPS 2002 in Grenoble. The aim of this paper is to join both ideas leading to a component framework for a generic integrated modeling technique. This component framework is based on transformations and is especially useful to be instantiated by graph- and net-based techniques. The main concepts are a self-contained semantics and internal correctness of components, based on a new idea of high-level constraints. Two main results concerning compositionality show that semantics and correctness for a system can be inferred from that of its components. The concepts are illustrated by a running example on modeling Java threads by high-level nets.},
Keywords = {Components, Integration Paradigm, High-Level Constraints}
}
@InProceedings{EOB+02c,
Title = {{A Component Framework based on High-Level Replacement Systems}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Booktitle = {Proc. Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'02), Satellite Event of ICGT'02},
Year = {2002},
Address = {Barcelona, Spain},
Month = {October},
Pages = {124-138},
Abstract = {This paper is based on two general concepts. The first one is a generic component framework for system modeling presented at FASE 2002, which is especially useful for graph- and net-based modeling techniques. The second one is the concept of high-level replacement systems, which has been studied within the last decade as an abstraction of the DPO-approach for graph transformation systems in a categorical framework, with instantiations to a large class of different modeling techniques. In this contribution both concepts are combined in the sense that the generic transformation concept -- essentially used in the component framework -- is instantiated by high-level replacement systems. As the main result we show how the properties for transformations required in the component framework can be shown in the case of high-level replacement systems. Moreover, some interesting extensions concerning multiple interfaces, union, and operational semantics of components are proposed.},
Editors = {Bottoni, P. and Minas, M.},
Keywords = {Components, HLR Systems, Transformation Semantics},
Url = {http://link.springer.de/link/service/series/0558/bibs/2306/23060033.htm}
}
@Article{EOB02,
Title = {{A Transformation-Based Component Framework for a Generic Integrated Modeling Technique}},
Author = {Ehrig, H. and Orejas, F. and Braatz, B. and Klein, M. and Piirainen, M.},
Journal = {Transactions of the SDPS},
Year = {2002},
Month = {December},
Note = {To appear in 2003},
Number = {4},
Pages = {78--104},
Volume = {6},
Abstract = {This paper is based on two general ideas. The first one is the integration paradigm for data type and process modeling techniques developed by the first two authors within the last five years. The second one is a transformation-based component framework for system modeling presented at ETAPS 2002 in Grenoble. The aim of this paper is to join both ideas leading to a component framework for a generic integrated modeling technique. This component framework is based on transformations and is especially useful to be instantiated by graph- and net-based techniques. The main concepts are a self-contained semantics and internal correctness of components, based on a new idea of high-level constraints. Two main results concerning compositionality show that semantics and correctness for a system can be inferred from that of its components. The concepts are illustrated by a running example on modeling Java threads by high-level nets.}
}
@Article{EOK+08,
Title = {{A Generic Approach to Connector Architectures}},
Author = {Ehrig, H. and Orejas, F. and Klein, M. and Padberg, J. and Pino, E. and Perez, S.},
Journal = {Science of Computer Programming},
Year = {2008},
Note = {To appear.},
Abstract = { },
Keywords = {category theory, connector architecture, generic approach}
}
@InProceedings{EOP99,
Title = {{Relevance, Integration and Classification of Specification Formalisms and Formal Specification Techniques}},
Author = {Ehrig, H. and Orejas, F. and Padberg, J.},
Booktitle = {Proc. FORMS'99, Braunschweig, Germany},
Year = {2000},
Pages = {31--54},
Publisher = {Forschrittberichte VDI, Reihe 12, Nr. 436, VDI-Verlag}
}
@Article{EOP99a,
Title = {{From Basic Views and Aspects to Integration of Specification Formalisms}},
Author = {Ehrig, H. and Orejas, F. and Padberg, J.},
Journal = BEATCS,
Year = {1999},
Pages = {98--108},
Volume = {69}
}
@TechReport{EOP99tr,
Title = {{Relevance, Integration and Classification of Specification Formalisms and Formal Specification Techniques}},
Author = {Ehrig, H. and Orejas, F. and Padberg, J.},
Institution = TUB,
Year = {1999},
Number = {99-13}
}
@InProceedings{EOP06,
Title = {{ Categorical Foundations of Distributed Graph Transformation}},
Author = {Ehrig, H. and Orejas, F. and Prange, U.},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Year = {2006},
Address = {Natal, Brazil},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Month = {September},
Pages = {215 -- 229},
Publisher = Springer,
Series = lncs,
Volume = {4178},
Abstract = {A distributed graph $(N,D)$ consists of a network graph $N$ and a commutative diagram $D$ over the scheme $N$ which associates local graphs $D(n_i)$ and graph morphisms $D(e) : D(n1) \to D(n2)$ to nodes $n1, n2$ and edges $e : n1 \to n2 in N$. Although there are several interesting applications of distributed graphs and transformations, even the basic pushout constructions for the double pushout approach of distributed graph transformation could be shown up to now only in very special cases. In this paper we show that the category of distributed graphs can be considered as a Grothendieck category over a specific indexed category, which assigns to each network $N$ the category of all diagrams $D$ of shape N. In this framework it is possible to give a free construction which allows to construct for each diagram $D1$ over $N1$ and network morphism $h : N1 \to N2$ a free extension $F_h(D1)$ over $N2$ and to show that the Grothendieck category is complete and cocomplete if the underlying category of local graphs has these properties. Moreover, an explicit construction for general pushouts of distributed graphs is given. This pushout construction is based on the free construction. The non-trivial proofs for free constructions and pushouts are the main contributions of this paper and they are compared with the special cases known up to now. },
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2},
Keywords = {graph transformation approach, SPO rewriting, DPO rewriting, Sesqui Pushout},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EOP06.pdf}
}
@InCollection{EP97c,
Title = {{A Uniform Approach to Petri Nets}},
Author = {Ehrig, H. and Padberg, J.},
Booktitle = {Foundations of Computer Science: Potential - Theory - Cognition},
Publisher = Springer,
Year = {1997},
Editor = {Freksa, Ch. and Jantzen, M. and Valk,R.},
Pages = {219--231},
Series = lncs,
Volume = {1337}
}
@InProceedings{EP97,
Title = {{Introduction to Universal Parametrized Net Classes}},
Author = {Ehrig, H. and Padberg, J.},
Booktitle = {{MoveOn-Proc. der DFG-Forschergruppe``Petrinetz-Technologie''}},
Year = {1997},
Address = {Technische Universit\"at Berlin},
Editor = {Weber, H. and Ehrig, H. and Reisig, W.},
Pages = {39--51},
Publisher = {Forschungsberichte des Fachbereichs Informatik}
}
@InProceedings{EP04,
Title = {Graph Grammars and {P}etri Net Transformations},
Author = {Ehrig, H. and Padberg, J.},
Booktitle = {Lectures on Concurrency and Petri Nets Special Issue Advanced Course PNT},
Year = {2004},
Pages = {496--536},
Publisher = Springer,
Series = lncs,
Volume = {3098},
ISSN = {0302-9743},
Keywords = {graph grammars, Petri nets}
}
@TechReport{EP97a,
Title = {Introduction to Universal Parameterized Net Classes},
Author = {Ehrig, H. and Padberg, J.},
Institution = TUB,
Year = {1997},
Number = {97-21},
Pages = {39--52}
}
@Article{EP94,
Title = {{Linking Dynamic Abstract Datatypes with Algebraic High-Level Nets}},
Author = {Ehrig, H. and Padberg, J.},
Journal = {EACTS, Bull. 54},
Year = {1994},
Month = {Oct.},
Pages = {132--144}
}
@InCollection{PE94,
Title = {{Linking Algebraic High-Level Nets and Dynamic Abstract Data Types}},
Author = {Ehrig, H. and Padberg, J.},
Booktitle = {Algebraic Specification Column},
Publisher = {EATCS},
Year = {1994},
Pages = {132 -- 144},
Volume = {54},
Journal = BEATCS
}
@InProceedings{EPB+04,
Title = {A Generic Framework for Connector Architectures based on Components and Transformations},
Author = {Ehrig, H. and Padberg, J. and Braatz, B. and Klein, M. and Orejas, F. and P{\'e}rez, S. and Pino, E.},
Booktitle = {Proc. FESCA'04, satellite of ETAPS'04, Barcelona, ENTCS},
Year = {2004},
Month = {December},
Pages = {53-67},
Volume = {108},
Abstract = {The intention of this paper is to extend our generic component framework presented at FASE 2002 [H. Ehrig, F. Orejas, B. Braatz, M. Klein, and M. Piirainen. A generic component concept for system modeling. In Proc. FASE '02, LNCS 2306. Springer, 2002] to a specific kind of connector architectures similar to architectural connections in the sense of Allen and Garlan [ACM Transactions on Software Engineering and Methodology, 1997]. In our generic component framework we have considered components with explicit import, export and body parts connected by embeddings and transformations and composition of components with a compositional transformation semantics. Our framework, however, was restricted to components with a single import and export interface. Here we study architectures based on connectors with multiple imports and components with multiple exports. Architectures studied in this paper are built up from components and connectors in a noncircular way. The semantics of an architecture is defined by reduction step sequences in the sense of graph reductions. The main result shows existence and uniqueness of the semantics of an architecture as a normal form of reduction step sequences. Our generic framework is instantiated on one hand to connector architectures based on CSP as the formal specification technique in the approach by Allen and Garlan. On the other hand it is instantiated to connector architectures based on high-level-replacement systems in general and Petri nets in particular. A running example using Petri nets as modeling technique illustrates all concepts and results.},
Journal = {Electr. Notes Theor. Comput. Sci.},
Keywords = {connector architectures, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EPB+04.pdf}
}
@Misc{EPEG99,
Title = {Petrinetze: {M}odellierung, {S}trukturierung und {K}ompositionalit\"at},
Author = {Ehrig, H. and Padberg, J. and Ermel, C. and Grigoriu, L.},
HowPublished = {Skript zur {L}ehrveranstaltung, SS99, Technische Universit\"at Berlin},
Year = {1999}
}
@InProceedings{EPO01,
Title = {{From Basic Views and Aspects to Integration of Specification Formalisms }},
Author = {H. Ehrig and J. Padberg and F. Orejas},
Booktitle = {Current Trends in Theoretical Computer Science: Entering the 21st Century},
Year = {2001},
Editor = {G. Paun and G. Rozenberg and A. Salomaa},
Pages = {202 -- 214},
Publisher = {World Scientific, Singapore},
Keywords = {Algebraic Specification, Graph Transformation, Integration of Modeling Techniques, Petri Nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/public/EPO01.ps.gz}
}
@InProceedings{EPR94,
Title = {Algebraic {H}igh-{L}evel {N}ets: {Petri} {N}ets {R}evisited},
Author = {Ehrig, H. and Padberg, J. and Ribeiro, L.},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1994},
Pages = {188--206},
Publisher = Springer,
Series = lncs,
Volume = {785}
}
@TechReport{EPR93,
Title = {Algebraic High Level Nets: {P}etri Nets Revisited},
Author = {Ehrig, H. and Padberg, J. and Ribeiro, L.},
Institution = TUB,
Year = {1993},
Month = {Januar},
Number = {93-6}
}
@InProceedings{EPR93b,
Title = {Algebraic high-level nets: {Petri} nets revisited},
Author = {Ehrig, H. and Padberg, J. and Ribeiro, L.},
Booktitle = {Proc. of the ADT-COMPASS Workshop'92 (Caldes de Malavella, Spain)},
Year = {1993},
Address = {Berlin},
Note = {Technical Report TUB93-06}
}
@InProceedings{EPR04,
Title = {{Workshop on Petri Nets and Graph Transformations}},
Author = {Ehrig, H. and Padberg, J. and Rozenberg, G.},
Booktitle = {Proc. 2nd Int. Conference on Graph Transformation (ICGT'04)},
Year = {2004},
Address = {Rome, Italy},
Editor = {Parisi-Presicce, F. and Bottoni, P. and Engels, G.},
Month = {October},
Pages = {144--160},
Publisher = Springer,
Series = lncs,
Volume = {3256},
Abstract = {The relationship between graph grammars and Petri nets is the topic of this workshop with the emphasis on work in progress and especially the transfer of concepts between both areas. Both areas are prominent specification formalisms for concurrent and distributed systems. The workshop brings together people working especially in the area of low-level and high-level Petri nets and in the area of graph transformation and high-level replacement systems. According to the main idea and in order to further stimulate the research in this important area, this workshop triggers discussion and transfer of concepts across the borders of these and related research fields.},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9},
Keywords = {graph transformation, Petri nets, workshop},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EPR04.pdf}
}
@TechReport{EPR94a,
Title = {Behaviour and {R}ealization {C}onstruction for {P}etri {N}ets{B}ased on {F}ree {M}onoid and {P}ower {S}et {G}raphs},
Author = {Ehrig, H. and Padberg, J. and Rozenberg, G.},
Institution = {Technical University Berlin TR 94-15},
Year = {1994}
}
@InProceedings{EPR94b,
Title = {Behaviour and Realization Construction for {P}etri Nets Based on Free Monoid and Power Set Graphs},
Author = {Ehrig, H. and Padberg, J. and Rozenberg, G.},
Booktitle = {Workshop on Concurrency, Specification \& Programming},
Year = {1994},
Note = {Extended version as Technical Report of University of Leiden},
Organization = {Humboldt University}
}
@InProceedings{EP93,
Title = {High-Level Replacement Systems for Equational Algebraic Specifications},
Author = {Ehrig, H. and {Parisi-Presicce}, F.},
Booktitle = {Proc. 3rd Conf. on Algebraic and Logic Programming, Pisa, 1992},
Year = {1993}
}
@InProceedings{EPP93,
Title = {Interaction Between Algebraic Specification Grammars and Modular Systems},
Author = {Ehrig, H. and Parisi-Presicce, F.},
Booktitle = {Proc. AMAST 93},
Year = {1993}
}
@InProceedings{EPP91b,
Title = {Non-equivalence of categories for equational algebraic specifications in view of High-Level-Replacement systems},
Author = {Ehrig, H. and Parisi-Presicce, F.},
Booktitle = {Proc. WADT-COMPASS-Workshop Dourdan, 1991},
Year = {1992},
Pages = {222--235},
Publisher = Springer,
Series = lncs,
Volume = {655}
}
@TechReport{EP91,
Title = {Nonequivalence of Categories for Equational Algebraic Specifications in View of High-Level Replacement Systems},
Author = {Ehrig, H. and {Parisi-Presicce}, F.},
Institution = FB13,
Year = {1991},
Note = {Short version in Proc. 3rd Conf. on Algebraic and Logic Programming, Pisa, 1992},
Number = {91/16}
}
@InCollection{EP91a,
Title = {{Algebraic Specification Grammars: Adjunction between Module Specifications and Graph Grammars}},
Author = {Ehrig, H. and {Parisi-Presicce}, F.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Publisher = Springer,
Year = {1991},
Pages = {292--310},
Series = lncs,
Volume = {532}
}
@TechReport{EPP91,
Title = {Non-equivalence of categories for equational algebraic specifications in view of High-Level-Replacement systems},
Author = {Ehrig, H. and Parisi-Presicce, F.},
Institution = TUB,
Year = {1991},
Number = {91-16}
}
@InProceedings{EPP91a,
Title = {A match operation for rule-based modular system design},
Author = {Ehrig, H. and Parisi-Presicce, F.},
Booktitle = {Proc. ADT-Workshop, Wusterhausen},
Year = {1991},
Pages = {74--97},
Publisher = Springer,
Series = lncs,
Volume = {534}
}
@Article{EPB+90,
Title = {Combining data type and recursive process specifications using projection algebras},
Author = {Ehrig, H. and {Parisi-Presicce}, F. and Boehm, P. and Rieckhoff, C. and Dimitrovici, C. and {Gro{\ss}e-Rhode}, M.},
Journal = TCS,
Year = {1990},
Pages = {347-380},
Volume = {71},
Publisher = {North Holland}
}
@Article{EPB+87,
Title = {Algebraic data type and process specifications based on projection spaces},
Author = {Ehrig, H. and {Parisi-Presicce}, F. and Boehm, P. and Rieckhoff, C. and Dimitrovici, C. and {Gro{\ss}e-Rhode}, M.},
Journal = TCS,
Year = {1987},
Pages = {23--43},
Volume = {332}
}
@InProceedings{EPB+88,
Title = {Algebraic Data Type and Process Specifications Based on Projection Spaces},
Author = {H. Ehrig and F. {Parisi--Presicce} and P. Boehm and C. Rieckhoff and C. Dimitrovici and M. {Gro{\ss}e--Rhode}},
Booktitle = {Recent Trends in Data Type Specifications},
Year = {1988},
Editor = {D. Sannella and A. Tarlecki},
Pages = {23--43},
Publisher = Springer,
Series = lncs,
Volume = {332}
}
@InProceedings{EPO89,
Title = {On Recent Trends in Algebraic Specification},
Author = {H. Ehrig and P. Pepper and F. Orejas},
Booktitle = {Proc.\ ICALP '89},
Year = {1989},
Pages = {263-289},
Publisher = Springer,
Series = lncs,
Volume = {372}
}
@TechReport{EPW+94,
Title = {Abschlu{\ss}bericht Projekt {KORSO}: Teilvorhaben: Formale Entwicklungsmethoden und Realisierungstechniken f{\"u}r korrekte Software},
Author = {Ehrig, H. and Pepper, P. and Wolter, U. and Jatzeck, M. and Cornelius, F. and Faulhaber, J. and Grieskamp, W. and L{\"o}we, M. and Cla{\ss}en, I. and Gerke, C. and Didrich, K.},
Institution = {Univ. Bremen},
Year = {1994},
Type = {Technical Report}
}
@InProceedings{EPS73,
Title = {Graph grammars: an algebraic approach},
Author = {Ehrig, H. and Pfender, M. and Schneider, H.J.},
Booktitle = {14th Annual IEEE Symposium on Switching and Automata Theory},
Year = {1973},
Pages = {167--180},
Publisher = {IEEE}
}
@Book{EP+72,
Title = {{Kategorien und Automaten}},
Author = {Ehrig, H. and {Pfender, M. et al.}},
Publisher = {de Gruyter Lehrbuch},
Year = {1972}
}
@InProceedings{EP08a,
Title = {{Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels}},
Author = {Ehrig, H. and Prange, U.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Editor = {Ehrig, H. and Heckel, R. and Rozenberg, G. and Taentzer, G.},
Pages = {178--193},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = {Triple graph transformation has become an important approach for model transformations. Triple graphs consist of a source, a target and a connection graph. The corresponding rules also contain these parts and describe the simultaneous construction of both the source and the target model. From these rules, forward rules can be derived which describe the model transformation from a given source model to a target model. The forward transformation must be source consistent in order to define a valid model transformation. Source consistency implies that the source and the target model correspond to each other according to a triple transformation. In this paper, the relationship between the source consistency of forward transformations, and NAC consistency and termination used in other model transformation approaches is analysed from a formal point of view. We define the kernel of a forward rule and construct NACs based on this kernel. Then we give sufficient conditions such that source consistency implies NAC consistency and termination. Moreover, we analyse how to achieve local confluence independent of source consistency. Both results together provide sufficient conditions for functional behaviour of model transformations. Our results are illustrated by an example describing a model transformation from activity diagrams to CSP. },
ISBN = {ISBN 978-3-540-87404-1},
Keywords = {model transformation, graph transformation, formal analysis, triple graph grammars},
Location = {Leicester, UK},
Url = {http://www.springerlink.com/index/K62771L2T7614W02.pdf}
}
@InProceedings{EP06b,
Title = {{Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations}},
Author = {Ehrig, H. and Prange, U.},
Booktitle = {{Algebra, Meaning and Computation. Essays Dedicated to J.A. Goguen}},
Year = {2006},
Editor = {Futatsugi, K. and Jouannaud, {J.-P.} and Meseguer, J.},
Pages = {235--251},
Publisher = Springer,
Series = lncs,
Volume = {4060},
Abstract = {Adhesive high-level replacement (HLR) systems have been recently introduced as a new categorical framework for graph tranformation in the double pushout (DPO) approach. They combine the wellknown concept of HLR systems with the concept of adhesive categories introduced by Lack and Sobociï¿½nski. While graphs, typed graphs, attributed graphs and several other variants of graphs together with corresponding morphisms are adhesive HLR categories, such that the categorical framework of adhesive HLR systems can be applied, this has been claimed also for Petri nets. In this paper we show that this claim is wrong for place/transition nets and algebraic high-level nets, although several results of the theory for adhesive HLR systems are known to be true for the corresponding Petri net transformation systems. In fact, we are able to define a weaker version of adhesive HLR categories, called weak adhesive HLR categories, which is still sufficient to show all the results known for adhesive HLR systems. This concept includes not only all kinds of graphs mentioned above, but also place/transition nets, algebraic high-level nets and several other kinds of Petri nets. For this reason weak adhesive HLR systems can be seen as a unifying framework for graph and Petri net transformations. },
Keywords = {graph transformation, adhesive HLR categry, Petri net transformation, category theory},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EP06b.pdf}
}
@InProceedings{EP06a,
Title = {{Modeling with Graph Transformation}},
Author = {Ehrig, H. and Prange, U.},
Booktitle = {{Advances in Multiagent Systems, Robotics and Cybernetics: Theory and Practice. Proceedings of Intern. Conf. on Systems Research, Informatics and Cybernetics 2005}},
Year = {2006},
Address = {Tecumseh, Canada},
Editor = {Lalsker, G.E. and Pfalzgraf, J.},
Publisher = {IIAS},
Volume = {1},
Abstract = {In this paper we give a general overview of graph grammars and graph transformation as important modeling techniques for several areas in computer science. In particular we present the main ideas of the algebraic approach, which is the basis for a categorical theory of rule-based transformations of high-level structures. },
ISSN = {ISBN 1-897 233-36-1},
Keywords = {graph transformation, graph grammar, category theory, rule-based transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EP06a.pdf}
}
@Article{EP08,
Title = {{Flattening Generalized Algebraic High-Level Nets}},
Author = {Ehrig, H. and Prange, U.},
Journal = BEATCS,
Year = {2008},
Pages = {151--160},
Volume = {94},
Abstract = {The flattening is a well-known construction from high-level to low-level nets. Moreover, this construction is known to be a functor from the category AHLNets(SP;A) of algebraic high-level nets with fixed specification and algebra part to the category PTNets of place/transition nets. In this paper, we extend the flattening construction to generalized algebraic high-level nets, where the specification, the algebra part and the net structure may be changed by morphisms. The main result shows under which condition this generalized flattening construction preserves pushouts.},
ISBN = {ISSN 0252-9742},
Keywords = {flattening, algebraic high-level nets},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@InProceedings{EP05,
Title = {{Modeling with Graph Transformation}},
Author = {Ehrig, H. and Prange, U.},
Booktitle = {{Proceedings of InterSymp 2005}},
Year = {2005},
Publisher = {IIAS},
Abstract = {In this paper we give a general overview of graph grammars and graph transformation as important modeling techniques for several areas in computer science. In particular we present the main ideas of the algebraic approach, which is the basis for a categorical theory of rule-based transformations of high-level structures.},
Keywords = {graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EP05.pdf}
}
@InCollection{EPT04,
Title = {Fundamental Theory for Typed Attributed Graph Transformation},
Author = {Ehrig, H. and Prange, U. and Taentzer, G.},
Booktitle = {Proc. 2nd Int. Conference on Graph Transformation (ICGT'04), Rome, Italy},
Publisher = Springer,
Year = {2004},
Editor = {Parisi-Presicce, F. and Bottoni, P. and Engels, G.},
Series = lncs,
Volume = {3256},
Abstract = {The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no adequate theory for this important branch of graph transformation. In this paper we give a new formalization of typed attributed graphs, which allows node and edge attribution. The first main result shows that the corresponding category is isomorphic to the category of algebras over a specific kind of attributed graph structure signature. This allows to prove the second main result showing that the category of typed attributed graphs is an instance of adhesive HLR categories . This new concept combines adhesive categories introduced by Lack and Sobocinski with the well-known approach of high-level replacement (HLR) systems using a new simplified version of HLR conditions. As a consequence we obtain a rigorous approach to typed attributed graph transformation providing as fundamental results the Local Church-Rosser, Parallelism, Concurrency, Embedding and Extension Theorem and a Local Confluence Theorem known as Critical Pair Lemma in the literature.},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9},
Keywords = {typed attributed graph transformation, graph transformation theory},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EPT04.pdf}
}
@TechReport{EPT+09a,
Title = {{Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation: Long Version}},
Author = {H. Ehrig and U. Prange and G. Taentzer and C. Ermel and E. Biermann},
Institution = {TU Berlin},
Year = {2009},
Note = {to appear},
Owner = {Claudia},
Timestamp = {2009.10.16}
}
@Article{ER97,
Title = {An {A}lgebraic {V}iew on {P}etri {N}ets},
Author = {Ehrig,H. and Reisig,W.},
Journal = BEATCS,
Year = {1997},
Month = {February},
Pages = {52--58}
}
@Article{ER96,
Title = {{Integration of Algebraic Specifications and Petri Nets}},
Author = {Ehrig, H. and Reisig, W.},
Journal = BEATCS,
Year = {1996},
Pages = {52--58},
Volume = {61}
}
@TechReport{ERW97,
Title = {Move-On-Workshop der DFG-Forschergruppe Petrinetz-Technologie},
Author = {Ehrig, H. and Reisig, W. and Weber, H.},
Institution = TUB,
Year = {1997},
Number = {97-21}
}
@InProceedings{ER80a,
Title = {The Mathematics of Record Handling},
Author = {Ehrig, H. and Rosen, B.K.},
Booktitle = {SIAM J. COMPUT.},
Year = {1980},
Pages = {441 -- 469}
}
@TechReport{ER78,
Title = {Concurrency of Manipulations in Multi-dimensional Information Structures},
Author = {Ehrig, H. and Rosen, B.K.},
Institution = TUB,
Year = {1978},
Number = {78-13}
}
@InProceedings{ER78a,
Title = {Concurrency of Manipulations in Multi-dimensional Information Structures},
Author = {Ehrig, H. and Rosen, B.K.},
Booktitle = {Mathematical Foundations of Computer Science},
Year = {1978},
Pages = {65--176},
Publisher = Springer,
Series = lncs,
Volume = {64}
}
@TechReport{ER76,
Title = {Commutativity of Independent Transformations on Complex Objects},
Author = {Ehrig, H. and Rosen, B.K.},
Institution = {IBM T. J. Watson Research Center},
Year = {1976},
Address = {Yorktown Heights},
Number = {RC 6251},
Type = {Research Report}
}
@Article{ER80,
Title = {Parallelism and concurrency of graph manipulations},
Author = {Ehrig, H. and Rosen, B. K.},
Journal = TCS,
Year = {1980},
Pages = {247--275},
Volume = {11}
}
@InCollection{ER79,
Title = {{Decomposition of Graph Grammars, Productions and Derivations}},
Author = {Ehrig, H. and Rosen, B.-K.},
Booktitle = {1st Int.\ Workshop on Graph Grammars and their Application to Computer Science and Biology},
Publisher = Springer,
Year = {1979},
Pages = {192--205},
Series = lncs,
Volume = {73}
}
@InProceedings{ER76a,
Title = {Some Definitional Suggestions for Parallel Graph Grammars},
Author = {H. Ehrig and G. Rozenberg},
Booktitle = {Formal Languages, Automata and Development},
Year = {1976},
Editor = {A. Lindenmayer and G. Rozenberg},
Pages = {443 - 468},
Publisher = {North Holland}
}
@InCollection{ER76b,
Title = {Some Definitional Suggestions for Parallel Graph Grammars},
Author = {Ehrig, H. and Rozenberg, G.},
Booktitle = {Automata, Laanguages Development},
Publisher = {North-Holland Publishing Compasny},
Year = {1976},
Address = {Yorktown Heights},
Editor = {Lindenmayer, A. and Rozenberg, G.},
Pages = {443 -- 468}
}
@InProceedings{EHGP98,
Title = {{Graph Transformations and Other Rule-Based Formalisms with Incomplete Information }},
Author = {Ehrig, H. and Rozenberg, G. and Padberg, J.},
Booktitle = {Proc. 6th International Workshop on Theory and Application of Graph Transformation},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Pages = {268--278},
Publisher = {Universit\"at Paderborn}
}
@Article{ES01,
Title = {{The Relevance of Mathematics in Software System Development}},
Author = {Ehrig, H. and Schr\"oter, G.},
Journal = {International Journal of Differential Equations and Applications},
Year = {2001},
Pages = {169--182},
Volume = {3}
}
@Article{ES00,
Title = {{On the Role of Mathematics and Formal Specification in Software System Development}},
Author = {Ehrig, H. and Schr\"oter, G.},
Journal = BEACTS,
Year = {2000},
Pages = {69--76},
Volume = {72}
}
@InCollection{ES04,
Title = {{The Role of Mathematics in Software System Development}},
Author = {Ehrig, H. and Schroeter, G.},
Booktitle = {Current Trends in Theoretical Computer Science: The Challenge of the New Century},
Publisher = {World Scientific, Singapore etc. 2004},
Year = {2004},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Pages = {5-15}
}
@InProceedings{ES83,
Title = {{ Church-Rosser Poperties for Graph Replacement Systems with Unique Splitting}},
Author = {Ehrig, H. and Staples, J.},
Booktitle = {Graph Grammars and their Application to Computer Science and Biology},
Year = {1983},
Editor = {Ehrig, H. and Nagl, M. and Rozenberg, G.},
Pages = {82--101},
Publisher = Springer,
Series = lncs,
Volume = {153}
}
@InProceedings{ET00a,
Title = {{A Proposal for Consistent Integration of Visual Computing with Visual Software Development}},
Author = {Ehrig, H. and Taentzer, G.},
Booktitle = {Proc. of Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2000), Satellite Workshop of 27th Int. Colloqium on Automata, Languages, and Programming (ICALP'2000)},
Year = {2000}
}
@Unpublished{ET98,
Title = {Graphical Representation and Graph Transformation},
Author = {Ehrig, H. and Taentzer, G.},
Year = {1998}
}
@TechReport{ET96a,
Title = {Computing by Graph Transformation II. Final Report. ESPRIT Basic Research Working Group No. 7183},
Author = {Ehrig, H. and Taentzer, G.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-17}
}
@TechReport{ET96b,
Title = {Computing by Graph Transformation. A Survey and Annotated Bibliography},
Author = {Ehrig, H. and Taentzer, G.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-21}
}
@Article{ET95,
Title = {{COMPUGRAPH} {II}: A Survey of Research Goals and Main Results},
Author = {Ehrig, H. and Taentzer, G.},
Journal = BEATCS,
Year = {1995},
Pages = {85--95},
Volume = {57}
}
@TechReport{ET95a,
Title = {Computing by Graph Transformation {II} ({COMPUGRAPH II}), Third Interim Report ESPRIT Basic Research Working Group No. 7183},
Author = {Ehrig, H. and Taentzer, G.},
Institution = TUB,
Year = {1995},
Number = {95-23}
}
@InProceedings{ET92,
Title = {From Parallel Graph Grammars to Parallel High- Level Replacement Systems},
Author = {Ehrig, H. and Taentzer, G.},
Booktitle = {Lindenmayer Systems},
Year = {1992},
Pages = {283--303},
Publisher = Springer,
Editors = {Rozenberg, G. and Salomaa, A.}
}
@TechReport{ETLZ84,
Title = {Denotational and initial algebra semantics of the algebraic specification language LOOK},
Author = {Ehrig, H. and Thatcher, J.W. and Lucas, P. and Zilles, S.N.},
Institution = TUB,
Year = {1984},
Number = {84-22}
}
@TechReport{ETLZ82,
Title = {Denotational and Initial Algebra Semantics of the Algebraic Specification Language {LOOK}},
Author = {H. Ehrig and J. W. Thatcher and P. Lucas and S. N. Zilles},
Institution = {IBM},
Year = {1982},
Type = {Draft Report}
}
@Article{ET75,
Title = {{Graph Grammars and Applications to Specification and Evolution in Biology}},
Author = {Ehrig, H. and Tischer, K.-W.},
Journal = {Journal Computer System Science},
Year = {1975},
Number = {2},
Pages = {212--236},
Volume = {11}
}
@InProceedings{ET75a,
Title = {{Development of Stochastic Graphs}},
Author = {Ehrig, H. and Tischer, K.-W.},
Booktitle = {Proc. Conf. on Uniformly Structured Automata Theory and Logic, Tokyo},
Year = {1975},
Pages = {1--6}
}
@InProceedings{ET74,
Title = {{Graph Grammars for the Specialization of Organisms}},
Author = {Ehrig, H. and Tischer, K.-W.},
Booktitle = {Proc. Conf. on Biologically Motivated Automata Theory, Virginia, USA},
Year = {1974},
Pages = {158--165},
Publisher = {Record MITRE Corp.}
}
@InProceedings{EWT83,
Title = {Algebraic specifications with generating constraints},
Author = {Ehrig, H. and Wagner, E.G. and Thatcher, J.W.},
Booktitle = {Proc. ICALP'83, Automata, Languages and Programming},
Year = {1983},
Pages = {188--202},
Publisher = Springer,
Series = lncs,
Volume = {154}
}
@TechReport{EWT82,
Title = {Algebraic Constraints for Specifications and Canonical Form Results},
Author = {Ehrig, H. and Wagner, E. and Thatcher, J.},
Institution = TUB,
Year = {1982},
Number = {82-09}
}
@Article{EW86,
Title = {Programming in the large with algebraic module specifications},
Author = {Ehrig, H. and Weber, H.},
Journal = {Information Processing},
Year = {1986},
Note = {Invited paper, IFIP'86 World Congress},
Pages = {675-684},
Volume = {86}
}
@InProceedings{EW85,
Title = {Algebraic Specification of Modules},
Author = {H. Ehrig and H. Weber},
Booktitle = {Proc.\ IFIP Work Conf.\ 85: The Role of Abstract Models in Programming, Wien},
Year = {1985},
Note = {Also as Techn.\ Report No.\ 190, FB Informatik, Univ.\ Dortmund, 1985},
Pages = {231--258},
Publisher = {North Holland}
}
@Article{EW96,
Title = {The Impact and Future Role of Algebraic Specification},
Author = {Ehrig, H. and Wolter, U.},
Journal = BEATCS,
Year = {1996},
Pages = {74-77},
Volume = {60}
}
@TechReport{Ehr03b,
Title = {{Conceptual Design and Implementation of a Generator for Animation Environments based on Visual Modelling Languages (in German)}},
Author = {Ehrig, K.},
Institution = {TUB},
Year = {2003},
Number = {2003-17},
Abstract = {In visual models, selected scenarios can be simulated in application domain oriented views. The basis for such a simulation in the GenGED tool environment is a simulation grammar which defines discrete state transitions for the visual model (e.g. a Petri net). The aim of this report is to describe the concepts and the implementation of a generator for animation environments which generates animation runs on the basis of simulation rules. The generator is integrated in GenGED, an interactive specification environment for visual modelling languages to generate visual modelling environments. The generator for animation environments extends discrete state transitions by continuous animations. The resulting animation runs are stored in the XML-based format SVG (scalable vector graphics) and can be viewed by an SVG-viewer. The presented concepts are explained along the concrete application scenario of Petri nets. The tool environment GenGED is available via http://www.user.tu-berlin.de/lieske/tfs/genged.},
ISSN = {ISSN 1436-9915},
Keywords = {Animation, Generator, Visual Languages, Graph Transformation},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_17.pdf}
}
@TechReport{Ehr03e,
Title = {{Konzeption und Implementierung eines Generators f\"ur Animationsumgebungen f\"ur visuelle Modellierungssprachen}},
Author = {Ehrig, K.},
Institution = {TUB},
Year = {2003},
Number = {2003-17},
Abstract = {In visual models, selected scenarios can be simulated in application domain oriented views. The basis for such a simulation in the GenGED tool environment is a simulation grammar which defines discrete state transitions for the visual model (e.g. a Petri net). The aim of this report is to describe the concepts and the implementation of a generator for animation environments which generates animation runs on the basis of simulation rules. The generator is integrated in GenGED, an interactive specification environment for visual modelling languages to generate visual modelling environments. The generator for animation environments extends discrete state transitions by continuous animations. The resulting animation runs are stored in the XML-based format SVG (scalable vector graphics) and can be viewed by an SVG-viewer. The presented concepts are explained along the concrete application scenario of Petri nets. The tool environment GenGED is available via http://www.user.tu-berlin.de/lieske/tfs/genged.},
ISSN = {ISSN 1436-9915},
Keywords = {Animation, Generator, Visual Languages, Graph Transformation},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_17.pdf}
}
@Misc{KEhr01,
Title = {{Converting XML Files with XSLT and XPath}},
Author = {K. Ehrig},
Note = {Student's Project Status Report},
Year = {2001},
Url = {http://www.user.tu-berlin.de/lieske/tfs/lehre/SS01/gragra.html}
}
@InProceedings{EBT+08,
Title = {{The EMF Model Transformation Framework}},
Author = {Ehrig, K. and Biermann, E. and Taentzer, G. and Ermel, C. and K\"ohler, C.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Year = {2008},
Address = {Heidelberg},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Pages = {66--68},
Publisher = springer,
Series = lncs,
Volume = {5088},
Abstract = {The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. The goal of the EMF Model Transformation framework (EMFTrans) is to support the modification of EMF models based on graphical EMF model transformation rules. EMFTrans currently consists of three components: a graphical editor for EMF model transformation rules, a compiler, generating Java code from these rules to be used in further projects, and an interpreter for the execution of the rules using AGG, a graph transformation tool environment.},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {graph transformation, EMF, EMF transformation tool, EMFTrans, AGG},
Location = {Kassel, Germany},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EBT+08.pdf}
}
@InProceedings{EEH05,
Title = {{Towards Model Transformation in Generated Eclipse Editor Plug-Ins}},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S.},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Address = {Tallinn, Estonia},
Month = {September},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {152},
Abstract = {With the growing importance of model-driven development, the ability of transforming models into well-defined semantic domains becomes a key to automated code generation or verification in the software development process. In this paper, we describe a high-level concept for specifying model transformations by means of typed, attributed graph transformation at the level of formal visual language specifications for the source and the target language. At the implementation level, a graph-transformation based generator of visual editor Eclipse plug-ins from formal visual language specifications has been developed. On the basis of this generator we discuss concepts for an implementation of the presented model transformation concepts and for an integration with the generated Eclipse plug-ins. We explain the concepts for model transformation and their implementation along a concrete model transformation from activity diagrams to Petri nets.},
Keywords = { model transformation, Eclipse, editor plug-in, code generation, graph transformation },
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EEH05.pdf}
}
@InProceedings{EEHT04,
Title = {{Towards Graph Transformation based Generation of Visual Editors using Eclipse}},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S. and Taentzer, G.},
Booktitle = {Visual Languages and Formal Methods},
Year = {2004},
Editor = {Minas, M.},
Pages = {127--143},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {127/4},
Abstract = { This work discusses the state-of-the-art of visual editor generation based on graph transformation concepts on one hand, and using the Eclipse technology which includes the Graphical Editor Framework (GEF), on the other hand. Due to existing shortcomings in both approaches, we present a combined approach for a tool environment that allows to generate a GEF-based editor from a formal, graph-transformation based visual language specification.},
Keywords = {Graph Transformation, visual editor, Eclipse, editor generation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EEHT04.pdf}
}
@InProceedings{EEHT05,
Title = {Generation of Visual Editors as Eclipse Plug-Ins},
Author = {Ehrig, K. and Ermel, C. and H\"ansgen, S. and Taentzer, G.},
Booktitle = {Proc. 20th IEEE/ACM International Conference on Automated Software Engineering},
Year = {2005},
Address = {IEEE Computer Society, Long Beach, California, USA},
Abstract = {Visual Languages (VLs) play an important role in software system development. Especially when looking at well-defined domains, a broad variety of domain specific visual languages are used for the development of new applications. These languages are typically developed specifically for a certain domain in a way that domain concepts occur as primitives in the language alphabet. Visual modeling environments are needed to support rapid development of domain-specific solutions. In this contribution we present a general approach for defining visual languages and for generating language-specific tool environments. The visual language definition is again given in a visual manner and precise enough to completely generate the visual environment. The underlying technology is Eclipse with its plug-in capabilities on the one hand, and formal graph transformation techniques on the other hand. More precisely, we present an Eclipse plug-in generating Java code for visual modeling plug-ins which can be directly executed in the Eclipse Runtime-Workbench.},
Keywords = {visual editor, Eclipse, editor generation, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EEHT05.pdf}
}
@Article{EET05,
Title = {{Erstellung eines grafischen Editor-Plug-Ins mit Eclipse EMF und GEF}},
Author = {Ehrig, K. and Ermel, C. and Taentzer, G.},
Journal = {OBJEKTspektrum},
Year = {2005},
Pages = {31--34},
Volume = {2},
Abstract = { In dem Artikel wird die Generierung eines einfachen baumbasierten Eclipse Editor-Plug-Ins anhand eines Editors f{\"u}r Petrinetze mit dem Eclipse Modeling Framework (EMF) beschrieben. Aufbauend auf den generierten Modellcode wird die Implementierung eines zweiten komplexeren grafischen Editor-Plug-Ins mit dem Graphical Editor Framework (GEF) erl\"autert. },
Keywords = {Eclipse, EMF, GEF, Editor-Plug-In},
Publisher = {Sigs-Datacom},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EET05.pdf}
}
@InProceedings{EKTW06,
Title = {{Generating Instance Models from Meta Models}},
Author = {Ehrig, K. and K\"uster, J. and Taentzer, G. and Winkelmann, J.},
Booktitle = {8th IFIP International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS'06)},
Year = {2006},
Address = {Heidelberg},
Pages = {156-170},
Publisher = Springer,
Series = lncs,
Volume = {4037},
Abstract = { Meta modeling is a wide-spread technique to define visual languages, with the UML being the most prominent one. Despite several advantages of meta modeling such as ease of use, the meta modeling approach has one disadvantage: It is not constructive i. e. it does not offer a direct means of generating instances of the language. This disadvantage poses a severe limitation for certain applications. For example, when developing model transformations, it is desirable to have enough valid instance models available for large-scale testing. Producing such a large set by hand is tedious. In the related problem of compiler testing, a string grammar together with a simple generation algorithm is typically used to produce words of the language automatically. In this paper, we introduce instance-generating graph grammars for creating instances of meta models, thereby overcoming the main deficit of the meta modeling approach for defining languages. },
ISSN = {ISSN 0302-9743},
Keywords = {meta modelling, instance generation, graph transformation},
Url = {http://www.springerlink.com/index/W66H5404N655X106.pdf}
}
@Article{ETV06,
Title = {Tool Integration by Model Transformations based on the Eclipse Modeling Framework},
Author = {Ehrig, K. and Taentzer, G. and Varr\'o, D.},
Journal = {EASST Newsletter},
Year = {2006},
Month = {June},
Volume = {12},
Abstract = {In the paper, we propose various approaches for tool integration based on model transformations over the Eclipse Modeling Framework (EMF). EMF is a key technology for tool integration, which provides a framework for developing domain-specific modeling languages by automatically generating Java code for model manipulation. Model transformations can be captured by graph transformation systems, which support visual specifications based on rules and patterns. Three levels of tool integration are identified: (i) model-level integration carries out model transformations in existing transformation tools by importing and exporting EMF models, (ii) interpreted EMF transformations take an EMF model of the transformation system, and manipulate EMF models according to the system by calling EMF interfaces, finally (iii) compiled transformer plug-ins generate stand-alone transformer programs in Java which are responsible for model manipulation.},
ISSN = {1861-0668},
Keywords = {model transformation, tool integration, graph transformation, Eclipse},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/ETV06.pdf}
}
@InProceedings{EW05,
Title = {{Model Transformation from VisualOCL to OCL using Graph Transformation}},
Author = {Ehrig, K. and Winkelmann, J.},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Address = {Tallinn, Estonia},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {152},
Abstract = { In this paper we present a model transformation from a visual representation (VisualOCL) of the Object Constraint Language (OCL) to the textual one using graph transformation. Starting from VisualOCL diagrams, we show how their underlying abstract syntax can be modeled by typed attributed graphs and converted into an OCL string representation using graph transformation rules. },
Keywords = {model transformation, OCL, VisualOCL, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EW05.pdf}
}
@InProceedings{EEH+96,
Title = {{A View-Based Approach to System Modelling}},
Author = {Engels, E. and Ehrig, H. and Heckel, R. and Taentzer, G. and Corradini, A.},
Booktitle = {Report on the Dagstuhl-Seminar 9637 \emph{Graph Transformations in Computer Science}},
Year = {1996},
Note = {Lecture and abstract}
}
@InProceedings{EE95a,
Title = {Towards a Module Concept for Graph Transformation Systems: The Software Engineering Perspective},
Author = {G. Engels and H. Ehrig},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {G. Valiente Feruglio and F. Rosello Llompart},
Organization = {Technical Report B-19, Universitat de les Illes Balears},
Pages = {25--28}
}
@Article{EEHT97b,
Title = {A Combined Reference Model- and View-Based Approach to System Specification},
Author = {Engels, G. and Ehrig, H. and Heckel, R. and Taentzer, G.},
Journal = {Int. Journal of Software and Knowledge Engineering},
Year = {1997},
Number = {4},
Pages = {457--477},
Volume = {7}
}
@InProceedings{EHTE97a,
Title = {A View-Oriented Approach to System Modelling Using Graph Transformation},
Author = {Engels, G. and Heckel, R. and Taentzer, G. and Ehrig, H.},
Booktitle = {Proc. of ESEC/FSE'97, Z\"urich},
Year = {1997},
Pages = {327--343},
Publisher = Springer,
Series = lncs,
Volume = {1301}
}
@InProceedings{EC96,
Title = {Object-oriented Design of a Class Library for a Metamodel based on Algebraic Graph Theory},
Author = {Sebastian Erdmann and Ingo Cla{\ss}en},
Booktitle = {Proc.\ 5th Intl.\ Conf.\ on Algebraic Methodology and Software Technology},
Year = {1996},
Publisher = Springer,
Url = {http://cis.cs.tu-berlin.de/%7Eserdmann/alpha/download/alpha.ps|}
}
@Article{Erm09,
Title = {Visual Modelling and Analysis of Model Transformations based on Graph Transformation},
Author = {Claudia Ermel},
Journal = {Bulletin of the EATCS},
Year = {2009},
Pages = {135 -- 152},
Volume = {99},
Abstract = {In the context of model-driven software development, the concepts of visual modelling and model transformation are of increasing importance. Although there is a wide range of tool support for designing and executing visual models and model transformations during system design, the analysis of model behaviour and of model transformation properties is not yet supported in a satisfactory way. In this article, we consider typed attributed graph transformation as formal framework for model transformations to deal with this problem. We give a conceptual overview on research activities and a survey of current research papers on the formalization of visual modelling and analysis of model transformations based on typed attributed graph transformation.},
Url = {http://www.eatcs.org/images/bulletin/beatcs99.pdf}
}
@PhdThesis{Erm06,
Title = {{Simulation and Animation of Visual Languages based on Typed Algebraic Graph Transformation}},
Author = {Ermel, C.},
School = {Technische Universit\"at Berlin, Fak. IV},
Year = {2006},
Address = {Books on Demand, Norderstedt},
Abstract = {In recent years, visual models represented by graphs have become very popular in systems development, as the wide-spread use of UML and Petri nets proves. While visual modeling techniques provide a precise way to model the structure and behavior of systems, visual models tend to be complex and are not always adequate for behavior validation. \\ The main objective of this doctoral thesis is to improve the validation process for visual behavioral models by providing a formal framework and tool support for simulation and animation based on typed algebraic graph transformation. To attain this goal, the thesis proposes to use \emph{animation views} for simulation instead of the notation of abstract modeling languages. Animation views allow to simulate model behavior in the layout of the application domain, at a freely chosen level of abstraction. Thus, they provide better insights of model behavior and lead to an earlier detection of inconsistencies and possible missing requirements in the model. A visual behavioral model is mapped to an animation view by so-called Simulation-to-Animation transformation (\emph{$\mathit{S2A}$ transformation}). Formal graph transformation properties allow to ensure semantical equivalence of a model and its animation view. The prototypical tool environment supports simulation, animation view definition, $\mathit{S2A}$ transformation and animation based on graph transformation. Animation scenarios can be visualized in animation views as smooth movements instead of discrete simulation steps.},
ISBN = {ISBN-10:3-8334-6321-X, ISBN-13:978-3-8334-6321-1},
Keywords = {Simulation, Animation, Graph Transformation, Visualization},
Url = {http://opus.kobv.de/tuberlin/volltexte/2006/1368/}
}
@Unpublished{Erm98a,
Title = {{Generierung eines graphischen Editors f\"ur Algebraische High-Level-Netze mit \textsc{GenGEd}}},
Author = {Ermel, C.},
Note = {Student's Project Status Report},
Year = {1998}
}
@TechReport{Erm96,
Title = {{Anforderungsanalyse eines medizinischen Informationssystems mit Algebraischen High-Level-Netzen}},
Author = {Ermel, C.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-15}
}
@Unpublished{Erm94,
Title = {{K}ategorielle {D}arstellung von {S}tellen/{T}ransitions-{N}etzen},
Author = {Ermel, C.},
Note = {Studienarbeit, TU Berlin},
Year = {1994}
}
@InProceedings{BE03,
Title = {{Scenario Animation for Visual Behavior Models: A Generic Approach Applied to Petri Nets}},
Author = {Ermel, C. and Bardohl, R.},
Booktitle = {Proc. 10th Workshop on Algorithms and Tools for Petri Nets (AWPN'03)},
Year = {2003},
Address = {Kath. Universit\"at Eichst\"att-Ingolstadt, Germany},
Editor = {Juhas, G. and Desel, J.},
Month = {September},
Publisher = {GI Special Interest Group on Petri Nets and Related System Models},
Abstract = {The GenGED approach developed at the Technical University of Berlin allows the generic description of visual modeling languages based on formal graph transformation and graphical constraint solving techniques and tools. In this paper, the \GenGEd approach is reviewed and extended to allow the description of dynamic behavior and animation of systems. Visual simulation and animation rules are defined on top of the rules defining the corresponding visual modeling language (VL). Moreover, a domain-specific layout can be given for an animation view of the system under consideration. The visual language of Petri nets and a specific Petri net modeling a network protocol serve as running example, i.e., the system view is given by means of a Place/Transition nets. In the animation view, the network model shows directly the sending of messages between hosts in a network graph.},
Keywords = {Petri Nets, Graph Transformation, Scenario, Animation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers03/EB03.pdf}
}
@Article{EB04,
Title = {{Scenario Animation for Visual Behavior Models: A Generic Approach}},
Author = {Ermel, C. and Bardohl, R.},
Journal = {Software and System Modeling: Special Section on Graph Transformations and Visual Modeling Techniques},
Year = {2004},
Number = {2},
Pages = {164--177},
Volume = {3},
Abstract = {Visualizing and simulating formal models in a flexible way becomes increasingly important for the design of complex systems. With GenGED, a tool is available which automatically generates a visual environment to process (create, edit, check, simulate) visual models over a specified visual language. Both the specification of the language and the model manipulation are based on graph grammars. In this paper, we present the means to transform visual models into application oriented views, called scenario views. We show how a model is consistently transferred to a scenario views and animated there. The extension of GenGED concerning scenario animation is discussed. },
Keywords = {Scenario animation, graph transformation, visual behavior model},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EB04.pdf}
}
@InProceedings{EB02,
Title = {{Scenario Views for Visual Behavior Models in \textsc{GenGED}}},
Author = {Ermel, C. and Bardohl, R.},
Booktitle = {Proc. Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'02), Satellite Event of ICGT'02},
Year = {2002},
Address = {Barcelona, Spain},
Month = {October},
Pages = {71-83},
Abstract = {Visualizing and simulating the behavior of formal models in an adequate and flexible way becomes increasingly important in the design of complex systems. With GenGED, a tool is available which automatically generates a visual environment to process (create, edit, check, simulate) visual models in a specified formalism (a visual language). Both the specification of the formalism and the model manipulation are based on graph grammars. In this paper we present the means to transform a formal model into different application domain oriented views (scenario views). We show how the behavior of the model is transferred to the views and animated there (i.e. simulated in the layout of the application domain). Possible extensions towards animation modules (animated scenario views defined by \GenGED that are accessible from other tools) are discussed.},
Editors = {Bottoni, P. and Minas, M.},
Keywords = {Graph Transformation, Scenarios, Visual Model, GenGED, Animation},
Url = {http://www.cs.tu-berlin.de/%7Erosi/publications/EB02_gtVMT.ps.gz}
}
@InProceedings{EBE01,
Title = {{Specification and Implementation of Animation Views for Petri nets}},
Author = {Ermel, C. and Bardohl, R. and Ehrig, H.},
Booktitle = {Proc. of 2nd International Colloquium on Petri Net Technology for Comunication Based Systems},
Year = {2001},
Address = {Berlin, Germany},
Editor = {DFG Research Group >>Petri Net Technology<<},
Month = {September},
Pages = {12},
Keywords = {Petri Nets, Animation, Graph Transformation},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/PNT-Coll01.ps.gz}
}
@InProceedings{EBP01,
Title = {{Visual Design of Software Architecture and Evolution based on Graph Transformation}},
Author = {Ermel,C. and Bardohl,R. and Padberg,J.},
Booktitle = { Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA'01)},
Year = {2001},
Address = {Genova, Italy},
Editor = {Hartmut Ehrig, Claudia Ermel and Julia Padberg},
Month = {March 31st -- April 1st},
Publisher = {Elsevier Science Publishers},
Series = entcs,
Volume = {44 (4)},
Keywords = {Software Architecture, Software Evolution, Graph Transformation, Visual Modeling, Components, Petri Nets},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/UniGra01.ps.gz}
}
@InProceedings{EBET08,
Title = {{Generating Eclipse Editor Plug-Ins using Tiger}},
Author = {Ermel, C. and Biermann, E. and Ehrig, K. and Taentzer, G.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Year = {2008},
Address = {Heidelberg},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Pages = {583--585},
Publisher = springer,
Series = lncs,
Volume = {5088},
Abstract = {We present Tiger, a visual environment to design visual language (VL) specifications based on meta models, graph grammars and layout definitions. A VL specification serves as basis to generate a visual editor for VL diagrams as Eclipse plug-in based on the Eclipse Graphical Editing Framework (GEF).},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {graph transformation tool, Tiger, GEF, Eclipse, visual editor generation},
Location = {Kassel, Germany},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/EBET08.pdf}
}
@InProceedings{EE07,
Title = {Behavior-Preserving Simulation-to-Animation Model and Rule Transformation},
Author = {Ermel, C. and Ehrig, H.},
Booktitle = {Proc. of Workshop on Graph Transformation for Verification and Concurrency (GT-VC'07)},
Year = {2008},
Editor = {K\"onig, B. and Heckel, R. and Rensink, A.},
Pages = {55-74},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {213},
Abstract = {In the framework of graph transformation, simulation rules define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules from simulation rules by so-called S2A-transformation. In contrast to simulation rules, animation rules use symbols representing entities from the application domain in a user-oriented visualization. Using animation views for model execution provides better insights of model behavior to users, leading to an earlier detection of model inconsistencies. Hence, an important requirement of the animation view construction is the preservation of the behavior of the original visual model. This means, we have to show on the one hand semantical correctness of the S2A-transformation, and, on the other hand, semantical correctness of a suitable backwards-transformation A2S. Semantical correctness of a model and rule transformation means that for each sequence of the source system we find a corresponding sequence in the target system. S2A-transformation has been considered in our contribution to GraMoT 2006. In this paper, we give a precise definition for animation-to-simulation (A2S) backward transformation, and show under which conditions semantical correctness of an A2S backward transformation can be obtained. The main result states the conditions for S2A-transformations to be behavior-preserving. The result is applied to analyze the behavior of a Radio Clock modelï¿½s S2A-transformation.},
Keywords = {graph transformation, model and rule transformation, semantical correctness, simulation, animation, behavior-preserving transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/EE07.pdf}
}
@InProceedings{EEE06a,
Title = {{Modeling Visual Languages based on Graph Transformation Concepts and Tools}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Booktitle = {Proc. Intern. IMCAS Symposium on Mathematical Modelling (MathMod)},
Year = {2006},
Editor = {Troch, I. and Breitenecker, F.},
Publisher = {ARGESIM-Reports},
Abstract = {Visual languages and visual environments are increasingly important for software development. In this paper, we focus on the syntax definition of visual languages and visual models based on graph transformation. In analogy to textual language definition, graph grammars are used to define the structure of visual notations as well as their construction. Two tool environments are presented which have been developed at TU Berlin to support visual language modeling: The graph transformation engine AGG realizes attributed graph transformation at the abstract syntax level. The visual editor generator Tiger relies on AGG and on the graphical editor framework GEF of Eclipse, and generates a syntax-directed graphical editor from a visual language model given as a typed attributed graph transformation system.},
ISBN = {ISBN 3-901608-25-7},
Keywords = {graph transformation, visual languages, visual language tools},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EEE06a.pdf}
}
@Article{EEE06,
Title = {{Semantical Correctness of Simulation-to-Animation Model and Rule Transformation}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Journal = {ECEASST},
Year = {2006},
Volume = {4},
Abstract = {In the framework of graph transformation, simulation rules are well-known to define the operational behavior of visual models. Moreover, it has been shown already how to construct animation rules in a domain specific layout from simulation rules. An important requirement of this construction is the semantical correctness which has not yet been considered. In this paper we give a precise definition for simulation-to-animation (S2A) model and rule transformations. Our main results show under which conditions semantical correctness can be obtained. The results are applied to analyze the S2A transformation of a Radio Clock model.},
Address = {Brighton, UK},
Booktitle = {Proc. Int. Workshop on Graph and Model Transformation (GraMoT'06), Satellite Event of the IEEE Symposium on Visual Languages and Human-Centric Computing},
ISSN = {ISSN 1863-2122},
Keywords = {graph transformation, model and rule transformation, semantical correctness, simulation, animation},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/5}
}
@TechReport{EEE06b,
Title = {{Semantical Correctness of Simulation-to-Animation Model and Rule Transformation: Long Version}},
Author = {Ermel, C. and Ehrig, H. and Ehrig, K.},
Institution = {TU Berlin, Fak. IV},
Year = {2006},
Number = {2006/10},
ISBN = {issn 1436-9915},
Url = {http://iv.tu-berlin.de/TechnBerichte/2006/2006-10.pdf}
}
@TechReport{EEOT10,
Title = {Pre-Proceedings of the International Colloquium on Graph and Model Transformation ï¿½ On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010)},
Author = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, T.},
Institution = {Technische Universit\"at Berlin},
Year = {2010},
Note = {Available online at \url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}},
Number = {2010/01},
ISBN = {ISSN 1436-9915},
Owner = {Claudia},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@InProceedings{EET06,
Title = {{Simulation and Animation of Visual Models of Embedded Systems: A Graph-Transformation-Based Approach Applied to Petri Nets}},
Author = {Ermel, C. and Ehrig, H. and Taentzer, G.},
Booktitle = {Proc. 7th Workshop on Embedded Systems -- Modeling, Technology, and Applications, Technische Universit\"at Berlin},
Year = {2006},
Editor = {Hommel, G. and Sheng, H.},
Pages = {11--20},
Publisher = Springer,
Abstract = {Behavior specification techniques like Petri nets provide a visual description of software and embedded systems as basis for behavior validation by simulation. Graph transformation systems can be used as a unifying formal approach to define various visual behavior modeling languages including different kinds of Petri nets, activity diagrams, Statecharts etc., and to provide models with an operational semantics defining simulations of visual models based on graph transformation rules. Moreover, simulation of visual models can be extended by animation which allows to visualize the states of a model simulation run in a domain-specific layout which is closer to the problem domain than the layout of the abstract diagrammatic notation of the specification technique. This kind of model transformation is defined also within the framework of graph transformation, which allows to show interesting properties like semantical correctness of the animation with respect to simulation. In this paper we give an overview of simulation and animation of visual models based on graph transformation and discuss corresponding correctness issues.},
ISSN = {ISBN-10 1-4020-4932-3, ISBN-13 978-4020-4932-3},
Keywords = {simulation, animation, graph transformation, Petri nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EET06.pdf}
}
@Article{EE10,
Title = {Graph Modelling and Transformation: Theory meets Practice},
Author = {Ermel, C. and Ehrig, K.},
Journal = {ECEASST},
Year = {2010},
Pages = {1--22},
Volume = {30},
Abstract = {In this paper, we focus on the role of graphs and graph transformation for four practical application areas from software system development. We present the typical problems in these areas and investigate how the respective systems are modelled by graphs and graph transformation. In particular, we are interested in the usefulness of theoretical graph transformation results and graph transformation tools in order to solve these problems. Finally, we characterize concepts and tool features which are still missing in practice to solve the presented and related problems even better.},
Booktitle = {Proc. of Int. Colloquium on Graph and Model Transformation (GraMoT 2010)},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{EE04,
Title = {View Transformation in Visual Environments applied to {P}etri Nets},
Author = {Ermel, C. and Ehrig, K.},
Booktitle = {Proc. Workshop on Petri Nets and Graph Transformation (PNGT), Satellite Event of ICGT'04},
Year = {2005},
Editor = {Rozenberg, G. and Ehrig, H. and Padberg, J.},
Pages = {61--86},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {127(2)},
Abstract = {Visualizing and simulating the behavior of formal models in an adequate and flexible way becomes increasingly important for the design and validation of complex systems. Using graph transformation, the concrete and abstract syntax of various visual modelling languages can be described, and the semantics can be formalized. Moreover, graph transformation tools support visual model specification, simulation and analysis on the basis of the rich underlying theory. Despite these benefits, often the simulation of formal visual behavior models (e.g. Petri nets or statecharts) is not flexible enough and results in an ineffective validation process. In this paper we propose a formal, view-based approach to simulate and animate the behavior of visual models at different abstraction levels on the basis of typed, attributed graph transformation. We introduce so-called animation views, which allow to define scenario animations for a given behavior model in a systematic way. Based on the visual language definition for Algebraic High-Level Petri nets, the well-known specification of {\em The Dining Philosophers} serves as running example for the definition of an animation view and a scenario animation which directly visualizes the behavior of the dining philosophers sitting around a table. A prototypical implementation of the concepts for view definition, view transformation, simulation and scenario animation as new features of \GenGEDp, an environment for the definition of visual languages and the specification and simulation of visual behavior models, is presented.},
Keywords = {Graph Transformation, Petri Nets, Semantics},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/EE04.pdf}
}
@InProceedings{EE08,
Title = {{Visualization, Simulation and Analysis of Reconfigurable Systems}},
Author = {Ermel, C. and Ehrig, K.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE Symposium},
Year = {2008},
Address = {Heidelberg},
Editor = {A. Sch{\"u}rr and M. Nagl and A. Z{\"u}ndorf},
Pages = {265--281},
Publisher = springer,
Series = lncs,
Volume = {5088},
Abstract = { Meta-modeling is well known to define the basic concepts of domain-specific languages in an object-oriented way. Based on graph transformation, an abstract meta-model may be enhanced with information on concrete visualization of objects and relations, and the language syntax is defined by a graph grammar. Moreover, graph transformation can also formalize the semantic aspects of models, thus providing a basis for model validation by simulation. Apart from editing and simulating the behavior of a system, there may be necessary reconfiguration operations which change the underlying system structure at runtime. In this paper, we focus on the interrelation of simulation and reconfiguration operations using formal verification techniques based on graph transformation. Our approach is demonstrated by the definition of a domain-specific language for building, simulating and reconfiguring small railway systems, using the Tiger tool environment. For further verification, we define a model transformation from the railway domain to Petri nets.},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {Petri nets, net transformation, graph transformation, visual editor, reconfigurable object net, Eclipse, GEF},
Location = {Kassel, Germany},
Url = {http://www.springerlink.com/index/e58250384p202404.pdf}
}
@InProceedings{EETW06,
Title = {{Object Oriented and Rule-based Design of Visual Languages using TIGER}},
Author = {Ermel, C. and Ehrig, K. and Taentzer, G. and Weiss, E.},
Booktitle = {Proc. Third International Workshop on Graph-Based Tools (GraBaTs'06)},
Year = {2006},
Address = {Natal, Brazil},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Volume = {1},
Abstract = {In this paper we present the state-of-the-art of the TIGER environment for the generation of visual editor plug-ins in Eclipse, with the focus on its Designer component, a visual environment for object oriented and rule-based design of visual languages. Based on an alphabet for finite automata we show how a visual language can be designed by defining the abstract and concrete syntax of the visual language and syntax directed editing operations in the generated editor plug-in. For the graphical layout we use the Graphical Editing Framework (GEF) of ECLIPSE which offers an efficient and standardized way for graphical layouting. },
ISSN = {ISSN 1863-2122},
Keywords = {graph transformation, visual language design, Tiger, editor generation, Eclipse},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/EETW06.pdf}
}
@Article{EFS11,
Title = {RONs Revisited: General Approach and Implementation of Reconfigurable Object Nets based on Algebraic High-Level Nets},
Author = {Claudia Ermel and Winzent Fischer and Sarkaft Shareef},
Journal = {ECEASST},
Year = {2011},
Volume = {40},
Abstract = {Reconfigurable Object Nets (RONs) have been implemented in our group to support the visual specification of controlled rule-based transformations of place/transition (P/T) nets. RONs are high-level nets (system nets) with two types of tokens: object nets (P/T nets) and net transformation rules. System net transitions can be of different types to fire object net transitions, move object nets through the system net, or to apply a net transformation rule to an object net. The disadvantage of the RON approach and tool is the limitation of object nets to P/T nets and the limitation of the underlying semantics of RONs due to the fixed types for system net transitions. Often, a more general approach is preferred where the type of object nets and the behavior of reconfigurations may be defined in a more flexible way. In this paper, we propose to use Algebraic High Level Nets with Individual Tokens (AHLI nets) as system nets. In this very general approach, tokens may have an arbitrary structure, depending on the corresponding algebraic signature and algebra. To support this general approach, a development environment for AHLI nets is currently implemented which allows the user to edit and simulate AHLI nets. The design of the tool enables language designers to define the visual appearance of different token structures in a flexible way. We present the formalization of RONs as special AHLI nets and describe the current state of the AHLI net tool environment.},
Booktitle = {Proc. Int. Workshop on Petri Nets and Graph Transformation Systems},
Editor = {Claudia Ermel and Kathrin Hoffmann},
Keywords = {algebraic high-level net, visual editor, reconfigurable Petri net, graph transformation, tool environment, Eclipse plug-in, AGG, RON},
Owner = {Claudia},
Publisher = {ECEASST},
Timestamp = {2010.12.16},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{EG97,
Title = {{Expanding the Use Of Structuring:Formal Justification for Working on Subnets}},
Author = {Ermel, C. and Gajewsky, M.},
Booktitle = {Workshop {P}etri {N}ets in {S}ystem {E}ngineering '97},
Year = {1997},
Address = {University Hamburg},
Editor = {Farwer, B. and Moldt, D. and Stehr, M.-O.},
Month = {September},
Pages = {44--54},
Publisher = {{FBI --HH--B--205/97}},
Url = {http://www.informatik.uni-hamburg.de/TGI/aktuelles/pnse97/papers.html}
}
@TechReport{EGV+97,
Title = {Verifikation strukturierter {N}etze},
Author = {Ermel, C. and Gajewsky, M. and Vesper, T. and Weber, M.},
Institution = {TU Berlin},
Year = {1997},
Number = {97--21}
}
@InProceedings{EGLT11,
Title = {Modeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior},
Author = {Claudia Ermel and J\"urgen Gall and Leen Lambers and Gabriele Taentzer},
Booktitle = {Proc. Fundamental Aspects of Software Engineering (FASE'11)},
Year = {2011},
Pages = {156-170},
Publisher = {Springer},
Series = lncs,
Volume = {6603},
Abstract = {UML activity diagrams are a wide-spread modelling technique to capture behavioral aspects of system models. Usually, pre- and post-conditions of activities are described in natural language and are not formally integrated with the static domain model. Hence, early consistency validation of activity models is difficult due to their semi-formal nature. In this paper, we use integrated behavior models that integrate activity diagrams with object rules defining sets of actions in simple activities. We formalize integrated behavior models using typed, attributed graph transformation. It provides a basis for plausibility checking by static conflict and causality detection between specific object rules, taking into account their occurrence within the control flow. This analysis leads to favorable as well as critical signs for consistency of the integrated behavior model. Our approach is supported by \actigra, an \eclipse plug-in for editing, simulating and analyzing integrated behavior models. It visualizes favorable and critical signs for consistency in a convenient way and uses the well-known graph transformation tool \agg for rule application as well as static conflict and causality detection. We validate our approach modeling a conference scheduling system.},
Owner = {Claudia},
Timestamp = {2010.12.16},
Url = {http://www.springerlink.com/content/e0t437n346845055/}
}
@TechReport{EGLT11a,
Title = {Modeling with Plausibility Checking: Inspecting Favorable and Critical Signs for Consistency between Control Flow and Functional Behavior},
Author = {Claudia Ermel and Jï¿½rgen Gall and Leen Lambers and Gabriele Taentzer},
Institution = {TU Berlin},
Year = {2011},
Number = {2011/2},
Abstract = {UML activity diagrams are a wide-spread modelling technique to capture behavioral aspects of system models. Usually, pre- and post-conditions of activities are described in natural language and are not formally integrated with the static domain model.Hence, early consistency validation of activity models is difficult due to their semi-formal nature. In this paper, we use integrated behavior models that integrate activity diagrams with object rules defining sets of actions in simple activities. We formalize integrated behavior models using typed, attributed graph transformation. It provides a basis for plausibility checking by static conflict and causality detection between specific object rules, taking into account their occurrence within the control flow.This analysis leads to favorable as well as critical signs for consistency of the integrated behavior model. Our approach is supported by ActiGra, an Eclipse plug-in for editing, simulating and analyzing integrated behavior models. It visualizes favorable and critical signs for consistency in a convenient way and uses the well-known graph transformation tool AGG for rule application as well as static conflict and causality detection.},
Owner = {Claudia},
Timestamp = {2010.12.16},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@InCollection{EG14,
Title = {Experiment Studentin: Ein schul\"ubergreifender Oberstufenkurs des Techno-Clubs an der Technischen Universit\"at Berlin und sein Informatik-Projekt},
Author = {Ermel, Claudia and Greusing, Inka},
Booktitle = {Informatikkultur neu denken - Konzepte f\"ur Studium und Lehre},
Publisher = {Springer Fachmedien Wiesbaden},
Year = {2014},
Editor = {Leicht-Scholten, Carmen and Schroeder, Ulrik},
Pages = {57-70},
Doi = {10.1007/978-3-658-06022-0_4},
ISBN = {978-3-658-06021-3},
Language = {German},
Owner = {Claudia},
Timestamp = {2014.06.05},
Url = {http://dx.doi.org/10.1007/978-3-658-06022-0_4}
}
@InProceedings{EHKZ05,
Title = {{Animated Simulation of Integrated UML Behavioral Models based on Graph Transformation}},
Author = {Ermel, C. and H\"olscher, K. and Kuske, S. and Ziemann, P.},
Booktitle = {Proc. IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC'05)},
Year = {2005},
Address = {Dallas, Texas, USA},
Editor = {Erwig, M. and Sch\"urr, A.},
Month = {September},
Publisher = {IEEE Computer Society},
Abstract = {This paper shows how integrated UML models combining class, object, use-case, collaboration and state diagrams can be animated in a domain-specific layout. The presented approach is based on graph transformation, i.e.\ UML model diagrams are translated to a graph transformation system and the behavior of the integrated model is simulated by applications of graph transformation rules. For model validation, users may prefer to see the behavior of selected model aspects as scenarios presented in the layout of the application domain. We propose to integrate animation views with the model's graph transformation system. A prototypical validation system has been implemented recently supporting the automatic translation of a UML model into a graph transformation system, and the interactive execution and simulation of the model behavior. We sketch the tool interconnection to GenGED, a visual language environment which allows to enrich graph transformation systems for model simulation by features for animation.},
Keywords = {simulation, animation, UML, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/EHKZ05.pdf}
}
@Article{EHGB12,
Title = {Visual Modeling and Analysis of EMF Model Transformations Based on Triple Graph Grammars},
Author = {Ermel, C. and Hermann, F. and Gall, J. and Binanzer, D.},
Journal = {ECEASST},
Year = {2012},
Pages = {1--14},
Volume = {54},
Abstract = {The tool Henshin is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the recent extensions of Henshin by a visual editor for triple graph grammars (TGGs). The visual editor (called HenshinTGG) supports a compact visualization of triple rules in an integrated editor panel. Internally, triple graph rules are represented as Henshin rules and can be simulated using the Henshin EMF model transformation engine. Our extension supports the automatic generation of forward translation rules for transforming source into target models. A converter from Henshin TGG rules to the graph transformation analysis tool AGG allows a systematic check for conflicts of forward translation rules in AGG based on critical pair analysis.},
Booktitle = {Proc. 5th Intern. Workshop on Graph-Based Tools (GraBaTs'12)},
ISBN = {ISSN 1863-2122},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/archive}
}
@TechReport{EM96a,
Title = {{A} {T}aste of {C}ategorical {P}etri {N}ets},
Author = {Ermel, C. and Martini, A.},
Institution = {{TU Berlin}},
Year = {1996},
Month = {march},
Number = {96-9}
}
@TechReport{EP97b,
Title = {Formalization of {V}ariables in {A}lgebraic {H}igh-{L}evel {N}ets},
Author = {Ermel, C. and Padberg, J.},
Institution = {Technical {U}niversity Berlin},
Year = {1997},
Number = {97-19}
}
@InProceedings{EPE96,
Title = {{Requirements Engineering of a Medical Information System Using Rule-Based Refinement of Petri Nets}},
Author = {Ermel, C. and Padberg, J. and Ehrig, H.},
Booktitle = {Proc. Integrated Design and Process Technology},
Year = {1996},
Editor = {Cooke, D. and Kr{\"a}mer, B.J. and Sheu, P. C-Y. and Tsai, J.P. and Mittermeir, R.},
Note = {Vol.1},
Organization = {Society for Design and Process Science},
Pages = {186--193}
}
@TechReport{ETB05a,
Title = {{Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation: Long Version}},
Author = {Ermel, C. and Taentzer, G. and Bardohl, R.},
Institution = {Technische Universit\"at Berlin},
Year = {2005},
Number = {2004-21},
Abstract = {The ``classical'' approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This translation depends on a concrete model and may yield large graph transformation systems as the number of rules depends directly on the number of transitions in the net. Hence, the aim of this paper is to define the behavior of Algebraic High-Level (AHL) nets, a high-level Petri net variant, by a parallel, typed, attributed graph transformation system. Such a general parallel transformation system for AHL nets replaces the translation of transitions of specific AHL nets. After reviewing the formal definitions of AHL nets and parallel attributed graph transformation, we formalize the classical translation from AHL nets to graph transformation systems and prove the correctness of the translation. The translation approach then is contrasted to a definition for AHL net behavior based on parallel graph transformation. We show that the resulting amalgamated rules correspond to the behavior rules from the classical translation approach. },
ISBN = {1436-9915},
Keywords = {parallel graph transformation, algebraic high-level nets, Petri net semantics},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/ETB05.pdf}
}
@InCollection{EW01,
Title = {{Implementation of Parametrized Net Classes with the Petri Net Kernel of the Petri Net Baukasten}},
Author = {Ermel, C. and Weber, M.},
Booktitle = {Advances in Petri Nets: Unifying Petri Nets},
Publisher = Springer,
Year = {2001},
Editor = {Ehrig, H. and Juh{\'a}s, G. and Padberg, J. and Rozenberg, G.},
Series = lncs,
Volume = {2128},
Keywords = {Petri Nets, Petri Net Kernel, Petri Net Baukasten},
Url = {http://www.cs.tu-berlin.de/%7Elieske/public/UnifyingPN2001.ps.gz}
}
@TechReport{Fey92,
Title = {{ACT TWO}: An Algebraic Module Specification and Interconnection Language},
Author = {W. Fey},
Institution = {Technische Universit\"at Berlin},
Year = {1992},
Note = {To appear in Proc.\ 2nd AMAST Conf., Iowa City, 1991},
Number = {92/33}
}
@TechReport{Fey88,
Title = {Pragmatics, Concepts, Syntax, Semantics, and Correctness Notions of {ACT TWO}: An Algebraic Module Specification and Interconnection Language},
Author = {W. Fey},
Institution = {Technische Universit\"at Berlin},
Year = {1988},
Number = {88/26}
}
@Unpublished{FKB98,
Title = {Formalizing Neural Networks},
Author = {Fischer, I. and Koch, M. and Berthold, M.},
Note = {in Proceedings of the 5. GI-Workshop Fuzzy-Neuro-Systems '98, Munich.},
Month = {March},
Year = {1998}
}
@Unpublished{FKB98b,
Title = {Proving Properties of Neural Networks with Graph Transformations},
Author = {Fischer, I. and Koch, M. and Berthold, M.},
Note = {in Proceedings of the 1998 IEEE World Congress on Computational Intelligence , Anchorage, Alaska},
Month = {March},
Year = {1998}
}
@Unpublished{FKB98c,
Title = {Showing the Equivalence of Two Training Algorithms -- Part I},
Author = {Fischer, I. and Koch, M. and Berthold, M.},
Note = {in Proceedings of the 1998 IEEE World Congress on Computational Intelligence , Anchorage, Alaska},
Month = {March},
Year = {1998}
}
@Unpublished{FKB98d,
Title = {Showing the Equivalence of Two Training Algorithms -- Part II},
Author = {Fischer, I. and Koch, M. and Berthold, M.},
Note = {in Proceedings of the 1998 IEEE World Congress on Computational Intelligence , Anchorage, Alaska},
Month = {March},
Year = {1998}
}
@TechReport{FKT98,
Title = {{Visual Design of Distributed Object Systems by Graph Transformation}},
Author = {Fischer, I. and Koch, M. and Taentzer, G.},
Institution = {Technical University of Berlin},
Year = {1998},
Number = {98-15},
Booktitle = {Proc. of the Int. Workshop on Communication-Based Systems},
Editor = {Hommel, G.}
}
@InProceedings{FKT00,
Title = {{Local Views on Distributed Systems and their Communications}},
Author = {Fischer, I. and Koch, M. and Taentzer, G},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Pages = {164-178},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{FKT98a,
Title = {{Local Views on Distributed Systems and their Communications}},
Author = {Ingrid Fischer and Manuel Koch and Gabi Taentzer},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Pages = {40-47},
Institution = {University of Paderborn},
Optnumber = {tr-ri-98-21}
}
@InProceedings{FKTV98,
Title = {{Distributed Graph Transformation with Application to Visual Design of Distributed Systems}},
Author = {Fischer, I. and Koch, M. and Taentzer,G. and Volle, V.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution},
Year = {1999},
Editor = {Ehrig, H. and Kreowski, H.-J. and Montanari, U. and Rozenberg, G.},
Pages = {269--340},
Publisher = {World Scientific}
}
@MastersThesis{Fis10,
Title = {{Entwicklung einer Werkzeugumgebung für Algebraische High-Level Netze mit Anwendung auf ein Szenario zur Einsatzsteuerung bei der Berliner Feuerwehr }},
Author = {Fischer, Winzent},
School = {TU Berlin, Fak. IV},
Year = {2010},
Type = {Diplomarbeit (Master's thesis)},
Timestamp = {2010.09.21},
Url = {http://www.tfs.tu-berlin.de/menue/forschung/abschlussarbeiten/archiv_abschlussarbeiten/}
}
@TechReport{FHTW05,
Title = {{Two visualizations of OCL: a comparison}},
Author = {Fish, A. and Howse, J. and Taentzer, G. and Winkelmann, J.},
Institution = {University of Brighton},
Year = {2005},
Number = {VMG.05.1},
Abstract = {We compare two visualizations of OCL, VisualOCL and Constraint Diagrams, and establish some of their benefits and weaknesses. These two notations were designed to fit in to the diagrammatic modelling paradigm. We introduce a simple case study, with constraints written in both natural language and OCL, and visualize these constraints using VisualOCL and Constraint Diagrams. Using a set of criteria which is based on cognitive, syntactic and semantic questions, we compare the notations, with reference to the sample constraints.}
}
@TechReport{FHMO89,
Title = {Anforderungen an computergest{\"u}tzte medizinische {A}rbeitspl{\"a}tze},
Author = {Fleck, E and Hansen, H. and Mahr, B. and Oswald, H.},
Institution = {PMI-Berlin},
Year = {1989},
Address = {Berlin},
Number = {89-01},
Type = {Research Report}
}
@TechReport{Gab10,
Title = {Algebraic High-Level Nets and Processes Applied to Communication Platforms},
Author = {Karsten Gabriel},
Institution = {Fak. IV, TU Berlin},
Year = {2010},
Number = {2010/14},
ISSN = {1436-9915},
Owner = {Claudia},
Timestamp = {2011.01.24}
}
@TechReport{GBEG10,
Title = {Finitary M-Adhesive Categories - Unabridged Version},
Author = {Gabriel, K. and Braatz, B. and Ehrig, H. and Golas, U.},
Institution = TUB,
Year = {2010},
Number = {2010/12},
Abstract = {Finitary M-adhesive categories are M-adhesive categories with finite objects only, where the notion M-adhesive category is short for weak adhesive high-level replacement (HLR) category. We call an object finite if it has a finite number of M-subobjects. In this paper, we show that in finitary M-adhesive categories we do not only have all the well-known properties of M-adhesive categories, but also all the additional HLR-requirements which are needed to prove the classical results for M-adhesive systems. These results are the Local Church-Rosser, Parallelism, Concurrency, Embedding, Extension, and Local Confluence Theorems, where the latter is based on critical pairs. More precisely, we are able to show that finitary M-adhesive categories have a unique E-M-factorization and initial pushouts, and the existence of an M-initial object implies in addition finite coproducts and a unique E0-M0-pair factorization. Moreover, we can show that the finitary restriction of each M-adhesive category is a finitary M-adhesive category and finitariness is preserved under functor and comma category constructions based on M-adhesive categories. This means that all the classical results are also valid for corresponding finitary M-adhesive systems like several kinds of finitary graph and Petri net transformation systems. Finally, we discuss how some of the results can be extended to non-M-adhesive categories.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2010/tr_2010-12.pdf}
}
@Article{GLE12,
Title = {{Algebraic Approach to Timed Petri Nets}},
Author = {Gabriel, Karsten and Lingnau, Pascal and Ermel, Claudia},
Journal = {ECEASST},
Year = {2012},
Volume = {47},
Abstract = {One aspect often needed when modelling systems of any kind is time-based analysis, especially for real-time or in general time-critical systems. Algebraic place/transition (P/T) nets do not inherently provide a way to model the passing of time or to restrict the firing behaviour with regards to passing time.In this paper, we present an extension of algebraic P/T nets by adding time durations to transitions and timestamps to tokens. We define categories for different timed net classes and functorial relations between them.Our first result is the definition of morphisms preserving firing behaviour for all timed net classes. As second result, we define structuring techniques for timed P/T nets in a way that our category fulfills the properties of $\mathcal{M}$-adhesive systems, a general categorical framework for structuring and transforming high-level algebraic structures.We demonstrate our approach by applying it to model a real-time communication network.},
Booktitle = {Proceedings of the 11th Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'12)},
Editor = {Andrew Fish and Leen Lambers},
ISBN = {{ISSN 1863-2122}},
Keywords = {algebraic Petri nets, Petri nets with time, timed P/T nets, Petri net structuring technique, P/T net transformation},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Unpublished{GH97,
Title = {An Inductive View of Graph Transformation},
Author = {Gadducci, F. and Heckel, R.},
Year = {1997}
}
@InProceedings{GHK98a,
Title = {Model Checking Graph-Interpreted Temporal Formulas},
Author = {Gadducci, F. and Heckel, R. and Koch, M.},
Booktitle = {Proc. 6th International Workshop on Theory and Applications of Graph Transformation (TAGT'98)},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Number = {tr--ri--98--201},
Organization = {Universit{\"a}t--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik},
Pages = {292--299},
Series = {Reihe Informatik}
}
@Unpublished{GHK98,
Title = {{A Fully Abstract Model for Graph-Interpreted Temporal Logic}},
Author = {F. Gadducci and R. Heckel and M. Koch},
Year = {1998}
}
@InProceedings{hk98b,
Title = {{Model Checking Graph-Interpreted Temporal Formulas}},
Author = {F. Gadducci and R. Heckel and M. Koch},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Institution = {University of Paderborn},
Optnumber = {tr-ri-98-21}
}
@TechReport{GHK97,
Title = {{C}ombining {G}raph {T}ransformations with {T}emporal {L}ogic},
Author = {Gadducci, F. and Heckel, R. and Koch, M.},
Institution = {In First TMR GETGRATS Workshop, Bordeaux, October 1997},
Year = {1997}
}
@TechReport{GM97,
Title = {{B}uilding {M}inimal {D}erivations or how to provide epi-mono factorizations},
Author = {Gadducci, Fabio and M{\"u}ller, J{\"u}rgen},
Institution = {Technical University of Berlin},
Year = {1997},
Note = {to appear},
Number = {97-??}
}
@InProceedings{GH99,
Title = {{An Inductive View of Graph Transformations}},
Author = {Gaducci, F. and Heckel, R.},
Booktitle = {Proc. CTCS'99},
Year = {1999}
}
@InProceedings{Gaj00,
Title = {{Concepts and Requirements for Transformations within Petri Net Based Process Models}},
Author = {Gajewsky, M.},
Booktitle = {5$^{th}$ World Conference on {I}ntegrated {D}esign and {P}rocess {T}echnology, {S}pecial {S}ession on {M}odel {I}ntegration},
Year = {2000},
Editor = {A. Ertas},
Note = {CD-ROM, 8 pages}
}
@Article{Gaj01,
Title = {Concepts and Requirements for Transformations within Petri Net Based Process Models},
Author = {Gajewsky, M.},
Journal = {Transactions of the SDPS Journal of Design \& Process Science},
Year = {2001},
Number = {1},
Pages = {1--12},
Volume = {3}
}
@InCollection{GE01,
Title = {{The ``Petri Net Baukasten'': An Overview}},
Author = {Gajewsky, M. and Ehrig, H.},
Booktitle = {{Unifying Petri Nets}},
Publisher = Springer,
Year = {2001},
Editor = {Ehrig, H. and Juh{\'a}s, G. and Padberg, J. and Rozenberg, G.},
Pages = {26--53},
Series = lncs,
Volume = {2128}
}
@InProceedings{GE99,
Title = {{Transition Invariants in Algebraic High-Level Nets}},
Author = {Gajewsky, M. and Ermel, C.},
Booktitle = {4$^{th}$ World Conference on {I}ntegrated {D}esign and {P}rocess {T}echnology},
Year = {1999},
Editor = {A. Ertas},
Note = {CD-ROM, 8 pages}
}
@TechReport{GHP99,
Title = {{Place Preserving and Transition Gluing Morphisms in Rule-Based Refinement of Place/Transition Systems}},
Author = {Gajewsky, M. and Hoffmann, K. and Padberg, J.},
Institution = {Technical University Berlin},
Year = {1999},
Number = {99-14}
}
@InProceedings{GLP96,
Title = {Parametrisierung von {F}un{S}oft-{N}etzen f{\"u}r die flexible {M}odellierung von {W}orkflow-{M}odellen},
Author = {Gajewsky, M. and Lembke, S. and Padberg, J.},
Booktitle = {{Kick-O}ff-{W}orkshop der {DFG-F}orschergruppe ``{P}etrinetz-{T}echnologie''},
Year = {1996},
Address = {{H}umboldt-{U}niversit{\"a}t zu {B}erlin},
Editor = {Weber, H. and Ehrig, H. and Reisig, W.},
Publisher = {Informatik- {B}ericht 73}
}
@TechReport{GPH00,
Title = {{Safety Introducing and Preserving Rules for Algebraic High-Level Net Systems}},
Author = {Gajewsky, M. and Padberg, J. and Hoffmann, K.},
Institution = {Technical University Berlin},
Year = {2000},
Number = {2000-17, ISSN: 1436-9915}
}
@TechReport{GPU01,
Title = {{Rule-Based Refinement for Place/Transition Systems: Preserving Liveness-Properties}},
Author = {Gajewsky, M. and Padberg, J. and Urb{\'a}{\v{s}}ek, M.},
Institution = TUB,
Year = {2001},
Number = {2001-8},
Keywords = {Net Transformations, Rule-Based Refinement, Liveness},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/TR01-8.ps.gz}
}
@InProceedings{GPP01,
Title = {On Compatibilty of Model and Class Transformations},
Author = {Gajewsky, M. and Parisi-Presicce, F.},
Booktitle = {{15$^{th}$ International Workshop on Algebraic Development Techniques and General Workshop of the CoFI WG}},
Year = {2001},
Editor = {Cerioli, M. and Reggio, G.},
Pages = {109-27},
Publisher = Springer,
Series = lncs,
Volume = {2267}
}
@TechReport{GPP00,
Title = {{Formal Transformations of Petri Nets}},
Author = {Gajewsky, M. and Parisi-Presicce, F.},
Institution = {Technical University Berlin},
Year = {2000},
Number = {2000-12}
}
@PhdThesis{Gei99,
Title = {{Formal Semantics for the Integration of Statecharts and Z in a Metamodel-Based Framework}},
Author = {R. Geisler},
School = {TU Berlin},
Year = {1999}
}
@InProceedings{Gei93,
Title = {{P}etri-Netze und ihre Einsatzm"oglichkeiten in der Steuerungstechnik},
Author = {Geisler, R.},
Booktitle = {Entwurf komplexer Automatisierungssysteme, 3. Fachtagung},
Year = {1993},
Month = {Mai},
Publisher = {TU Braunschweig}
}
@MastersThesis{GK95,
Title = {{D}esign and {R}ealization of the {I}nteractive {T}heorem- and {C}ompleteness {P}rover {{\it InterACT}} for {A}lgebraic {S}pecifications (in German)},
Author = {R. Geisler and M. Klar},
School = {Berlin University of Technology},
Year = {1995},
Month = {Jun}
}
@InProceedings{GKC96,
Title = {{\em InterACT}: An Interactive Theorem Prover for Algebraic Specifications},
Author = {Geisler, R. and Klar, M. and Cornelius, F.},
Booktitle = {Proc. AMAST'96, 5th International Conference on Algebraic Methodology and Software Technology},
Year = {1996},
Publisher = Springer
}
@InProceedings{GKM00,
Title = {Precise semantics of integrated modeling languages by formal metamodeling},
Author = {Geisler, R. and Klar, M. and Mann, S.},
Booktitle = {Proc. 5th World Conference on Integrated Design and Process Technology},
Year = {2000},
Editor = {Tanik, M.M. and Ertas, A.},
Publisher = {Society for Design and Process Science}
}
@TechReport{GKP98,
Title = {{Dimensions and Dichotomy in Metamodeling}},
Author = {Geisler, R. and Klar, M. and Pons, C.},
Institution = {FB Informatik, TU Berlin},
Year = {1998},
Number = {98--05}
}
@MastersThesis{GJK90,
Title = {{Entwurf und Implementierung eines Netz\-werk\-zeugs zur Simulation algebraischer High-Level-Netze}},
Author = {Giesel, D. and Jeschke, R. and Kr{\"u}ger, J.},
School = {Technical University of Berlin},
Year = {1990}
}
@TechReport{GKJ90,
Title = {{Grundkonzepte und Implementierung eines Netzwerkzeugs f{\"u}r Algebraische High-Level Netze}},
Author = {Giesel, D. and Kr{\"u}ger, J. and Jeschke, R.},
Institution = TUB,
Year = {1990},
Number = {90/34}
}
@InProceedings{GEMT00,
Title = {{ Tool Support for ViewPoint-Oriented Software Development: Towards Integration of Multiple Perspectives by Distributed Graph Transformation}},
Author = {Goedicke, M. and Enders, B. and Meyer, T. and Taentzer, G.},
Booktitle = {Int.\ Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE'99)},
Year = {2000},
Pages = {369 -- 378},
Publisher = Springer,
Series = lncs,
Volume = {1779}
}
@InProceedings{GEMT00a,
Title = {{ViewPoint-Oriented Software Development: Tool Support for Integrating Multiple Perspectives by Distributed Graph Transformation}},
Author = {Goedicke, M. and Enders, B. and Meyer, T. and Taentzer, G.},
Booktitle = {{Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Berlin, Germany}},
Year = {2000},
Pages = {43 - 47},
Publisher = Springer,
Series = lncs,
Volume = {1785},
Editors = {S. Graf and Michael Schwartzbach}
}
@InProceedings{GMT99,
Title = {{ViewPoint-oriented Software Development by Distributed Graph Transformation: Towards a Basis for Living with Inconsistencies}},
Author = {Goedicke, M. and Meyer, T. and Taentzer, G.},
Booktitle = {Proc.\ 4th IEEE Int.\ Symposium on Requirements Engineering (RE'99), June 7-11, 1999, University of Limerick, Ireland},
Year = {1999},
Publisher = {IEEE Computer Society},
ISSN = {ISBN 0-7695-0188-5}
}
@InProceedings{GMT98,
Title = {{Dynamic Change Management by Distributed Graph Transformation: Towards Configurable Distributed Systems}},
Author = {Goedicke, M. and Meyer, T. and Taentzer, G.},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Institution = {University of Paderborn},
Optnumber = {tr-ri-98-21}
}
@PhdThesis{Gol11,
Title = {{Analysis and Correctness of Algebraic Graph and Model Transformations}},
Author = {Ulrike Golas},
School = {Technische Universit\"at Berlin},
Year = {2011},
ISBN = {ISBN: 978-3-8348-1493-7},
Publisher = {Vieweg + Teubner}
}
@TechReport{Gol10,
Title = {Multi-Amalgamation in M-Adhesive Categories: Long Version},
Author = {Golas, U.},
Institution = TUB,
Year = {2010},
Number = {2010/05},
Abstract = {Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general application conditions. However, the theory of amalgamation for the double pushout approach has been developed up to now only on a set-theoretical basis for pairs of standard graph rules without any application conditions.
For this reason, we present the theory of amalgamation in this paper in the framework of M-adhesive categories, short for weak adhesive HLR categories, for a bundle of rules with (nested) application conditions. The main result is the Multi-Amalgamation Theorem, which generalizes the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronized parallelism.
The constructions are illustrated by a small running example. A more complex case study for the operational semantics of statecharts based on multi-amalgamation is presented in a separate paper.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2010/tr_2010-05.pdf}
}
@Article{GBEE11,
Title = {{A Visual Interpreter Semantics for Statecharts Based on Amalgamated Graph Transformation}},
Author = {Golas, Ulrike and Biermann, Enrico and Ehrig, Hartmut and Ermel, Claudia},
Journal = {ECEASST},
Year = {2011},
Volume = {39},
Abstract = {Several different approaches to define the formal operational semantics of statecharts have been proposed in the literature, including visual techniques based on graph transformation. These visual approaches either define a compiler semantics (translating a concrete statechart into a semantical domain) or they define an interpreter using complex control and helper structures. Based on the existing visual semantics definitions it is difficult to apply the classical theory of graph transformations to analyze behavioral statechart properties due to the complex control structures. In this paper, we define an interpreter semantics for statecharts based on amalgamated graph transformation where rule schemes are used to handle an arbitrary number of transitions in orthogonal states in parallel. We build on an extension of the existing theory of amalgamation from binary to multi-amalgamation including nested application conditions to control rule applications for automatic simulation. This is essential for the interpreter semantics of statecharts. The theory of amalgamation allows us to show termination of the interpreter semantics of well-behaved statecharts, and especially for our running example, a producer-consumer system.},
Booktitle = {Selected Papers of Int. Workshop on Graph Computation Models (GCM'10)},
Editor = {Rachid Echahed, Annegret Habel, Mohamed Mosbah},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, triple graph grammar, application condition},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{GEH10,
Title = {Multi-Amalgamation in Adhesive Categories},
Author = {Golas, U. and Ehrig, H. and Habel, A.},
Booktitle = {Proceedings of Intern. Conf. on Graph Transformation ( ICGT' 10)},
Year = {2010},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch{\"u}rr, A.},
Pages = {346--361},
Publisher = Springer,
Series = lncs,
Volume = {6372},
Abstract = {Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general application conditions. However, the theory of amalgamation for the double pushout approach has been developed up to now only on a set-theoretical basis for pairs of standard graph rules without any application conditions.
For this reason, we present the theory of amalgamation in this paper in the framework of adhesive categories for a bundle of rules with (nested) application conditions. In fact, it is also valid for weak adhesive HLR categories. The main result is the Multi-Amalgamation Theorem, which generalizes the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronized parallelism.
The constructions are illustrated by a small running example. A more complex case study for the operational semantics of statecharts based on multi-amalgamation is presented in a separate paper.},
ISBN = {ISBN 978-3-642-15927-5},
Owner = {Claudia},
Timestamp = {2010.10.15},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/GEH10.pdf}
}
@Article{GEH11,
Title = {{Formal Specification of Model Transformations by Triple Graph Grammars with Application Conditions}},
Author = {Golas, Ulrike and Ehrig, Hartmut and Hermann, Frank},
Journal = {ECEASST},
Year = {2011},
Volume = {39},
Booktitle = {Proc. Int. Workshop on Graph Computation Models (GCM'10)},
Editor = {Rachid Echahed, Annegret Habel, Mohamed Mosbah},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, triple graph grammar, application condition},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{GEH10a,
Title = {{Enhancing the Expressiveness of Formal Specifications for Model Transformations by Triple Graph Grammars with Application Conditions}},
Author = {Golas, Ulrike and Ehrig, Hartmut and Hermann, Frank},
Booktitle = {Proc. Int. Workshop on Graph Computation Models (GCM'10)},
Year = {2010},
Pages = {149--164},
Url = {http://gcm-events.org/gcm2010/pages/gcm2010-preproceedings.pdf}
}
@InCollection{GLEG12,
Title = {Toward Bridging the Gap between Formal Foundations and Current Practice for Triple Graph Grammars},
Author = {Golas, Ulrike and Lambers, Leen and Ehrig, Hartmut and Giese, Holger},
Booktitle = {Graph Transformations},
Publisher = {Springer Berlin Heidelberg},
Year = {2012},
Editor = {Ehrig, Hartmut and Engels, Gregor and Kreowski, Hans-JÃ¶rg and Rozenberg, Grzegorz},
Pages = {141-155},
Series = {Lecture Notes in Computer Science},
Volume = {7562},
Doi = {10.1007/978-3-642-33654-6_10},
ISBN = {978-3-642-33653-9},
Url = {http://dx.doi.org/10.1007/978-3-642-33654-6_10}
}
@Article{GLEO12,
Title = {Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs},
Author = {Ulrike Golas and Leen Lambers and Hartmut Ehrig and Fernando Orejas},
Journal = {Theor. Comput. Sci.},
Year = {2012},
Pages = {46-68},
Volume = {424},
Bibsource = {DBLP, http://dblp.uni-trier.de},
Ee = {http://dx.doi.org/10.1016/j.tcs.2012.01.032}
}
@InProceedings{GHE+13,
Title = {Towards Bidirectional Engineering of Satellite Control Procedures Using Triple Graph Grammars},
Author = {Susann Gottmann and Frank Hermann and Claudia Ermel and Thomas Engel and Gianluigi Morelli},
Booktitle = {Proceedings of the 7th Workshop on Multi-Paradigm Modeling (MPM 2013)},
Year = {2013},
Address = {Aachen},
Editor = {Christophe Jacquet and Daniel Balasubramanian and Edward Jones and Tam\'as M\'esz\'aros},
Number = {1112},
Pages = {67-76},
Series = {CEUR Workshop Proceedings},
Abstract = {The development and maintenance of satellite control software are very complex, mission-critical and cost-intensive tasks that require expertise from different domains. In order to adequately address these challenges, we propose to use visual views of the software to provide concise abstractions of the system from different perspectives. This paper introduces a visual language for process flow models of satellite control procedures that we developed in cooperation with the industrial partner SES for the satellite control language SPELL. Furthermore, we present a general and formal bidirectional engineering approach for automatically translating satellite control procedures into corresponding process flow visualisations. The bidirectional engineering framework is supported by a visual editor based on Eclipse GMF, the transformation tool HenshinTGG, and additional extensions to meet requirements set up by the specific application area of satellite control languages.},
Eventdate = {2013-09-30},
ISSN = {1613-0073},
Url = {http://ceur-ws.org/Vol-1112/},
Venue = {Miami, Florida}
}
@InProceedings{GHN+13,
Title = {Correctness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars},
Author = {Gottmann, S. and Hermann, F. and Nachtigall, N. and Braatz, B. and Ermel, C. and Ehrig, H. and Engel, T.},
Booktitle = {Proc. Int. Workshop on Analysis of Model Transformations 2013 (AMT'13)},
Year = {2013},
Address = {Aachen},
Editor = {Baudry, B. and Dingel, J. and Lucio, L. and Vangheluwe, H.},
Number = {1112},
Pages = {67-76},
Series = {CEUR Workshop Proceedings},
Abstract = {Triple graph grammars (TGGs) have been applied successfully for specifying and analysing bidirectional model transformations. Recently, a formal approach to concurrent model synchronisation has been presented, where source and target modifications are synchronised simultaneously. In addition to methods for update propagation, the approach includes a semi-automatic strategy for conflict resolution. Up to now, this approach has been limited to deterministic propagation operations. In this paper, we generalise the approach to arbitrary TGGs and consider non-deterministic operations which might yield dierent results and require back tracking. We show correctness and completeness of the extended approach and provide a technique for reducing and possibly eliminating backtracking to improve efficiency. },
ISSN = {1613-0073},
Keywords = {concurrent model synchronisation, bidirectional model transformation, triple graph grammars},
Location = {Miami, USA, September 2013},
Url = {http://ceur-ws.org/Vol-1077/}
}
@MastersThesis{GN11,
Title = {Modelling the Living Place Project using Algebraic Higher Order Nets},
Author = {Gottmann, S. and Nachtigall, N.},
School = {School of Electrical Engineering and Computer Science, Technische Universität Berlin},
Year = {2011},
Abstract = {Within this work the system of the Living Place Hamburg is considered as a system of ubiquitous computing and ambient intelligence by providing a formal model of the internal system behaviour of this system, so that this model helps us to improve our understanding of ubiquitous computing systems in general and in particular helps us to improve our understanding of the modelled system itself.
The thereby used formal modelling techniques include a new variant of Petri nets with markings called Algebraic High-Level Nets with Individual Tokens, short AHLI nets, as well as rule-based transformation of such nets following the double pushout approach.
This new approach of individual tokens in contrast to the former approach of collective tokens enables the formulation of marking-changing rules, where the usage of such rules within the modelling leads into an elegant model of the Living Place system as the main result of this work.
On the basis of the presented model an examplary scenario, as it can be processed by the Living Place system, will be simulated. Thereby, the essential components of the model will be taken into account.
Furthermore, possible formal analysis techniques are introduced that can be applied upon that model to obtain resp. verify certain properties concerning the internal system behaviour of the Living Place system as well as some results resulting from such an application are considered.},
Owner = {Claudia},
Timestamp = {2012.03.14}
}
@InProceedings{GNE+16,
Title = {Towards the Propagation of Model Updates along different Views in Multi-View Models},
Author = {Gottmann, S. and Nachtigall, N. and Ermel, C. and Hermann, F. and Engel, T.},
Booktitle = {5th International Workshop on Bidirectional Transformations},
Year = {2016},
Pages = {45-60},
Publisher = {CEUR Workshop Proceedings},
Volume = {1571},
Abstract = {Models are the keystones in model-driven systems development. They describe systems at different layers of abstraction and with a focus to different domains. For each domain, dedicated domain specific visual modelling languages are used for model definitions with the idea to separate concerns to different domain experts. This enables precise problem and requirement definitions and should decrease efforts in developing and validating systems.
We focus on multi-view models that are in relationship with source models by triple graph grammars. A multi-view model provides different views of the source model at different
layers of abstraction but within the same DSL which is typically different from the DSL of the source model. In practice, elements in different views may overlap. We present an informal methodology for consistently propagating updates from one view to the other views and also to the source domain. We motivate our approach by multi-view models in a hospital scenario.},
Owner = {Lenovo},
Timestamp = {2017.02.26},
Url = {http://ceur-ws.org/Vol-1571/paper_7.pdf}
}
@MastersThesis{Gra06,
Title = {{Evolution{\"a}res Layout von Graphseqenzen unter Nutzung von anwendungsspezifischem Wissen}},
Author = {Graf, D.},
School = FB13,
Year = {2006},
Type = {Master's thesis},
Abstract = {In dieser Diplomarbeit wird ein Algorithmus zum Layout einer Sequenz von Graphen vorgestellt. Da inhaltlich und zeitlich aufeinander folgende Graphen dargestellt werden sollen, werden die Unterschiede zwischen zwei aufeinander folgenden Graphen durch Graphtransformationen realisiert. Der Layoutalgoritmus wird in das Graphtransformationstool AGG integriert. Dieses Layout wird hier als evolution{\"a}res Layout bezeichnet, da auch das Layout von aufeinander folgenden Graphen aufeinander auf- baut. Dabei soll das Layout der einzelnen Graphen m{\"o}glichst {\"a}hnlich sein. Dadurch soll der Wiedererkennungswert der aufeinander folgenden Graphen einer Sequenz hoch und das Ausma{\ss} der notwendigen {\"A}nderung der Mental Map der Entwickler somit gering gehalten werden. F{\"u}r die Berechnung des Layouts der Einzelgraphen kann Vorwissen {\"u}ber die Art und den Anwendungszweck der Graphen herangezogen werden. So k{\"o}nnen spezielle Anforderungen an das Layout von bestimmten Graphen realisiert werden. Ein Beispiel f{\"u}r eine solche Anforderung ist die Erwartung, dass in einem Klassenmodell in einer Vererbungsstruktur die Superklasse oberhalb ihrer Subklassen angeordnet ist. F{\"u}r das Layout kommt ein Spring Embedder Algorithmus zum Einsatz. Dabei k{\"o}nnen Eigenschaften von Knoten (Klassen) und Kanten sowie die auf die objektorientierten Inhalte bezogenen Layouterwartungen die Berechnung des Layouts beeinflussen, so dass inhaltlich verwandte Klassen n{\"a}her bei- einander positioniert werden. },
Keywords = {graph transformation tool, evolutionary layout},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Gra06.pdf}
}
@TechReport{Gri02,
Title = {{Transformation Systems Semantics and Compositionality of Algebraic Petri Nets}},
Author = {Grigoriu, L.},
Institution = {Technical University of Berlin},
Year = {2002},
Number = {2002-21},
Abstract = {In the first part of the paper, place-transition nets and algebraic high-level nets are translated into algebra transformation systems, thus defining the net semantics. Both sequential and concurrent nets are considered. Some results concerning the relation between the net semantics resulting from a rul-based system corresponding to the net, and a transformation system built directly from the net are presented. The second part of the paper analyzes the correspondence between transformation system compositon operations applied to place-transition net semantics, and syntactical operations on place-transition nets. It is shown that no correspondance exists for the general case, and reasons for this situation are outlined. Some elementary mechanisms are presented, showing the way in which certain characteristics of synchronized compositions correspond to syntactical composition operations on nets, that go beyond the usual gluing techniques. This corresponds very much to finding out to what extent marking graph synchronization can be reflected by operations on nets.},
Keywords = {Petri Nets, Algebra Transformation Systems, Net Semantics},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2002/TR2002_21.ps.gz}
}
@MastersThesis{Gri00,
Title = {Transformation System Semantics and Compositionality of Algebraic Petri Nets},
Author = {Grigoriu, L.},
School = {TU Berlin, FB Informatik},
Year = {2000}
}
@TechReport{GR99,
Title = {{Specification of state based systems by algebra rewrite systems and refinements}},
Author = {Gro{\ss{}}e-Rhode, M.},
Institution = {TU Berlin, FB Informatik},
Year = {1999},
Number = {99-04}
}
@InProceedings{Gro00a,
Title = {Integration Modelling},
Author = {{Gro{\ss}e-Rhode}, M.},
Booktitle = {INT: Integration of Specification Techniques with Applications in Enginering},
Year = {2000},
Editor = {Ehrig, H. and {Gro{\ss}e--Rhode}, M. and Orejas, F.},
Pages = {29--33},
Publisher = {TU Berlin, FB 13}
}
@InCollection{Gro90,
Title = {Towards Object--Oriented Algebraic Specifications},
Author = {{Gro{\ss}e-Rhode}, M.},
Booktitle = {Recent Trends in Data Type Specification},
Publisher = Springer,
Year = {1991},
Editor = {Ehrig, H. and Jantke, K.P. and Orejas, F. and Reichel, H.},
Pages = {98 -- 116},
Series = lncs,
Volume = {534}
}
@InProceedings{Gro96b,
Title = {Concurrent State Transformations on Abstract Data Types},
Author = {{Gro{\ss}e-Rhode}, M.},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1996},
Editor = {Haveraaen, M. and Owe, O. and Dahl, O.-J.},
Organization = {11th Workshop on Specification of Abstract Data Types},
Publisher = Springer,
Series = lncs,
Volume = {1130}
}
@InProceedings{Gro00b,
Title = {Using a formal reference model for consistency checking and integration of {UML} diagrams},
Author = {{Gro{\ss}e-Rhode}, M.},
Booktitle = {Proc. 5th World Conference on Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Editor = {Tanik, M.M. and Ertas, A.},
Publisher = {Society for Design and Process Science}
}
@TechReport{Gro97a,
Title = {{Sequential and Parallel Algebra Transformation Systems and their Composition}},
Author = {Gro{\ss}e-Rhode, M.},
Institution = {Universit{\`a} di Roma \emph{La Sapienza}, Dip. Scienze dell'Informazione},
Year = {1997},
Number = {97--07}
}
@PhdThesis{Gro95a,
Title = {Specification of Transition Categories --- An Approach to Dynamic Abstract Data Types },
Author = {{Gro{\ss}e-Rhode}, M.},
School = {TU Berlin},
Year = {1995}
}
@InProceedings{Gro89-c,
Title = {Parameterized Data Type and Process Specifications using Projection Algebras},
Author = {{Gro{\ss}e-Rhode}, M.},
Booktitle = {Categorical Methods in Computer Science},
Year = {1989},
Pages = {185--197},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@MastersThesis{Gro88,
Title = {Specification of projection algebras},
Author = {{Gro{\ss}e-Rhode}, Martin},
School = {Technical University of Berlin},
Year = {1988}
}
@InProceedings{Gro99b,
Title = {A compositional comparison of specifications of the alternating bit protocol in {CCS} and {UNITY} based on algebra transformation systems},
Author = {{Gro{\ss}e--Rhode}, M.},
Booktitle = {Proc. of the 1st International Conference on Integrated Formal Methods (IFM'99), York, UK, 28--29 June 1999},
Year = {1999},
Editor = {Araki, K. and Galloway, A. and Taguchi, K.},
Pages = {253--272},
Publisher = {Springer Verlag}
}
@InCollection{Gro98a,
Title = {Algebra Transformation Systems and their Composition},
Author = {{Gro{\ss}e--Rhode}, M.},
Booktitle = {Fundamental Approaches to Software Engineering (FASE'98)},
Publisher = Springer,
Year = {1998},
Editor = {Astesiano, E.},
Pages = {107--122},
Series = lncs,
Volume = {1382}
}
@InProceedings{Gro01c,
Title = {Formal concepts for an integrated internal model of the {UML}},
Author = {{Gro{\ss}e--Rhode}, M.},
Booktitle = {Proc.\ Uniform Approaches to Graphical Process Specification Techniques (UNIGRA'01)},
Year = {2001},
Editor = {Ehrig, H. and Padberg, J.},
Series = entcs,
Volume = {44 (4)},
Keywords = {Algebraic Specification, Integration of Modeling Techniques, UML},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Emgr/papers/unigra.ps.gz}
}
@InProceedings{Gro01b,
Title = {Integrating Semantics for Object-Oriented System Models},
Author = {{Gro{\ss}e--Rhode}, M.},
Booktitle = {Proc.\ International Colloquium on Automata, Languages and Programming (ICALP 2001)},
Year = {2001},
Editor = {Orejas, F. and Spirakis, P. G. and {van Leeuwen}, J.},
Pages = {40--60},
Publisher = Springer,
Series = lncs,
Volume = {2076},
Keywords = {Algebraic Specification, Integration of Modeling Techniques, UML}
}
@InCollection{Gro98c,
Title = {From Algebra Transformation to Labelled Transition Systems},
Author = {{Gro{\ss}e--Rhode}, M.},
Booktitle = {Recent Trends in Algebraic Development Techniques},
Publisher = Springer,
Year = {1998},
Editor = {{{Parisi--Presicce}, F.}},
Pages = {269--284},
Series = lncs,
Volume = {1376},
Annote = {12th Workshop on Algebraic Development Techiques, Tarquinia (Italy), June 1997}
}
@TechReport{Gro01a,
Title = {Semantic Integration of Heterogeneous Formal Specifications via Transformation Systems},
Author = {{Gro{\ss}e--Rhode}, M.},
Institution = {TU Berlin},
Year = {2001}
}
@Misc{Gro00,
Title = {{Compositional Comparison of Formal Software Specifications using Transformation Systems}},
Author = {{Gro{\ss}e--Rhode}, M.},
Month = {August},
Year = {2000}
}
@TechReport{Gro00c,
Title = {Integration of heterogeneous software component models via transition systems},
Author = {{Gro{\ss}e--Rhode}, M.},
Institution = {TU Berlin},
Year = {2000}
}
@Article{Gro99,
Title = {On a reference model for the formalization and integration of software specification languages},
Author = {{Gro{\ss}e--Rhode}, M.},
Journal = BEATCS,
Year = {1999},
Month = {June},
Pages = {81--89},
Volume = {68}
}
@TechReport{Gro99a,
Title = {Specification of State Based Systems by Algebra Rewrite Systems and Refinements},
Author = {{Gro{\ss}e--Rhode}, M.},
Institution = {TU Berlin, FB Informatik},
Year = {1999},
Month = {March},
Number = {99--04}
}
@Article{Gro99c,
Title = {On a reference model for the formalization and integration of software specification languages},
Author = {{Gro{\ss}e--Rhode}, M.},
Journal = BEATCS,
Year = {1999},
Pages = {81--89},
Volume = {68}
}
@InCollection{Gro99d,
Title = {{K}ategorielle {G}rundlagen},
Author = {{Gro{\ss}e--Rhode, M.}},
Booktitle = {Mathematisch--strukturelle Grundlagen der Informatik, Part V},
Publisher = {Springer Verlag, Berlin, Heidelberg, New--York},
Year = {1999}
}
@Article{Gro98b,
Title = {First Steps Towards an Institution of Algebra Replacement Systems},
Author = {{Gro{\ss}e--Rhode}, M.},
Journal = {Applied Categorical Structures},
Year = {1998},
Number = {4},
Pages = {403--426},
Volume = {6}
}
@Article{Gro96a,
Title = {Transition Specifications for Dynamic Abstract Data Types},
Author = {{{Gro{\ss}e--Rhode}}, M.},
Journal = {Applied Categorical Structures},
Year = {1997},
Pages = {265--308},
Volume = {5}
}
@Article{Gro97b,
Title = {Transition Specifications for Dynamic Abstract Data Types},
Author = {{Gro{\ss}e--Rhode}, M.},
Journal = {Applied Categorical Structures},
Year = {1997},
Pages = {265--308},
Volume = {5}
}
@Article{Gro95b,
Title = {Transition Specifications for Dynamic Abstract Data Types (extended abstract)},
Author = {{Gro{\ss}e--Rhode}, M.},
Journal = BEATCS,
Year = {1995},
Month = {February},
Pages = {121 -- 128},
Volume = {55}
}
@InCollection{GD92,
Title = {Algebraic Specification of Action Trees and Recursive Processes},
Author = {M. {Gro{\ss}e-Rhode} and C. Dimitrovici},
Booktitle = {Tree Automata and Languages},
Publisher = {Elsevier},
Year = {1992},
Editor = {M. Nivat and A. Podelski},
Pages = {235--290}
}
@InProceedings{GJS02,
Title = {{Transformation Systems for the Integration of Software Specification}},
Author = {{Gro{\ss}e--Rhode}, M. and John, S. and Schr\"oter, G.},
Booktitle = {Proc. AGT 2002: APPLIGRAPH Workshop on Applied Graph Transformation},
Year = {2002},
Editor = {Kreowski, H.-J.},
Pages = {151 -- 160},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Emgr/papers/agt02.ps.gz}
}
@TechReport{GRKB00,
Title = {{Concepts for the Evolution of Component-Based Software Systems}},
Author = {Gro{\ss}e-Rhode, M. and Kutsche, R. and B\"ubl, F.},
Institution = {FB Informatik, TU Berlin},
Year = {2000},
Number = {TR-2000/11}
}
@TechReport{GKB00,
Title = {Concepts for the evolution of component-based software systems},
Author = {{Gro{\ss}e-Rhode}, M. and Kutsche, R.-D. and B{\"u}bl, F.},
Institution = {TU Berlin},
Year = {2000},
Number = {2000/11}
}
@TechReport{GPS97a,
Title = {{Concrete Spatial Refinement Constructions for Graph Transformation Systems}},
Author = {Gro{\ss}e-Rhode, M. and {Parisi Presicce}, F. and Simeoni, M.},
Institution = {Universit{\`a} di Roma \emph{La Sapienza}, Dip. Scienze dell'Informazione},
Year = {1997},
Number = {97--10}
}
@TechReport{GPS97b,
Title = {{Spatial and Temporal Refinement of Typed Graph Transformation Systems}},
Author = {Gro{\ss}e-Rhode, M. and {Parisi Presicce}, F. and Simeoni, M.},
Institution = {Universit{\`a} di Roma \emph{La Sapienza}, Dip. Scienze dell'Informazione},
Year = {1997},
Number = {97--11}
}
@InCollection{GPS98c,
Title = {{Spatial and Temporal Refinement of Typed Graph Transformation Systems}},
Author = {{Gro{\ss}e--Rhode}, M. and {Parisi Presicce}, F. and Simeoni, M.},
Booktitle = {Proc. Mathematical Foundations of Computer Science 1998},
Publisher = Springer,
Year = {1998},
Editor = {Brim, L. and Gruska, J. and Zlatu\v{s}ka, J.},
Pages = {553--561},
Series = lncs,
Volume = {1450}
}
@InProceedings{GPS98a,
Title = {{Refinements of Graph Transformation Systems via Rule Expressions}},
Author = {{Gro{\ss}e--Rhode}, M. and {Parisi Presicce}, F. and Simeoni, M.},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Applications of Graph Transformation (TAGT'98)},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Number = {tr--ri--98--201},
Organization = {Universit{\"a}t--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik},
Pages = {96--103},
Series = {Reihe Informatik}
}
@InCollection{GPS98b,
Title = {{Refinements and Modules for Typed Graph Transformation Systems}},
Author = {{Gro{\ss}e--Rhode}, M. and {Parisi Presicce}, F. and Simeoni, M.},
Booktitle = {Workshop on Algebraic Development Techniques (WADT'98), at ETAPS'98, Lisbon, April 1998},
Publisher = Springer,
Year = {1999},
Editor = {Fiadeiro, J. L.},
Pages = {137--151},
Series = lncs,
Volume = {1589}
}
@InProceedings{GPS00,
Title = {{Refinements of Graph Transformation Systems via Rule Expressions}},
Author = {{Gro{\ss}e--Rhode}, M. and {Parisi Presicce}, F. and Simeoni, M.},
Booktitle = {6th Int.\ Workshop on Theory and Application of GraphTransformation (TAGT'98)},
Year = {2000},
Pages = {368--382},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{GPST00,
Title = {{Modeling Distributed Systems by Modular Graph Transformation based on Refinement via Rule Expressions}},
Author = {Gro{\ss}e--Rhode, M. and {Parisi Presicce}, F. and Simeoni, M. and Taentzer, G.},
Booktitle = {Int.\ Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE'99)},
Year = {2000},
Pages = {31--45},
Publisher = Springer,
Series = lncs,
Volume = {1779}
}
@Unpublished{GPST99,
Title = {{Modeling Distributed Systems by Modular Graph Transformation based on Refinement via Rule Expressions}},
Author = {Gro{\ss}e--Rhode, M. and {Parisi Presicce}, F. and Simeoni, M. and Taentzer, G.},
Note = {presented at ``Applications of Graph Transformations with Industrial Relevance'', Kerkrade, The Netherlands, September},
Year = {1999}
}
@InProceedings{GSP98a,
Title = {Spatial and Temporal Refinement of Typed Graph Transformation Systems},
Author = {{Gro{\ss}e--Rhode}, M. and Simeoni, M. and {Parisi Presicce}, F.},
Booktitle = {Proc. MFCS'98 (Mathematical Foundations of computer Science)},
Year = {1998},
Editor = {Brim, L. and Gruska, J. and Zlatuska, J.},
Pages = {553 - 561},
Publisher = Springer,
Series = lncs,
Volume = {1450}
}
@InProceedings{GSP98,
Title = {Refinements and Modules for Typed Graph Transformation Systems},
Author = {{Gro{\ss}e--Rhode}, M. and Simeoni, M. and {Parisi Presicce}, F.},
Booktitle = {Proc. WADT'98 (Workshop on Algebraic Development Techniques), at ETAPS'98, Lisbon, April},
Year = {1998}
}
@InProceedings{GRW94,
Title = {{2-Categorical Specification of Partial Algebras}},
Author = {{Gro{\ss}e-Rhode}, M. and Wolter, U.},
Booktitle = {Recent Trends in Data Type Specification, Proc. 9th Workshop on Specification of Abstract Data Types, Caldes de Malavella, Spain, 1992},
Year = {1994},
Pages = {207-219},
Publisher = Springer,
Series = lncs,
Volume = {785}
}
@Misc{Gro94,
Title = {{Specification of Parallel State Dependent Systems}},
Author = {M. {Gro\ss e-Rhode}},
Note = {TU Berlin},
Year = {1994}
}
@InProceedings{Gro01,
Title = {{Algebra transformation systems as a unifying framework}},
Author = {Grosse-Rhode, M.},
Booktitle = {Proc. GETGRATS Closing Workshop},
Year = {2001},
Editor = {M. Bauderon and A. Corradini},
Series = entcs,
Volume = {55},
Keywords = {Algebraic Specification, Graph Transformation, Integration of Modeling Techniques},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Emgr/papers/bordeaux.ps.gz}
}
@TechReport{GM96,
Title = {Transition Specifications and the Algebraic Core of the Z-Notation},
Author = {Grosse-Rhode, M . and Martini, A.},
Institution = {TU Berlin},
Year = {1996}
}
@InProceedings{GRE90,
Title = {Transformation of Combined Data Type and Process Specifications Using Projection Algebras},
Author = {Grosse-Rhode, M. and Ehrig, H.},
Booktitle = {Stepwise Refinement of Distributed Systems, REX-Workshop 1989},
Year = {1990},
Pages = {301--339},
Publisher = Springer,
Series = lncs,
Volume = {430}
}
@TechReport{GRE90a,
Title = {Transformation of Combined Data Type and Process Specifications Using Projection Algebras},
Author = {Grosse-Rhode, M. and Ehrig, H.},
Institution = TUB,
Year = {1990},
Number = {90-01}
}
@InProceedings{Gru00,
Title = {{A Combined Graph Schema and Graph Grammar approach to Consistency in Distributed Data Modeling}},
Author = {Gruner, S.},
Booktitle = {Int.\ Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE'99)},
Year = {2000},
Pages = {247--254},
Publisher = Springer,
Series = lncs,
Volume = {1779}
}
@InProceedings{Gru00a,
Title = {Meta-Typing is Compatible to the Typed SPO Approach},
Author = {Gruner, S.},
Booktitle = {Proc. Joint APPLIGRAPH/GETRATS Workshop on Graph Transformation Systems (GRATRA 2000, Satellite Event of ETAPS 2000),techn. report no. 2000-2},
Year = {2000},
Address = {Technical University of Berlin, Germany},
Month = {March/April}
}
@InProceedings{GKT00,
Title = {{A Visual Modeling Technique for Controlling Graph Transformations}},
Author = {Gruner,S. and Kurt,M. and Taentzer,G.},
Booktitle = {Proc. of Satellite Workshops of 27th Int. Colloqium on Automata, Languages, and Programming (ICALP'2000)},
Year = {2000},
Address = {Geneva, Switzerland},
Month = {July},
Pages = {435--442},
Publisher = {Carleton Scientific, Canada}
}
@TechReport{EJO91,
Title = {Compositionality Results for Different Types of Parametrization and Parameter Passing in Specification Languages},
Author = {H.Ehrig and A.M.Jimenez and F.Orejas},
Institution = {Univ. Polit. Catalunya},
Year = {1991},
Month = {November},
Type = {Internal Report}
}
@MastersThesis{Han05,
Title = {{Konzeption und Implementierung eines Generators f\"ur visuelle Sprachumgebungen in Eclipse basierend auf Graphtransformation}},
Author = {H{\"a}nsgen, Stefan},
School = {Technische Universit\"at Berlin, Fak. Elektrotechnik/Informatik},
Year = {2005}
}
@Article{HHT96,
Title = {{Graph Grammars with Negative Application Conditions}},
Author = {Habel, A. and Heckel, R. and Taentzer, G.},
Journal = {Special issue of Fundamenta Informaticae},
Year = {1996},
Number = {3,4},
Pages = {287--313},
Volume = {26}
}
@Article{HR10,
Title = {{Expressiveness of Graph Conditions with Variables}},
Author = {Habel, Annegret and Radke, Hendrik},
Journal = {ECEASST},
Year = {2010},
Volume = {30},
Booktitle = {Proc. Int. Coll. on Graph and Model Transformation (GraMoT 2010)},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InCollection{Han88,
Title = {The {ACT}--system: experiences and future enhancements},
Author = {Hansen, H.},
Booktitle = {Recent Trends in Data Type Specification, Selected Papers from the 5th Workshop on Specification of Abstract Data Types, Gullane, Scotland},
Publisher = Springer,
Year = {1988},
Pages = {113--130},
Series = lncs,
Volume = {332}
}
@InProceedings{Han87,
Title = {The {ACT} System: experiences and future enhancements},
Author = {H. Hansen},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1987},
Pages = {113--130},
Publisher = Springer,
Series = lncs,
Volume = {332}
}
@InProceedings{HHT02,
Title = {{Detection of Conflicting Functional Requirements in a Use Case-Driven Approach}},
Author = {Hausmann, J.H. and Heckel, R. and Taentzer, G.},
Booktitle = {Proc. of Int. Conference on Software Engineering 2002},
Year = {2002},
Address = {Orlando, USA},
Pages = {105 -- 115},
Url = {http://www.user.tu-berlin.de/lieske/tfs/\%7Egabi/gHHT02.pdf}
}
@InProceedings{Hec95,
Title = {{Embedding of Conditional Graph Transformations}},
Author = {Heckel, R.},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {Valiente Feruglio, G. and Rosello Llompart, F.},
Organization = {Technical Report B-19, Universitat de les Illes Balears}
}
@Misc{Hec04,
Title = {Graph Transformation and Software Technology -- Script of Summer 2004},
Author = {Reiko Heckel},
Note = {Universit\"at Paderborn},
Year = {2004},
Owner = {Claudia},
Timestamp = {2012.07.29}
}
@PhdThesis{Hec98,
Title = {{Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems}},
Author = {Heckel, R.},
School = FB13,
Year = {1998}
}
@InCollection{Hec98a,
Title = {{Compositional verification of reactive systems specified by graph transformation}},
Author = {Reiko Heckel},
Booktitle = {Fundamental Approaches to Software Engineering},
Publisher = Springer,
Year = {1998},
Pages = {138-153},
Series = lncs,
Volume = {1382}
}
@InProceedings{Hec96,
Title = {{Behavioral Constraints for Loose Graph Transformation Systems}},
Author = {Heckel, R.},
Booktitle = {Report on the Dagstuhl-Seminar 9637 \emph{Graph Transformations in Computer Science}},
Year = {1996},
Note = {Lecture and abstract}
}
@MastersThesis{Hec95a,
Title = {{Algebraic Graph Transformations with Application Conditions}},
Author = {Heckel, R.},
School = {TU-Berlin},
Year = {1995}
}
@Unpublished{HCEH96,
Title = {Automatic Intergration of Safety Invariants into {Z} Specifications},
Author = {Heckel, R. and Conrad, M. and Egger, G. and Hiemer, J.},
Year = {1997}
}
@Article{HCEL96,
Title = {Horizontal and Vertical Structuring of Typed Graph Transformation Systems},
Author = {Heckel, R. and Corradini, A. and Ehrig, H. and L{\"o}we, M.},
Journal = {Math. Struc. in Comp. Science},
Year = {1996},
Note = {Also as techn. report no 96-22, TU Berlin},
Number = {6},
Pages = {613-648},
Volume = {6}
}
@TechReport{HCEL96a,
Title = {Horizontal and Vertical Structuring of Typed Graph Transformation Systems},
Author = {Heckel, R. and Corradini, A. and Ehrig, H. and L{\"o}we, M.},
Institution = TUB,
Year = {1996},
Number = {96-22}
}
@InProceedings{HEET98a,
Title = {{A View-Based Approach to System Modeling based on Open Graph Transformation Systems}},
Author = {Reiko Heckel and Hartmut Ehrig and Gregor Engels and Gabriele Taentzer},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools},
Year = {1999},
Editor = {Ehrig, H. and Engels, G. and Kreowski, J.-J. and Rozenberg, G.},
Publisher = {World Scientific}
}
@InProceedings{HEET99,
Title = {{Classification and Comparison of Modularity Concepts for Graph Transformation Systems}},
Author = {Reiko Heckel and Hartmut Ehrig and Gregor Engels and Gabriele Taentzer},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools},
Year = {1999},
Editor = {Ehrig, H. and Engels, G. and Kreowski, J.-J. and Rozenberg, G.},
Pages = {669 -- 690},
Publisher = {World Scientific}
}
@InProceedings{HEET98,
Title = {{Classification and comparison of modularity concepts for graph transformation systems}},
Author = {Heckel, R. and Ehrig, H. and Engels, G. and Taentzer, G.},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Institution = {University of Paderborn},
Optnumber = {tr-ri-98-21}
}
@TechReport{HEP+96,
Title = {A Coalgebraic Loose Semantics for Graphtransformation Systems with Behavioral Constraints},
Author = {Heckel, R. and Ehrig, H. and Padberg, J. and Wolter, U. and Corradini, A.},
Institution = TUB,
Year = {1996}
}
@Article{HEWC00,
Title = {{Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems }},
Author = {Heckel, R. and Ehrig, H. and Wolter, U. and Corradini, A.},
Journal = {Journal of Applied Categorical Structures},
Year = {2001},
Number = {1},
Pages = {83--110},
Volume = {9},
Keywords = {Graph Transformation, Graph Transformation Semantics},
Url = {http://www.user.tu-berlin.de/lieske/tfs/public/HEWC01.ps.gz}
}
@TechReport{HEWC97,
Title = {Loose Semantics and Constraints for Graph Transformation Systems},
Author = {Heckel, R. and Ehrig, H. and Wolter, U. and Corradini, A.},
Institution = {TU Berlin},
Year = {1997},
Note = {http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html},
Number = {97-07}
}
@InProceedings{HEWC97a,
Title = {Integrating the Specification Techniques of Graph Transformation and Temporal Logic},
Author = {Heckel, R. and Ehrig, H. and Wolter, U. and Corradini, A.},
Booktitle = {Proc. of MFCS'97, Bratislava},
Year = {1997},
Pages = {219--228},
Publisher = Springer,
Series = lncs,
Volume = {1295}
}
@Article{HEWC97b,
Title = {Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems},
Author = {Heckel, R. and Ehrig, H. and Wolter, U. and Corradini, A.},
Journal = {Applied Categorical Structures},
Year = {1997}
}
@InCollection{HEET99b,
Title = {{A View-Based Approach to System Modeling Based on Open Graph Transformation Systems}},
Author = {Heckel, R. and Engels, G. and Ehrig, H. and Taentzer, G.},
Booktitle = {{Handbook of Graph Grammars and Computing by Graph Transformation. Vol 2: Applications, Languages and Tools}},
Publisher = {World Scientific, Singapore etc.},
Year = {1999},
Pages = {639--668}
}
@InProceedings{HKT02,
Title = {{Towards Automatic Translation of UML Models into Semantic Domains }},
Author = {Heckel, R. and K\"uster, J. and Taentzer, G. },
Booktitle = {Proc. of APPLIGRAPH Workshop on Applied Graph Transformation (AGT 2002)},
Year = {2002},
Editor = {Kreowski, H.-J.},
Pages = {11 -- 22},
Url = {http://www.cs.tu-berlin.de/%7Egabi/agt.ps}
}
@InProceedings{HLEO00,
Title = {{Concurrency of Double-Pullback Graph Transitions}},
Author = {Heckel, R. and Llabres, M. and Ehrig, H. and Orejas, F.},
Booktitle = {Proc. of Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation (GRATRA 2000)},
Year = {2000},
Editor = {Ehrig, H. and Taentzer, G.},
Organization = {Technical Report No. 2000-2, FB Informatik, TU Berlin},
Pages = {146--154}
}
@Article{HLEO02,
Title = {{Concurrency and Loose Semantics of Open Graph Transformation Systems}},
Author = {Heckel, R. and Llabres, M. and Ehrig, H. and Orejas, F.},
Journal = {MSCS},
Year = {2002},
Month = {August},
Note = {ISSN: 0960-1295},
Number = {4},
Pages = {349-376},
Volume = {12}
}
@InProceedings{HMTW95,
Title = {Attributed Graph Transformations with Controlled Application of Rules},
Author = {Heckel, R. and M\"uller, J. and Taentzer, G. and Wagner, A.},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {Valiente, G. and Rossello Llompart, F.},
Organization = {Technical Report B - 19, Universitat de les Illes Balears},
Pages = {41--53}
}
@Article{HW95,
Title = {{Ensuring Consistency of Conditional Graph Grammars -- A constructive Approach}},
Author = {Heckel, R. and Wagner, A.},
Journal = {Proc. of SEGRAGRA'95 ``Graph Rewriting and Computation''},
Year = {1995},
Note = {{\sf http://www.elsevier.nl/locate/entcs/volume2.html}},
Volume = {2},
Series = entcs
}
@TechReport{Hei92a,
Title = {{Transformation und Komposition von P/T-Netzen unter Erhaltung wesentlicher Eigenschaften}},
Author = {Heise, A.},
Institution = {Forschungsberichte des Fachbereichs Informatik der TU Berlin, Bericht-Nr. 92-13},
Year = {1992}
}
@Article{Her09,
Title = {{Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems}},
Author = {Hermann, Frank},
Journal = {Electronic Communications of the EASST},
Year = {2009},
Volume = {16},
Abstract = {Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used -- in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improved essentially for the analysis of systems with NACs by our new concept of permutation equivalence. Two derivations respecting all NACs are called permutation-equivalent, if they are switch-equivalent disregarding the NACs. In fact, there are permutation-equivalent derivations which are not switch-equivalent with NACs. As main result of the paper, we solve the following problem: Given a derivation with NACs, we can efficiently derive all permutation-equivalent derivations to the given one by static analysis. The results are based on extended techniques for subobject transformation systems, which have been introduced recently.},
Booktitle = {Proc. International Conference on Graph Transformation-Doctorial Symposium (ICGT-DS'08)},
Editor = {Corradini, Andrea},
ISBN = {ISSN 1863-2122},
Location = {Leicester, UK},
Owner = {User},
Publisher = {Electronic Communications of the EASST},
Timestamp = {2009.08.06},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/Her09.pdf}
}
@InProceedings{H08,
Title = {{Process Construction and Analysis for Workflows Modelled by Adhesive HLR Systems with Application Conditions}},
Author = {Hermann, Frank},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Editor = {Ehrig, H. and Heckel, R. and Rozenberg, G. and Taentzer, G.},
Pages = {496--498},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = {Graph transformation systems (gts) are suitable for modelling concurrent and distributed behaviour of systems and in particular of workflows. Analysis of the behaviour of these models is in general highly complex, but it is of main interest, especially for optimizing the system execution. Main focus of the PhD project is a formal approach for constructing the process of a workflow scenario to support possibilities of efficient analysis and execution. Based on the abstract framework of adhesive high level replacement systems the developed techniques will be applied on two levels. First, the framework is instantiated to different kinds of graph as well as Petri net transformation systems, which are key ingredient for modelling mobile networks in [1]. In the second level, the modelling techniques are used to specify the production of industrial products, which can involve several thousands of production steps. A case study will show how a chain of production steps taken from a real production facility can be modelled as gts derivation. Formal techniques for process construction and analysis known for basic cases only have to be extended in various dimensions in order to be applied to the model and in general to the domain of workflows. A practical evaluation will compare the results with those derived by standard techniques for process analysis. },
Doi = {10.1007/978-3-540-87405-8\_44},
ISBN = {ISBN 978-3-540-87404-1},
Keywords = {model transformation, graph transformation, formal analysis, triple graph grammars},
Location = {Leicester, UK},
Url = {http://www.springerlink.com/content/bv193206450wrg26}
}
@PhdThesis{Her11,
Title = {Analysis and Optimization of Visual Enterprise Models Based on Graph and Model Transformation},
Author = {Frank Hermann},
School = {TU Berlin},
Year = {2011},
Abstract = {Security, risk and compliance are increasingly important issues in enterprise modelling. An analysis of real world scenarios for banking has shown that today's best practices'' based on informal techniques are insufficient and should be replaced by adequate formal approaches. For this purpose, visual enterprise models based on algebraic graph and model transformation are proposed in this thesis, where the following two typical problem areas are considered: (1) Behaviour Analysis and Optimization of Visual Enterprise Process Models (2) Conformance Analysis of Enterprise Process and Service Models The first problem is solved by new concepts and results concerning behaviour analysis of visual languages, especially analysis of permutation equivalence of graph transformations based on Petri nets. In order to tackle the second problem area, model transformations based on triple graph grammars are introduced with new results concerning analysis and optimization enabling automated support for sound integration and conformance checks between different models. The new results in the area of graph and model transformation are developed in the general framework of M-adhesive transformation systems. They can be instantiated to a large variety of high-level replacement systems and applied not only to enterprise modelling, but also to several other application domains. Last but not least, the new tool AGT-M provides automated tool support for simulation, analysis and optimization in various case studies.},
Owner = {Claudia},
Timestamp = {2011.07.26},
Url = {http://opus.kobv.de/tuberlin/volltexte/2011/3008/}
}
@TechReport{Her09a,
Title = {{Permutation Equivalence of DPO Derivations with Negative Application Conditions based on Subobject Transformation Systems: Long Version}},
Author = {Hermann, Frank},
Institution = {TU Berlin, Fak. IV},
Year = {2009},
Number = {2009/10},
Abstract = {Switch equivalence for transformation systems has been successfully used in many domains for the analysis of concurrent behaviour. When using graph transformation as modelling framework for these systems, the concept of negative application conditions (NACs) is widely used -- in particular for the specification of operational semantics. In this paper we show that switch equivalence can be improved essentially for the analysis of systems with NACs by our new concept of permutation equivalence. Two derivations respecting all NACs are called permutation-equivalent, if they are switch-equivalent disregarding the NACs. In fact, there are permutation-equivalent derivations which are not switch-equivalent with NACs. As main result of the paper, we solve the following problem: Given a derivation with NACs, we can efficiently derive all permutation-equivalent derivations to the given one by static analysis. The results are based on extended techniques for subobject transformation systems, which have been introduced recently.},
ISSN = {ISSN 1436-9915},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/Her09a.pdf}
}
@TechReport{H08a,
Title = {{Process Definition of Adhesive HLR Systems}},
Author = {Hermann, Frank},
Institution = {Technische Universit{\"a}t Berlin,Fakult{\"a}t IV},
Year = {2008},
Number = {2008/09}
}
@TechReport{Her08,
Title = {{Process {D}efinition of {A}dhesive {HLR} {S}ystems (Long Version) }},
Author = {Hermann, Frank},
Institution = {TU Berlin, Fak. IV},
Year = {2008},
Number = {2008/09},
ISSN = {ISSN 1436-9915},
Keywords = {subobject transformation system, adhesive HLR systems, process definition},
Owner = {User},
Timestamp = {2010.09.21}
}
@Article{HCE12,
Title = {{Analysis of Permutation Equivalence in M-adhesive Transformation Systems with Negative Application Conditions}},
Author = {Frank Hermann and Andrea Corradini and Hartmut Ehrig},
Journal = {MSCS},
Year = {2012},
Owner = {frank.hermann},
Timestamp = {2012.06.07}
}
@Article{HCE11,
Title = {{Analysis of Permutation Equivalence in M-adhesive Transformation Systems with Negative Application Conditions}},
Author = {Hermann, Frank and Corradini, Andrea and Ehrig, Hartmut},
Journal = {MSCS},
Year = {2011},
Note = {submitted, online available at \url{http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers11/HCE11.pdf}}
}
@Article{HCEK10a,
Title = {{Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets }},
Author = {Hermann, Frank and Andrea Corradini and Hartmut Ehrig and Barbara K{\"o}nig},
Journal = {ECEASST},
Year = {2010},
Pages = {1--15},
Volume = {29},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'10)},
Editor = {K{\"u}ster, Jochen and Tuosto, Emilio},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Location = {York, UK},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/view/39}
}
@TechReport{HCEK10b,
Title = {{Efficient Process Analysis of Transformation Systems Based on Petri nets}},
Author = {Hermann, Frank and Andrea Corradini and Hartmut Ehrig and Barbara K{\"o}nig},
Institution = {TU Berlin},
Year = {2010},
Number = {TR 2010-3},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@Article{HE08,
Title = {{Process Definition using Subobject Transformation Systems}},
Author = {Hermann, Frank and Ehrig, Hartmut},
Journal = BEATCS,
Year = {2008},
Pages = {153-163},
Volume = {95},
Abstract = {Process definition on the basis of graph transformation systems was introduced by the concept of occurrence grammars, which are a generalization of Petri net processes given by occurrence nets. Recently, subobject transformation systems were proposed as abstract framework for occurrence grammars in adhesive categories, but they are still restricted to injective matches for graph transformation steps. In this paper we review the construction of STSs as processes for plain graph grammars and discuss an extension to attributed graph grammars with non-injective matches. This is the basis for a forthcoming formal treatment in the framework of adhesive categories. },
ISBN = {ISSN 0252-9742},
Keywords = {process definition, subobject transformation system, adhesive category},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@TechReport{HEE07a,
Title = {Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (Long Version)},
Author = {Hermann, F. and Ehrig, H. and Ermel, C.},
Institution = {Technische Universit\"at Berlin, Fak. IV},
Year = {2008},
Number = {2008/07},
Abstract = {E-government services usually process large amounts of condential data. Therefore, security requirements for the communication between components have to be adhered in a strict way. Hence, it is of main interest that developers can analyze their modularized models of actual systems and that they can detect critical patterns. For this purpose, we present a general and formal framework for critical pattern detection and user-driven correction as well as possibilities for automatic analysis and verification at meta-model level. The technique is based on the formal theory of graph transformation, which we extend to transformations of type graphs with inheritance within a type graph hierarchy. We apply the framework to specify relevant security requirements. The extended theory is shown to full the conditions of a weak adhesive HLR category allowing us to transfer analysis techniques and results shown for this abstract framework of graph transformation. In particular, we discuss how confluence analysis and parallelization can be used to enable parallel critical pattern detection and elimination.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2008/2008-07.pdf}
}
@InProceedings{HEEO12,
Title = {Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars},
Author = {Frank Hermann and Hartmut Ehrig and Claudia Ermel and Fernando Orejas},
Booktitle = {Int. Conf. on Fundamental Approaches to Software Engineering (FASE'12)},
Year = {2012},
Editor = {Juan de Lara and Andrea Zisman},
Pages = {178-193},
Publisher = {Springer},
Series = {Lecture Notes in Computer Science},
Volume = {7212},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Hence, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems, our approach takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define a model revision by a span $G \from D \to H$, called graph modification, where $G$ and $H$ are the old and new versions, respectively, and $D$ the common subgraph that remains unchanged. Based on notions of behavioural equivalence and parallel independence of graph modifications, we are able to show a Local-Church-Rosser Theorem for graph modifications and to define a merge construction for conflict-free modifications which corresponds exactly to the parallel execution of parallel independent graph transformations using minimal rules. Moreover, we are able to handle conflicts of graph modifications which may occur in the case of parallel dependent graph modifications. The main result is a general merge construction for graph modifications that resolves all conflicts simultaneously in the sense that for delete-insert conflicts insertion has priority over deletion.},
Location = {Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estland, March 23 - April 1, 2012},
Nee = {http://dx.doi.org/10.1007/978-3-642-19811-3_15},
Nisbn = {978-3-642-19810-6},
Nurl = {http://www.springerlink.com/content/y722h2qp020l4217/}
}
@TechReport{HEEO11a,
Title = {Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars - Extended Version},
Author = {Frank Hermann and Hartmut Ehrig and Claudia Ermel and Fernando Orejas},
Institution = {TU Berlin},
Year = {2011},
Number = {2011/14},
Abstract = {Triple graph grammars (TGGs) have been used successfully to analyse correctness of bidirectional model transformations. Most recently, also a corresponding formal approach to model synchronization has been presented, where a forward propagation operation updates a source model modification from source to target, and symmetrically, a backward propagation operation takes care of updates from target to source models. However, a corresponding formal approach of concurrent model synchronization, where a source and a target modification have to be synchronized simultaneously, has not yet been presented and analysed. This paper closes this gap taking into account that the given and propagated source or target model modifications are in conflict with each other. Our conflict resolution strategy is semi-automatic, where a formal resolution strategy – known from previous work – can be combined with a user-specific strategy. As first main result, we show correctness of concurrent model synchronization with respect to the TGG. This means that each result of our nondeterministic concurrent update leads to a consistent correspondence between source and target models, where consistency is defined by the TGG. As second main result, we show compatibility of concurrent with basic model synchronization. In other words, concurrent model synchronization can be realized either to coincide with forward or with backward propagation. The main results are illustrated by a running example on updating organizational models.},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@InProceedings{HEGO10,
Title = {{Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars}},
Author = {Hermann, Frank and Ehrig, Hartmut and Golas, Ulrike and Orejas , Fernando},
Booktitle = {Proc. Int. Workshop on Model Driven Interoperability (MDI'10)},
Year = {2010},
Address = {New York, NY, USA},
Editor = {B{\'e}zivin, J. and Soley, R.M. and Vallecillo, A.},
Pages = {22--31},
Publisher = {ACM},
Series = {MDI '10},
Abstract = {Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and analysis of bidirectional model transformations. In previous work we have formalized and analyzed already termination, correctness, completeness, local confluence and functional behaviour. In this paper, we show how to improve the efficiency of the execution and analysis of model transformations in practical applications by using triple rules with negative application conditions (NACs). In addition to specification NACs, which improve the specification of model transformations, the generation of filter NACs improves the efficiency of the execution and the analysis of functional behaviour supported by critical pair analysis of the tool AGG. We illustrate the results for the well-known model transformation from class diagrams to relational database models.},
Doi = {http://doi.acm.org/10.1145/1866272.1866277},
ISBN = {978-1-4503-0292-0},
Keywords = {functional behaviour, model transformation, triple graph grammars},
Location = {Oslo, Norway},
Numpages = {10},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/HEGO10.pdf}
}
@Article{HEGO12,
Title = {{Formal Analysis of Model Transformations Based on Triple Graph Grammars}},
Author = {Frank Hermann and Hartmut Ehrig and Ulrike Golas and Fernando Orejas},
Journal = {MSCS},
Year = {2012},
Owner = {frank.hermann},
Timestamp = {2012.06.07}
}
@TechReport{HEGO10b,
Title = {Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars - Extended Version},
Author = {Hermann, F. and Ehrig, H. and Golas, U. and Orejas, F.},
Institution = TUB,
Year = {2010},
Number = {2010/13},
Abstract = {Triple Graph Grammars are a well-established, formal and intuitive concept for the specification and analysis of bidirectional model transformations. In previous work we have formalized and analyzed already termination, correctness, completeness, local confluence and functional behaviour. In this paper, we show how to improve the efficiency of the execution and analysis of model transformations in practical applications by using triple rules with negative application conditions (NACs). In addition to specification NACs, which improve the specification of model transformations, the generation of filter NACs improves the efficiency of the execution and the analysis of functional behaviour supported by critical pair analysis of the tool AGG. We illustrate the results for the well-known model transformation from class diagrams to relation database models.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2010/tr_2010-13.pdf}
}
@Article{HEO+15,
Title = {Model synchronization based on triple graph grammars: correctness, completeness and invertibility},
Author = {Hermann, Frank and Ehrig, Hartmut and Orejas, Fernando and Czarnecki, Krzysztof and Diskin, Zinovy and Xiong, Yingfei and Gottmann, Susann and Engel, Thomas},
Journal = {Software \& Systems Modeling},
Year = {2015},
Number = {1},
Pages = {241-269},
Volume = {14},
Abstract = {Triple graph grammars (TGGs) have been used successfully to analyze correctness and completeness of bidirectional model transformations, but a corresponding formal approach to model synchronization has been missing. This paper closes this gap by providing a formal synchronization framework with bidirectional update propagation operations. They are generated from a given TGG, which specifies the language of all consistently integrated source and target models. As our main result, we show that the generated synchronization framework is correct and complete, provided that forward and backward propagation operations are deterministic. Correctness essentially means that the propagation operations preserve and establish consistency while completeness ensures that the operations are defined for all possible inputs. Moreover, we analyze the conditions under which the operations are inverse to each other. All constructions and results are motivated and explained by a running example, which leads to a case study, using concrete visual syntax and abstract syntax notation based on typed attributed graphs.},
Doi = {10.1007/s10270-012-0309-1},
ISSN = {1619-1366},
Keywords = {Model synchronization; Correctness; Bidirectional model transformation; Triple graph grammars},
Language = {English},
Owner = {Claudia},
Publisher = {Springer Berlin Heidelberg},
Timestamp = {2015.02.09},
Url = {http://dx.doi.org/10.1007/s10270-012-0309-1}
}
@InProceedings{HEOG10,
Title = {{Formal Analysis of Functional Behaviour of Model Transformations Based on Triple Graph Grammars}},
Author = {Hermann, Frank and Ehrig, Hartmut and Orejas , Fernando and Golas, Ulrike},
Booktitle = {Proceedings of Intern. Conf. on Graph Transformation ( ICGT' 10)},
Year = {2010},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch{\"u}rr, A.},
Pages = {155--170},
Publisher = Springer,
Series = lncs,
Volume = {6372},
Abstract = {Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour - especially local confluence - is missing up to now. In order to close this gap we automatically generate from the given triple rules suitable forward translation rules, including translation attributes keeping track which parts of the source graph have been translated already. The first main result shows the equivalence of model transformation sequences in the sense of TGGs with forward translation sequences based on the double pushout (DPO) approach. This allows to apply critical pair analysis in the sense of the DPO-approach and corresponding tool support by the tool AGG. However, we do not need general local confluence, because confl uence for source graphs not belonging to the source language is not relevant for the functional behaviour of a model transformation. For this reason we only have to analyze a weaker property, called translation confluence. This leads to our second main result, the functional behaviour of model transformations, which is applied to our running example, the model transformation from class diagrams to database models.},
ISBN = {ISBN 978-3-642-15927-5},
Owner = {Claudia},
Timestamp = {2010.10.15},
Url = {http://www.springerlink.com/index/576X761165NR405P.pdf}
}
@TechReport{HEOG10a,
Title = {Formal Analysis of Functional Behaviour for Model Transformations Based on Triple Graph Grammars - Extended Version},
Author = {Hermann, F. and Ehrig, H. and Orejas, F. and Golas, U.},
Institution = TUB,
Year = {2010},
Number = {2010/08},
Abstract = {Triple Graph Grammars (TGGs) are a well-established concept for the specification of model transformations. In previous work we have formalized and analyzed already crucial properties of model transformations like termination, correctness and completeness, but functional behaviour - especially local confluence - is missing up to now. In order to close this gap we generate forward translation rules, which extend standard forward rules by translation attributes keeping track of the elements which have been translated already. In the first main result we show the equivalence of model transformations based on forward resp. forward translation rules. This way, an additional control structure for the forward transformation is not needed. This allows to apply critical pair analysis and corresponding tool support by the tool AGG. However, we do not need general local confluence, because confluence for source graphs not belonging to the source language is not relevant for the functional behaviour of a model transformation. For this reason we only have to analyze a weaker property, called translation confluence. This leads to our second main result, the functional behaviour of model transformations, which is applied to our running example, the model transformation from class diagrams to database models.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2010/tr_2010-08.pdf}
}
@InProceedings{HET08,
Title = {{A typed attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams}},
Author = {Hermann, F. and Ehrig, H. and Taentzer, G.},
Booktitle = {Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'06)},
Year = {2008},
Address = {Amsterdam},
Editor = {Varro, D. and Bruni, R.},
Pages = {261--269},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {211},
Abstract = {According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of the abstract syntax of UML class and sequence diagrams based on the well-defined theory of typed attributed graph transformation with inheritance and application conditions. The generated language covers all important features of these parts of UML diagrams and is shown to satisfy all of the corresponding constraints by construction. An explicit model transformation demonstrates the close correspondence between the graph grammar and the MOF definition of UML class and sequence diagrams. The graph grammar is validated by well-established benchmarks showing that all important features of the MOF definition of UML are covered. This formal constructive syntax definition of UML class and sequence diagrams is the basis for syntax directed editing, formal analysis, formal operational and denotational semantics and correctness of model transformations. },
ISBN = {ISSN:1571-0661},
Keywords = {graph transformation, typed, attributed, inheritance, UML, sequence diagrams, class diagrams, abstract syntax},
Location = {Vienna, Austria},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/HET06.pdf}
}
@InProceedings{HET06,
Title = {{A typed attributed Graph Grammar with Inheritance for the Abstract Syntax of UML Class and Sequence Diagrams}},
Author = {Hermann, Frank and Ehrig, Hartmut and Taentzer, Gabriele},
Booktitle = {Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'06)},
Year = {2006},
Address = {Heidelberg},
Editor = {Varro, D. and Bruni, R.},
Month = {April},
Publisher = {Elsevier Science},
Series = entcs,
Abstract = {According to the UML Standard 2.0 class and sequence diagrams are defined in a descriptive way by a MOF meta-model and semi-formal constraints. This paper presents a formal and constructive definition of the abstract syntax of UML class and sequence diagrams based on the well-defined theory of typed attributed graph transformation with inheritance and application conditions. The generated language covers all important features of these parts of UML diagrams and is shown to satisfy all of the corresponding constraints by construction. An explicit model transformation demonstrates the close correspondence between the graph grammar and the MOF definition of UML class and sequence diagrams. The graph grammar is validated by well-established benchmarks showing that all important features of the MOF definition of UML are covered. This formal constructive syntax definition of UML class and sequence diagrams is the basis for syntax directed editing, formal analysis, formal operational and denotational semantics and correctness of model transformations. },
ISBN = {ISSN:1571-0661},
Keywords = {graph transformation, typed, attributed, inheritance, UML, sequence diagrams, class diagrams, abstract syntax},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/HET06.pdf}
}
@InProceedings{HGN+14,
Title = {Triple Graph Grammars in the Large for Translating Satellite Procedures},
Author = {Frank Hermann and Susann Gottmann and Nico Nachtigall and Hartmut Ehrig and Benjamin Braatz and Gianluigi Morelli and Alain Pierre and Thomas Engel and Claudia Ermel},
Booktitle = {Proc. Int. Conf. on Model Transformations (ICMT 2014)},
Year = {2014},
Address = {Switzerland},
Editor = {{Di Ruscio}, D. and Varro, D.},
Number = {8568},
Pages = {122-137},
Publisher = {Springer International Publishing},
Series = {Lecture Notes of Computer Science},
Abstract = {Software translation is a challenging task. Several requirements are important – including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability concerning the correctness of the translation. Triple graph grammars (TGGs) have shown to be an intuitive, welldefined technique for model translation. In this paper, we leverage TGGs for industry scale software translations. The approach is implemented using the Eclipse-based graph transformation tool Henshin and has been successfully applied in a large industrial project with the satellite operator SES on the translation of satellite control procedures. We evaluate the approach regarding requirements from the project and performance on a complete set of procedures of one satellite.},
Doi = {10.1007/978-3-319-08789-4_9},
ISBN = {978-3-319-08788-7},
Keywords = {model transformation, software translation, refactoring, triple graph grammars, Eclipse Modeling Framework (EMF)},
Owner = {Claudia},
Timestamp = {2014.05.30},
Url = {http://dx.doi.org/10.1007/978-3-319-08789-4_9}
}
@InProceedings{HGN+13,
Title = {{Triple Graph Grammars in the Large for Translating Satellite Procedures}},
Author = {Hermann, Frank and Gottmann, Susann and Nachtigall,Nico and Ehrig, Hartmut and Braatz,Benjamin and Morelli,Gianluigi and Pierre, Alain and Engel,Thomas and Ermel,Claudia},
Booktitle = {Proc. Int. Conf. on Theory and Practice of Model Transformations (ICMT'13)},
Year = {2013},
Editor = {Keith Duddy and Gerti Kappel},
Pages = {50-51},
Publisher = {Springer},
Series = {LNCS},
Volume = {7909},
Ee = {http://dx.doi.org/10.1007/978-3-642-38883-5_4},
ISBN = {978-3-642-38882-8},
Owner = {frank.hermann},
Timestamp = {2014.06.05}
}
@TechReport{HGN+14a,
Title = {Triple Graph Grammars in the Large for Translating Satellite Procedures: Extended Version},
Author = {Frank Hermann and Susann Gottmann and Nico Nachtigall and Hartmut Ehrig and Benjamin Braatz and Gianluigi Morelli and Alain Pierre and Thomas Engel and Claudia Ermel},
Institution = {University of Luxemburg},
Year = {2014},
Address = {Luxemburg},
Number = {TR-SnT-2014-7},
Abstract = {Software translation is a challenging task. Several requirements are important – including automation of the execution, maintainability of the translation patterns, and, most importantly, reliability concerning the correctness of the translation. Triple graph grammars (TGGs) have shown to be an intuitive, welldefined technique for model translation. In this paper, we leverage TGGs for industry scale software translations. The approach is implemented using the Eclipse-based graph transformation tool Henshin and has been successfully applied in a large industrial project with the satellite operator SES on the translation of satellite control procedures. We evaluate the approach regarding requirements from the project and performance on a complete set of procedures of one satellite.},
ISBN = {978-2-87971-128-7},
Keywords = {model transformation, software translation, refactoring,
triple graph grammars, Eclipse Modeling Framework (EMF)},
Pages = {1-22},
Url = {http://hdl.handle.net/10993/16887}
}
@Article{HHK10,
Title = {Specification and Verification of Model Transformations},
Author = {Hermann, Frank and H{\"u}lsbusch, Mathias and K{\"o}nig, Barbara},
Journal = {ECEASST},
Year = {2010},
Pages = {1--21},
Volume = {30},
Abstract = {Model transformations are a key concept within model driven development and there is an enormous need for suitable formal analysis techniques for model transformations, in particular with respect to behavioural equivalence of source models and their corresponding target models. For this reason, we discuss the general challenges that arise for the specification and verification of model transformations and present suitable formal techniques that are based on graph transformation. In this context, triple graph grammars show many benefits for the specification process, e.g. modelers can work on an intuitive level of abstraction and there are formal results for syntactical correctness, completeness and efficient execution. In order to verify model transformations with respect to behavioural equivalence we apply well-studied techniques based on the double pushout approach with borrowed context, for which the model transformations specified by triple graph transformation rules are flattened to plain (in-situ) graph transformation rules. The potential and adequateness of the presented techniques are demonstrated by an intuitive example, for which we show the correctness of the model transformation with respect to bisimilarity of source and target models.},
Booktitle = {Proc. Int. Coll. on Graph and Model Transformation (GraMoT'10)},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
ISBN = {{ISSN 1863-2122}},
Keywords = {model transformation, graph transformation, model refactoring},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{HKBR07,
Title = {Simulating Multi-graph Transformations Using Simple Graphs},
Author = {Hermann, Frank and Kastenberg, Harmen and Boneva, Iovka and Rensink, Arend},
Booktitle = {Workshop on Graph Transformation and Visual Modelling Techniques (GT-VMT'07)},
Year = {2007},
Editor = {Ehrig, K. and Giese, H.},
Publisher = {Electronic Communications of the EASST},
Abstract = {Application of graph transformations for software verification and model transformation is an emergent field of research. In particular, graph transformation approaches provide a natural way of modelling object oriented systems and semantics of object-oriented languages. There exist a number of tools for graph transformations that are often specialised in a particular kind of graphs and/or graph transformation approaches, depending on the desired application domain. The main drawback of this diversity is the lack of interoperability. In this paper we show how (typed) multigraph production systems can be translated into (typed) simple-graph production systems. The presented construction enables the use of multigraphs with DPO transformation approach in tools that only support simple graphs with SPO transformation approach, e.g. the GROOVE tool.},
ISBN = {ISSN 1863-2122},
Keywords = { graph transformations, graph transformation tools, tool interoperability, multigraphs, simple graphs},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/HKBR07.pdf}
}
@InProceedings{Hoff02b,
Title = {{Algebraic Higher Order Nets: Graphs and Petri Nets as Tokens}},
Author = {Hoffmann, K.},
Booktitle = {Proceedings of the 16th International Workshop on Algebraic Development Techniques (WADT 2002)},
Year = {2002},
Editor = {Wirsing, M. and Pattinson, D. and Henicker, R.},
Pages = {87-88},
Publisher = {LMU Munich}
}
@PhdThesis{Hof05,
Title = {{Formal Approach and Applictions of Algebraic Higher Order Nets}},
Author = {Hoffmann, Kathrin},
School = {Technische Universit{\"a}t Berlin},
Year = {2005}
}
@InProceedings{KH01,
Title = {Flexible {M}odellierung mit {A}lgebraischen {H}igher {O}rder {N}etzen},
Author = {Hoffmann, K.},
Booktitle = {Proceeding of the workshop {M}odellierung 2001},
Year = {2001},
Pages = {101--110}
}
@InProceedings{KH00,
Title = {Run {T}ime {M}odification of {A}lgebraic {H}igh {L}evel {N}ets and {A}lgebraic {H}igher {O}rder {N}ets using {F}olding and {U}nfolding {C}onstruction},
Author = {Hoffmann, K.},
Booktitle = {Proceeding of the 3rd Internation Workshop {C}ommunication {B}ased {S}ystems},
Year = {2000},
Pages = {55--72}
}
@MastersThesis{Hof98,
Title = {{Structural Compatibility in Petri Nets: Morphisms and Categories of Nets}},
Author = {Kathrin Hoffmann},
School = {Technische Universis{\"a}t Berlin},
Year = {1998}
}
@InProceedings{HBPP06,
Title = {{Termination of Algebraic Rewriting with Inhibitors}},
Author = {Hoffmann, K. and Bottoni, P. and Parisi-Presicce, F.},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'06), Satellite Event of the IEEE Symposium on Visual Languages and Human-Centric Computing },
Year = {2006},
Address = {Brighton, UK},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Volume = {4},
Abstract = {We proceed with the study of termination properties in the double pushout approach to algebraic rewriting, and show a concrete termination criterion for rewriting systems with inhibitors. Inhibitors prevent elements in an algebra to participate in rule matches, so that termination depends only on whether new possibilities for matches are created. The notion of inhibitor can be extended to considering different levels of inhibition, by which the ability of an element to participate in a match is progressively reduced. We illustrate the approach by considering some application contexts in model transformation.},
ISSN = {ISSN 1863-2122},
Keywords = { termination, double pushout approach, inhibitors},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/HBPP06.pdf}
}
@InProceedings{HEP07,
Title = {Flexible Modeling of Emergency Scenarios using Reconfigurable Systems},
Author = {Hoffmann, K. and Ehrig, H. and Padberg, J.},
Booktitle = {Proc. of the 10th World Conference on Integrated Design {\&} Process Technology},
Year = {2007},
Note = {CDROM},
Pages = {15},
Abstract = {In this paper we extend our results concerning the layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher order nets (AHO nets). MANETs are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure. Workflows in MANETs can be adequately modeled using a layered architecture, where the overall workflow, the team member activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Based on a formal notion of layer consistency we extend that approach to allow changes of the interfaces of the gluing of the workflow and the mobility layer.},
Keywords = {Petri nets, mobile ad-hoc networks, emergency scenarios, case study},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/HEP07.pdf}
}
@InProceedings{HEW99,
Title = {Folding and {U}nfolding {C}onstruction between {A}lgebraic {H}igh-{L}evel {N}ets and {R}egular {A}lgebraic {H}igher {O}rder {N}ets},
Author = {Hoffmann, K. and Ehrig, H. and Wolter, U.},
Booktitle = {Proc.\ of {W}orkshop on {A}lgebraic {D}evelopment {T}echniques(WADT'99)},
Year = {1999},
Publisher = Springer,
Series = lncs,
Volume = {1827}
}
@Article{HM10,
Title = {Formal Modeling of Communication Platforms using Reconfigurable Algebraic High-Level Nets},
Author = {Kathrin Hoffmann and Tony Modica},
Journal = {ECEASST},
Year = {2010},
Pages = {1--25},
Volume = {30},
Abstract = {Communication nowadays is based on communication platforms like Skype, Facebook, or SecondLife. The formal modeling and analysis of communication platforms poses considerable challenges, namely highly dynamic structures and complex behavior. Since most of the well-known formal modeling approaches are adequate only for specific aspects of communication platforms, in this paper we introduce the approach of reconfigurable algebraic high-level nets with individual tokens and show in our case study Skype that this approach is adequate for modeling the main aspects and features of communication platforms.},
Booktitle = {Proc. Int. Coll. on Graph and Model Transformation (GraMoT 2010)},
Editor = {Ermel, C. and Ehrig, H. and Orejas, F. and Taentzer, G.},
ISBN = {{ISSN 1863-2122}},
Keywords = {communication platform, graph transformation, Petri nets},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@InProceedings{HM03,
Title = {{A}lgebraic {H}igher-{O}rder {N}ets: {G}raphs and {P}etri {N}ets as {T}okens},
Author = {Hoffmann, K. and Mossakowski, T.},
Booktitle = {Proc. of 16th International Workshop of Algebraic Development Techniques},
Year = {2003},
Editor = {Wirsing, M. and Pattinson, D. and Henicker, R.},
Pages = {253--267},
Publisher = Springer,
Series = lncs,
Volume = {2755},
Abstract = {Petri nets and Algebraic High-Level Nets are well-known to model parallel and concurrent systems. In this paper, we introduce the concept of Algebraic Higher-Order Nets, which allow to have dynamical tokens like graphs or (ordinary low-level) Petri nets. For this purpose, we specify graphs and Petri nets in the higher-order algebraic specification language HasCASL such that graphs and Petri nets become first-class citizens, i.e. members of algebras (rather than algebras themselves). As an example, we model hospital therapeutic processes by a single higher-order net. Individual care plans for each patient are tokens modeled by low-level nets.},
ISSN = {ISBN 3-540-20537-3},
Keywords = {Petri nets, graphs, algebraic specification},
Url = {http://www.cs.tu-berlin.de/%7Ehoffmann/publications/mainWADT02.ps}
}
@InCollection{HEM05,
Title = {{High-Level Nets with Nets and Rules as Tokens}},
Author = {Hoffmann, K. and Mossakowski, T. and Ehrig, H.},
Booktitle = {Proc. of 26th Intern. Conf. on Application and Theory of Petri Nets and other Models of Concurrency},
Publisher = Springer,
Year = {2005},
Pages = {268--288},
Series = lncs,
Volume = {3536},
Abstract = {High-Level net models following the paradigm ``nets as tokens'' have been studied already in the literature with several interesting applications. In this paper we propose the new paradigm ``nets and rules as tokens'', where in addition to nets as tokens also rules as tokens are considered. The rules can be used to change the net structure. This leads to the new concept of high-level net and rule systems, which allows to integrate the token game with rule-based transformations of P/T-systems. The new concept is based on algebraic high-level nets and on the main ideas of graph transformation systems. We introduce the new concept with the case study ``House of Philosophers'', a dynamic extension of the well-known dining philosophers. In the main part we present a basic theory for rule-based transformations of P/T-systems and for high-level nets with nets and rules as tokens leading to the concept of high-level net and rule systems. },
ISBN = {ISSN 0302-9743},
Keywords = {Graph Transformation, Petri Nets, High-Level Nets, Higher-Order Nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/HEM05.pdf}
}
@TechReport{HP99,
Title = {{Requirements for A Petri Net Specification Technique: Classification of Morphisms}},
Author = {Hoffmann, K. and Padberg, J.},
Institution = {Technical University Berlin},
Year = {1999}
}
@InProceedings{HPE+10,
Title = {Flexible Independence of Net Transformations and Token Firing in the Cospan DPO Approach},
Author = {Hoffmann, K. and Padberg, J. and Ehrig, H. and Hermann, F.},
Booktitle = {Proc. 3rd International Symposium of Multiagent Systems (MAS), Robotics and Cybernetics: Theory and Practice, 2009},
Year = {2010},
Owner = {Claudia},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/HPE+10.pdf}
}
@InProceedings{HP04,
Title = {{Higher-Order Nets for Mobile Policies}},
Author = {Hoffmann, K. and Parisi-Presicce, F.},
Booktitle = {Proc. Workshop on Petri Nets and Graph Transformation (PNGT), Satellite Event of ICGT'04},
Year = {2004},
Editor = {Rozenberg, G. and Ehrig, H. and Padberg, J.},
Abstract = { A policy is a set of rules that controls the behavior of complex systems. In \cite{icgt04} a policy framework based on graph transformations is presented providing an intuitive visual formalism for the manipulation of policy-based systems. The policy framework is defined by a type graph and sets of policy rules, positive and negative constraints, resp. Mobile policies have the additional capability to move around with the object e.g between different companies. We investigate how the distribution and modification of mobile policies can be modeled with Algebraic Higher-Order (AHO) nets, a high-level net class which is an extension of Petri nets by concepts of the higher-order specification language HasCASL. Due to the higher-order features graphs and rules are allowed to be dynamical objects in AHO-nets and the behavior of an AHO-net simulates the modification needed to achieve the flexibility of adapting objects. For our purpose, the AHO-net gives an overview of the different locations where the mobile policies could reside. Furthermore, the coupling of a set of rules which are used to modify the mobile policies, to certain locations, which have the authority to modify the mobile policies, is given by the net topology. Technically, we extent the HasCASL-specification of rule-based modifications on the one hand by adding negative application conditions and on the other hand by using specific operations for the modification of mobile policies. },
Keywords = {Graph Transformation, Petri Nets, Semantics},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/HP04.pdf}
}
@TechReport{HS02,
Title = {{Case Study Logistics using Algebraic Higher-Order Nets}},
Author = {Hoffmann, K. and Schreiter, T.},
Institution = {Technical University of Berlin},
Year = {2002},
Note = {ISSN 1436-9915},
Number = {TR 02-18},
Abstract = {In this paper we present a case study logistics using Algebraic Higher-Order Nets. Algebraic Higher-Order Nets are an extension of the well defined formalism of Algebraic High-Level Nets by higher-order functions leading to a more flexible modeling technique. After an introduction of Algebraic Higher-Order Nets at an informal level we present the case study logistics and demonstrate the advantage of our approach which allows a flexible modeling of business processes including exceptions and roles without changing the net structure of our nets. },
Keywords = {Petri Nets, Transformation, Petri Net Baukasten, Case Study},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2002/TR2002_18.ps}
}
@MastersThesis{Hof97,
Title = {{Spezifikation und Simulation eines Telephonsystems mit Graphtransformation}},
Author = {Hofmann, L.},
School = {TU Berlin},
Year = {1997},
Type = {Diplomarbeit}
}
@MastersThesis{Hof93,
Title = {{Anwendung algebraischer Graph\-gram\-ma\-tiken zur Werk\-st\"uck\-erkennung im Rahmen von CIM}},
Author = {Hofmann, L.},
School = {TU Berlin},
Year = {1993},
Type = {Studienarbeit}
}
@PhdThesis{Hum89,
Title = {{Algebraische High-Level Netze}},
Author = {Hummert, U.},
School = {Technische Universit\"at Berlin},
Year = {1989}
}
@MastersThesis{Hur09,
Title = {{Generation of Simulation Environments based on EMF Model Transformations }},
Author = {Hurrelmann, Jonas},
School = {TU Berlin, Fak. IV},
Year = {2009},
Type = {Diplomarbeit (Master's thesis)},
Timestamp = {2010.09.21},
Url = {http://www.tfs.tu-berlin.de/menue/forschung/abschlussarbeiten/archiv_abschlussarbeiten/}
}
@TechReport{JKRE82,
Title = {Concurrency of node label controlled graph transformations},
Author = {Janssens, D. and Kreowski, H.-J. and Rozenberg, G. and Ehrig, H.},
Institution = {University Antwerpen},
Year = {1982},
Address = {Antwerpen},
Number = {83-38},
Type = {Research Report}
}
@Article{JOE95,
Title = {Compositionality and compatibility of parameterization and parameter passing in specification languages},
Author = {Jimenez, R.M. and Orejas, F. and Ehrig, H.},
Journal = {MSCS},
Year = {1995},
Number = {2},
Pages = {283--314},
Volume = {5}
}
@InProceedings{Joh01,
Title = {Transition selection algorithms for statecharts},
Author = {John, S.},
Booktitle = {Informatik 2001: Wirtschaft und Wissenschaft in der Network Economy --- Visionen und Wirklichkeit, Proc.\ GI/OCG--Jahrestagung, 25.--28.\ September 2001, Wien, Austria},
Year = {2001},
Editor = {Bauknecht, K. and Brauer, W. and M{\"u}ck, T.},
Pages = {622--627},
Publisher = {{\"O}stereichische Computer--Gesellschaft},
Volume = {1}
}
@InProceedings{Joh04,
Title = {Minimal Unambiguous {eNFA}},
Author = {John, Sebastian},
Booktitle = {Implementation and Application of Automata: 9th International Conference, {CIAA} 2004},
Year = {2004},
Address = {Kingston, Canada},
Editor = {Domaratzki, Michael and Okhotin, Alexander and {Salomaa et al.}, Kai },
Month = {July 22-24},
Pages = {193-205},
Publisher = Springer,
Series = lncs,
Volume = {3317},
Abstract = {A nondeterministic finite automaton with e-transitions (eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem how to compactify a given eNFA by reducing the number of transitions. Compared to the standard techniques to minimize deterministic complete finite automata (complete DFA) two novel features matter in compactifying eNFA: the principle of transition partition and the principle of transition union. An algorithm for compactifying eNFA is presented that exploits the union principle. This algorithm has the following property: if the algorithm returns an unambiguous automaton, then this automaton is the transition minimal eNFA.},
ISBN = {ISBN: 3-540-24318-6},
Keywords = {Finite Nondeterministic Automaton, NFA, Minimization}
}
@TechReport{Joh03,
Title = {Steps for Statecharts: A Tool-based, Comparative Study},
Author = {John, S.},
Institution = {{TU}-Berlin, Germany},
Year = {2003},
Abstract = {Statecharts provide a formalism for modeling reactive systems, which extend the framework of finite automata with mechanisms to treat parallelism, hierarchical organization and inter-level transitions. In this modeling domain, we want to be able to treat input and output behaviors. This short survey brings together the approaches to the modeling of input and output used in the statechart models proposed by Harel, Statemate, UML and Rhapsody, showing where the various models are in agreement and where the fundamental differences lie.},
ISSN = {{ISSN}: 1436-9916},
Key = {{TR} 2003-4},
Keywords = {Statecharts, Semantics}
}
@TechReport{Joh03a,
Title = {Minimal unambiguous {eNFA}},
Author = {Sebastian John},
Institution = {{TU}-Berlin, Germany},
Year = {2003},
Abstract = {A nondeterministic finite automaton with e-transitions (eNFA) accepts a regular language. Among the eNFA accepting a certain language some are more compact than others. This essay treats the problem how to compactify a given eNFA by reducing the number of transitions. Compared to the standard techniques to minimize deterministic complete finite automata (complete DFA) two novel features matter in compactifying eNFA: the principle of transition partition and the principle of transition union. An algorithm for compactifying eNFA is presented that exploits the union principle. This algorithm has the following property: if the algorithm returns an unambiguous automaton, then this automaton is the transition minimal eNFA.},
ISSN = {{ISSN}: 1436-9916},
Key = {{TR} 2003-22},
Keywords = {Finite Nondeterministic Automaton, NFA, Minimization}
}
@MastersThesis{Joh99,
Title = {Zur kompositionalen {S}emantik von objekt--orientierten {S}tatecharts},
Author = {John, S.},
School = {TU Berlin},
Year = {1999}
}
@InProceedings{JGT06,
Title = {{Evolutionary Layout of Graph Transformation Sequences}},
Author = {Jucknath-John, S. and Graf, D. and Taentzer, G.},
Booktitle = {Proc. Third International Workshop on Graph-Based Tools (GraBaTs'06)},
Year = {2006},
Address = {Natal, Brazil},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Volume = {1},
Abstract = {The paper presents an evolutionary layout algorithm of graph transformation sequences which is based on the well-known spring embedder layout algorithm. The spring embedder algorithm already fulfills two important requirements for layouting a graph sequence: the highest single layout quality and the lowest difference between two successive layouts. But this layout algorithm does not fit well for incomplete graph sequences, since the following two new requirements are not fulfilled: \\ 1. the option for future extensions of graph sequences without ruining the layout, \\ 2. by taking also typing of graph edges into account. \\ So we extended the spring embedder layout algorithm by two new concepts: 1. A concept of node ageing and protection of senior node positions in the layout that allows the user to keep track of changes during transformation steps. The persistence of node positions throughout a sequence is most helpful to preserve the mental map. Especially the concept of ageing was the reason to name the algorithm an evolutionary layout algorithm. \\ 2. A concept of layout patterns based on edge typing. \\ This new layout algorithm tries to solve the following problems for an evolving graph transformation sequence: \\ 1. The quality of every single layout should be as optimal as possible. \\ 2. The mental distance from one layout to its successor layout should be small. \\ 3. The graph sequence may have future extensions, without loosing the layout`s quality. \\ 4. The changes between two graphs should be easily recognizable in the layout of two subsequent graphs.},
ISSN = {ISSN 1863-2122},
Keywords = {graph transformation, AGG, graph layout, layout algorithm},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/JGT06.pdf}
}
@InCollection{Juh99,
Title = {Reasoning about algebraic generalisation of {P}etri nets},
Author = {Juh\'as, Gabriel},
Booktitle = {Proc. of 20th Conference on Theory and Application of {P}etri nets},
Publisher = Springer,
Year = {1999},
Pages = {324--343},
Series = lncs,
Volume = {1639}
}
@InCollection{Juh99b,
Title = {On Semantics of {P}etri Nets over Partial Algebra},
Author = {Juh\'as, Gabriel},
Booktitle = {Proc. of 26th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'99)},
Publisher = Springer,
Year = {1999},
Pages = {408--415},
Series = lncs,
Volume = {1725}
}
@InProceedings{JLMT08,
Title = {{Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams}},
Author = {Jurack, S. and Lambers, L. and Mehner, K. and Taentzer, G.},
Booktitle = {Proc. ACM/IEEE 11th International Conference on Model Driven Engineering Languages and Systems (MoDELS'08)},
Year = {2008},
Editor = {Czarnecki, K.},
Pages = {341--355},
Publisher = Springer,
Series = lncs,
Volume = {5301},
Abstract = {In use case-driven approaches to requirements modeling, UML activity diagrams are a wide-spread means for refining the functional view of use cases. Early consistency validation of activity diagrams is therefore desirable but difficult, due to the semi-formal nature of activity diagrams. In this paper, we specify well-structured activity diagrams and define activities more precisely by pre- and post- conditions. They can be modeled by interrelated pairs of object diagrams based on a domain class diagram. This activity refinement is based on the theory of graph transformation and paves the ground for a consistency analysis of the required system behavior. A formal semantics for activity diagrams refined by pre- and post-conditions, allows us to establish sufficient criteria for consistency. The automated checking of these criteria has been integrated into a tool for graph transformation. },
ISBN = {978-3540878742},
Keywords = {graph transformation, activity diagram, consistent behavior modeling},
Location = {Toulouse, France},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/JLMT08.pdf}
}
@InProceedings{JLM+09,
Title = {{Object Flow Definition for Refined Activity Diagrams }},
Author = {Jurack, S. and Lambers, L. and Mehner, K. and Taentzer, G. and Wierse, G.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'09)},
Year = {2009},
Editor = {Chechik, M. and Wirsing, M.},
Pages = {49--63},
Publisher = {Springer},
Series = lncs,
Volume = {5503},
Abstract = {Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we refine activities by pairs of pre- and post-conditions formulated by interrelated object diagrams. To define a clear semantics for refined activity diagrams with object flow, we use a graph transformation approach. Control flow is formalized by sets of transformation rule sequences, while object flow is described by partial dependencies between transformation rules. This approach is illustrated by a simple service-based on-line university calendar. },
Doi = {10.1007/978-3-642-00593-0\_4},
ISBN = {978-3-642-00592-3},
Owner = {Claudia},
Timestamp = {2009.05.12},
Url = {http://www.springerlink.com/content/bgmnx25w700j4767/?p=83ac5bfbce90462dbb453b2a95fed6e2&pi=3}
}
@InProceedings{KPA08,
Title = {{Hierarchical Modelling and Verification based on Petri Net Components with Multiple Import Interfaces}},
Author = {K{\"u}ssel, U. and Padberg, J. and Abel, D.},
Booktitle = {Proc. 17th World Congress of International Federation of Automatic Control (IFAC'08)},
Year = {2008},
Abstract = {This paper introduces the modelling of discrete event based system and the verification of their properties using Petri net components. Especially interesting is the application of a component based verification approach in order to structure the Petri nets hierarchically and to verify their properties component-wise. Here, we exemplify a new notion of the theory that facilitates modelling. This extension allows the definition of multiple import interfaces. Multiple import interfaces allow the component to import more than one other component and so simplifies the task of the modeler as it provides means for a "divide and conquer" strategy.},
Keywords = {Discrete event systems modeling and control, Petri nets, Petri net tools},
Location = {Seoul, Korea},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/KPA08.pdf}
}
@MastersThesis{Koe06,
Title = {{A Visual Model Transformation Environment for the Eclipse Modeling Framework}},
Author = {K\"ohler, C.},
School = FB13,
Year = {2006},
Type = {Master's thesis},
Abstract = {Model driven engineering as a methodology for designing and implementing systems and processes is established for years now. The industry on one hand and Open Source communities on the other hand provide a large variety of frameworks for model driven development processes. The EclipseModeling Framework (EMF) implements a modeling approach by providing code generation facilities for structural data models. Although there already exist proposals for EMF model transformations, a graphbased approach, where model transformations can be defined in a visual, rule-based manner has not been considered yet. In this thesis, a formal interpretation of modeling concepts is presented and a model transformation approach for EMF is introduced, based on formal graph transformation. An implementation is provided in the form of a graphical editor for the Eclipse platform, that allows the visual definition of in-place transformations for EMF-compliant models. EMF model instantiations are interpreted as attributed typed graphs with special containment edges. The order properties of these containment edges are formalized and conditions are stated, that must be satisfied to apply transformation rules to this kind of graphs. Further, a concept of consistency is introduced, that ensures well defined instantiations of EMF models. Applications of the framework are given through two examples, one for endogenous and one for exogenous model transformations. },
Keywords = {graph transformation, model transformation, Eclipse, EMF},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Koeh06.pdf}
}
@MastersThesis{Kar05,
Title = {{Entwurf und Implementierung eines Interpreters f{\"u}r amalgamierte Graphtransformation}},
Author = {Karwan, B.},
School = {Technische Universit{\"a}t Berlin, Fak. Elektrotechnik/Informatik},
Year = {2005}
}
@InProceedings{KHM06,
Title = {{Towards Translating Graph Transformation Systems by Model Transformation}},
Author = {Kastenberg, Harmen and Hermann, Frank and Modica, Tony},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'06), Satellite Event of the IEEE Symposium on Visual Languages and Human-Centric Computing },
Year = {2006},
Address = {Brighton, UK},
Month = {September},
Publisher = {Electronic Communications of the EASST},
Volume = {4},
Abstract = {Recently, many researchers are working on semantics preserving model transformation. In the field of graph transformation one can think of translating graph grammars written in one approach to a behaviourally equivalent graph grammar in another approach. In this paper we translate graph grammars developed with the GROOVE tool to AGG graph grammars by first investigating the set of core graph transformation concepts supported by both tools. Then, we define what it means for two graph grammars to be behaviourally equivalent, and for the regar/ded approaches we actually show how to handle different definitions of both - application conditions and graph structures. The translation itself is explained by means of intuitive examples.},
ISSN = {ISSN 1863-2122},
Keywords = { model transformation, bridging languages, preserving semantics, graph transformation tools},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/KHM06.pdf}
}
@InCollection{KRH12,
Title = {Testing against Visual Contracts: Model-Based Coverage},
Author = {Khan, {Tamim Ahmed} and Runge, Olga and Heckel, Reiko},
Booktitle = {Proc. Int. Conf. on Graph Transformations},
Publisher = {Springer Berlin Heidelberg},
Year = {2012},
Editor = {Ehrig, Hartmut and Engels, Gregor and Kreowski, Hans-J\"org and Rozenberg, Grzegorz},
Pages = {279-293},
Series = {Lecture Notes in Computer Science},
Volume = {7562},
Abstract = {Testing service-oriented or component-based systems poses new challenges due to the non-availability of code and the distributed nature of the applications being tested. Structural coverage criteria, traditionally used to assess test suites, require access to code. As an alternative we consider model-based criteria based on interface specifications using visual contracts.
Formally represented as graph transformation rules, visual contracts are analysed for potential dependencies and conflicts and dependency graphs are derived for defining the criteria. In order to assess the coverage of a given set of tests, AGG is used for simulating the model while tests are executed. In the course of the simulation, which also serves as a test oracle, conflicts and dependencies are observed and recorded. This allows us to see if the statically detected potential dependencies and conflicts are exercised at runtime. For evaluation purposes, we compare coverage with respect to model-based criteria and traditional structural ones.},
Doi = {10.1007/978-3-642-33654-6_19},
ISBN = {978-3-642-33653-9},
Url = {http://dx.doi.org/10.1007/978-3-642-33654-6_19}
}
@Article{KRH12a,
Title = {{Visual Contracts as Test Oracle in AGG 2.0}},
Author = {Khan, Tamim and Runge, Olga and Heckel, Reiko},
Journal = {ECEASST},
Year = {2012},
Volume = {47},
Abstract = {A test oracle predicts expected outcomes for a set of test cases, often based on a formal, executable specification. Visual contracts are graph transformation rules describing pre- and post-conditions of a service’s operations. To obtain an oracle based on visual contracts, we use the Attributed Graph Grammar System (AGG) to execute the rules, creating a simulation of the behaviour expected of the system under test. The paper discusses the basic idea, illustrates it by an example, describes the challenges and solutions of its implementation and draws conclusions for the use of graph transformation and AGG in test oracles.},
Booktitle = {Proceedings of the 11th Int. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'12)},
Editor = {Andrew Fish and Leen Lambers},
ISBN = {{ISSN 1863-2122}},
Keywords = {graph transformation, test oracle, visual contract, AGG},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@TechReport{KTW02,
Title = {{VisualOCL: A Visual Notation of the Object Constraint Language}},
Author = {Kiesner, C. and Taentzer, G. and Winkelmann, J.},
Institution = {Technische Universit\"at Berlin},
Year = {2002},
Number = {2002--23},
ISSN = {ISSN 1436-9915},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Egabi/gKTW02.pdf}
}
@PhdThesis{Kla99,
Title = {A Semantical Framework for the Integration of Object-Oriented Modeling Languages},
Author = {Klar, M.},
School = {TU Berlin, FB13},
Year = {1999}
}
@TechReport{KG98,
Title = {{A Meta-Model for Object-oriented Systems}},
Author = {Klar, M. and Geisler, R.},
Institution = {TU Berlin, Fachbereich Informatik},
Year = {1998},
Number = {(to appear)}
}
@InProceedings{KGC96a,
Title = {{\em InterACT}: An Interactive Theorem and Completeness Prover for Algebraic Specifications with Conditional Equations},
Author = {Klar, M. and Geisler, R. and Cornelius, F.},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1996},
Editor = {Haveraaen, M. and Owe, O. and Dahl, O.J.},
Note = {11th Workshop on Specification of Abstract Data Types joint with the 9th general COMPASS workshop. Oslo, Norway, September 1995. Selected papers},
Publisher = Springer,
Series = lncs,
Volume = {1130}
}
@PhdThesis{Kle06,
Title = {{Transformation-Based Component Architectures General Framework, Instantiations and Case Study}},
Author = {Klein, M.},
School = {Technische Universit\"at Berlin, Fak. IV},
Year = {2006},
Abstract = {The thesis introduces an abstract framework for the specification of software components with multiple require and provide interfaces that allows the specication of multiple access to a single provide interface. Component connections are given by families of transformations connecting require and provide interfaces. Component composition is defined in terms of extension and multiple extension of transformations or transformation families, respectively. It is proven that the result of two composition steps is not affected by the order of the calculation. The framework offers a semantics to component architectures by reducing them to components by composition. This semantics is proven to be well-defined and unique if multiple extension and composition of extension diagrams as well as disjoint require interfaces are given. Moreover, the framework offers a semantics for components which is shown to be compositional. The abstract framework is primary meant to be instantiated with formal specification techniques featuring a mathematical semantics, and thus, enabling the application of formal analysis techniques like formal verification and model-checking to component architectures specified by those techniques. A case study using elementary nets and UML diagrams demonstrates the applicability of the framework. This includes instantiations of the framework for the corresponding techniques.},
Keywords = {Software Components,Architectures,Abstract Framework}
}
@TechReport{Kle03,
Title = {{A Component Concept for System Modeling Based on High-Level Replacement Transformations}},
Author = {Klein, M.},
Institution = {TUB},
Year = {2003},
Number = {2003-09},
Abstract = {The present work is a theoretical foundation of the application of an abstract transformation based component concept to high-level replacement systems, that can be understood as a categorical abstraction of graph transformation systems. This is done by proving the assumptions of the abstract framework concerning the underlying transformations for the case of high-level replacement transformations. These assumptions describe the existence of an extension for given transformations and morphisms and based on that the compositionality and decomposition of extension diagrams. The corresponding proofs assume several properties for the different categories. The result of the application is a component concept that can be used to specify software systems with categorical techniques in a structured way.},
ISSN = {ISSN 1436-9915},
Keywords = {Components, HLR Systems, Transformation Semantics},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2003/TR2003_09.ps.gz}
}
@InProceedings{KOP02,
Title = {{Agent--Based Material Flow}},
Author = {Klein, M. and {\"O}zhan, M. and Piirainen, M.},
Booktitle = {Proc. Workshop on Software Evolution through Transformations (SET'01), Satellite Event of ICGT'02},
Year = {2002},
Editor = {Heckel, R. and Mens, T. and Wermelinger, M.},
Month = {October},
Series = entcs,
Volume = {74}
}
@Article{KBESB04,
Title = {{Anwendung softwaretechnischer Komponentenkonzepte auf die Produktionsautomatisierung}},
Author = { Klein, M. and Braatz, B. and Ehrig, H. and Schr\"oter, G and Bengel, M.},
Journal = {atp},
Year = {2004},
Month = {August},
Pages = {46--56},
Abstract = {Motivated by the wide acceptance of component based technologies in software development it is shown by example, how to apply component concepts for software engineering to modeling in the field of production automation. Taking the modeling of a holonic transport system as an example, it is shown how functionblocks in the sense of production automation can be understood as software engineering components. Thus, the advantages of component based modeling with respect to structuring, exchange and reuse can be transferred to systems in production automation.},
ISSN = {0178-2320},
Keywords = {production automation, components, software technology}
}
@InProceedings{KPO06,
Title = {{Towards Multiple Access in Generic Component Architectures}},
Author = {Klein, M. and Padberg, J. and Orejas, F.},
Booktitle = {Proc. Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA 06), Satellite Event of the European Joint Conferences on Theory and Practice of Software (ETAPS)},
Year = {2006},
Address = {Amsterdam},
Editor = {Kuester-Filipe, J. and Poernorno, I. and Reussner, R.},
Note = {DOI: 10.1016/j.entcs.2006.02.030},
Pages = {25-45},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {176},
Abstract = {The paper introduces an abstract framework for the specification of components with multiple require and provide interfaces that allows the specification of multiple access to a single provide interface. This framework can be regarded as a generalization of abstract hierarchical and connector-based component specification approaches. The main ideas are clarified in a sample specification, a component architecture for a web browser suite. For this, elementary nets are applied and are shown to be an instantiation of the abstract framework. },
ISBN = {ISSN:1571-0661},
Issue = {2},
Keywords = {Software Components,Architectures,Abstract Framework},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/KPO06.pdf}
}
@InProceedings{KPE00,
Title = {{Modeling Train Control Systems: From Message Sequence Charts to Petri Nets}},
Author = {Kluge, Olaf and Padberg, Julia and Ehrig, Hartmut},
Booktitle = {Proc. Formale Techniken f{\"u}r die Eisenbahnsicherung (FORMS)},
Year = {2000},
Note = {Reihe 12, Nr.\ 44, {VDI} Verlag},
Organization = {Fortschritt-Berichte {VDI}},
Pages = {25--42}
}
@MastersThesis{Klu10,
Title = {Concept and Implementation of an Application Environment for Model Transformations Based on Triple Graph Grammars and Mathematica},
Author = {Olegs Klujs},
School = {Technische Universitï¿½t Berlin},
Year = {2010},
Type = {Diplomarbeit (Master Thesis)},
Owner = {Claudia},
Url = {http://www.user.tu-berlin.de/lieske/tfs/Diplomarbeiten/TFSdipl/10-OlegsKlujs.pdf}
}
@MastersThesis{Ray04,
Title = {{Modelling Object-Oriented Systems by Transformation Systems}},
Author = {Kniep, Andreas Rayo},
School = {Technische Universit{\"a}t Berlin, Fakult{\"a}t IV Informatik und Elektrotechnik},
Year = {2004},
Abstract = {In this paper, "Object-Oriented Transformation Systems" are introduced as a general semantical framework for the integration of possibly heterogeneous object-oriented systems. Instances of these systems can be modelled by Object-Oriented Transformation Systems within a formal mathematical semantic enabling comparison and consistency check between them. In order to clarify the term "object-orientation" the characteristics of today's object oriented systems are identified. As a result of this paper Object-Oriented Transformation Systems are proven to form a concrete institution and thus constitute an instantiation of the generic Transformation Systems by M. Gro{\ss}e-Rhode. Hence existing and proven theorems like the composition of Transformation Systems and development relations can be applied to instances of Object-Oriented Transformation Systems.},
Keywords = {OOTS, transformation systems, object-orientation, modelling, integration, IOSIP},
Pages = {101},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/thesis/mastersthesis-04-rayo.pdf}
}
@PhdThesis{Koc99,
Title = {Integration of Graph Transformation and Temporal Logic for the Specification of Distributed Systems},
Author = {Koch, M.},
School = {Technische Universit\"at Berlin, FB 13},
Year = {1999}
}
@TechReport{Koc97,
Title = {Bedingte verteilte {G}raphtransformation und ihre {A}nwendung auf verteilte {T}ransaktionen},
Author = {Koch, M.},
Institution = FB13,
Year = {1997},
Number = {97-11}
}
@TechReport{Koc96a,
Title = {{M}odellierung und {N}achweis der {K}onsistenz von verteilten {T}ransaktionsmodellen f\"ur {D}atenbanksysteme mit algebraischen {G}raphgrammatiken},
Author = {Koch, M.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-36}
}
@InProceedings{KFV98,
Title = {{Graphtransformation zur visuellen Beschreibung einer transaktionsgesteuerten Konfigurationskontrolle}},
Author = {Koch, M. and Fischer, I. and Volle, V.},
Booktitle = {Rundbrief Datenbanken},
Year = {1998},
Month = {May},
Publisher = {GI}
}
@InCollection{KG98b,
Title = {{{V}om {B}egriff zur {K}ategorie. {E}in {B}eitrag zur {B}edeutung {E}mmy {N}oethers f{\"u}r die {I}nformatik}},
Author = {Koreuber, M. and {Gro{\ss}e--Rhode}, M.},
Booktitle = {Sozialgeschichte der Informatik. Kulturelle Praktiken und Orientierungen},
Publisher = {Deutscher Universit{\"a}ts Verlag, Wiesbaden},
Year = {1998},
Editor = {Siefkes, D. and Eulenh{\"o}fer, P. and Stach, H. and St{\"a}dtler, K.},
Pages = {151--174}
}
@Conference{Kor95a,
Title = {{True Concurrency Semantics for Single Pushout Graph Transformations with Applications to Actor Systems}},
Author = {Korff, M.},
Booktitle = {Working papers of the International Workshop on Informal Information Systems - Correctness and Reusability},
Year = {1995},
Editor = {Wieringa, R. J. and Feenstra, R. B.},
Pages = {33--50},
Publisher = {World Scientific}
}
@PhdThesis{Kor95b,
Title = {{Generalized Graph Structure Grammars with Applications to Concurrent Object-Oriented Systems}},
Author = {Korff, M.},
School = {TU Berlin},
Year = {1996}
}
@PhdThesis{Kor95c,
Title = {Generalized Graph Structure Grammars with Applications to Concurrent Object-Oriented Systems},
Author = {M. Korff},
School = {TU Berlin},
Year = {1996}
}
@Misc{Kor94a,
Title = {A Graph Transformation Approach to Concurrent Object-Oriented System Specification},
Author = {Korff, M.},
Month = {February},
Note = {Lecture on the joint COMPASS/ISCORE workshop in Lissabon},
Year = {1994}
}
@InProceedings{Kor94b,
Title = {Single Pushout Transformations of Equationally Defined Graph Structures with Applications to Actor Systems},
Author = {Korff, M.},
Booktitle = {Proc. Graph Grammar Workshop Dagstuhl 93},
Year = {1994},
Pages = {234--247},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@TechReport{Kor94c,
Title = {Minimality of Derived Rules in Single Pushout Graph Rewriting},
Author = {Korff, M.},
Institution = {Technical University of Berlin},
Year = {1994},
Number = {94/10}
}
@Unpublished{Kor94d,
Title = {Graph-Interpreted Graph Transformations for Concurrent Object-Oriented Systems},
Author = {Korff, M.},
Note = {Extended abstract for the 5th International Workshop on Graph Grammars and their Application to Computer Science},
Year = {1994}
}
@InProceedings{Kor94e,
Title = {True concurrency semantics for single pushout graph transformations with applications to actor systems},
Author = {Korff, M.},
Booktitle = {Working papers of the International Workshop on Information Systems -- Corretness and Reusability IS-CORE'94},
Year = {1994},
Note = {Tech. Report IR-357, Free University, Amsterdam.},
Pages = {244--258}
}
@TechReport{Kor93a,
Title = {An Algebraic Graph Grammar Model for Actor Systems},
Author = {Korff, M.},
Institution = TUB,
Year = {1993},
Number = {93/21}
}
@Misc{Kor93c,
Title = {Concurrent Object-Oriented System Specification: a Graph Transformation Approach},
Author = {Korff, M.},
Month = {June},
Note = {Lecture on the joint COMPASS/COMPUGRAPH workshop in L'Aquila},
Year = {1993}
}
@TechReport{Kor93e,
Title = {Single Pushout Transformations of Generalized Graph Structures},
Author = {Korff, M.},
Institution = {Federal University of Rio Grande do Sul},
Year = {1993},
Address = {Porto Alegre, Brazil},
Number = {RP 220}
}
@TechReport{Kor92,
Title = {Algebraic Transformations of Equationally Defined Graph Structures},
Author = {Korff, M.},
Institution = TUB,
Year = {1992},
Note = {ca. 120 pages},
Number = {92/32}
}
@TechReport{Kor90,
Title = {Optimizations of production systems based on algebraic graph transformations},
Author = {Korff, M.},
Institution = FB13,
Year = {1990}
}
@Article{KE94,
Title = {{COMPUGRAPH} {II}: Computing by Graph Transformations {II}},
Author = {Korff, M. and Ehrig, H.},
Journal = BEATCS,
Year = {1994},
Pages = {107-120},
Volume = {53}
}
@Manual{KLTW93,
Title = {{Algebraische Graphgrammatiken --- zwischen Theorie und Praxis --- Skript zur Lehrveranstaltung "Graphtransformation und Petrinetze" (in german)}},
Author = {Korff, M. and L{\"o}we, M. and Taentzer, G. and Wagner, A.},
Organization = {Technical University of Berlin, Department of Computer Science},
Year = {1993}
}
@InProceedings{KR95a,
Title = {{Formal Relationship between Graph Grammars and {Petri} nets}},
Author = {Korff, M. and Ribeiro, L.},
Booktitle = {5th Int.\ Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94},
Year = {1996},
Pages = {288 - 303},
Publisher = Springer,
Series = lncs,
Volume = {1073}
}
@InProceedings{KR95b,
Title = {Concurrent derivations as single pushout graph grammar processes},
Author = {Korff, M. and Ribeiro, L.},
Booktitle = {Proc. of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation},
Year = {1995},
Pages = {113-122},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {2}
}
@Unpublished{KR94a,
Title = {An attributed graph transformation approach to the behaviour of algebraic high-level nets},
Author = {Korff, M. and Ribeiro, L.},
Note = {Extended abstract for the international Workshop on Graph Grammars'94},
Year = {1994}
}
@Unpublished{KR94b,
Title = {Process semantics for algebraic graph transformations},
Author = {Korff, M. and Ribeiro, L.},
Note = {Unpublished},
Year = {1994}
}
@MastersThesis{Kur00,
Title = {{Entwurf und Implementierung einer Kontrollkomponente f\"ur attributierte Graphersetzung}},
Author = {Kurt, M.},
School = {TU Berlin, FB 13},
Year = {2000}
}
@InProceedings{Low94,
Title = {{V}on {G}raphgrammatiken zu {P}etrinetzen und zur{\"u}ck},
Author = {L{\"o}we, M.},
Booktitle = {{T}agungsband {A}lternative {K}onzepte f{\"u}r {S}prachen und {R}echner},
Year = {1994},
Editor = {F. Simon},
Organization = {Univ. Kiel, FB Informatik},
Pages = {Nr. 94 12, 79 - 82}
}
@InProceedings{Low99,
Title = {{Evolution pattern. A Graphical Framework for Software Redesign}},
Author = {L{\"o}we, M.},
Booktitle = {Proc. World Multiconf. on Systemics, Cybernetics and Informatics},
Year = {1999},
Pages = {110--111}
}
@TechReport{Low98,
Title = {{E}volution {P}atterns -- {E}in formaler {A}nsatz zur {E}ntwicklung langlebiger {S}oftwaresysteme auf der {B}asis von {G}raphgrammatiken},
Author = {L{\"o}we, M},
Institution = {Technische Unversit\"at Berlin},
Year = {1998},
Number = {98-4}
}
@Unpublished{Low97,
Title = {Evolution Pattern},
Author = {L{\"o}we, M.},
Note = {postdoctoral thesis, Technical University of Berlin},
Year = {1997}
}
@Article{Low93,
Title = {{Algebraic Approach to Single-Pushout Graph Transformation}},
Author = {L{\"o}we, M.},
Journal = {TCS},
Year = {1993},
Pages = {181--224},
Volume = {109},
Publisher = {North Holland}
}
@PhdThesis{Low90,
Title = {Extended Algebraic Graph Transformations},
Author = {L{\"o}we, M.},
School = {Technical University of Berlin},
Year = {1990},
Note = {short version in TCS (109):181 -- 224}
}
@TechReport{Low90a,
Title = {Algebraic approach to graph transformation based on single pushout derivations with partial morphisms},
Author = {L{\"o}we, M.},
Institution = FB13,
Year = {1990},
Number = {90/5}
}
@Article{Low90c,
Title = {Implementing algebraic specifications by graph transformations},
Author = {L{\"o}we, M.},
Journal = {Journal for Information Processing and Cybernetics ({E}{I}{K})},
Year = {1990},
Number = {11/12},
Pages = {615--641},
Volume = {26}
}
@TechReport{Low89,
Title = {Implementing algebraic specifications by graph transformations},
Author = {L{\"o}we, M.},
Institution = FB13,
Year = {1989},
Number = {89/26}
}
@TechReport{Loe85a,
Title = {{A}lgebraische {S}pezifikation in {UNIVERS} -- 2.\ {T}eil: {V}ersionsgraphen f\"ur zerlegte {D}okumente},
Author = {M. L{\"o}we},
Institution = {Bundesministerium f\"ur Forschung und Technologie},
Year = {1985},
Note = {In Abschlu\ss bericht SPREE--Projekt: Spezifikation mit Rechnerunterst\"utzung, Entwurf und Entwicklung}
}
@InProceedings{LB93,
Title = {{AGG} --- An Implementation of Algebraic Graph Rewriting},
Author = {L{\"o}we, M. and Beyer, M.},
Booktitle = {Proc. Fifth Int.\ Conf. Rewriting Techniques and Applications},
Year = {1993},
Pages = {451--456},
Publisher = Springer,
Series = lncs,
Volume = {690}
}
@InProceedings{LD94,
Title = {Parallelism in Single-Pushout Graph Rewriting},
Author = {L{\"o}we, M. and Dingel, J.},
Booktitle = {Graph Transformation in Computer Science},
Year = {1994},
Pages = {234--247},
Series = lncs,
Volume = {776}
}
@Conference{LE91,
Title = {Algebraic approach to graph transformation based on single pushout derivations},
Author = {L{\"o}we, M. and Ehrig, H.},
Booktitle = {Graph-Theoretic Concepts in Computer Science, WG '90},
Year = {1991},
Editor = {M{\"o}hring, R.H.},
Pages = {338--353},
Publisher = Springer,
Series = lncs,
Volume = {484}
}
@InProceedings{LEFJ91,
Title = {On the relationship between algebraic module specifications and program modules},
Author = {L{\"o}we, M. and Ehrig, H. and Fey, W. and Jacobs, D.},
Booktitle = {Proc. TAPSOFT},
Year = {1991},
Pages = {83-98},
Publisher = Springer,
Series = lncs,
Volume = {494}
}
@TechReport{LH94,
Title = {{Process Modelling and Control with Higher-Order Nets}},
Author = {L{\"o}we, M. and Han, Y.},
Institution = {Technical Univerity Berlin},
Year = {1994},
Number = {TR 94-34}
}
@InCollection{LKW93,
Title = {{An Algebraic Framework for the Transformation of Attributed Graphs}},
Author = {L{\"o}we, M. and Korff, M. and Wagner, A.},
Booktitle = {Term Graph Rewriting: Theory and Practice},
Publisher = {John Wiley \& Sons Ltd},
Year = {1993},
Chapter = {14},
Editor = {Sleep, M.R. and Plasmeijer, M.J. and van Eekelen, M.C.},
Pages = {185--199}
}
@InProceedings{LKW91,
Title = {Single-pushout transformation of attributed graphs: a link between graph grammars and abstract data types},
Author = {L{\"o}we, M. and Korff, M. and Wagner, A.},
Booktitle = {Proc. of the {SEMAGRAPH} Symposium 1991},
Year = {1991},
Pages = {359--379},
Publisher = {Technical Report 91-25, University of Nijmegen},
Institution = {University of Nijmegen}
}
@InProceedings{LM95,
Title = {Critical {P}air {A}nalysis in {S}ingle-{P}ushout {G}raph {R}ewriting},
Author = {M. L{\"o}we and J. M{\"u}ller},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {G. Valiente Feruglio and F. Rosello Llompart},
Organization = {Technical Report B-19, Universitat de les Illes Balears}
}
@TechReport{LM95a,
Title = {Theorie funktionaler {E}rsetzungssysteme - {Eine \"{U}bersicht} -},
Author = {L{\"o}we, M. and M{\"u}ller, J.},
Institution = {TU Berlin},
Year = {1995},
Number = {95-28}
}
@TechReport{LM93,
Title = {Algebraische {G}raphersetzung: mathematische {M}odellierung und {K}onfluenz},
Author = {L{\"o}we, M. and M{\"u}ller, J.},
Institution = {TU Berlin},
Year = {1993},
Number = {93-37}
}
@TechReport{LR85,
Title = {{A}lgebraische {S}pezifikation in {UNIVERS} am {B}eispiel der {S}truktur eines {V}ersionsgraphen},
Author = {M. L{\"o}we and M. Reisin},
Institution = {Technische Universit\"at Berlin},
Year = {1985},
Number = {85/07}
}
@Article{LW95,
Title = {{Parametric algebraic specifications with Gentzen formulas -- from quasi-freeness to free functor semantics}},
Author = {L{\"o}we, M. and Wolter, U.},
Journal = {Math. Struct. in Comp. Science},
Year = {1995},
Note = {A preliminary version appeared as Tech. Report 92--07, Technische Universit{\"a}t Berlin, FB Informatik, 1992},
Pages = {69-111},
Volume = {5}
}
@TechReport{LW92,
Title = {Parametric Algebraic Specifications with Gentzen-Formulas},
Author = {L{\"o}we, M. and Wolter, U.},
Institution = {Technische Universit\"at Berlin, FB Informatik},
Year = {1992},
Month = {February},
Number = {92--07}
}
@TechReport{LCFW92,
Title = {{E}in {F}allbeispiel f\"ur {K}{O}{R}{S}{O}: {E}in {V}orschlag},
Author = {L\"owe, Michael and Cornelius, Felix and Faulhaber, Joachim and Wess\"aly, Roland},
Institution = {Technische Universit\"at Berlin},
Year = {1992},
Number = {92-45}
}
@InProceedings{Lam04,
Title = {{A New Version of GTXL: An Exchange Format for Graph Transformation Systems}},
Author = {Lambers, L.},
Booktitle = {Proc. Workshop on Graph-Based Tools (GraBaTs'04), Satellite Event of ICGT'04},
Year = {2004},
Editor = {Mens, T. and Sch\"urr, A. and Taentzer, G.},
Abstract = {GTXL (Graph Transformation Exchange Language) is designed to support and stimulate developers to provide their graph transformation-based tools with an exchange functionality regarding the integration with other tools. For this exchange XML was chosen as underlying technology. The exchange of graphs is facilitated by the exchange format GXL which is also XML-based. GTXL uses GXL to describe the graph parts of a graph transformation system. A first version of GTXL arose from the format discussion within the EU Working Group APPLIGRAPH. Trying to restimulate the discussion on a common exchange format for graph transformation systems, this paper presents a new version of GTXL. Three important changes have been made. At first, an integrated presentation of rules is introduced, secondly the expression of more general conditions is supported and finally the storage of the underlying semantics of a graph transformation system by means of special attributes is proposed. },
Keywords = {Graph Transformation system, exchange format, graph transformation-based tools, XML},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/Lam04.pdf}
}
@PhdThesis{Lam09,
Title = {Certifying Rule-Based Models using Graph Transformation},
Author = {Lambers, Leen},
School = {Technische Universit\"at Berlin},
Year = {2009},
Owner = {Claudia},
Timestamp = {2010.07.13}
}
@TechReport{LEH+10,
Title = {Local Confluence for Rules with Nested Application Conditions based on a New Critical Pair Notion},
Author = {Lambers, L. and Ehrig, H. and Habel, A. and Orejas, F. and Golas, U.},
Institution = TUB,
Year = {2010},
Number = {2010/07},
Abstract = {Local confluence is an important property in many rewriting systems. The notion of critical pairs is central for being able to verify local confluence of rewriting systems in a static way. Critical pairs are defined already in the framework of graphs and adhesive rewriting systems. These systems may hold rules with or without negative application conditions. In this paper however, we consider rules with more general application conditions -- also called nested application conditions -- that are known to be equivalent to finite first-order graph conditions. The classical critical pair notion denotes conflicting transformations in a minimal context satisfying the application conditions. This is no longer true for combinations of positive and negative application conditions -- an important special case of nested ones -- where we allow that critical pairs do not satisfy the application conditions. This leads to a new notion of critical pairs which allows to formulate and prove a Local Confluence Theorem for rules with nested application conditions in the framework of adhesive rewriting systems based on the DPO-approach. It builds on a new Embedding Theorem and Completeness Theorem for critical pairs based on rules with nested application conditions. We demonstrate this new theory on the modeling of an elevator control by a typed graph transformation system with positive and negative application conditions.},
ISBN = {ISSN 1436-9915},
Url = {http://www.eecs.tu-berlin.de/fileadmin/f4/TechReports/2010/tr_2010-07.pdf}
}
@InProceedings{LEO08,
Title = {{Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs}},
Author = {Lambers, L. and Ehrig, H. and Orejas, F.},
Booktitle = {Proc. International Workshop on Graph Transformation and Visual Modeling Techniques (GTVMT'06)},
Year = {2008},
Address = {Amsterdam},
Pages = {17--26},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {211},
Abstract = {The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately the standard construction is not very efficient. This paper introduces the new concept of essential critical pairs allowing a more efficient conflict detection. This is based on a new conflict characterization, which determines for each conflict occuring between the rules of the system the exact conflict reason. This new notion of conflict reason leads us to an optimization of conflict detection. Efficiency is obtained because the set of essential critical pairs is a proper subset of all critical pairs of the system and therefore the set of representative conflicts to be computed statically diminishes. It is shown that for each conflict in the system, there exists an essential critical pair representing it. Moreover each essential critical pair possesses a unique conflict reason and thus represents each conflict not only in a minimal, but also in a unique way. Main new results presented in this paper are a characterization of conflicts, completeness and uniqueness of essential critical pairs and a local confluence lemma based on essential critical pairs. The theory of essential critical pairs is the basis to develop and implement a more efficient conflict detection algorithm in the near future.},
Keywords = {conflict detection, confluence, critical pair, graph transformation},
Location = {Vienna, Austria},
Url = {http://www.sciencedirect.com/science/article/pii/S1571066108002417}
}
@InProceedings{LEO06a,
Title = {{Conflict Detection for Graph Transformation with Negative Application Conditions}},
Author = {Lambers, L. and Ehrig, H. and Orejas, F.},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Year = {2006},
Address = {Natal, Brazil},
Month = {September},
Pages = {61--76},
Publisher = Springer,
Series = lncs,
Volume = {4178},
Abstract = {This paper introduces a new theory needed for the purpose of conflict detection for graph transformation with negative application conditions (NACs). Main results are the formulation of a conflict notion for graph transformation with NACs and a conflict characterization derived from it. A critical pair definition is introduced and completeness of the set of all critical pairs is shown. This means that for each conflict, occuring in a graph transformation system with NACs, there exists a critical pair expressing the same conflict in a minimal context. Moreover a necessary and sufficient condition is presented for parallel independence of graph transformation systems with NACs. In order to facilitate the implementation of the critical pair construction for a graph transformation system with NACs a correct construction is formulated. Finally, it is discussed how to continue with the development of conflict detection and analysis techniques in the near future. },
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2},
Keywords = {conflict detection, confluence, critical pair, graph transformation, negative application condition},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/LEO06a.pdf}
}
@TechReport{LEO06b,
Title = {Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs},
Author = {Lambers, L. and Ehrig, H. and Orejas, F.},
Institution = {Technische Universit\"{a}t Berlin},
Year = {2006},
ISBN = {issn 1436-9915}
}
@InProceedings{LEO05,
Title = {{Efficient detection of conflicts in graph-based model transformation}},
Author = {Lambers, L. and Ehrig, H. and Orejas, F.},
Booktitle = {Proc. International Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Address = {Tallinn, Estonia},
Month = {September},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {152},
Abstract = {Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are required properties. Only under these two conditions, existence and uniqueness of the outcoming model is ensured. Verifying confluence of a graph transformation system is equivalent to checking both local confluence and termination. A graph transformation system is locally confluent, if all its conflicts in a minimal context can be resolved. Formally, this means, that all critical pairs of the graph transformation system should be strictly confluent. Thus, answering the question of local confluence of a graph transformation system, requires the following two steps. At first, the computation of all critical pairs is necessary. Secondly, this set of critical pairs has to be tested for strict confluence. This paper concentrates on the first step, proposing an efficient method to compute the set of all critical pairs of a given graph transformation system. Efficiency is obtained, because of the following two main reasons. At first, all pairs of rules are analyzed to check, if they can actually cause a conflict. Then for each conflict inducing pair of rules, the set of critical pairs is computed in a constructive way, avoiding needless computations. },
Keywords = {conflict, confluence, critical pair, model transformation, graph transformation},
Url = {http://www.sciencedirect.com/science/article/pii/S1571066106001411}
}
@InProceedings{LEOP08,
Title = {{Parallelism and Concurrency in Adhesive High-Level Replacement Systems with Negative Application Conditions}},
Author = {Lambers, L. and Ehrig, H. and Orejas, F. and Prange, U.},
Booktitle = {{Proceedings of the ACCAT workshop at ETAPS 2007}},
Year = {2008},
Editor = {Ehrig, H. and Pfalzgraf, J. and Prange, U.},
Pages = {43--66},
Publisher = {Elsevier},
Series = entcs,
Volume = {203 / 6},
Abstract = {The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions. These conditions restrict the application of a rule by expressing that a specific structure should not be present before or after applying the rule to a certain context. Such a condition influences thus each rule application or transformation and therefore changes significantly the properties of the replacement system. The effect of negative application conditions on parallelism and concurrency in the replacement system is described in the generalization of the following results, formulated already for adhesive HLR systems without negative application conditions: Local Church-Rosser Theorem, Parallelism Theorem and Concurrency Theorem. These important generalized results will support the development of formal analysis techniques for adhesive HLR systems with negative application conditions.},
ISBN = {ISSN 1571-0661},
Keywords = {adhesive HLR systems, graph transformation, negative application conditions},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/LEOP08.pdf}
}
@InProceedings{LEPO08,
Title = {{Embedding and Confluence of Graph Transformations with Negative Application Conditions}},
Author = {Lambers, L. and Ehrig, H. and Prange, U. and Orejas, F.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Editor = {Ehrig, H. and Heckel, R. and Rozenberg, G. and Taentzer, G.},
Pages = {162--177},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = {The goal of this paper is the generalization of embedding and confluence results for graph transformation systems to transformation systems with negative application conditions (NACs). These conditions restrict the application of a rule by expressing that a specific structure must not be present before or after applying the rule to a certain context. Such a condition influences each rule application and transformation and therefore changes significantly the properties of the transformation system. This behavior modification is reflected by the generalization of the Embedding Theorem and the Critical Pair Lemma or Local Confluence Theorem, formulated already for graph transformation systems without negative application conditions. The results hold for adhesive high-level replacement systems with NACs and are formulated in this paper for the instantiation to double-pushout graph transformation systems with NACs. All constructions and results are explained on a running example.},
ISBN = {ISBN 978-3-540-87404-1},
Keywords = {graph transformation, embedding, confluence, formal analysis, negative application conditions},
Location = {Leicester, UK},
Url = {http://www.springerlink.com/index/b7798t7077lq6020.pdf}
}
@InProceedings{LET08,
Title = {{Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences}},
Author = {Lambers, L. and Ehrig, H. and Taentzer, G.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08)},
Year = {2008},
Editor = {C. Ermel, J. de Lara and R. Heckel},
Publisher = eceasst,
Volume = {10},
Abstract = {In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence of rules is applicable (resp. not applicable) on a given graph? Of course, it is possible to use a trial and error strategy to find out the answer to these questions. In this paper however, we will formulate suitable sufficient criteria for applicability and other ones for non-applicability. These criteria can be checked in a static way i.e. without trying to apply the whole rule sequence explicitly. Moreover if a certain criterion is not satisfied, then this is an indication for reasons why rule sequences may or may not be applicable. Consequently it is easier to rephrase critical rule sequences. The results are formulated within the framework of double pushout (DPO) graph transformations with negative application conditions (NACs). },
ISBN = {{ISSN 1863-2122}},
Keywords = {graph transformation, analysis, applicability of rules},
Location = {Budapest, Hungary},
Url = {http://journal.ub.tu-berlin.de/eceasst/issue/view/19}
}
@TechReport{LET08a,
Title = {Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences},
Author = {Lambers, L. and Ehrig, H. and Taentzer, G.},
Institution = {Technische Universit\"{a}t Berlin},
Year = {2008},
Number = {2008-2},
Abstract = {In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence of rules is applicable (resp. not applicable) on a given graph? Of course, it is possible to use a trial and error strategy to find out the answer to these questions. In this paper however, we will formulate suitable sufficient criteria for applicability and other ones for non-applicability. These criteria can be checked in a static way i.e. without trying to apply the whole rule sequence explicitly. Moreover if a certain criterion is not satisfied, then this is an indication for reasons why rule sequences may or may not be applicable. Consequently it is easier to rephrase critical rule sequences. The results are formulated within the framework of double pushout (DPO) graph transformations with negative application conditions (NACs).},
ISBN = {ISSN 1436-9915},
Keywords = {graph transformation, rule sequences, applicability criteria},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-02.pdf}
}
@TechReport{LJM+08,
Title = {Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams: Long Version},
Author = {Lambers, L. and Jurack, S. and Mehner, K. and Runge, O. and Taentzer, G.},
Institution = {Technische Universit\"{a}t Berlin},
Year = {2008},
Number = {2008-11},
Abstract = {In use case-driven approaches to requirements modeling, UML activity diagrams are a wide-spread means for refining the functional view of use cases. Early consistency validation of activity diagrams is therefore desirable but difficult due to the semi-formal nature of activity diagrams. In this paper, we specify well-structured activity diagrams and define activities more precisely by pre- and post- conditions. They can be modeled by interrelated pairs of object diagrams based on a domain class diagram. This activity refinement is based on the theory of graph transformation and paves the ground for a consistency analysis of the required system behavior. A formal semantics for activity diagrams refined by pre- and post-conditions allows us to establish sufficient criteria for consistency. The semi-automatic checking of these criteria is supported by a tool for graph transformation. },
ISBN = {ISSN 1436-9915},
Keywords = {graph transformation, activity diagrams, consistent behavior modeling},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-11.pdf}
}
@InProceedings{LMEP08,
Title = {{ A Formal Framework for Developing Adaptable Service-Based Applications}},
Author = {Lambers, L. and Mariani, L. and Ehrig, H. and Pezze, M.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'08)},
Year = {2008},
Editor = {J.L.\ Fiadeiro and P. Inverardi},
Pages = {392--406},
Publisher = Springer,
Series = lncs,
Volume = {4961},
Abstract = {Web services are open, interoperable, easy to integrate and reuse, and are extensively used in many application domains. Research and best practices have produced excellent support for developing large-scale web-based applications implementing complex business processes. Flexibility and interoperability of web services make them well suited also for highly-customizable reactive service-based applications, that is interactive applications which serve few users, and can be rapidly adapted to new requirements and environmental conditions. This is the case, for example of personal data managers tailored to the needs of few specific users who want to adapt them to different conditions and requests. Classic development approaches that require experts of web service technologies do not well support this class of applications which call for rapid individual customization and adaptation by non-expert users. In this paper, we present the formal framework of a model-based approach that provides expert users with the ability of rapidly building, adapting and reconfiguring reactive service-based applications according to new requirements and needs. Moreover this formal approach will presumably allow adaptations and reconfigurations by non-expert users as well. The underlying technique integrates two user-friendly, visual and executable formalisms: live sequence charts, to describe control flow, and graph transformation systems, to describe data flow and processing. Main results of the paper are the specification and semantics of the integration and early analysis techniques revealing inconsistencies.},
Doi = {10.1007/978-3-540-78743-3},
ISBN = {978-3-540-78742-6},
Keywords = {web service reconfiguration, graph transformation, live sequence charts},
Location = {Budapest, Hungary},
Url = {http://www.springerlink.com/content/y24k478ww2212259/}
}
@InProceedings{LMPE07,
Title = {Iterative Model-driven Development of Adaptable Service-Based Applications},
Author = {Lambers, L. and Mariani, L. and Pezze, M. and Ehrig, H.},
Booktitle = {Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering ASE 07},
Year = {2007},
Pages = {453--456},
Publisher = {ACM},
Abstract = {Flexibility and interoperability make web services well suited for designing highly-customizable reactive service-based applications, that is interactive applications that can be rapidly adapted to new requirements and environmental conditions. This is the case, for example of personal data managers that many users tailor to their needs to meet different usage conditions and requests. In this paper, we propose a model-based approach that provides users with the ability of rapidly developing, adapting and reconfiguring reactive service-based applications to meet new requirements and needs. Users specify their needs by describing sample executions that include interactions with web services through an intuitive interface. Interactions are stored in a visual formalism that integrates live sequence charts with graph transformation systems. Models can be visualized, modified, executed and automatically analyzed to identify inconsistencies.},
Doi = {http://doi.acm.org/10.1145/1321631.1321707},
ISBN = {ISBN 978-1-59593-882-4},
Keywords = {visual languages, live sequence charts, graph transformations, service integration, automated analysis},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/LMPE07.pdf}
}
@Article{LBE+07,
Title = {{A}ttributed {G}raph {T}ransformation with {N}ode {T}ype {I}nheritance},
Author = {Lara, {J. de} and Bardohl, R. and Ehrig, H. and Ehrig, K. and Prange, U. and Taentzer, G.},
Journal = TCS,
Year = {2007},
Number = {3},
Pages = {139--163},
Volume = {376},
Abstract = {The aim of this paper is to integrate typed attributed graph transformation with node type inheritance. Borrowing concepts from object oriented systems, the main idea is to enrich the attributed type graph with an inheritance relation and a set of abstract nodes. In this way, a node type inherits the attributes and edges of all its ancestors. Based on these concepts, it is possible to define abstract productions, containing abstract nodes. These productions are equivalent to a number of concrete productions, resulting from the substitution of the abstract node types by the node types in their inheritance clan. Therefore, productions become more compact and suitable for their use in combination with meta-modelling. The main results of this paper show that attributed graph transformation with node type inheritance is fully compatible with the existing concept of typed attributed graph transformation.},
Doi = {http://dx.doi.org/10.1016/j.tcs.2007.02.001},
File = {LBE+07.pdf:LBE+07.pdf:PDF},
ISBN = {ISSN 0304-3975},
Keywords = {graph transformation, meta-modeling, visual languages},
Url = {http://dx.doi.org/10.1016/j.tcs.2007.02.001}
}
@Article{Lar03,
Title = {{Meta-Modelling and Graph Transformation for the Simulation of Systems}},
Author = {de Lara, J.},
Journal = BEATCS,
Year = {2003},
Month = {October},
Volume = {81},
Abstract = {Complex (physical and software) systems have components with different nature that may have to be described using different formalisms. For the simulation or analysis of properties of the whole system, our approach is to transform each component into a common formalism with appropriate analysis or simulation methods. This approach is realized by building meta-models of the different formalisms and expressing their translation using attributed graph transformation. Other model manipulations such as simulation and optimization can also be expressed with graph transformation.},
Keywords = {Meta-Modelling, Graph Transformation, Simulation},
Url = {http://www.cs.tu-berlin.de/%7Emoswald/public/gLar03.ps.gz}
}
@Article{LETE04,
Title = {Parallel Graph Transformation for Model Simulation applied to Timed Transition {P}etri Nets},
Author = {de Lara, J. and Ermel, C. and Taentzer, G. and Ehrig, K.},
Journal = {ENTCS},
Year = {2004},
Pages = {17-29},
Volume = {109},
Abstract = {This paper discusses the use of parallel graph transformation systems for (multi-formalism) modeling and simulation and their implementation in the meta-modeling tool AToM3. Parallel graph transformation is used to describe the application of rule schemes in an unknown context. This is important for obtaining general descriptions of the behavior of visual models like Petri nets. After reviewing the concepts of parallel graph transformation which is based on rule amalgamation according to certain rule interaction schemes, a simulator for Timed Transition Petri Nets is modeled using meta-modeling and parallel graph transformation. The extensions of AToM3 in order to support the definition and application of amalgamated rules are also discussed in the paper.},
Ee = {http://dx.doi.org/10.1016/j.entcs.2004.02.053},
Keywords = {model transformation, graph transformation, timed transition petri nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/LETE04.pdf}
}
@InProceedings{LT04,
Title = {{Automated Model Transformation and its Validation using $AToM^3$ and AGG}},
Author = {de Lara, J. and Taentzer, G.},
Booktitle = {Diagrammatic Representation and Inference},
Year = {2004},
Editor = {Alan Blackwell and Kim Marriott and Atsushi Shimojima},
Publisher = Springer,
Series = {LNAI},
Volume = {2980},
Abstract = {Complex systems are characterized by components that may have to be described using different notations. For the analysis of such a system, our approach is to transform each component (preserving behaviour) into a single common formalism with appropriate analysis methods. Both source and target notations are described by means of meta-modelling whereas the translation is modelled by means of graph transformation. During the transformation process, the intermediate models can be a blend of elements of the source and target notations, but at the end the resulting model should be expressed in the target notation alone. In this work we propose defining also a meta-model for the intermediate process, in such a way that we can apply some validation methods to the transformation. In particular, we show how to prove functional behaviour (confluence and termination) via critical pair analysis and {\em layering conditions}, and discuss other desirable properties of the transformation, namely: syntactic consistency and behaviour preservation. The automation of these concepts has been carried out by combining the AToM3 and AGG tools. },
Keywords = {model transformation, meta modelling, graph transformation, validation}
}
@InCollection{LT05,
Title = {{Modelling and Analysis of Distributed Simulation Protocols with Distributed Graph Transformation}},
Author = {de Lara, J. and Taentzer, G.},
Booktitle = {Proc. of Application of Concurrency to System Design},
Publisher = {IEEE Computer Society Press},
Year = {2005},
Abstract = {This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. In particular, we use distributed typed attributed graph transformation to describe a conservative simulation protocol. We use local control flows for rule execution in each process as the use of a global control would imply a completely synchronized evolution of all processes. These are specified by a {\em Statechart} in which transitions are labelled with rule executions. States are encoded as process attributes, in such a way that rules are only applicable if the process is in a particular state. For the analysis, we introduce a {\em flattening} construction as a functor from distributed to normal graphs. Global consistency conditions can be defined for normal graphs which specify safety properties for the protocol. Once the flattening construction is applied to each rule, the global conditions can then be translated into pre-conditions for the protocol rules, which ensure that the protocol fulfills the global constraints in any possible execution. Finally, the paper also discusses tool support using the AToM$^3$ environment.},
Keywords = {Distributed Graph Transformation, Distributed Simulation, Protocols, Discrete Event Simulation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/LT05.pdf}
}
@InProceedings{LPE06,
Title = {{Termination Criteria for DPO Transformations with Injective Matches}},
Author = {Levendovszky, T. and Prange, U. and Ehrig, H.},
Booktitle = {{Proceedings of Workshop on Graph Transformation and Concurrency (GT-VC 2006)}},
Year = {2006},
Address = {Amsterdam},
Editor = {Rensink, A. and Heckel, R. and K\"onig, B.},
Publisher = {Elsevier Science},
Series = entcs,
Abstract = {Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integrated Computing (MIC). Termination criteria for graph and model transformation systems have become a focused area recently. This paper provides termination criteria for graph and model transformation systems with injective matches and finite input structure. It proposes a treatment for infinite sequences of rule applications, and takes attribute conditions, negative application conditions, and type constraints into account. The results are illustrated on case studies excerpted from real-world transformations, which show the termination properties of the frequently used ``transitive closure'' and ``leaf collector'' transformation idioms. An intuitive comparison with other approaches is also given. },
Keywords = {graph transformation, termination},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/LPE06.pdf}
}
@MastersThesis{Lin11,
Title = {{Algebraic Approach to Timed Petri Nets with Applications to Communication Networks}},
Author = {Lingnau, Pascal},
School = {TU Berlin, Fak. IV},
Year = {2011},
Type = {Diplomarbeit (Master's thesis)},
Url = {http://www.tfs.tu-berlin.de/menue/forschung/abschlussarbeiten/archiv_abschlussarbeiten/}
}
@TechReport{LGM12,
Title = {An Algebraic Approach to Timed Petri Nets with Applications to Communication Networks -- Extended Version},
Author = {Lingnau, P. and Gabriel, K. and Modica, T.},
Institution = {Technische Universit\"at Berlin},
Year = {2012},
Number = {2012/02},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2012}
}
@TechReport{Mue97,
Title = {{S}hifting {D}erivations of non-injective {R}ules in the {A}lgebraic {G}raph {R}ewriting {A}pproaches},
Author = {M{\"u}ller, J{\"u}rgen},
Institution = {Technical University of Berlin},
Year = {1997},
Number = {97-16}
}
@TechReport{Mue97a,
Title = {{A} {N}on-categorical {C}haracterization of {S}equential {I}ndependence for {A}lgebraic {G}raph {R}ewriting and some {A}pplications},
Author = {M{\"u}ller, J{\"u}rgen},
Institution = {Technical University of Berlin},
Year = {1997},
Number = {97-18}
}
@TechReport{Mue97b,
Title = {{T}erminating and {C}yclic {A}lgebraic {G}raph {R}ewriting},
Author = {M{\"u}ller, J{\"u}rgen},
Institution = {Technical University of Berlin},
Year = {1997},
Number = {97-??}
}
@TechReport{Mue96,
Title = {{O}n {T}ermination of {S}ingle-{P}ushout {G}raph {R}ewriting},
Author = {M{\"u}ller, J{\"u}rgen},
Institution = {Technical University of Berlin},
Year = {1996},
Number = {96-38}
}
@MastersThesis{Muel95,
Title = {{Foundations of relational graph rewriting systems}},
Author = {M{\"u}ller, J{\"u}rgen},
School = FB13,
Year = {1995}
}
@PhdThesis{Mar99,
Title = {Relating {A}rrows between {I}nstittutions in a {C}ategorical {F}ramework},
Author = {Martini, A.},
School = {Technische Universit\"at Berlin, Fachbereich Informatik},
Year = {1999}
}
@TechReport{Mar96,
Title = {Elements of Basic Category Theory},
Author = {Martini, A.},
Institution = {Technical University Berlin},
Year = {1996},
Month = {March},
Number = {96-5}
}
@TechReport{MEN96a,
Title = {Graph Grammars - An Introduction to the Double-Pushout Approach},
Author = {Martini, A. and Ehrig, H. and Nunes, D.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-6}
}
@TechReport{MEN96b,
Title = {Basic Concepts of Equational Parameterized Specifications},
Author = {Martini, A. and Ehrig, H. and Nunes, D.},
Institution = {TU Berlin},
Year = {1996},
Number = {96-8}
}
@InProceedings{MW96,
Title = {Specification concepts for data-types in high-level nets},
Author = {Martini, A. and Wolter, U.},
Booktitle = {Kick-Off-Workshop der DFG-Forschergruppe ``Petrinetz-Technologie''},
Year = {1996},
Editor = {Ehrig, H. and Reisig, W. and Weber, H.},
Publisher = {Informatik-Berichte 73, Humboldt-Universit{\"a}t Berlin, 1996.}
}
@InProceedings{MW99,
Title = {A {S}ingle {P}erspective on {A}rrows between {I}nstitutions},
Author = {Martini, A. and Wolter, U.},
Booktitle = {{A}lgebraic {M}ethodology and {S}oftware {T}echnology},
Year = {1999},
Editor = {{Haeberer}, A. M.},
Organization = {7th {I}nternational {C}onference, {AMAST}'98, {A}mazonia, {B}razil, {J}anuary 1999, Proceedings},
Pages = {486--501},
Publisher = Springer,
Series = lncs,
Volume = {1548}
}
@InProceedings{MW98,
Title = {A systematic study of mappings between institutions},
Author = {Martini, A. and Wolter, U.},
Booktitle = {Recent {T}rends in {A}lgebraic {D}evelopment {T}echniques},
Year = {1998},
Editor = {{Parisi-Presicce}, F.},
Organization = {12th {I}nternational {W}orkshop, {WADT}'97, {T}arquinia, {I}taly, {J}une 1997, Selected Papers},
Pages = {300--315},
Publisher = Springer,
Series = lncs,
Volume = {1376}
}
@MastersThesis{Mat02,
Title = {{Konzeption und Implementierung eines Verfahrens zum Nachweis der Konsistenz in einer attributierten Graphgrammatik}},
Author = {Matz, M.},
School = {TU Berlin, Fak. IV},
Year = {2001}
}
@Article{MEE11,
Title = {Formal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Journal = {ECEASST},
Year = {2011},
Volume = {40},
Abstract = {Various kinds of graph transformations and Petri net transformation systems are examples of $\mathcal{M}$-adhesive transformation systems based on $\mathcal{M}$-adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net transformation systems, the RON-Environment, has recently been developed which implements and simulates Petri net transformations based on corresponding graph transformations using AGG. Up to now, the correspondence between Petri net and graph transformations is handled on an informal level. The purpose of this paper is to establish a formal relationship between the corresponding $\mathcal{M}$-adhesive transformation systems, which allow the translation of Petri net transformations into graph transformations with equivalent behavior, and, vice versa, the creation of Petri net transformations from graph transformations. Since this is supposed to work for different kinds of Petri nets, we propose to define suitable functors, called $\mathcal{M}$-functors, between different $\mathcal{M}$-adhesive categories and to investigate properties allowing us the translation and creation of transformations of the corresponding $\mathcal{M}$-adhesive transformation systems.},
Booktitle = {Proc. Int. Workshop on Petri Nets and Graph Transformation Systems},
Editor = {Claudia Ermel and Kathrin Hoffmann},
Owner = {Claudia},
Publisher = {ECEASST},
Timestamp = {2010.12.16},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Article{MEE12,
Title = {Transfer of Local Confluence and Termination between {P}etri Net and Graph Transformation Systems Based on $\mathcal{M}$-Functors},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Journal = {ECEASST},
Year = {2012},
Pages = {1-12},
Volume = {51},
Abstract = {Recently, a formal relationship between Petri net and graph transformation systems has been established using the new framework of \Madh-functors $\Fadh: (\cat{C_1}, \Madh_1) \fun (\cat{C_2}, \Madh_2)$ between \Madh-adhesive categories. This new approach allows to translate transformations in $(\cat{C_1}, \Madh_1)$ into corresponding transformations in $(\cat{C_2}, \Madh_2)$ and, vice versa, to create transformations in $(\cat{C_1}, \Madh_1)$ from those in $(\cat{C_2}, \Madh_2)$. This is helpful because our tool for reconfigurable Petri nets, the RON-tool, performs the analysis of Petri net transformations by analyzing corresponding graph transformations using the AGG-tool. Up to now, this correspondence has been implemented as a converter on an informal level. The formal correspondence results given by our framework make the RON-tool more reliable. In this paper we extend this framework to the transfer of local confluence, termination and functional behavior. In particular, we are able to create these properties for transformations in $(\cat{C_1}, \Madh_1)$ from corresponding properties of transformations in $(\cat{C_2}, \Madh_2)$, where $(\cat{C_1}, \Madh_1)$ are Petri nets with individual tokens and $(\cat{C_2}, \Madh_2)$ typed attributed graphs. This allows us to apply the well-known critical pair analysis for typed attributed graph transformations supported by the AGG-tool in order to analyze these properties for Petri net transformations. },
Booktitle = {Proc. of 5th Workshop on Petri Nets and Graph Transformation (PNGT)},
Editor = {Padberg, J. and Hoffmann, K.},
ISBN = {{ISSN 1863-2122}},
Keywords = {$\mathcal{M}$-adhesive transformation system, graph transformation, Petri net transformation, confluence, termination, functional behavior},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Article{MEE13,
Title = {{Analysis of Hypergraph Transformation Systems in AGG based on M-Functors}},
Author = {Maximova, M. and Ehrig, H. and Ermel, C.},
Journal = {ECEASST},
Year = {2013},
Volume = {58},
Abstract = {Hypergraph transformation systems are examples of M-adhesive transformation systems based on M-adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simu- lation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding M-adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory of M-functors between different M-adhesive transformation systems. We construct a functor between the M-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M-functor with suitable properties. We then use existing results for M-functors to show that analysis results for hypergraph transformation systems can be obtained using AGG by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.},
Booktitle = {Proceedings of the International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'13)},
Editor = {Tichy, M. and Ribeiro, L.},
ISBN = {{ISSN 1863-2122}},
Keywords = {hypergraph transformation systems, graph transformation, confluence analysis, AGG, M-functor},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@Article{DBLP:journals/scp/MaximovaEE15,
Title = {Local confluence analysis of hypergraph transformation systems with
application conditions based on M-functors and {AGG}},
Author = {Maria Maximova and
Hartmut Ehrig and
Claudia Ermel},
Journal = {Sci. Comput. Program.},
Year = {2015},
Pages = {44--70},
Volume = {104},
Abstract = {For typed attributed graph transformation systems, the tool environment Agg supports modelling, simulation and analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. In this paper we establish a formal relationship between the corresponding M -adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behaviour, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This relationship is based on the general theory of M -functors between different M -adhesive transformation systems which is extended in this paper to rules with application conditions. Our main result shows the creation of local confluence based on F -reachable critical pairs for rules with application conditions, where F is a suitable M -functor. We construct a functor between the M -adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M -functor with properties required by the general theory. Hence, analysis results for hypergraph transformation systems can be obtained using Agg for analysing the translated typed attributed graph transformation systems.},
Doi = {10.1016/j.scico.2014.10.002},
ISSN = {0167-6423},
Keywords = {M -adhesive transformation system},
Url = {http://dx.doi.org/10.1016/j.scico.2014.10.002}
}
@TechReport{MEE13a,
Title = {{Analysis of Hypergraph Transformation Systems in AGG based on $\mathcal{M}$-Functors}},
Author = {Maximova, Maria and Ehrig, Hartmut and Ermel, Claudia},
Institution = {Fakult\"at IV, Technische Universit\"at Berlin},
Year = {2013},
Number = {2013/02},
Abstract = {Hypergraph transformation systems are examples of \madh transformation systems based on $\mathcal{M}$-adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding \madh transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory of $\mathcal{M}$-functors between different $\mathcal{M}$-adhesive transformation systems. We construct a functor between the $\mathcal{M}$-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an $\mathcal{M}$-functor with suitable properties. We then use existing results for $\mathcal{M}$-functors to show that analysis results for hypergraph transformation systems can be obtained using AGG by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.},
ISSN = {1436-9915},
Keywords = {graph transformation, critical pair analysis, hypergraph, M-Functor, confluence},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@TechReport{MEE12a,
Title = {Transfer of Local Confluence and Termination between Petri Net and Graph Transformation Systems Based on M-Functors -- Extended Version},
Author = {Maximova, M. and Ehrig, H. and Ermel, C.},
Institution = {Technische Universit\"at Berlin},
Year = {2012},
Number = {2012/08},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2012}
}
@TechReport{MEE11a,
Title = {{Functors between M-adhesive Categories Applied to Petri Net and Graph Transformation Systems}},
Author = {Maria Maximova and Hartmut Ehrig and Claudia Ermel},
Institution = {TU Berlin},
Year = {2011},
Number = {2011/04},
Abstract = {Various kinds of graph transformations and Petri net transformation systems are examples of $\mathcal{M}$-adhesive transformation systems based on $\mathcal{M}$-adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net transformation systems, the RON-Environment, has recently been developed which implements and simulates Petri net transformations based on corresponding graph transformations using AGG. Up to now, the correspondence between Petri net and graph transformations is handled on an informal level. The purpose of this paper is to establish a formal relationship between the corresponding $\mathcal{M}$-adhesive transformation systems, which allow the translation of Petri net transformations into graph transformations with equivalent behavior, and, vice versa, the creation of Petri net transformations from graph transformations. Since this is supposed to work for different kinds of Petri nets, we propose to define suitable functors, called $\mathcal{M}$-functors, between different $\mathcal{M}$-adhesive categories and to investigate properties allowing us the translation and creation of transformations of the corresponding $\mathcal{M}$-adhesive transformation systems. },
Owner = {Claudia},
Timestamp = {2010.12.16},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/}
}
@InProceedings{MMT06,
Title = {{Interaction Analysis in Aspect-Oriented Models}},
Author = {Mehner, K. and Monga, M. and Taentzer, G.},
Booktitle = {Proc. 14th IEEE International Requirements Engineering Conference},
Year = {2006},
Address = {Minneapolis, Minnesota, USA},
Month = {September},
Pages = {66-75},
Publisher = {IEEE Computer Society},
Abstract = { Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between aspects and base entities may reduce the value of aspect-oriented separation of cross-cutting concerns. Some interactions may be intended or may be emerging behavior while others are the source of unexpected inconsistencies. Thus, it is desirable to detect inconsistencies as early as possible, preferably at the modeling level. We propose an approach for analyzing interactions and potential inconsistencies at the level of requirements modeling. We use a variant of UML to model requirements in a use-case driven approach. Activities, which are used to refine use cases, are the join points to compose cross-cutting concerns. The activities and their composition are formalized by using the theory of graph transformation systems, which provides analysis support for the detection of potential conflicts and dependencies between rule-based transformations. This theory is used to effectively reason about potential interactions and inconsistencies caused by aspectoriented composition. The analysis is performed with the graph transformation tool AGG. The automatically analyzed conflicts and dependencies also serve as an additional view that helps in better understanding the potential behavior of the composed system. },
ISSN = {1090-705X},
Keywords = {graph transformation, aspect-oriented computing, requirements engineering, interaction analysis},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/MMT06.pdf}
}
@MastersThesis{Mel98,
Title = {{Design and Realisation of an Attribute Manager for Conditional and Distributed Graph Transformation}},
Author = {Melamed, B.},
School = FB13,
Year = {1998},
Type = {Master's Thesis}
}
@MastersThesis{Mel97,
Title = {Grundkonzeption und -implementierung einer {A}ttributkomponente f\"ur ein {G}raphtransformationssystem},
Author = {Melamed, B.},
School = FB13,
Year = {1997},
Type = {Studienarbeit}
}
@InProceedings{MKR06,
Title = {{Transformation dependency analyis: A comparison of two approaches}},
Author = {Mens, T. and Kniesel, G. and Runge, O.},
Booktitle = {Proc. Conf. Langages et Modeles a Objets},
Year = {2006},
Pages = {167--182},
Publisher = {Hermes Science Publications, Lavoisier},
Abstract = { Transformation dependency analysis is crucial to provide better tool support for current-day software development techniques ï¿½ two prominent examples are program refactoring and model transformation. Unfortunately, it is unclear how existing tools that provide generic support for these techniques relate to each other, due to their difference in terminology, concepts and formal foundations (graphs versus logic). This article reports on the results of an experimental comparison between two tools: AGG and Condor. Among others, we noticed a performance advantage of several orders of magnitude for the logic-based approach. },
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/MKR06.pdf}
}
@InProceedings{MST04,
Title = {{Workshop on Graph-Based Tools}},
Author = {Mens, T. and Sch\"urr, A. and Taentzer, G.},
Booktitle = {Proc. 2nd Int. Conference on Graph Transformation (ICGT'04)},
Year = {2004},
Address = {Rome, Italy},
Editor = {Parisi-Presicce, F. and Bottoni, P. and Engels, G.},
Month = {October},
Pages = {144--160},
Publisher = Springer,
Series = lncs,
Volume = {3256},
Abstract = {Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various application domains. In all these domains, tools are developed that store, retrieve, manipulate and display graphs. It is the purpose of this workshop to summarize the state of the art of graph-based tool development, bring together developers of graph-based tools in different application fields and to encourage new tool development cooperations.},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9},
Keywords = {graph transformation, graph-based tools, workshop},
Url = {http://www.cs.tu-berlin.de/%7Egabi/gMST04.pdf}
}
@InProceedings{MTR04,
Title = {{Detecting Structural Refactoring Conflicts unsing Critical Pair Analysis}},
Author = {Mens, T. and Taentzer, G. and Runge, O.},
Booktitle = {Proc. Workshop on Software Evolution through Transformations: Model-based vs. Implementation-level Solutions (SETra'04), Satellite Event of ICGT'04)},
Year = {2004},
Address = {Rome, Italy},
Editor = {Heckel, R. and Mens, T.},
Month = {October},
Publisher = {ENTCS},
Abstract = { Refactorings are program transformations that improve the software structure while preserving the external behaviour. In spite of this very useful property, refactorings can still give rise to structural conflicts when parallel evolutions to the same software are made by different developers. This paper explores this problem of structural evolution conflicts in a formal way by using graph transformation and critical pair analysis. Based on experiments carried out in the graph transformation tool AGG, we show how this formalism can be exploited to detect and resolve refactoring conflicts.},
Keywords = {graph transformation, UML, software refactoring, critical pair analysis, AGG},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/MTR04.pdf}
}
@Article{MRT07,
Title = {Analysing Refactoring Dependencies Using Graph Transformation},
Author = {Mens, T. and Taentzer, G. and Runge, O.},
Journal = {Software and System Modeling},
Year = {2007},
Number = {3},
Pages = {269-285},
Volume = {6},
Abstract = {Refactoring is a widely accepted technique to improve the structure of object-oriented software. Nevertheless, existing tool support remains restricted to automatically applying refactoring transformations. Deciding what to refactor and which refactoring to apply still remains a difficult manual process, due to the many dependencies and interrelationships between relevant refactorings. In this paper, we represent refactorings as graph transformations, and we propose the techniques of critical pair analysis and sequential dependency analysis to detect the implicit dependencies between refactorings. The results of this analysis can help the developer to make an informed decision of which refactoring is most suitable in a given context and why. We report on several experiments we carried out in the AGG graph transformation tool to support our claims.},
Keywords = {refactoring, graph transformation, critical pair analysis, sequential dependency analysis, AGG},
Publisher = Springer,
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/MTR07.pdf}
}
@InProceedings{MP96a,
Title = {Grundz{\"u}ge der regelbasierten {V}erfeinerung von {P}etrinetzen},
Author = {Merten, A. and Padberg, J.},
Booktitle = {{Kick-O}ff-{W}orkshop der {DFG-F}orschergruppe``{P}etrinetz-{T}echnologie''},
Year = {1996},
Address = {{H}umboldt-{U}niversit{\"a}t zu {B}erlin},
Editor = {Weber, H. and Ehrig, H. and Reisig, W.},
Publisher = {Informatik- {B}ericht 73}
}
@InProceedings{Mod10,
Title = {Towards Formal Algebraic Modeling and Analysis of Communication Spaces},
Author = {Tony Modica},
Booktitle = {CALCO Young Researchers Workshop (CALCO-jnr 2009) -- Selected Papers},
Year = {2010},
Editor = {Magne Haveraaen and Marina Lenisa and John Power and Monika Seisenberger},
Number = {5-2010},
Pages = {89--103},
Publisher = {Universit\`a di Udine -- Dipartimento di Matematica e Informatica},
Series = {Technical Report},
Abstract = {We subsume Communication Spaces (CS) as communication-based systems taking into account the central notions of interpretation of content in contexts, communication roles, and allowing for human-centric demands, e.g. adaption to environment and preferences. Since most of the well-known formal modeling approaches are adequate only for specific aspects or limited views of systems considered as CS, in this article a new formal approach is advocated. This approach is an integration and extension of the well-established modeling techniques of algebraic high-level Petri nets and rule-based graph transformation, intended to cover the main aspects of CS and to analyze and verify properties specific to them. We demonstrate the new approach of Algebraic Higher-Order Net with Individual Tokens (AHOI nets) on an example modeling of the widely known Internet telephone software Skype. This allows us to discuss the advantages of AHOI nets w.r.t. needs of a basic modeling of CS.},
Institution = {Universit\`a di Udine -- Dipartimento di Matematica e Informatica},
Keywords = {Communication Spaces, higher-order Petri nets, visual languages},
Owner = {TonyModica},
Timestamp = {2010.02.02},
Type = {Technical Report},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers10/Mod10.pdf}
}
@PhdThesis{Mod12,
Title = {Formal Modeling, Simulation, and Validation of Communication Platforms},
Author = {Tony Modica},
School = {School of Electrical Engineering and Computer Science, Technische Universit\"at Berlin},
Year = {2012},
Note = {Submitted},
Owner = {Claudia},
Timestamp = {2012.03.14}
}
@TechReport{Mod06,
Title = {Eine attributierte getypte Graphgrammatik zum syntaxgesteuerten Editieren von UML State Machines},
Author = {Modica, Tony},
Institution = {TU Berlin, Fak. IV},
Year = {2006},
Number = {2006/06},
Abstract = {This article discusses a formal definition of the visual language of UML State Machines via a graph grammar. This is done with special consideration of the definition of State Machines by a meta model in the UML. We are using the categorical framework of graph transformations with double-pushouts. Beside defining the visual language of UML State Machines the rules in this graph grammar shall be suitable for use in a syntax-directed editor and for generating automatically an editor respectivly. Note: This article is based on the article ï¿½A typed attributed Graph Grammar for syntax-directed editing of UML Sequence Diagramsï¿½ by Frank Hermann, extends the graph grammar in his work and suggests adjustments for the integration of both graph grammars.},
ISSN = {ISSN 1436-9915},
Keywords = {graph transformation, visual languages, uml, state machines},
Url = {http://iv.tu-berlin.de/TechnBerichte/2006/2006-06.pdf}
}
@InProceedings{MBE09,
Title = {{An ECLIPSE Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models}},
Author = {Tony Modica and Enrico Biermann and Claudia Ermel},
Booktitle = {GI-Workshop on Methodological Development of Modelling Tools},
Year = {2009},
Abstract = {Model-based development has an increasing importance in modern softwareengineering and other domains. Visual models such as Petri nets andUMLdiagrams proved to be an adequate way to illustrate many structuraland behavioralsystem properties. However, while tooling for textual modeling is pretty mature now,visual tool builders are faced with a much higher complexity regarding the representation of model properties, and the interplay of the concrete syntax (theviews) withthe underlying abstract model representation, e.g. based on Java,XML or the EclipseModeling Framework (EMF). In order to ease the development of visual editors, the Graphical Editing Framework (GEF) offers layout and rendering possibilities, as wellas an architecture that allows to integrate models based on EMF, Javaor XMI withtheir visual views and editors. Unfortunately, the structure of GEF is quite complex touse if editors are not simply one-to-one representations of model elements, or if more than one view is needed at a time for more complex models. Based on several years of experience in teaching the development of GEF-based visual editors for complex visual models to students, we developed MUVITORKIT (Multi-View Editor Kit), a framework for rich-featured visual editors, which is presentedin this paper. MUVITORKIT is based on EMF and GEF, and supports nested models, models needing multiple graphical viewers, and animated simulation of model behavior. The architecture of MUVITORKIT is designed in a way that encapsulates the complex underlying mechanisms in GEF and simplifies the integration in the ECLIPSE workbench.},
Owner = {Claudia},
Timestamp = {2009.05.12},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers09/MBE09a.pdf}
}
@Misc{MBE09a,
Title = {An ECLIPSE Framework for Rapid Development of Rich-featured GEF Editors based on EMF Models: Long Version},
Author = {Modica, T. and Biermann, E. and Ermel, C.},
HowPublished = {Internal Report},
Year = {2009},
Abstract = {Model-based development has an increasing importance in modern software engineering and other domains. Visual models such as Petri nets and UML diagrams proved to be an adequate way to illustrate many structural and behavioral system properties. However, while tooling for textual modeling is pretty mature now, visual tool builders are faced with a much higher complexity regarding the representation of model properties, and the interplay of the concrete syntax (the views) with the underlying abstract model representation, e.g. based on Java, XML or the Eclipse Modeling Framework (EMF). In order to ease the development of visual editors, the Graphical Editing Framework (GEF) offers layout and rendering possibilities, as well as an architecture that allows to integrate models based on EMF, Java or XMI with their visual views and editors. Unfortunately, the structure of GEF is quite complex to use if editors are not simply one-to-one representations of model elements, or if more than one view is needed at a time for more complex models. Based on several years of experience in teaching the development of GEF-based visual editors for complex visual models to students, we developed MUVITORKIT (Multi-View Editor Kit), a framework for rich-featured visual editors, which is presented
in this paper. MUVITORKIT is based on EMF and GEF, and supports nested models, models needing multiple graphical viewers, and animated simulation of model behavior. The architecture of MUVITORKIT is designed in a way that encapsulates the complex underlying mechanisms in GEF and simplifies the integration in the ECLIPSE workbench.},
Owner = {Claudia},
Timestamp = {2009.05.12},
Url = {http://www.user.tu-berlin.de/lieske/tfs/roneditor/files/MuvitorKit_GI09_long.pdf}
}
@InProceedings{MEE+09,
Title = {Modeling Communication Spaces with Higher-Order Petri Nets},
Author = {Tony Modica and Claudia Ermel and Hartmut Ehrig and Kathrin Hoffmann and Enrico Biermann},
Booktitle = {Advances in Multiagent Systems, Robotics and Cybernetics: Theory and Practice},
Year = {2009},
Address = {Tecumseh, Canada},
Editor = {George~E.~Lasker and Jochen Pfalzgraf},
Pages = {43-48},
Publisher = {The International Institute for Advanced Studies in Systems Research and Cybernetics},
Volume = {III},
Abstract = {Communication Spaces (CS) are intended to give a general view on communication-based systems that focuses on the actors and the relations among each other. One of the main aspects of CS is to take into account human-centric demands, e.g. adaption to environment and preferences, interpretation of content in contexts. Since most of the well-known formal modeling approaches are adequate only for specific aspects of CS, we advocate a new formal approach in this article: reconfigurable algebraic higher-order Petri nets with individual tokens (AHOI nets). This approach is an integration of the well-established modeling techniques Petri nets, algebras, and rule-based Petri net transformation (based on graph transformation). It is intended to cover the main aspects of CS and to analyze and verify properties specific to them. In this article, an informal introduction of the new approach is given and demonstrated on an example modeling of the widely known Internet telephone software Skype. This allows us to discuss the advantages of the new formal approach w.r.t. needs of modeling CS and how the new approach could be extended to support more advanced features of Skype and other CS.},
ISBN = {978-1-897233-61-0},
Keywords = {Communication Spaces, higher-order Petri nets, visual languages},
Owner = {TonyModica},
Timestamp = {2010.01.08}
}
@TechReport{MGE+10,
Title = {{L}ow- and {H}igh-{L}evel {P}etri {N}ets with {I}ndividual {T}okens},
Author = {Tony Modica and Karsten Gabriel and Hartmut Ehrig and Kathrin Hoffmann and Sarkaft Shareef and Claudia Ermel and Ulrike Golas and Frank Hermann and Enrico Biermann},
Institution = {Technische Universit{\"a}t Berlin},
Year = {2010},
Note = {\url{http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}},
Number = {2009/13},
Abstract = {In this article, we present a new variant of Petri nets with markings called \engquote{Petri nets with individual tokens}, together with rule-based transformation following the double pushout approach. The most important change to former Petri net transformation approaches is that the marking of a net is no longer a \engquote{collective} set of tokens, but each each has an own identity leading to the concept of Petri nets with individual tokens. This allows us to formulate rules that can change the marking of a net arbitrarily without necessarily manipulating the structure. As a first main result that depends on nets with individual markings we show the equivalence of transition firing steps and the application of firing-simulating rules.
We define categories of low-level and of algebraic high-level nets with individual tokens, called PTI nets and AHLI nets, respectively, and relate them with each other and their collective counterparts by functors.
To be able to use the properties and analysis results of \MCAL{M}-adhesive HLR systems (formerly know as weak adhesive high-level replacement systems) we show in further main results that both categories of PTI nets and AHLI nets are \MCAL{M}-adhesive categories. By showing how to construct initial pushouts we also give necessary and sufficient conditions for the applicability of transformation rules in these categories, known as gluing condition in the literature.},
ISBN = {ISSN 1436-9915},
Owner = {TonyModica},
Timestamp = {2010.05.04},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2009}
}
@Article{MGH11,
Title = {{Transformation of Petri Nets with Individual Tokens}},
Author = {Tony Modica and Karsten Gabriel and Kathrin Hoffmann},
Journal = {ECEASST},
Year = {2011},
Volume = {40},
Booktitle = {Proc. of 4th Workshop on Petri Nets and Graph Transformation (PNGT)},
Editor = {Ehrig, H. and Ermel, C. and Hoffmann, K.},
Owner = {TonyModica},
Timestamp = {2011.02.28}
}
@InProceedings{NHOH10,
Title = {Incremental Service Composition Based on Partial Matching of Visual Contracts},
Author = {Muhammad Naeem and Reiko Heckel and Fernando Orejas and Frank Hermann},
Booktitle = {Proc. Intern. Conf. on Fundamental Aspects of Software Engineering (FASE'10)},
Year = {2010},
Editor = {D. Rosenblum and G. Taentzer},
Pages = {123--138},
Publisher = {Springer},
Series = {{LNCS}},
Volume = {6013},
Doi = {10.1007/978-3-642-12029-9},
ISBN = {ISSN 0302-9743},
Owner = {User},
Timestamp = {2010.09.21},
Url = {http://dx.doi.org/10.1007/978-3-642-12029-9}
}
@MastersThesis{Neu02,
Title = {{Computerunterst\"utzte Analyse von Designentscheidungen in UML-Modellen durch XML-basierte Werkzeugkooperation zwischen CASE Tools und dem Graphtransformationswerkzeug AGG}},
Author = {Neumann, M.},
School = {TU Berlin},
Year = {2002}
}
@Misc{Nic94a,
Title = {Konzeption der statischen Semantik einer algebraischen Spezifikationssprache auf der Basis von Colimeskonstruktionen},
Author = {Nicklisch, Jan},
HowPublished = {Studienarbeit},
Month = {August},
Note = {in german},
Year = {1994}
}
@MastersThesis{Nie99,
Title = {{Konzeption und Implementierung eines generischen Grammatikeditors f\"ur visuelle Sprachen}},
Author = {Niemann, M.},
School = {Technische Universit\"at Berlin, FB Informatik},
Year = {1999}
}
@MastersThesis{Niemann:99,
Title = {Konzeption und {I}mplementierung eines generischen {G}rammatikeditors f{\"u}r visuelle {S}prachen},
Author = {Niemann, M.},
School = {TU Berlin},
Year = {1999}
}
@InProceedings{NB00,
Title = {{T}ool-based {S}pecification of {V}isual {L}anguages and {G}raphic {E}ditors},
Author = {Niemann, M. and Bardohl, R.},
Booktitle = {Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2000)},
Year = {2000},
Pages = {456--470},
Publisher = Springer,
Series = lncs,
Volume = {1785},
Editors = {S. Graf and Michael Schwartzbach}
}
@Article{OBE+13,
Title = {On Propagation-Based Concurrent Model Synchronization},
Author = {Orejas, Fernando and Boronat, Artur and Ehrig, Hartmut and Hermann, Frank and Sch\"olzel, Hanna},
Journal = {Electronic Communications of the EASST},
Year = {2013},
Volume = {57},
Publisher = {European Association of Software Science and Technology}
}
@InProceedings{OE03,
Title = {{Components for Algebra Transformation Systems}},
Author = {Orejas, F. and Ehrig, H.},
Booktitle = {Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA)},
Year = {2003},
Address = {Warsaw, Poland},
Editor = {Bardohl, R. and Ehrig, H.},
Pages = {16},
Publisher = {Elsevier},
Series = entcs,
Volume = {82 (7)},
Abstract = {In this paper we study the instantiation of the generic notion of component introduced before in terms of algebra transformation systems, where refinements are defined by means of high-level replacement rules. With this work we follow two aims. On one hand we show that our generic component concept is not purely syntactic, but it may take into account the semantics of the specifications involved. On the other hand, with this instantiation we strengthen the role of our component concept in the study of component-based heterogeneous systems.},
ISSN = {ISSN: 0304-3975},
Keywords = {Components, Algebraic Specification, Algebra Transformation System},
Url = {http://www.elsevier.com/gej-ng/31/29/23/133/48/show/Products/notes/index.htt#006}
}
@InProceedings{OE00,
Title = {Integration and classification of data type and process specification techniques},
Author = {Orejas, F. and Ehrig, H.},
Booktitle = {INT: Integration of Specification Techniques with Applications in Enginering},
Year = {2000},
Editor = {Ehrig, H. and Gro{\ss}e--Rhode, M. and Orejas, F.},
Pages = {54--56},
Publisher = {TU Berlin, FB 13}
}
@Article{OEK+10,
Title = {A Generic Approach to Connector Architectures Part II: Instantiation to Petri Nets and CSP},
Author = {Orejas, Fernando and Ehrig, Hartmut and Klein, Markus and Padberg, Julia and Pino, Elvira and P\'{e}rez, Sonia},
Journal = {Fundamenta Informaticae},
Year = {2010},
Number = {1},
Pages = {95--124},
Volume = {99},
Abstract = {The aim of this paper is to show how the generic approach to connector architectures, presented in the first part of this work, can be applied to a given modeling formalism to define architectural component and connector notions associated to that formalism. Starting with a review of the generic approach, in this second part of the paper we consider two modeling formalisms: elementary Petri nets and CSP. As main results we show that both cases satisfy the axioms of our component framework, so that the results concerning the semantics of architectures can be applied. Moreover, a small case study in terms of Petri Nets is presented in order to show how the results can be applied to a connector architecture based on Petri nets. },
Address = {Amsterdam, The Netherlands, The Netherlands},
ISSN = {0169-2968},
Publisher = {IOS Press}
}
@InBook{OEP01,
Title = {{Tight and Loose Semantics for Transformation Systems}},
Author = {Orejas, F. and Ehrig, H. and Pino, E.},
Pages = {287--290},
Publisher = Springer,
Year = {2001},
Series = lncs,
Volume = {2267},
Booktitle = {Recent Trends in Algebraic Development Techniques}
}
@InProceedings{OEP08,
Title = {{A Logic of Graph Constraints}},
Author = {Orejas, F. and Ehrig, H. and Prange, U.},
Booktitle = {Proc. Fundamental Approaches to Software Engineering (FASE'08)},
Year = {2008},
Editor = {J.L.\ Fiadeiro and P. Inverardi},
Pages = {179--198},
Publisher = Springer,
Series = lncs,
Volume = {4961},
Abstract = {Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In this sense, after some discussion on these application areas, we concentrate on the problem of how to prove the consistency of specifications based on this kind of constraints. In particular, we present proof rules for three classes of (increasingly more powerful) graph constraints and show that our proof rules are sound and (refutationally) complete for each class.},
Doi = {10.1007/978-3-540-78743-3},
ISBN = {978-3-540-78742-6},
Keywords = {graph transformation, graph constraints, visual modelling, application conditions},
Location = {Budapest, Hungary},
Url = {http://www.springerlink.com/content/u73x201792052314/}
}
@Article{OEP09,
Title = {{Reasoning with Graph Constraints}},
Author = {Fernando Orejas and Hartmut Ehrig and Ulrike Prange},
Journal = {Formal Aspects of Computing},
Year = {2009},
Number = {3--4},
Pages = {385--422},
Volume = {22},
Abstract = {Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websites (i.e. HTML or XML sets of documents). In this sense, after some discussion on these application areas, we concentrate on the problem of how to prove the consistency of specifications based on this kind of constraints. In particular, we present proof rules for two classes of graph constraints and show that our proof rules are sound and (refutationally) complete for each class. In addition, we study clause subsumption in this context as a form to speed up refutation.},
Doi = {10.1007/s00165-009-0116-9},
ISBN = {ISSN 0934-5043},
Url = {http://www.springerlink.com/content/c1142076n323j703/}
}
@InProceedings{ONE89,
Title = {Semantical Constructions for Categories of Behavioral Specifications},
Author = {Orejas, F. and Nivela, P. and Ehrig, H.},
Booktitle = {Computer Science - with Aspects from Topology},
Year = {1989},
Editor = {H. Ehrig and H. Herrlich and {H.-J.} Kreowski and G. Preu{\"s}},
Pages = {220--243},
Publisher = Springer,
Series = lncs,
Volume = {393}
}
@InProceedings{OPE97,
Title = {Institutions for Logic Programming},
Author = {Orejas, F. and Pino, E. and Ehrig, H.},
Booktitle = {TCS 173},
Year = {1997},
Pages = {485--511}
}
@InProceedings{OPE94,
Title = {Algebraic Methods in the Compositional Analysis of Logic Programs},
Author = {Orejas, F. and Pino, E. and Ehrig, H.},
Booktitle = {Proc. MFCS'94 },
Year = {1994},
Publisher = Springer,
Series = lncs,
Volume = {841}
}
@InProceedings{Pad03b,
Title = {Case Study: Modelling Telecom Services with Petri Net Modules},
Author = {Padberg, J.},
Booktitle = {Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA)},
Year = {2003},
Editor = {Roswitha Bardohl and Hartmut Ehrig},
Publisher = {Elsevier},
Series = entcs,
Volume = {82 (7)},
Abstract = {Case studies are frequently used as a means for testing new formalisms and modeling techniques in non-trivial environments. In this case study we use Petri net modules for structuring the operational behavior technique of non-trivial systems. We point out the advantages of our approach as well as possible starting points for further extension and improvements.},
Keywords = {Component-based modeling, Petri nets, case study},
Url = {http://www.cs.tu-berlin.de/%7Epadberg/Publications/Year2003/UNIGRA03.ps.gz}
}
@InProceedings{Pad02,
Title = {{Basic Ideas for Transformations of Specification Architectures}},
Author = {Padberg, J.},
Booktitle = {Proc. Workshop on Software Evolution through Transformations (SET 02), Satellite Event of ICGT'02},
Year = {2002},
Editor = {Heckel, R. and Mens, T. and Wermelinger M.},
Month = {October},
Series = entcs,
Volume = {74},
Abstract = {This contribution gives the formal foundation for specification architectures. Specification architectures are given by diagrams in an arbitrary category of specifications. Hence this is in line with the extension form graph transformations to high-level replacement systems. We then transform diagrams in order to describe model evolution. We distinguish between global transformations, synchronization, and local transformations. The main result of this paper is that the composition of all sub-specifications, i.e. the semantics of the specification architectures is compatible with the transformation. Hence it guarantees that the result of an architecture transformation is the same as the corresponding transformation of the composed sub-specifications. },
Keywords = {Software Architecture, category theory, graph transformation},
Url = {http://www.elsevier.nl/gej-ng/31/29/23/127/49/show/Products/notes/index.htt}
}
@InProceedings{Pad94a,
Title = {Abstract datatype semantics for algebraic high-level nets using dynamic abstract datatypes},
Author = {Padberg, J.},
Booktitle = {Proc. Int. Workshop on Quality of Communication Based Systems},
Year = {1995},
Editor = {G. Hommel},
Pages = {1--18},
Publisher = {Kluwer Academic Publishing}
}
@InCollection{Pad01,
Title = {Classification of Petri Nets Using Adjoint Functors},
Author = {Padberg, J.},
Booktitle = {Current Trends in Theoretical Computer Science},
Publisher = {World Scientific},
Year = {2001},
Editor = {P{\u{a}}un,G. and Rozenberg, G. and Salomaa,A. },
Pages = {171-179}
}
@InCollection{Pad06,
Title = {{Formale Techniken f{\"u}r die Beschreibung von Software-Architekturen}},
Author = {Padberg, J.},
Booktitle = {Handbuch der Software-Architektur},
Publisher = {d-punkt Verlag},
Year = {2006},
Editor = {Reussner, R. and Hasselbring, W.},
Pages = {465-476},
ISBN = {10 3-89864-372-7}
}
@Article{Pad08a,
Title = {{Integration of Categorical Frameworks: {R}ule-Based Refinement and Hierarchical Composition for Components}},
Author = {Padberg, J.},
Journal = {Applied Categorical Structures},
Year = {2008},
Number = {3},
Pages = {333--364},
Volume = {16},
Abstract = {The integration of two important categorical frameworks -- namely adhesive High-Level Replacement (HLR) systems and the generic component concept -- yields a categorical approach to component transformation and refinement. The generic component concept is shown to be an adhesive HLR category, so rules and transformations as well as the corresponding results are available. Moreover, the compatibility with the hierarchical component composition is provided. The extension to rule-based refinement requires additional property-preserving morphisms and yields property-preserving rules and transformations, i.e. refinements where compatibility with the hierarchical component composition again is achieved. The categorical framework is instantiated to typed algebraic high-level (AHL) nets and illustrated with an example of AHL net components.},
Doi = {10.1007/s10485-008-9127-6},
Publisher = Springer,
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/Pad08a.pdf}
}
@InProceedings{Pad06eka,
Title = {{Regelbasierte Verfeinerung von Petri-Netz Modulen}},
Author = {Padberg, J.},
Booktitle = {Tagungsband Entwurf komplexer Automatisierungssysteme EKA 2006},
Year = {2006},
Organization = {Institut f{\"u}r Regelungs- und Automatisierungstechnik TU Braunschweig},
Pages = {57-67},
Abstract = {Petrinetz-Module sind eine formale Komponententechnik, die verschieden Kompositionsoperationen und regelbasierte Verfeinerung umfasst. Dieser Beitrag beschreibt anhand eines kleinen Beispiels Petrinetz-Module. Zwei Petrinetzmodule beschreiben nach ihrer Komposition eine automatisierte Produktionszelle. Die beiden Module haben Sicherheitseigenschaften, die durch die Komposition bewahrt bleiben. Diese Module werden dann regelbasiert verfeinert. Diese beiden Verfeinerungen sind mit der Komposition vertr{\"a}glich und bewahren die Sicherheitseigenschaften.},
ISSN = {ISBN 3-9803363-7-9},
Keywords = {Petrinetz, Modul, regelbasierte Verfeinerung}
}
@TechReport{Pad06TR12,
Title = {Formal Foundation for Transformation-Based Approach to Component Verification},
Author = {Padberg, J. },
Institution = {Technische Universit\"at Berlin,Fakult{\"a}t IV},
Year = {2006},
Number = {2006-12},
Abstract = {The intention of this paper is to extend the generic component framework presented at FASE 2002 to allow component verification based on export-import implications. In the generic component framework components with explicit import, export interfaces and a body specification connected by embeddings and transformations provide hierarchical composition of components with a compositional transformation semantics. We introduce implications that relate sentences of the import stating what the component requires to sentences of the export stating what the component guarantees. The main result of this paper is that these import-export implications are compatible with the hierarchical composition. as given in \cite{EOB+02}. The second part illustrates how this abstract concept can be instantiated to Petri net systems.},
Keywords = {Petri nets, components, verification, Netlab}
}
@Article{Pad05eatcs,
Title = {Integration of the Generic Component Concepts for System Modeling with Adhesive {HLR} Systems},
Author = {Padberg, Julia},
Journal = BEATCS,
Year = {2005},
Pages = {138-155},
Volume = {87},
Abstract = {The integration of two well established theories is presented in this paper, namely the generic framework for components in system modeling and the adhesive HLR systems. The first theory describes components and composition at an abstract level that is independent of the specification technique. The second theory formalizes rules and transformations for an abstract replacement at the same abstract level.The main results are the definition of a weak adhesive HLR category for components, its immediate results as Church-Rosser Theorem, Parallelism Theorem and Concurrency Theorem, and the new compatibility results for the transformation and hierarchical composition. We discuss the instantiation with deterministic automata, Petri nets and others. For these instantiations we immediately have the results mentioned above.},
ISBN = {ISSN 0252-9742},
Keywords = {formal specification, components, transformation},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@Misc{Pad05habil,
Title = {Specification and rule-based refinement of software-components},
Author = {Padberg, Julia},
Note = {Habiltiation Thesis, Technische Universit{\"a}t Berlin},
Year = {2005}
}
@TechReport{PadTR05,
Title = {High-Level Replacement Systems for Software Components},
Author = {Padberg, Julia},
Institution = {Technische Universit\"at Berlin},
Year = {2005},
Number = {2005-07},
Abstract = {Changing environments - commercial, technical or social - demand software systems that can be adapted to those changes with reasonable effort. Component-based systems have been proposed as an adequate support for that task. Today there is no doubt on the importance of component-based systems. There are various specifications for the description of component-based software architectures. Component-based software engineering needs to be backed by thorough formal concepts and modeling techniques, so that the correctness and consistency of the component and the component-based system increase. Formal specification of the component interface and the component specification allow the precise modeling and the verification of required functionality. Moreover, the composition of components can be given formally and correctness and consistency can be ensured even in the composed system. In our approach the formal description is the basis to make the conditions under which a component can be changed or exchanged explicitly. The compatibility of component transformation with component composition is an key issue of component transformation as it represents the core question of changing a component in some given context. The second main results concerns the conditions for the most complex case: transforming both components and their interfaces in different ways and keeping the composition of these components via their interfaces intact. This result is given by the Compatibility Theorem stating that the result of first transforming the two components and the composing them is the same (up to renaming) as composing the two components first and applying then the composed rule. Transformations of components arise whenever a component-based system is changed and new components are introduced, components are replaced by other ones, components are changed, or components are deleted. In this paper we present a formal frame for the description of these transformations.},
ISBN = {1436-9915},
Keywords = {formal specification, components, transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/PadTR05.pdf}
}
@Article{Pad04,
Title = {Safety Properties in {P}etri Net Modules},
Author = {Padberg, J.},
Journal = {Journal on Integrated Design and Process Technology},
Year = {2004},
Abstract = {This paper introduces safety properties in the temporal logic sense to Petri net modules. Petri net moduleshave been achieved by a transfer of algebraic specification modules to Petri nets. They consist of three nets; the interface nets import and export, and the body of the module. The import net states the prerequisites the modules assumes. The body net represents the internal functionality. The export net gives an abstraction of the body that can be used by the environment. The interfaces IMP and EXP are related to the body BOD via morphisms. These modules conform with the basic concepts of components and component-based systems of Continuous Software Engineering (CSE). We make precise what it means that a Petri net module has specific safety properties. We differentiate between explicit and implicit properties. Explicit safety properties are stated additionally to the export net. Implicit are those properties that hold in the export net without being stated explicitly.The main advantage of our approach are module operations to compose larger modules from basic ones. We can show that the composition of modules preserves safety properties: Given two modules with implicit or explicit safety properties then the composition of these modules is again a module with implicit or explicit safety properties.},
Keywords = {modules, Petri nets, stepwise verification},
Organization = {Society for Design and Process Science},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/Pad04.pdf}
}
@TechReport{Pad02b,
Title = {Specification Architectures: Definition, Semantics and Transformation},
Author = {Padberg, J.},
Institution = {Institute for Communication and Software Technology, Technical University Berlin},
Year = {2002},
Number = {TR 2002-11}
}
@Article{Pad03,
Title = {Petri Net Modules},
Author = {Padberg, J.},
Journal = {Journal on Integrated Design and Process Technology},
Year = {2002},
Number = {4},
Pages = {121-137},
Volume = {6},
Abstract = {We present a new module concept for Petri nets that is based on the component concepts of Continuous Software Engineering (CSE). According to that concept two distinguished interfaces are required. These are import and export interfaces. The import describes the assumptions on the environment, e.g. in terms of used components. The export gives an abstraction of the functionality and presents e.g. the offered services. We provide module operations to compose larger modules from basic ones. We propose three different operations, composition, disjoint union, and union. The main result in this contribution is that these module operations are compatible with each other. },
ISSN = {ISSN 1092-0617},
Keywords = {Petri nets, components, modules},
Url = {http://www.cs.tu-berlin.de/%7Epadberg/Publications/Year2002/pnm.ps.gz}
}
@TechReport{Pad01b,
Title = {{Place/Transition Net Modules: Transfer from Algebraic Specification Modules}},
Author = {Padberg, J.},
Institution = {Technical University Berlin},
Year = {2001},
Number = {TR 01-3}
}
@Article{Pad99a,
Title = {{Categorical Approach to Horizontal Structuring and Refinement of High-Level Replacement Systems}},
Author = {Julia Padberg},
Journal = {Applied Categorical Structures},
Year = {1999},
Month = dec,
Number = {4},
Pages = {371--403},
Volume = {7}
}
@Unpublished{Pad99b,
Title = {{Safety Preserving Transformations for Typed High-Level Abstract Petri Nets}},
Author = {J. Padberg},
Note = {Internal Paper},
Year = {1999}
}
@InProceedings{Pad98a,
Title = {{Abstract Petri Nets as a Uniform Approach to High-Level Petri Nets}},
Author = {Padberg, J.},
Booktitle = {Proc. WADT 98},
Year = {1998},
Pages = {240--259},
Publisher = Springer,
Series = lncs,
Volume = {1589}
}
@Article{Pad98b,
Title = {{Classification of Petri Nets Using Adjoint Functors}},
Author = {Julia Padberg},
Journal = BEACTS,
Year = {1998},
Volume = {66}
}
@PhdThesis{Pad96,
Title = {{A}bstract {P}etri {N}ets: {A} {U}niform {A}pproach and {R}ule-{B}ased {R}efinement},
Author = {Padberg, J.},
School = {Technical University Berlin},
Year = {1996},
Note = {Shaker Verlag}
}
@InProceedings{Pad96a,
Title = {An {O}utline of {R}ule-{B}ased {R}efinement for {P}etri {N}ets},
Author = {Padberg, J.},
Booktitle = {Proceedings of the Colloqium on Formal Methods in Concurrency},
Year = {1996},
Organization = {Gesellschaft f{\"u}r Informatik SIG 0.0.1 and SIG 0.1.7}
}
@TechReport{Pad93,
Title = {Survey of High-Level Replacement Systems},
Author = {Padberg, J.},
Institution = TUB,
Year = {1993},
Number = {93/8}
}
@Article{Pad93a,
Title = {Algebraic High-Level Net Transformation Systems: A Survey over Theory and Applications},
Author = {Padberg, J.},
Journal = BEATCS,
Year = {1993},
Pages = {102 - 110}
}
@MastersThesis{Pad92,
Title = {Theory of High-Level Replacement Systems with Application to {P}etri Nets},
Author = {Padberg, J.},
School = {Technical University of Berlin},
Year = {1992},
Type = {Diplomarbeit}
}
@Unpublished{Pad91,
Title = {{K}olimeskonstruktionen in {A}lgebraischen {S}pezifikationssprachen},
Author = {J. Padberg},
Note = {Studienarbeit, Technische Universit\"at Berlin},
Year = {1991}
}
@TechReport{PB01,
Title = {{Structuring with Petri Net Modules: A Case Study}},
Author = {Padberg, J. and Buder, M.},
Institution = {Technical University Berlin},
Year = {2001},
Number = {TR 01-4}
}
@InCollection{PE01,
Title = {{Parametrized Net Classes: A Uniform Approach to Petri Net Classes}},
Author = {Padberg, J. and Ehrig, H.},
Booktitle = {Advances in Petri Nets: Unifying Petri Nets},
Publisher = Springer,
Year = {2001},
Editor = {Ehrig, H. and Juh{\'a}s, G. and Padberg, J. and Rozenberg, G.},
Pages = {173--229},
Series = lncs,
Volume = {2128},
Url = {http://link.springer.de/link/service/series/0558/tocs/t2128.htm}
}
@Article{PE06a,
Title = {{Petri Net Modules in the Transformation-Based Component Framework}},
Author = {Padberg, J. and Ehrig, H.},
Journal = {Journal of Logic and Algebraic Programming},
Year = {2006},
Pages = {198--225},
Volume = {67 / 1-2},
Abstract = {Component-based software engineering needs to be backed by thorough formal concepts and modeling techniques. This paper combines two concepts introduced independently by the two authors in previous papers. On one hand, the concept of Petri net modules introduced at IDPT 2002 in [J. Padberg, Petri net modules, Journal on Integrated Design and Process Technology 6 (4) (2002), pp. 105-120], and on the other hand a generic component framework for system modeling introduced at FASE 2002 in [H. Ehrig, F. Orejas, B. Braatz, M. Klein, M. Piirainen, A generic component concept for system modeling, in: Proceedings of FASE ï¿½02, Lecture Notes in Computer Science, vol. 2306, Springer, 2002]. First we develop a categorical formalization of the transformation based approach to components that is based on pushouts. This is the frame in which we show that Petri net modules can be considered as an instantiation of the generic component framework. This allows applying the transformation based semantics and compositionality result of the generic framework to Petri net modules. In addition to general Petri net modules we introduce Petri net modules preserving safety properties which can be considered as another instantiation of pushout based formalization of the generic framework.},
Keywords = {Petri nets, modules, components, graph transformation, Petri net modules, category theory},
Url = { http://www.sciencedirect.com/science/journal/15678326 }
}
@Article{PE05,
Title = {{P}etri Net Modules in the Transformation-Based Component Framework},
Author = { Padberg, J. and Ehrig, H.},
Journal = {Journal of Logic and Algebraic Programming},
Year = {2005},
Pages = {198-225},
Volume = {67},
Abstract = {Component-based software engineering needs to be backed by thorough formal concepts and modeling techniques. This paper combines two concepts introduced independently by the two authors in previous papers. On one hand, the concept of Petri net modules introduced at IDPT 2002 in \cite{Pad03}, and on the other hand a generic component framework for system modeling introduced at FASE 2002 in \cite{EO+02}. First we develop a categorical formalization of the transformation based approach to components that is based on pushouts. This is the frame in which we show that Petri net modules can be considered as an instantiation of the generic component framework. This allows applying the transformation based semantics and compositionality result of the generic framework to Petri net modules. In addition to general Petri net modules we introduce Petri net modules preserving safety properties which can be considered as another instantiation of pushout based formalization of the generic framework. },
ISBN = {ISSN...},
Keywords = {graph transformation, Petri net modules, components},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/PE05.pdf}
}
@Article{PEH07,
Title = {Formal Modeling and Analysis of flexible Processes in Mobile Ad-Hoc Networks},
Author = {Padberg, J. and Ehrig, H. and Hoffmann, K.},
Journal = BEATCS,
Year = {2007},
Pages = {128--132},
Volume = {91},
Abstract = {Mobile Ad-hoc NETworks (MANETs) consist of mobile nodes which communicate with each other independently from a stable infrastructure, while the topology of the network constantly changes depending on the current position of the nodes and their availability. Unfortunately there are almost no approaches so far for the modeling and the analysis of those MANETs which are urgently needed for a correct course of the relevant processes. In our project "forMAlNET" we aim at modeling flexible processes that are the changing workflows at the nodes of a MANET. It is the goal to develop a formal technique which on the one hand enables the modeling of flexible processes in MANETs and on the other hand supports changes of the network topology and the transformation of processes. This can be achieved by an appropriate integration of graph transformation, Petri nets and processes in high level net classes. In this project a successful application on MANETs requires a specific advancement concerning structuring, process modeling, analysis, methodology and tool support. The achieved results will be validated by a case study in the area of emergency management.},
ISBN = {ISSN 0252-9742},
Keywords = {formal modeling, transformation, flexible process, mobile ad-hoc network},
Url = {http://www.eatcs.org/index.php/eatcs-bulletin}
}
@InProceedings{PEO09,
Title = {Towards Component Verification in the Generic Component Framework},
Author = {Padberg, J. and Ehrig, H. and Orejas, F.},
Booktitle = {Proc. Formal Foundations of Embedded Software and Component-Based Software Architectures (FESCA 07), Satellite Event of the European Joint Conferences on Theory and Practice of Software (ETAPS)},
Year = {2009},
Address = {Amsterdam},
Editor = {Kuester-Filipe, J. and Poernorno, I. and Reussner, R.},
Number = {7},
Pages = {37 -- 53},
Publisher = {Elsevier Science},
Series = {Electronic Notes in Theoretical Computer Science},
Volume = {203},
Abstract = {The intention of this paper is to extend the generic component framework presented at FASE 2002 to allow component verification based on export-import implications. In the generic component framework components with explicit import, export interfaces and a body specification connected by embeddings and transformations provide hierarchical composition of components with a compositional transformation semantics. We introduce implications that relate sentences of the import stating what the component requires to sentences of the export stating what the component guarantees. The main result of this paper is that these import-export implications are compatible with the hierarchical composition. The second part illustrates how this abstract concept can be instantiated to Petri net systems. },
Keywords = {Software Components,Architectures,Abstract Framework, Verification},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/PEO07.pdf}
}
@Article{PER95,
Title = {Algebraic High-Level Net Transformation Systems},
Author = {Padberg, J. and Ehrig, H. and Ribeiro, L.},
Journal = {Mathematical Structures in Computer Science},
Year = {1995},
Pages = {217--256},
Volume = {5}
}
@TechReport{PER93,
Title = {Algebraic High-Level Net Transformation Systems},
Author = {Padberg, J. and Ehrig, H. and Ribeiro, L.},
Institution = TUB,
Year = {1993},
Note = {Revised Verion accepted for Mathematical Structures in Computer Science},
Number = {93-12}
}
@InCollection{PRE01,
Title = {{Behaviour and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs}},
Author = {Padberg, J. and Ehrig, H. and Rozenberg, G.},
Booktitle = {Advances in Petri Nets: Unifying Petri Nets},
Publisher = Springer,
Year = {2001},
Editor = {Ehrig, H. and Juh{\'a}s, G. and Padberg, J. and Rozenberg, G.},
Pages = {230--249},
Series = lncs,
Volume = {2128}
}
@InProceedings{PE02,
Title = {Rule Invariants in Graph Transformation Systems for Analyzing Safety-Critical Systems},
Author = {Padberg, J. and Enders, B.},
Booktitle = {Proc. 1st Int. Conference on Graph Transformation (ICGT'02)},
Year = {2002},
Note = {ISSN 0302-9743, ISBN 3-540-44310-X},
Pages = {334--350},
Publisher = Springer,
Series = lncs,
Volume = {2505},
Abstract = {Automating software engineering activities for developing safety-critical systems reliably and correctly brings along the challenge to combine expressive specification methods with powerful analysis techniques. The focus of this paper lies in the analysis of graph transformation systems by analysis techniques transferred from Petri nets. We have transferred transition invariants to rule invariants in graph transformation systems. This allows a suitable analysis of graph transformation systems as is exemplified by a safety-critical system specification in the area of human-computer interaction. },
Keywords = {Graph transformations, Petri nets, transition invariants},
Url = {http://link.springer.de/link/service/series/0558/papers/2505/25050334.pdf}
}
@InProceedings{PEB00,
Title = {{Rule-Based and Visual Model Evolution using GenGEd}},
Author = {Padberg, J. and Ermel, C. and Bardohl, R.},
Booktitle = {Proc. Graph Transformations for Visual Modeling Techniques (Satellite Workshop of 27th Int. Colloqium on Automata, Languages, and Programming, ICALP'2000)},
Year = {2000},
Note = {Satellite Workshop of ICALP}
}
@InProceedings{PG98,
Title = {{Using High-Level Replacement Systems to Preserve Safety Properties in Place/Transition Net Transformations}},
Author = {Padberg, Julia and Gajewsky, Maike},
Booktitle = {Proc. Sixth International Workshop on {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {1998},
Editor = {Engels, G. and Rozenberg, G.},
Organization = {Universit{\"a}t--Gesamthochschule Paderborn, Fachbereich Mathematik--Informatik},
Pages = {356--365}
}
@InProceedings{PG00,
Title = {{Rule-Based Refinement of Petri Nets For Modeling Train Control Systems }},
Author = {Padberg, Julia and Gajewsky, Maike},
Booktitle = {Petri Nets in Design, Modelling and Simulation of Control Systems, Special Session at the IFAC Conference on Control Systems Design},
Year = {2000},
Editor = {Koz{\'a}k, {\v{S}}. and Huba, M.},
Pages = {299--304}
}
@TechReport{PG00a,
Title = {{Safety Preserving Transformations of Coloured Petri Nets}},
Author = {Padberg, J. and Gajewsky, M.},
Institution = {Technical University Berlin},
Year = {2000},
Number = {2000-13}
}
@InProceedings{PGE98,
Title = {Rule-{B}ased {R}efinement of {H}igh-{L}evel {N}ets {P}reserving {S}afety {P}roperties},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Booktitle = {Fundamental Approaches to Software Engineering},
Year = {1998},
Editor = {Astesiano, E.},
Pages = {221--238},
Publisher = Springer,
Series = lncs,
Volume = {1382}
}
@Article{PGE01,
Title = {Rule-based refinement of high-level nets preserving safety properties},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Journal = {Science of Computer Programming},
Year = {2001},
Note = {\url{www.elsevier.nl/locate/scico}},
Pages = {97--118},
Volume = {40}
}
@TechReport{PGE97,
Title = {{Refinement versus Verification: Compatibility of Net-Invariants and Stepwise Development of High-Level Petri Nets}},
Author = {Padberg, J. and Gajewsky, M. and Ermel, C.},
Institution = {Technical University Berlin},
Year = {1997},
Note = {\url{http://www.cs.tu-berlin.de/cs/ifb/TechnBerichteListe.html}},
Number = {97-22}
}
@InProceedings{PGH99,
Title = {{Incremental Development of Safety Properties in Petri Net Transformations}},
Author = {Padberg, Julia and Gajewsky, Maike and Hoffmann, Kathrin},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Editor = {Engels, G. and Rozenberg, G.},
Pages = {410--425},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{PH99,
Title = {{Horizontal and Vertical Structuring in a Uniform Approach to Petri Nets}},
Author = {Padberg, J. and Hoffmann, K.},
Booktitle = {WADT99},
Year = {1999},
Note = {Abstract}
}
@InProceedings{PHE+07,
Title = {Maintaining Consistency in Layered Architectures of Mobile Ad-Hoc Networks},
Author = {Julia Padberg and Kathrin Hoffmann and Hartmut Ehrig and Tony Modica and Enrico Biermann and Claudia Ermel},
Booktitle = {Fundamental Approaches to Software Engineering},
Year = {2007},
Editor = {Matthew B. Dwyer and Ant\'{o}nia Lopes},
Pages = {383--397},
Publisher = {Springer},
Series = lncs,
Volume = {4422},
Abstract = {In this paper we present a layered architecture for modeling workflows in Mobile Ad-Hoc NETworks (MANETs) using algebraic higher order nets (AHO nets). manets are networks of mobile devices that communicate with each other via wireless links without relying on an underlying infrastructure, e.g. in emergency scenarios, where an effective coordination is crucial among team members, each of them equipped with hand-held devices. Workflows in manets can be adequately modeled using a layered architecture, where the overall workflow, the team membersï¿½ activities and the mobility issues are separated into three different layers, namely the workflow layer, the mobility layer and the team layer. Dividing the AHO net model into layers immediately rises the question of consistency. We suggest a formal notion of layer consistency requiring that the team layer is given by the mapping of the individual memberï¿½s activities to the gluing of the workflow and the mobility layer. The main results concern the maintenance of the layer consistency when changing the workflow layer, the mobility layer and the team layer independently.},
ISBN = {978-3-540-71288-6},
Keywords = {mobile ad-hoc network, Petri net, consistency, layered architecture},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/PHE+07.pdf}
}
@InProceedings{PHG00,
Title = {{Stepwise Introduction and Preservation of Safety Properties in Algebraic High-Level Net Systems}},
Author = {Padberg, Julia and Hoffmann, Kathrin and Gajewsky, Maike},
Booktitle = {Fundamental Approaches to Software Engineering},
Year = {2000},
Editor = {Maibaum, T.},
Pages = {249--265},
Publisher = Springer,
Series = lncs,
Volume = {1783},
Keywords = {algebraic high-level net systems, rule-based refinement, temporal logic, safety properties, safety preserving morphisms, safety introducing rules, safety preserving rules}
}
@Article{PJESH99,
Title = {{Cooperability in Train Control Systems Specification of Scenarios Using Open Nets}},
Author = {Padberg, J. and Jansen, L. and Ehrig, H. and Schnieder, E. and Heckel, R.},
Journal = {{Journal of Integrated Design and Process Technology}},
Year = {2001},
Pages = {3-21},
Volume = {5}
}
@InProceedings{PJHE98,
Title = {{Interoperability in Train Control Systems Specification of Scenarios Using Open Nets}},
Author = {Padberg, J. and Jansen, L. and Heckel, R. and Ehrig, H.},
Booktitle = {Proc. Integrated Design and Process Technology},
Year = {1998},
Organization = {Society for Design and Process Science},
Pages = {17--24}
}
@InProceedings{PK07,
Title = {A component-based verification approach based on {P}etri net components},
Author = {Padberg, J. and K{\"u}ssel, U.},
Booktitle = {Proc. FORMS/FORMAT 2007 - Formal Methods for Automation and Safety in Railway and Automotive Systems},
Year = {2007},
Pages = {40-50},
Publisher = {GZBV},
Abstract = {In this contribution we suggest a method for the component-based verification based on Petri nets. Petri net components are extended with import-export implications. These can be expressed by temporal logic formulae. The satisfaction of these implications guarantees the export statement given in the export interface independently of the component's import.}
}
@Unpublished{PM96,
Title = {{Algebraic High-Level Net Schemes}},
Author = {Padberg, J. and Merten, A.},
Note = {internal paper},
Month = {August},
Year = {1996}
}
@InProceedings{PM07,
Title = {Formal Analysis of Algebraic Higher-Order Nets - Modeling Flexible Processes in Mobile Ad-Hoc Networks},
Author = {Julia Padberg and Tony Modica},
Booktitle = {Advances in Multiagent Systems, Robotics and Cybernetics: Theory and Practice},
Year = {2007},
Address = {Tecumseh, Canada},
Editor = {George~E. Lasker and Jochen Pfalzgraf},
Publisher = {The International Institute for Advanced Studies in Systems Research and Cybernetics},
Volume = {II},
Abstract = {Mobile Ad-hoc NETworks (MANETs) consist of mobile nodes which communicate with each other independently from a stable infrastructure, while the topology of the network constantly changes depending on the current position of the nodes and their availability. Unfortunately there are almost no approaches so far for the modeling and the analysis of those MANETs which are urgently needed for a correct course of the relevant processes. Here, we introduce algebraic higher-order (AHO) nets that have been developed in our project forMAlNET as a formal technique which on the one hand enables the modeling of flexible processes in MANETs and on the other hand supports changes of the network topology and the transformation of processes. They can be roughly described as Petri nets where the tokens are reconfigurable nets and rules for the reconfiguration. This paper concentrates on two important topics for modeling of the flexible processes in MANETs: the analysis of conflict situation and the development of a tool environ-ment for AHO nets.},
ISBN = {978-1-897233-61-0},
Keywords = {mobile ad-hoc networks, workflow modeling, higher-order Petri nets, visual languages}
}
@Unpublished{PR93,
Title = {Using Algebraic High-Level Net Transformations to describe the {HDMS-A} Development System},
Author = {Padberg, J. and Ribeiro, L.},
Note = {Seminararbeit HDMS-A Seminar SS93 TU-Berlin},
Month = {Juli},
Year = {1993}
}
@Unpublished{PR93a,
Title = {Using Algebraic High-Level Net Transformations to Describe the {HDMS-A} Development Process},
Author = {Padberg, J. and Ribeiro, L.},
Note = {Internal report},
Year = {1993}
}
@TechReport{PREC93,
Title = {Formal Requirement Analysis Using Algebraic High-Level Nets and Transformations: a {KorSo} Case Study improving parts of {HDMS-A}},
Author = {Padberg, J. and Ribeiro, L. and Ehrig, H. and Cornelius, F.},
Institution = {TU Berlin},
Year = {1993},
Number = {93/34}
}
@InProceedings{PSE00,
Title = {{New Concepts for High-Level Petri Nets in the Application Domain of Train Control}},
Author = {Padberg, J. and Schiller, P. and Ehrig, H.},
Booktitle = {Proc.\ Vol.\ 2, 9th Symposium on Transportation Systems},
Year = {2000},
Editor = {Schnieder, E. and Becker, U.},
Pages = {153--160}
}
@InProceedings{PT95,
Title = {Embedding of Derivations in High-Level Replacement Systems},
Author = {J. Padberg and G. Taentzer},
Booktitle = {Proc. Colloquium on Graph Transformation and its Application in Computer Science},
Year = {1995},
Editor = {G. Valiente Feruglio and F. Rosello Llompart},
Organization = {Technical Report B-19, Universitat de les Illes Balears}
}
@TechReport{PT92,
Title = {Embedding of Derivations in High-Level Replacement Systems},
Author = {Padberg, J. and Taentzer, G.},
Institution = FB13,
Year = {1993},
Number = {93/9}
}
@InProceedings{PSW00,
Title = {{Petri Net Based Components for Evolvable Architectures: Infrastructures and Business Processes Through Evolutionary Development}},
Author = {Padberg, J. and Weber, H. and S{\"u}nb{\"u}l, A.},
Booktitle = {Proc. of World Conference on Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Organization = {Society for Process Technology}
}
@InProceedings{PWS00,
Title = {{Evolutionary Development of Business Process Centered Architectures Using Component Technologies}},
Author = {Padberg, J. and Weber, H. and S{\"u}nb{\"u}l, A.},
Booktitle = {Proc. of 5th World Conference on Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Organization = {Society for Process Technology}
}
@InProceedings{PE91,
Title = {Algebraic Specification Grammars},
Author = {Parisi-Presicce, F. and Ehrig, H.},
Booktitle = {4th Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1991},
Publisher = Springer,
Series = lncs,
Volume = {532}
}
@InProceedings{PEM87,
Title = {{Graph Rewriting with Unification and Composition}},
Author = {Parisi-Presicce, F. and Ehrig, H. and Montanari, U.},
Booktitle = {3rd Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1987},
Address = {Berlin},
Pages = {496--514},
Publisher = Springer,
Series = lncs,
Volume = {291}
}
@MastersThesis{Par01,
Title = {Formal Semantics of Object Systems with Data-- and Object Attributes},
Author = {Parnitzke, D.},
School = {TU Berlin, Fachbereich Informatik},
Year = {2001},
Month = {January}
}
@MastersThesis{Pas12,
Title = {{Konzeption und Implementierung eines Werkzeugs zur Rekonfiguration von algebraischen High-Level-Netzen}},
Author = {Pascal, Marcus},
School = {TU Berlin, Fak. IV},
Year = {2012},
Type = {Diplomarbeit (Master's thesis)},
Url = {http://www.tfs.tu-berlin.de/menue/forschung/abschlussarbeiten/archiv_abschlussarbeiten/}
}
@Unpublished{Pat91,
Title = {Korrektheit unvollst\"andiger {S}pezifikationen: ein {F}allbeispiel},
Author = {R. Patriarca},
Note = {Studienarbeit, Technische Universit\"at Berlin},
Year = {1991}
}
@InProceedings{Pra08,
Title = {Towards Algebraic High-Level Systems as Weak Adhesive {HLR} Categories},
Author = {Prange, U.},
Booktitle = {{Proceedings of the ACCAT workshop at ETAPS 2007}},
Year = {2008},
Address = {Amsterdam},
Editor = {Ehrig, H. and Pfalzgraf, J. and Prange, U.},
Pages = {67-88},
Publisher = {Elsevier},
Series = entcs,
Volume = {203 / 6},
Abstract = {Adhesive high-level replacement (HLR) systems have been recently established as a suitable categorical framework for double pushout transformations based on weak adhesive HLR categories. Among different types of graphs and graph-like structures, various kinds of Petri nets and algebraic high-level (AHL) nets are interesting instantiations of adhesive HLR systems. AHL nets combine algebraic specifications with Petri nets to allow the modeling of data, dataflow and data changes within the net.
For the development and analysis of reconfigurable systems, not only AHL schemas based on an algebraic specification and AHL nets using an additional algebra should be considered, but also AHL systems which additionally include markings of nets.
In this paper, we summarize the results for different kinds of AHL schemas and nets, and extend these results to AHL systems. The category of markings is introduced, which allows us to give a general construction combining an AHL net with its possible markings leading under certain properties to a weak adhesive HLR category.},
ISBN = {ISSN 1571-0661},
Keywords = {algebraic high-level nets, adhesive HLR categories, category theory},
Location = {Braga, Portugal},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/Pra08.pdf}
}
@InProceedings{PE07,
Title = {{F}rom {A}lgebraic {G}raph {T}ransformation to {A}dhesive {HLR} {C}ategories and {S}ystems},
Author = {Prange, U. and Ehrig, H.},
Booktitle = {{A}lgebraic {I}nformatics. {P}roceedings of {CAI} 2007},
Year = {2007},
Editor = {Bozapalidis, S. and Rahonis, G.},
Pages = {122--146},
Publisher = Springer,
Series = lncs,
Volume = {4728},
Abstract = {In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, critical pairs and confluence are introduced. As a generalization, the categorical framework of adhesive high-level replacement systems is introduced which allows to instantiate the rich theory to several interesting classes of high-level structures.},
Doi = {http://dx.doi.org/10.1007/978-3-540-75414-5_8},
ISBN = {ISBN 978-3-540-75413-8},
Keywords = {graph transformation, category theory},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/PE07.pdf}
}
@InProceedings{PE06,
Title = {{Graph Transformation in Adhesive HLR Categories}},
Author = {Prange, U. and Ehrig, H.},
Booktitle = {{Advances in Multiagent Systems, Robotics and Cybernetics: Theory and Practice. Proceedings of Intern. Conf. on Systems Research, Informatics and Cybernetics 2005}},
Year = {2006},
Address = {Tecumseh, Canada},
Editor = {Lalsker, G.E. and Pfalzgraf, J.},
Publisher = {IIAS},
Volume = {1},
Abstract = {In this paper we introduce the categorical framework for rule-based transformations of high-level structures, e.g. graphs, hypergraphs, typed and attributed graphs, Petri nets, etc. based on adhesive high-level replacement (HLR) categories. This generalizes the classical theory of algebraic graph transformation systems. In particular we analyze the gluing condition for transformations in a categorical way and illustrate it with an example of Petri nets. },
ISSN = {ISBN 1-897 233-36-1},
Keywords = {graph transformation, adhesive HLR category, rule-based transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/PE06.pdf}
}
@InProceedings{PE05a,
Title = {{Graph Transformation in Adhesive HLR Categories}},
Author = {Prange, U. and Ehrig, H.},
Booktitle = {{Proceedings of InterSymp 2005}},
Year = {2005},
Publisher = {IIAS},
Abstract = {In this paper we introduce the categorical framework for rule-based transformations of high-level structures, e.g. graphs, hypergraphs, typed and attributed graphs, Petri nets, etc. based on adhesive high-level replacement (HLR) categories. This generalizes the classical theory of algebraic graph transformation systems. In particular we analyze the gluing condition for transformations in a categorical way and illustrate it with an example of Petri nets. },
Keywords = {graph transformation, adhesive HLR category},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/PE05a.pdf}
}
@InCollection{PEHP08,
Title = {{Transformations in Reconfigurable Place/Transition Systems}},
Author = {Ulrike Prange and Hartmut Ehrig and Kathrin Hoffman and Julia Padberg},
Booktitle = {Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday},
Publisher = Springer,
Year = {2008},
Editor = {Degano, P. and De Nicola, R. and Meseguer, J.},
Pages = {96--113},
Series = lncs,
Volume = {5065},
Abstract = {Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements. For the transformation of Petri nets in the double pushout approach, the categorical framework of adhesive high-level replacement systems has been instantiated to Petri nets. In this paper, we show that also place/transition systems form a weak adhesive high-level replacement category. This allows us to apply the developed theory also to tranformations within reconfigurable place/transition systems.},
ISBN = {978-3-540-68676-7},
Keywords = {Graph Transformation, Petri Nets, High-Level Nets, Higher-Order Nets},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/PEHP08.pdf}
}
@Article{PEL08,
Title = {{Construction and Properties of Adhesive and Weak Adhesive High-Level Replacement Categories}},
Author = {Prange, U. and Ehrig, H. and Lambers, L.},
Journal = {Applied Categorical Structures},
Year = {2008},
Number = {3},
Pages = {365--388},
Volume = {16},
Abstract = {As presented in Ehrig et al. (Fundamentals of Algebraic Graph Transformation, EATCS Monographs, Springer, 2006), adhesive high-level replacement (HLR) categories and systems are an adequate framework for several kinds of transformation systems based on the double pushout approach. Since (weak) adhesive HLR categories are closed under product, slice, coslice, comma and functor category constructions, it is possible to build new (weak) adhesive HLR categories from existing ones. But for the general results of transformation systems, as additional properties initial pushouts, binary coproducts compatible with a special morphism class M and a pair factorization are needed to obtain the full theory. In this paper, we analyze under which conditions these additional properties are preserved by the categorical constructions in order to avoid checking these properties explicitly.},
ISBN = {ISSN 0927-2852},
Keywords = {adhesive HLR category, graph transformation, category theory},
Publisher = Springer,
Url = {http://www.springerlink.com/content/c6145871622p635j/}
}
@Article{Qem02,
Title = {{A New Experience with Graph Transformation}},
Author = {Qemali, A.},
Journal = BEATCS,
Year = {2002},
Month = {June},
Volume = {77},
Abstract = {The contribution is an experience report by a young scientist in a changing enviroment. In fact, she was grown up and has studied Computer Science in Albania, a country which had been isolated until 1990. She gives a report about her experience with Computer Science, especially Web application, in Tirana on one hand, and her new experience with formal methods, especially Graph Transformation, in Berlin on the other hand. },
Keywords = {Graph Transformation},
Url = {http://www.cs.tu-berlin.de/%7Emoswald/public/gQem.ps.gz}
}
@InProceedings{QT04,
Title = {{Towards Validation of Session Management in Web Applications based on Graph Transformation}},
Author = {Qemali, A. and Taentzer, G.},
Booktitle = {Application of Graph Transformations with Industrial Relevance (AGTIVE'03)},
Year = {2004},
Editor = {Pfaltz, J. and Nagl, M. and Boehlen, B.},
Publisher = Springer,
Series = lncs,
Volume = {3062},
Abstract = {The paper addresses the problem of how to create a coherent application out of a series of independent Web pages. We provide a modelling approach for powerful and flexible Web session management based on UML. We propose the definition of a session model concerning consistency issues. The validation of a session model is possible due to the formal basis of our approach using graph transformation.},
Keywords = {Graph Transformation, Session Management, Validation, Web Application}
}
@InProceedings{RKE08,
Title = {{ Deriving Bisimulation Congruences in the Presence of Negative Application Conditions}},
Author = {Rangel, G. and K\"onig, B. and Ehrig, H.},
Booktitle = {Proc. Foundations of Software Science and Computational Structures (FOSSACS'08)},
Year = {2008},
Editor = {R. Amadio},
Pages = {413-427},
Publisher = Springer,
Series = lncs,
Volume = {4962},
Abstract = { In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisimilarity is automatically a congruence. One important aspect that has not been studied so far is the treatment of reduction rules with negative application conditions. That is, a rule may only be applied if certain patterns are absent in the vicinity of a left-hand side. Our goal in this paper is to extend the borrowed context framework to label derivation with negative application conditions and to show that bisimilarity remains a congruence. An important application area is graph transformation and we will present a small example in order to illustrate the theory.},
Doi = {10.1007/978-3-540-78499-9},
ISBN = {978-3-540-78497-5},
Keywords = {bisimilarity, bisimulation congruence, graph transformation, negative application condition},
Location = {Budapest, Hungary},
Url = {http://www.springerlink.com/content/e950520638346408/}
}
@InProceedings{RKE07,
Title = {Bisimulation Verification for the DPO Approach with Borrowed Contexts },
Author = {Rangel, G. and K\"onig, B. and Ehrig, H.},
Booktitle = {Workshop on Graph Transformation and Visual Modelling Techniques (GT-VMT'07)},
Year = {2007},
Editor = {Ehrig, K. and Giese, H.},
Publisher = {Electronic Communications of the EASST},
Abstract = {Bisimilarity is the most widespread notion of behavioral equivalence and hence algorithms for bisimulation checking are of fundamental importance for verifying that two systems are behaviorally equivalent (seen from the perspective of the environment). We investigate this problem in the context of behavioral equivalences of graphs and graph transformation systems, where the extension of the DPO approach to borrowed contexts provides us with a formal basis for reasoning about bisimilarity of graphs. In this paper we extend Hirschkoff's on-the-fly algorithm for bisimulation checking, enabling it to verify whether two graphs are bisimilar with respect to a given set of productions. We then apply this framework to refactoring problems and ver- ify instances of a model transformation which describes the minimization of deterministic finite automata.},
ISBN = {ISSN 1863-2122},
Keywords = { graph transformations,bisimulation, refactoring, automata},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers07/RKE07.pdf}
}
@InProceedings{RLK+08,
Title = {{Behavior Preservation in Model Refactoring using DPO Transformations with Borrowed Contexts}},
Author = {Rangel, G. and Lambers, L. and K\"onig, B. and Ehrig, H. and Baldan, P.},
Booktitle = {Proc. International Conference on Graph Transformation (ICGT'08)},
Year = {2008},
Address = {Heidelberg},
Publisher = Springer,
Series = lncs,
Volume = {5214},
Abstract = {Behavior preservation, namely the fact that the behavior of a model is not altered along the transformations, is a crucial property in refactoring. The most common approaches to behavior preservation rely basically on checking given instances of a model class and their refactored versions. In this paper we introduce a more general technique for checking behavior preservation of refactorings defined by graph transformation rules. We use double pushout (DPO) rewriting with borrowed contexts, and, exploiting the fact that observational equivalence is a congruence, we show how to check refactoring rules for behavior preservation without the need of considering specific instances of the model. When rules are behavior-preserving, their application will never change behavior, i.e., every instance of the model class and its refactored version will have the same behavior. However, often there are refactoring rules describing intermediate steps of the transformation, which are not behavior-preserving, although the full refactoring does preserve the behavior. For these cases we present a procedure to combine refactoring rules to behavior-preserving concurrent productions in order to ensure behavior preservation. An example of refactoring for finite automata is given to illustrate the theory. },
Keywords = {graph transformation, DPO, behavior preservation, model refactoring, borrowed context},
Location = {Leicester, UK},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/RLK+08.pdf}
}
@TechReport{RLK+08a,
Title = {Behavior Preservation on Model Refactoring using DPO Transformations with Borrowed Contexts},
Author = {Rangel, G. and Lambers, L. and Koenig, B. and Ehrig, H. and Baldan P.},
Institution = {Technische Universit\"{a}t Berlin},
Year = {2008},
Number = {2008-12},
Abstract = {Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behavior preservation rely basically on checking given models and their refactored versions. In this paper we introduce a more general technique for checking behavior preservation of refactorings deï¿½ned by graph transformation rules. We use double pushout (DPO) rewriting with borrowed contexts, and, ex- ploiting the fact that observational equivalence is a congruence, we show how to check refactoring rules for behavior preservation. When rules are behavior-preserving, their application will never change behavior, i.e., every model and its refactored version will have the same behavior. However, often there are refactoring rules describing intermediate steps of the transformation, which are not behavior-preserving, although the full refactoring does preserve the behavior. For these cases we present a procedure to combine refactoring rules to behavior-preserving concur- rent productions in order to ensure behavior preservation. An example of refactoring for ï¿½nite automata is given to illustrate the theory. },
ISBN = {ISSN 1436-9915},
Keywords = {graph transformation, model refactoring, borrowed context, behavior preservation},
Url = {http://iv.tu-berlin.de/TechnBerichte/2008/2008-12.pdf}
}
@InProceedings{Rei08,
Title = {{Negative Application Conditions for Reconfigurable Algebraic High-Level Systems}},
Author = {Rein, A.},
Booktitle = {Proc. Third International Workshop on Petri Nets and Graph Transformations},
Year = {2008},
Editor = {Baldan, P. and K\"onig, B.},
Note = {To appear},
Publisher = eceasst,
Abstract = {This paper introduces negative application conditions for reconfigurable algebraic high-level systems. These are algebraic high-level systems, i.e. algebraic high-level nets with an initial marking, together with a set of rules for changing the system dynamically. Negative application conditions are a control structure for restricting the application of a rule if a certain structure is present. The use of negative application conditions is motivated in a short example. Subsequently, the underlying theory is sketched and the most significant results are presented. Finally, the example is resumed and the main results and their usefulness within the example are discussed. },
ISBN = {ISSN 1863-2122},
Keywords = { AHL net, AHL system, net transformation, control structure, negative application condition },
Location = {Leicester, UK},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/Rei08.pdf}
}
@InProceedings{RPL+08,
Title = {{Negative Application Conditions for Reconfigurable Place/Transition Systems}},
Author = {Rein, A. and Prange, U. and Lambers, L. and Hoffmann, K. and Padberg, J.},
Booktitle = {Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'08)},
Year = {2008},
Editor = {C. Ermel, J. de Lara and R. Heckel},
Publisher = eceasst,
Volume = {10},
Abstract = {This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and its marking dynamically. Negative application conditions are a control structure that prohibits the application of a rule if certain structures are already existent. We motivate the use of negative application conditions in a short example. Subsequently the underlying theory is sketched and the results - concerning parallelism, concurrency and confluence - are presented. Then we resume the example and explicitly discuss the main results and their usefulness within the example.},
ISBN = {{ISSN 1863-2122}},
Keywords = {Petri net, net transformation, control structure, negative application condition},
Location = {Budapest, Hungary},
Url = {http://eceasst.cs.tu-berlin.de/index.php/eceasst/article/view/140/150}
}
@InProceedings{RDE+08,
Title = {{Ludo: A Case Study for Graph Transformation Tools}},
Author = {Rensink, A. and Dotor, A. and Ermel, C. and Jurack, S. and Kniemeyer, O. and {de Lara}, J. and Maier, S. and Staijen, T. and Z\"undorf, A.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Year = {2008},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Pages = {493--513},
Publisher = {Springer},
Series = lncs,
Volume = {5088},
Abstract = {In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Graph Transformation Tool Contest. After summarising the case description, we give an overview of the submitted solutions. In particular, we propose a number of dimensions along which choices had to be made when solving the case, essentially setting up a solution space; we then plot the spectrum of solutions actually encountered into this solution space. In addition, there is a brief description of the special features of each of the submissions, to do justice to those aspects that are not distinguished in the general solution space.},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {graph transformation tool, Ludo, case study},
Location = {Kassel, Germany},
Url = {http://www.springerlink.com/index/W87475326301H206.pdf}
}
@InCollection{RT05,
Title = {Ensuring Structural Constraints in Graph-Based Models with Type Inheritance},
Author = {Rensink, A. and Taentzer, G.},
Booktitle = {Proc.\ Fundamental Approaches to Software Engineering (FASE'05)},
Publisher = {Springer},
Year = {2005},
Address = {Berlin},
Pages = {64--79},
Series = lncs,
Volume = {3442},
Abstract = {Graphs are a common means to represent structures in models and meta-models of software systems. A classification of entities and their relations in class structures or type graphs, has proved to be a very valuable concept in the context of graph-based models being e.g. meta-models or graph transformation systems. The constraints that can be imposed by pure typing are, however, relatively weak. In the context of meta-modelling it is common practice to enrich type information with structural properties (such as local invariants or multiplicity conditions) or inheritance. In this paper, we show how to formulate structural properties using graph constraints in type graphs with inheritance, and we show how to translate constrained type graphs with inheritance to equivalent constrained simple type graphs. From existing theory it then follows that graph constraints can be translated into pre-conditions for productions of a typed graph transformation system which ensures those graph constraints. This result can be regarded as a further important step of integrating meta-modelling with graph transformation concepts.},
Keywords = {structural constraints, graph-based models, type inheritance, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/RT05.pdf}
}
@PhdThesis{Rib96,
Title = {Parallel Composition and Unfolding Semantics of Graph Grammars},
Author = {Ribeiro, L.},
School = {TU Berlin},
Year = {1996}
}
@TechReport{Rib96a,
Title = {A Telephone System's Specification using Graph Grammars},
Author = {Ribeiro, L.},
Institution = {Technical University of Berlin},
Year = {1996},
Number = {96-23}
}
@InProceedings{Rib94a,
Title = {Object-Oriented Algebraic High-Level Nets},
Author = {Ribeiro, L.},
Booktitle = {Working papers of the Int. Workshop on Information Systems: Correctness and Reusability, IS-CORE'94},
Year = {1994},
Note = {Tech. Report IR-357, Free University, Amsterdam.}
}
@TechReport{Rib92,
Title = {Extension of {PROSOFT} in order to integrate correct software tools obtained from algebraic specifications},
Author = {Ribeiro, L.},
Institution = {Technical University of Berlin},
Year = {1992},
Number = {92-22}
}
@InProceedings{REK+93,
Title = {Graphical support and integration of formal and semi-formal methods for software specification and development},
Author = {Ribeiro, L. and Ehrig, H. and Korff, M. and Padberg, J. and Nunes, D. and Bardohl, R. and Castro, P.},
Booktitle = {Information Technology: Cooperative Research with Industrial Partners between Germany and Brazil},
Year = {1993},
Address = {Rio de Janeiro, Brazil}
}
@InProceedings{REP93,
Title = {Formal Development of Concurrent Systems Using Algebraic High-Level Nets and Transformations},
Author = {Ribeiro, L. and Ehrig, H. and Padberg, J.},
Booktitle = {Proc. VII Simp\'osio Brasileiro de Engenharia de Software},
Year = {1993},
Address = {Rio de Janeiro},
Month = {oct.},
Note = {Tech-report no. 93-13, TU Berlin},
Pages = {1--16}
}
@TechReport{RP94,
Title = {Algebraic {H}igh-{L}evel {N}ets and {T}ransformations with {I}nitial {M}arkings},
Author = {Ribeiro, L. and Padberg, J.},
Institution = TUB,
Year = {1994},
Number = {94--7}
}
@PhdThesis{Rie93,
Title = {Eine Theorie zur Graphischen Visualisierung algebraischer Spezifikationen},
Author = {Rieckhoff,C.},
School = {TU Berlin},
Year = {1993}
}
@MastersThesis{Roo98,
Title = {{Visuelles Design eines verteilten Filemanagers mit Graphtransformation}},
Author = {Roock, A.},
School = {TU Berlin},
Year = {1998}
}
@InProceedings{Rud00,
Title = {{Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching}},
Author = {Michael Rudolf},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Pages = {238--251},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{Rud98,
Title = {Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching},
Author = {Michael Rudolf},
Booktitle = {Proc.\ 6th Int.\ Workshop on Theory and Application of Graph Transformation (TAGT'98)},
Year = {1998},
Note = {\url{http://www.user.tu-berlin.de/lieske/tfs/publikationen/public1998.html}},
Institution = {University of Paderborn},
Optnumber = {tr-ri-98-21}
}
@MastersThesis{Rud97,
Title = {{Konzeption und Implementierung eines Interpreters f{\"u}r attributierte Graphtransformation}},
Author = {Michael Rudolf},
School = FB13,
Year = {1997},
Note = {\url{http://www.user.tu-berlin.de/lieske/tfs/publikationen/public1997.html}}
}
@MastersThesis{Rud96,
Title = {Konzeption und {I}mplementierung grundlegender {A}spekte der {A}bleitungskomponente eines {G}raphtransformationssystems},
Author = {Rudolf, M.},
School = FB13,
Year = {1996},
Type = {Studienarbeit}
}
@InProceedings{RET12,
Title = {{AGG} 2.0 -- New Features for Specifying and Analyzing Algebraic Graph Transformations},
Author = {Runge, O. and Ermel, C. and Taentzer, G},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, 4th International Symposium, (AGTIVE'11), Proceedings},
Year = {2012},
Editor = {Andy Sch\"urr and Daniel Varro and Gergely Varro},
Publisher = {Springer},
Series = {LNCS},
Volume = {7233},
Abstract = {The integrated development environment AGG supports the specification of algebraic graph transformation systems based on attributed, typed graphs with node type inheritance, graph rules with application conditions, and graph constraints. It offers several analysis techniques for graph transformation systems including graph parsing, consistency checking of graphs as well as conflict and dependency detection in transformations by critical pair analysis of graph rules, an important instrument to support the confluence check of graph transformation systems. AGG 2.0 includes various new features added over the past two years. It supports the specification of complex control structures for rule application comprising the definition of control and object flow for rule sequences and nested application conditions. Furthermore, new possibilities for constructing rules from existing ones (e.g. inverse, minimal, amalgamated, and concurrent rules) and for more flexible usability of critical pair analyses have been realized.},
Location = {Budapest, Hungary, October 4-7, 2011},
Owner = {Claudia},
Timestamp = {2012.05.07}
}
@Article{RKA13,
Title = {{Test Case Generation Using Visual Contracts}},
Author = {Runge, O. and Khan, T. and Heckel, R.},
Journal = {Electronic Communications of the EASST},
Year = {2013},
Volume = {58},
Abstract = {Visual contracts provide a diagrammatic notation for pre- and postconditionsas alternative to the Object-Constraint Language (OCL) or code-levelcontract languages. Using visual contracts for testing, we benefit from their executabilityand formal background in graph transformation to provide model-basedtest oracles and coverage criteria. Based on a static analysis of their dependenciesand conflicts, in this paper we use visual contracts to generate test cases accordingto these coverage criteria.Together with previous work, this adds up to a comprehensive approach aiming toautomate the three major challenges of testing through the use of models.},
Booktitle = {Proceedings of the International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'13)},
Editor = {Tichy, M. and Ribeiro, L.},
ISBN = {{ISSN 1863-2122}},
Keywords = {hypergraph transformation systems, graph transformation, confluence analysis, AGG, M-functor},
Publisher = {European Association of Software Science and Technology},
Url = {http://journal.ub.tu-berlin.de/index.php/eceasst/issue/archive}
}
@TechReport{Sch10,
Title = {Model Transformation of Model Fragments Using Borrowed Context: Extended Version},
Author = {Sch{\"o}lzel, Hanna},
Institution = {TU Berlin},
Year = {2010},
Number = {2010/16},
Abstract = {In this technical report we study the transformation of models in the context of algebraic graph transformation and triple graph grammars. The new contribution of the report is to define and analyze the transformation of model fragments in general and the propagtion of graph constraints in particular. With the borrowed context we developed a technique further to the model transformation with triple graph grammars. This allows a transformation of incomplete models which could not be transformed until now. Moreover, we defined under which conditions a graph constraint can be propagated with borrowed context transformations and the model properties are preserved. This is also analyzed in the case study using the modeling framework ABT-Reo.},
Owner = {Claudia},
Timestamp = {2011.01.06}
}
@InProceedings{SEM+12,
Title = {Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories},
Author = {Sch\"olzel, H. and Ehrig, H. and Maximova, M. and Gabriel, K. and Hermann, F.},
Booktitle = {Proc. Seventh ACCAT Workshop on Applied and Computational Category Theory (ACCAT'12)},
Year = {2012},
Abstract = {Application conditions for rules and constraints for graphs are well-known in the theory of graph transformation and have been extended already toM-adhesive transformation systems. Concerning constraints we distinguish according to the literature between two kinds of satisfaction, called general and initial satisfaction of constraints, where initial satisfaction is defined for constraints over an initial object of the base category. Unfortunately, the standard definition of general satisfaction is not compatible with negation in contrast to initial satisfaction. Based on the well-known restriction of objects along type morphisms we study in this paper restriction and amalgamation of application conditions and constraints together with their solutions. In our main result, we show compatibility of initial satisfaction for positive constraints with restriction and amalgamation, while general satisfaction fails in general. This is based on a result concerning compatibility of compositions via pushouts with restriction, where the proof requires the horizontal van Kampen property, in contrast to the vertical one required forM-adhesive categories.},
Owner = {Claudia},
Timestamp = {2012.01.19}
}
@MastersThesis{Schi99,
Title = {{Application of Petri Nets: Modelling of a Railway Crossing}},
Author = {Schiller, Patricia},
School = {Technical University Berlin},
Year = {1999}
}
@MastersThesis{Sch10a,
Title = {Entwicklung eines visuellen Editors zur Steuerung von EMF-Modelltransformationen },
Author = {Johann Schmidt},
School = {Technische Universit\"at Berlin},
Year = {2010},
Type = {Diplomarbeit (Master Thesis)},
Owner = {Claudia},
Url = {http://www.user.tu-berlin.de/lieske/tfs/Diplomarbeiten/TFSdipl/10-JohannSchmidt.pdf}
}
@Article{SE76,
Title = {Grammars on Partial Graphs},
Author = {Schneider, H.J. and Ehrig, H.},
Journal = {Acta Informatica},
Year = {1976},
Pages = {297--316},
Volume = {6}
}
@Book{SE94,
Title = {Graph Transformations in Computer Science},
Author = {H.-J. Schneider and H. Ehrig},
Publisher = Springer,
Year = {1994},
Series = lncs,
Volume = {776}
}
@MastersThesis{Sch04,
Title = {{Ablaufvorhersage f\"ur verteilte Programme mit Hilfe von Graphtransformationen}},
Author = {J. Schneider},
School = FB13,
Year = {2004}
}
@Article{SEE+99,
Title = {Formale Techniken f{\"u}r die Eisenbahnsicherungstechnik: Anforderungskatalog - Zusammenfassung der Arbeitsunterlagen},
Author = {Schnieder, E. and Einer, S. and Ehrig, H. and al., et},
Journal = {Signal und Draht (Rail Signalling and Telecommunication)},
Year = {1999},
Pages = {38-42},
Volume = {10}
}
@Article{SBE+04,
Title = {{Semantische Konsistenz viewpointorientierter Modellierungstechniken am Beispiel der Produktionsautomatisierung}},
Author = {Schr\"oter, G and Braatz, B. and Ehrig, H. and Klein, M. and Bengel, M.},
Journal = {atp},
Year = {2004},
Month = {August},
Pages = {26--36},
Abstract = {The role of the viewpoint concept, known from software engineering, is of increasing importance for modeling in production automation. While most often only a syntactical consistency check is performed for viewpoint oriented modeling techniques, this work examines semantical consistency. Semantical modeling and model based consistency checks are presented along an example of a machining tool robot.},
ISSN = {0178-2320},
Keywords = {semantical consistency, viewpoints, modelling techniques}
}
@MastersThesis{Schu01,
Title = {{Konzeption und Implementierung eines Parsers f\"ur visuelle Sprachen}},
Author = {Schultzke, T.},
School = {Technische Universit\"at Berlin, FB Informatik},
Year = {2001}
}
@MastersThesis{Schu01a,
Title = {{Concepts and Implementation of a Parser for Visual Languages (in German)}},
Author = {Schultzke, T.},
School = {TU Berlin},
Year = {2001}
}
@MastersThesis{Schw99,
Title = {Konzeption und {I}mplementierung eines generischen {A}lphabeteditors f{\"u}r visuelle {S}prachen},
Author = {Schwarze, M.},
School = {TU Berlin},
Year = {1999}
}
@MastersThesis{ST90,
Title = {Anwendungen und {E}rweiterungen der {T}heorie von {G}raphgrammatiken auf {B}ewegungsprobleme in der {R}obotik},
Author = {H. Schween and G. Taentzer},
School = {TU Berlin},
Year = {1990}
}
@MastersThesis{Sha10,
Title = {{Formal Modelling and Analysis of Reconfigurable Object Nets Based on the RON Editor}},
Author = {Shareef, Sarkaft},
School = {TU Berlin, Fak. IV},
Year = {2010},
Type = {Diplomarbeit (Master's thesis)},
Timestamp = {2010.09.21},
Url = {http://www.tfs.tu-berlin.de/menue/forschung/abschlussarbeiten/archiv_abschlussarbeiten/}
}
@InProceedings{Ste01,
Title = {{Compiling \textsc{Agg} into the Network Linear Graph Reduction System}},
Author = {Stewart, C.},
Booktitle = {Proc. 2nd International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'01)},
Year = {2001},
Address = {Crete, Greece},
Editor = {Luciano Baresi, Mauro Pezze and Gabriele Taentzer},
Month = {June 12--13},
Publisher = {Dipartimento di Elettronica e Informazione Politecnico di Milano}
}
@Article{Ste02,
Title = {{Reducibility between classes of static-port graph grammars}},
Author = {Stewart, C.},
Journal = {Computer and System Sciences (JCSS)},
Year = {2002},
Number = {2},
Pages = {169--223},
Volume = {65}
}
@TechReport{Ste02a,
Title = {{A proof of the reducibility of general port graph grammars to simple port graph grammars}},
Author = {Stewart, C.},
Institution = {Technische Universit\"at Berlin},
Year = {2002},
Number = {2002--1},
ISSN = {ISSN 1436-9915}
}
@InProceedings{Tae01b,
Title = {{Visual Modeling of Distributed Object Systems by Graph Transformation}},
Author = {Taentzer, G.},
Booktitle = {Proc. GETGRATS Closing Workshop},
Year = {2001},
Editor = {M. Bauderon and A. Corradini},
Series = entcs,
Volume = {55},
Keywords = {Distributed Systems, Visual Modelling, Graph Transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Egabi/gTae01b.ps}
}
@InProceedings{Tae06a,
Title = {{Characterizing Tools for Visual Modeling Techniques}},
Author = {Taentzer, G.},
Booktitle = {Lecture Notes of SegraVis Advanced School on Visual Modelling Techniques},
Year = {2006},
Address = {Leicester, UK},
Editor = {Ehrig, K. and Heckel, R. and Lajios, G. },
Month = {September},
Abstract = {In the wide area of visual modeling techniques a large number of CASE and Meta-CASE tools have been developed to define and work with visual modeling techniques. In this report, we mainly concentrate on those tools developed by partners and grant holders of the Research Training Network SegraVis on Syntactic and Semantic Integration of Visual Modeling Techniques. Each tool is shortly introduced and characterized along a criteria catalog for CASE and MetaCASE tools.},
Keywords = {SegraVis, graph transformation tools, CASE tools, Meta-CASE tools, tool comparison},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Tae06a.pdf}
}
@InProceedings{Tae02a,
Title = {{A Visual Modeling Framework for Distributed Object Computing }},
Author = {Taentzer, G.},
Booktitle = {Proc. Formal Methods for Open Object-based Distributed Systems V (FMOODS'02)},
Year = {2002},
Editor = {B. Jacobs and A. Rensink},
Publisher = {Kluwer Academic Publishers},
ISSN = {ISBN 0-7923-7683-8},
Keywords = {Graph Transformation, Distributed Systems},
Url = {http://www.cs.tu-berlin.de/%7Egabi/fmoods02.ps}
}
@InProceedings{Tae03,
Title = {{AGG: A Graph Transformation Environment for System Modeling and Validation}},
Author = {Taentzer, G.},
Booktitle = {Proc. Tool Exihibition at `Formal Methods 2003'},
Year = {2003},
Address = {Pisa, Italy},
Editor = {Margaria, T.},
Month = {September},
Abstract = {AGG is a general development environment for algebraic graph transformation systems which follows the interpretative approach. Its special power comes from a very flexible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environment consists of a graphical user interface comprising several visual editors, an interpreter, and a set of validation tools. The interpreter allows the stepwise transformation of graphs as well as rule applications as long as possible. AGG supports several kinds of validations which comprise graph parsing, consistency checking of graphs and conflict detection in concurrent transformations by critical pair analysis of graph rules. Applications of AGG include graph and rule-based modeling of software, validation of system properties by assigning a graph transformation based semantics to some system model, graph transformation based evolution of software, and the definition of visual languages based on graph grammars.},
Keywords = {Graph Transformation, Tools},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Egabi/public/gTae03.ps.gz}
}
@InProceedings{Tae99,
Title = {{Adding Visual Rules to Object-Oriented Modeling Techniques}},
Author = {Taentzer, G.},
Booktitle = {Technology of Object-Oriented Languages and Systems (TOOLS'99), June 7 - 10, 1999, Nancy, France},
Year = {1999},
Editor = {Mitchell, R. and Wills, A. C. and Bosch, J. and Meyer, B.},
Publisher = {IEEE Computer Society}
}
@InProceedings{Tae01,
Title = {{Towards Common Exchange Formats for Graphs and Graph Transformation Systems}},
Author = {Taentzer, G.},
Booktitle = {Proc. Uniform Approaches to Graphical Process Specification Techniques (UNIGRA'01)},
Year = {2001},
Editor = {J. Padberg},
Series = entcs,
Volume = {44 (4)},
Keywords = {XML, Graph Transformation, Exchange Format},
Url = {http://www.user.tu-berlin.de/lieske/tfs/%7Egabi/gTae01.ps}
}
@InCollection{Tae04,
Title = {{AGG}: A Graph Transformation Environment for Modeling and Validation of Software},
Author = {Taentzer, G.},
Booktitle = {Application of Graph Transformations with Industrial Relevance (AGTIVE'03)},
Publisher = Springer,
Year = {2004},
Address = {Berlin},
Editor = {Pfaltz, J. and Nagl, M. and Boehlen, B.},
Pages = {446 -- 456},
Series = lncs,
Volume = {3062},
Abstract = {AGG is a general development environment for algebraic graph transformation systems which follows the interpretative approach. Its special power comes from a very flexible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environment consists of a graphical user interface comprising several visual editors, an interpreter, and a set of validation tools. The interpreter allows the stepwise transformation of graphs as well as rule applications as long as possible. AGG supports several kinds of validations which comprise graph parsing, consistency checking of graphs and conflict detection in concurrent transformations by critical pair analysis of graph rules. Applications of AGG include graph and rule-based modeling of software, validation of system properties by assigning a graph transformation based semantics to some system model, graph transformation based evolution of software, and the definition of visual languages based on graph grammars.},
Keywords = {Graph Transformation, tools},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/Tae04.pdf}
}
@InProceedings{Tae06,
Title = {{Towards Generating Domain-Specific Model Editors with Complex Editing Commands}},
Author = {Taentzer, G.},
Booktitle = {Proc. International Workshop Eclipse Technology eXchange (eTX), Satellite Event of European Conf. on Object-Oriented Programming (ECOOP)},
Year = {2006},
Abstract = {Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of domain-specific solutions. Usually, domainspecific modeling languages are defined by providing a meta model using the MOF/EMF approach. The language definition can be used to generate a corresponding editor using meta tools such as Eclipse GMF. The meta model defines all symbols and relations of the domain-specific model which can be used to provide an editor with basic editing commands. In addition, further language properties can be formulated by OCL constraints which form the input to a syntax checker. If the modeling language has not only simple syntax structures, syntax-directed editing would increase the convenience. Up to now, meta CASE tools being based on EMF do not provide support for the definition of complex editing commands. A natural way to define editing commands is the formulation by transformation rules, specifying the pre- and post-conditions of each command. The background for this approach is the grammar-based definition of visual modeling languages. While the transformation rules for simple commands can be generated automatically, complex commands are defined by the language designer. The formal basis for this kind of editor definition is given by graph transformation. A meta model-based editor specification extended by such rules shall be used to generate Eclipse plug-ins for domain-specific editing with complex editing commands.},
Keywords = {Eclipse, GMF, editor generation, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/Tae06.pdf}
}
@Article{Tae05,
Title = {{A First Comparison of SegraVis Tools}},
Author = {Taentzer, G.},
Journal = {EASST Newsletter},
Year = {2005},
Pages = {12--23},
Volume = {10},
Abstract = {In the wide area of visual modelling techniques a large number of CASE and Meta-CASE tools have been developed to define and work with visual modelling techniques. In this survey, we concentrate on those tools for visual modelling techniques and languages which have been developed within the SegraVis project. The main purpose of this first comparison is to get an overview on the functionalities of such kind of tools and to better understand each toolï¿½s purpose and features.},
Keywords = {Graph Transformation Tools, SegraVis},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/Tae05.pdf}
}
@Manual{Tae02,
Title = {{XML-based Exchange Formats for Graphs and Graph Transformation Systems}},
Author = {Taentzer, G.},
Organization = {EU Working Group APPLIGRAPH on `Application of Graph Transformation'},
Year = {2002},
Url = {http://www.user.tu-berlin.de/lieske/tfs/projekte/gxl-gtxl.html}
}
@InProceedings{Tae00,
Title = {{AGG: A Tool Environment for Algebraic Graph Transformation}},
Author = {Taentzer, G.},
Booktitle = {Int.\ Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE'99)},
Year = {2000},
Pages = {481--490},
Publisher = Springer,
Series = lncs,
Volume = {1779}
}
@InProceedings{Tae99a,
Title = {{A framework for algebraic graph transformation in Java}},
Author = {Taentzer, G.},
Booktitle = {Proc. Application of Graph Transformations with Industrial Relevance, Subarea Meeting on Tools},
Year = {1999},
Publisher = {RWTH Aachen},
Editors = {M.Nagl and A.Sch{\"u}rr}
}
@Article{Tae99b,
Title = {{Distributed Graphs and Graph Transformation}},
Author = {Taentzer, G.},
Journal = {Applied Categorical Structures},
Year = {1999},
Month = {December},
Number = {4},
Pages = {431--462},
Volume = {7}
}
@InProceedings{Tae98,
Title = {{How to Integrate Graph Transformation with an Object-Oriented Language}},
Author = {Taentzer, G.},
Booktitle = { Proc. of the 6th Int. Workshop on Theory and Application of Graph Transformations (TAGT'98)},
Year = {1998},
Address = {Paderborn, Germany},
Note = {Extended abstract}
}
@Article{Tae97b,
Title = {Parallel High-Level Replacement Systems},
Author = {Taentzer, G.},
Journal = {TCS},
Year = {1997},
Month = {November},
Volume = {186}
}
@Article{Tae94,
Title = {Towards Synchronous and Asynchronous Graph Transformations},
Author = {Taentzer, G.},
Journal = {Special issue of Fundamenta Informaticae},
Year = {1996},
Number = {3,4},
Volume = {26}
}
@InProceedings{Tae95,
Title = {Hierarchically Distributed Graph Transformation},
Author = {Taentzer, G.},
Booktitle = {5th Int.\ Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94},
Year = {1996},
Pages = {304 - 320},
Publisher = Springer,
Series = lncs,
Volume = {1073}
}
@PhdThesis{Tae96,
Title = {Parallel and Distributed Graph Transformation: Formal Description and Application to Communication-Based Systems},
Author = {Taentzer, G.},
School = {TU Berlin},
Year = {1996},
Note = {Shaker Verlag}
}
@Article{Tae96b,
Title = {Modeling Dynamic Distributed Object Structures by Graph Transformation},
Author = {Taentzer, G.},
Journal = {Object Currents},
Year = {1996},
Month = {Dec.},
Note = {http://www.sigs.com/publications/docs/oc/9612/oc9701.f.taentzer.html},
Number = {12},
Volume = {1}
}
@Unpublished{Tae94a,
Title = {Parallel High-Level Replacement Systems},
Author = {Taentzer, G.},
Year = {1994}
}
@Unpublished{Tae94b,
Title = {Hierarchically Distributed Graph Transformations},
Author = {Taentzer, G.},
Note = {extended abstract for 5. int. workshop on graph transformations in Williamsburg, Virginia, USA},
Year = {1994}
}
@Unpublished{Tae93,
Title = {Synchronous and Asynchronous Graph Transformations},
Author = {Taentzer, G.},
Note = {in preparation},
Year = {1993}
}
@TechReport{Tae92,
Title = {Parallel High-Level Replacement Systems},
Author = {Taentzer, G.},
Institution = {TU Berlin},
Year = {1992},
Number = {92/10}
}
@InProceedings{TEHA13,
Title = {Towards refactoring of rule-based, in-place model transformation systems},
Author = {Taentzer, G and Arendt, T. and Ermel, C. and Heckel, R.},
Booktitle = {Proceedings of the First Workshop on the Analysis of Model Transformations (AMT'12)},
Year = {2013},
Address = {New York, NY, USA},
Editor = {Dingel, J. and Lucio, L. and Vangheluwe, H. and Varro, D.},
Publisher = {ACM},
Abstract = {The more model transformations are applied in various application domains, the more questions about their quality arise. In this paper, we present a first approach towards improving the quality of endogenous in-place model transformation systems. This kind of model transformations is typically rule-based and well suited to perform model simulations and optimizations. After discussing suitable quality aims for this kind of model transformation systems and how they can be detected by smells, a first selection of refactorings is presented showing a variety of potential improvements of model transformation systems. Each refactoring is presented in a systematic way including an explanation how the quality is improved, a description of its pre- and postconditions, a possible refactoring strategy, and an example. All discussed refactorings are implemented in Henshin, a model transformation engine based on graph transformation concepts, using Henshin in combination with the Eclipse plug-in EMF Refactor, a refactoring plug-in for defining and applying refactorings of EMF models.},
Doi = {10.1145/2432497.2432506},
ISBN = {978-1-4503-1803-7},
Location = {Innsbruck, Austria},
Url = {http://dl.acm.org/citation.cfm?id=2432497}
}
@Unpublished{TBM97,
Title = {Developing Shipping software by Graph Transformation},
Author = {Taentzer, G. and Bardohl, R. and Melamed, B.},
Note = {technical report, in preparation},
Year = {1997}
}
@InProceedings{BT93,
Title = {Amalgamated Graph Transformation Systems and Their Use for Specifying {AGG} -- an Algebraic Graph Grammar System},
Author = {Taentzer, G. and Beyer, M.},
Booktitle = {Graph Transformations in Computer Science},
Year = {1994},
Publisher = Springer,
Series = lncs,
Volume = {776}
}
@InProceedings{TBB+08,
Title = {{Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools}},
Author = {Taentzer, G. and Biermann, E. and Bisztray, D. and Bohnet, B. and Boneva, I. and Boronat, A. and Geiger, L. and Gei\"s, R. and Horvath, A. and Kniemeyer, O. and Mens, T. and Ness, B. and Plump, D. and Vajk, T.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Year = {2008},
Address = {Heidelberg},
Editor = {Sch\"urr, A. and Nagl, M. and Z\"undorf, A.},
Pages = {514 -- 539},
Publisher = springer,
Series = lncs,
Volume = {5088},
Abstract = {In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest. A Sierpinski triangle shows a well-known fractal structure. This case study is mostly a performance benchmark, involving the construction of all triangles up to a certain number of iterations. Both time and space performance are involved. The transformation rules themselves are quite simple.},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {graph transformation tool, Eclipse EMF, EMF transformation, Sierpinski triangles, case study},
Location = {Kassel, Germany},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/TBB+08.pdf}
}
@InProceedings{TCSE08,
Title = {{Generating Domain-Specific Model Editors with Complex Editing Commands}},
Author = {Taentzer, G. and Crema, A. and Schmutzler, R. and Ermel, C.},
Booktitle = {Applications of Graph Transformation with Industrial Relevance, Proceedings of the Third International AGTIVE 2007 Symposium},
Year = {2008},
Address = {Heidelberg},
Editor = {A. Sch{\"u}rr and M. Nagl and A. Z{\"u}ndorf},
Pages = {98--103},
Publisher = springer,
Series = lncs,
Volume = {5088},
Abstract = {Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of domain-specific solutions. Using the Eclipse Graphical Modeling Framework (GMF), modeling languages are defined by providing a meta model using the MOF/EMF approach. Up to now, GMF provides basic editing commands only. It does not support the definition of complex editing commands which would allow e.g. to insert a complex structure into a diagram in one step. As practical tool support for the design and generation of visual editors with complex editing operations based on graph transformation, an extended version of GMF has been developed and is presented in this paper.},
Confaddress = {Universit\"at Kassel, Germany},
ISBN = {ISBN-13: 978-3540890195},
Keywords = {Eclipse, GMF, editor generation, graph transformation},
Location = {Kassel, Germany},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/TCSE08.pdf}
}
@InProceedings{TE00b,
Title = {Semantics of Distributed System Specifications based on Graph Transformation},
Author = {Taentzer, G. and Ehrig, H.},
Booktitle = {GI Workshop ``Rigorose Entwicklung software-intensiver Systeme'', Berlin},
Year = {2000},
Pages = {57--72},
Publisher = {LMU-Report 0005}
}
@InProceedings{TEG+05,
Title = {{Model Transformation by Graph Transformation: A Comparative Study}},
Author = {Taentzer, G. and Ehrig, K. and Guerra, E. and de Lara, J. and Lengyel, L. and Levendovsky, T. and Prange, U. and Varro, D. and Varro-Gyapay, S.},
Booktitle = {Proc. Workshop Model Transformation in Practice},
Year = {2005},
Address = {Montego Bay, Jamaica},
Month = {October},
Abstract = {Graph transformation has been widely used for expressing model transformations. Especially transformations of visual models can be naturally formulated by graph transformations, since graphs are well suited to describe the underlying structures of models. Based on a common sample model transformation, four different model transformation approaches are presented which all perform graph transformations. At first, a basic solution is presented and crucial points of model transformations are indicated. Subsequent solutions focus mainly on the indicated problems. Finally, a first comparison of the chosen approaches to model transformation is presented where the main ingredients of each approach are summarized.},
Keywords = {graph transformation, model transformation, graph transformation tools},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers05/TEG+05.pdf}
}
@InProceedings{TEHA12,
Title = {Towards Refactoring of Rule-Based, In-Place Model Transformation Systems},
Author = {Taentzer, G and Ermel, C. and Heckel, R. and Arendt, T.},
Booktitle = {Int. Workshop of Automated Model Transformations (AMT 2012)},
Year = {2012},
Abstract = {The more model transformations are applied in various application domains, the more questions about their quality arise.
In this paper, we present a first approach towards improving the quality of endogenous in-place model transformation systems. This kind of model transformations is typically rule-based and well suited to perform model simulations and optimizations.
After discussing suitable quality aims for this kind of model transformation systems and how they can be detected by smells, a first selection of refactorings is presented showing a variety of potential improvements of model transformation systems. Each refactoring is presented in a systematic way including an explanation how the quality is improved, a description of its pre- and post-conditions, a possible refactoring strategy, and an example.
All discussed refactorings are implemented in Henshin, a model transformation engine based on graph transformation concepts, using Henshin in combination with the Eclipse plug-in Refactor, a refactoring plug-in for defining and applying refactorings of EMF models.},
Owner = {Claudia},
Timestamp = {2012.09.17}
}
@Misc{TEHA11a,
Title = {{Towards Refactoring of Graph Transformation Systems -- Long Version}},
Author = {Taentzer, G and Ermel, C. and Heckel, R. and Arendt, T.},
Note = {To Appear as Technical Report at TU Berlin},
Year = {2011},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers11/TEHA11a.pdf}
}
@InProceedings{TELW10,
Title = {Conflict Detection for Model Versioning Based on Graph Modifications},
Author = {Taentzer, G. and Ermel, C. and Langer, P. and Wimmer, M.},
Booktitle = {Proc. of Int. Conf. on Graph Transformations (ICGT'10)},
Year = {2010},
Editor = {Ehrig, H. and Rensink, A. and Rozenberg, G. and Sch\"urr, A.},
Pages = {171--186},
Publisher = {Springer},
Series = {LNCS},
Volume = {6372},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Therefore, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems we present an approach which takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define model revisions as graph modifications which are not necessarily rule-based. Building up on the DPO approach to graph transformations, we define two different kinds of conflict detection: (1) the check for operation-based conflicts, and (2) the check for state-based conflicts on results of merged graph modifications.},
ISBN = {ISSN 0302-9743},
Url = {http://www.springerlink.com/content/vu72w565867k3716/}
}
@Article{TELW14,
Title = {A fundamental approach to model versioning based on graph modifications: from theory to implementation},
Author = {Taentzer, Gabriele and Ermel, Claudia and Langer, Philip and Wimmer, Manuel},
Journal = {Software \& Systems Modeling},
Year = {2014},
Number = {1},
Pages = {239-272},
Volume = {13},
Doi = {10.1007/s10270-012-0248-x},
ISSN = {1619-1366},
Keywords = {Model versioning; Graph modification; Conflict detection; Conflict resolution},
Language = {English},
Owner = {Claudia},
Publisher = {Springer Berlin Heidelberg},
Timestamp = {2014.02.12},
Url = {http://dx.doi.org/10.1007/s10270-012-0248-x}
}
@Article{TELW12,
Title = {A fundamental approach to model versioning based on graph modifications: from theory to implementation},
Author = {Taentzer, Gabriele and Ermel, Claudia and Langer, Philip and Wimmer, Manuel},
Journal = {Software and Systems Modeling},
Year = {2012},
Pages = {1-34},
Abstract = {In model-driven engineering, models are primary artifacts that can evolve heavily during their life cycle. Therefore, versioning of models is a key technique to be offered by integrated development environments for model-driven engineering. In contrast to text-based versioning systems we present an approach that takes model structures and their changes over time into account. Considering model structures as graphs, we define a fundamental approach where model revisions are considered as graph modifications consisting of delete and insert actions. Two different kinds of conflict detection are presented: (1) the check for operation-based conflicts between different graph modifications, and (2) the check for state-based conflicts on merged graph modifications. For the merging of graph modifications, a two-phase approach is proposed: First, operational conflicts are temporarily resolved by always giving insertion priority over deletion to keep as much information as possible. Thereafter, this tentative merge result is the basis for manual conflict resolution as well as for the application of repair actions that resolve state-based conflicts. If preferred by the user, giving deletion priority over insertion might be one solution. The fundamental concepts are illustrated by versioning scenarios for simplified statecharts. Furthermore, we show an implementation of this fundamental approach to model versioning based on the Eclipse Modeling Framework as technical space.},
Doi = {10.1007/s10270-012-0248-x},
ISSN = {1619-1366},
Keywords = {Model versioning; Graph modification; Conflict detection; Conflict resolution},
Language = {English},
Publisher = {Springer-Verlag},
Url = {http://dx.doi.org/10.1007/s10270-012-0248-x}
}
@TechReport{TELW10a,
Title = {Conflict Detection for Model Versioning Based on Graph Modifications: Long Version},
Author = {Gabriele Taentzer and Claudia Ermel and Philip Langer and Manuel Wimmer},
Institution = {TU Berlin},
Year = {2010},
Number = {2010/09},
Abstract = {In model-driven engineering, models are primary artifacts and can evolve heavily during their life cycle. Therefore, versioning of models is a key technique which has to be offered by an integrated development environment for model-driven engineering. In contrast to text-based versioning systems we present an approach which takes abstract syntax structures in model states and operational features into account. Considering the abstract syntax of models as graphs, we define model revisions as graph modifications which are not necessarily rule-based. Building up on the DPO approach to graph transformations, we define two different kinds of conflict detection: (1) the check for operation-based conflicts, and (2) the check for state-based conflicts on results of merged graph modifications.},
Owner = {Claudia},
Timestamp = {2010.12.16},
Url = {http://www.eecs.tu-berlin.de/menue/forschung/forschungsberichte/2010}
}
@InProceedings{ERT98,
Title = {{The {AGG}-Approach: Language and Tool Environment}},
Author = {Taentzer, G. and Ermel, C. and Rudolf, M.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, volume 2: Applications, Languages and Tools},
Year = {1999},
Editor = {Ehrig, H. and Engels, G. and Kreowski, H.-J. and Rozenberg, G.},
Pages = {551--603},
Publisher = {World Scientific}
}
@InProceedings{TFKV98,
Title = {{Visual Design of Distributed Systems by Graph Transformation}},
Author = {Taentzer, G. and Fischer, I. and Koch, M and Volle, V.},
Booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism, and Distribution},
Year = {1999},
Editor = {Ehrig, H. and Kreowski, H.-J. and Montanari, U. and Rozenberg, G.},
Pages = {269--340},
Publisher = {World Scientific}
}
@InProceedings{TGM00,
Title = {{Dynamic Change Management by Distributed Graph Transformation: Towards Configurable Distributed Systems}},
Author = {Taentzer, G. and Goedicke, M. and Meyer, T.},
Booktitle = {Proc. {T}heory and {A}pplication of {G}raph {T}ransformations (TAGT'98)},
Year = {2000},
Pages = {179 - 193},
Publisher = Springer,
Series = lncs,
Volume = {1764}
}
@InProceedings{TGM99,
Title = {Dynamic Accomodation of Change: Automated Architecture Configuration of Distributed Systems},
Author = {Taentzer, G. and Goedicke, M and Meyer, T.},
Booktitle = {Automated Software Engineering'99, Cocoa Beach, Florida, USA},
Year = {1999},
Publisher = {IEEE Computer Society}
}
@TechReport{TGM98,
Title = {{Dynamic Change Management by Distributed Graph Transformation: Towards Configurable Distributed Systems}},
Author = {Taentzer, G. and Goedicke, M. and Meyer, T.},
Institution = {Dept. of Mathematics and Computing, University of Essen},
Year = {1998}
}
@InProceedings{TK97,
Title = {Distributing Attributed Graph Transformation},
Author = {Taentzer, G. and Koch, M.},
Booktitle = {First European Workshop on ``General Theory of Graph Transformation Systems'', Bordeaux, Oct. 8-10,1997},
Year = {1997}
}
@Article{TS95,
Title = {{DIEGO}, Another Step Towards a Module Concept for Graph Transformation Systems},
Author = {G. Taentzer and A. Sch{\"u}rr},
Journal = {Proc. of SEGRAGRA'95 ``Graph Rewriting and Computation''},
Year = {1995},
Note = {{\sf http://www.elsevier.nl/locate/entcs/volume2.html}},
Volume = {2},
Publisher = entcs
}
@InProceedings{TS91,
Title = {Movements of Objects in configuration Spaces Modelled by Graph Grammars},
Author = {Taentzer, G. and Schween, H.},
Booktitle = {4th International Workshop on Graph Grammars and Their Application to Computer Science},
Year = {1991}
}
@InProceedings{TT06,
Title = {A Graph-Based Approach to Transform XML Documents},
Author = {Taentzer, G. and Toffetti Carughi, G.},
Booktitle = {Proc.\ Fundamental Approaches to Software Engineering (FASE)},
Year = {2006},
Editor = {Baresi, L. and Heckel, R.},
Pages = {48-62},
Publisher = {Springer},
Series = lncs,
Volume = {3922},
Abstract = {As XML diffusion keeps increasing, it is today common practice for most developers to deal with XML parsing and transformation. XML is used as format to e.g. render data, query documents, deal with Web services, generate code from a model or perform model transformation. Nowadays XSLT is the most common language for XML transformation. But, although meant to be simple, coding in XSLT can become quite a challenge, if the coding approach does not only depend on the structure of the source document, but the order of template application is also dictated by target document structure. This is the case especially when dealing with transformations between visual models. We propose to use a graph-based approach to simplify the transformation definition process where graphs representing documents are transformed in a rule-based manner, as in XSLT. The differences to XSLT are mainly that rules can be developed visually, are more abstract (since the order of execution does not depend on the target document), IDREFs are dealt with much more naturally, and due to typed transformations, the output document is guaranteed to be valid with respect to the target schema. Moreover, graph-based transformation definitions can be automatically reversed in most cases. This is especially useful in model transformation (e.g. in OMG's MDA approach).},
ISBN = {ISSN 0302-9743},
Keywords = {XML, document transformation, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/TT06.pdf}
}
@Unpublished{TW94,
Title = {Anforderungsspezifikation f\"ur ein erweitertes Graphtransformationsystem},
Author = {Taentzer, G. and Wagner, A.},
Note = {unpublished},
Year = {1994}
}
@TechReport{Tav02,
Title = {{Transformation of Open and Algebraic High-Level Petri Net Classes}},
Author = {Tavakoli, R.},
Institution = {Technical University of Berlin},
Year = {2002},
Note = {ISSN 1436-9915},
Number = {2002-24},
Abstract = {The theory based incremental approach to the stepwise development of Petri net process models plays an important role as Petri net based models have been used in many successful applications in practice. This incremental approach is based on the ability to transform a model (by replacing one submodel with another) and to change the class of models (by adding features previously ignored). Formally, these transformations are called \emph{net model transformation} and \emph{net class transformation}. This thesis continues recent research in the area of net class transformations and \emph{open Petri nets}. It provides a rigorous foundation for the different Petri net classes formalized as categories and the net class transformations formalized as functors in the framework of category theory. In the first part, eight categories are presented, three of them newly introduced in this thesis. Basic Petri net categories are extended to open Petri net categories. Open Petri nets are a generalization of the ordinary models where some places designated as open represent an interface of the system towards the environment. In all categories, the existence and structure of pushouts and initial objects are discussed. The main result in the first part is that the different open Petri net categories share similar properties concerning morphisms and pushouts. These numerous variants of Petri nets have been developed in order to express specific features in these domains. In the software development process a simple initially proposed Petri net can be incrementally extended, for example, by exception handling, initial state etc. In the different development steps different Petri net models are produced, each enhancing the initial model with further aspects and details. Transformations are tools to develop more complex Petri net process models from simple ones. In the second part, these transformations, formally functors between the categories of part one, are defined. It is proven that they preserve pushouts and initial objects if they exist. A further main result in this part is that functors between a basic Petri net category and its respective open Petri net category are adjoint.},
Keywords = {Petri Net Transformation, Algebraic High-Level Nets},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2002/TR2002_24.ps}
}
@TechReport{Ten01,
Title = {A formal semantics of {UML} class diagrams based on trasnformation systems},
Author = {Tenzer, J.},
Institution = {TU Berlin},
Year = {2001},
Number = {2001/09},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/TR01-9.ps}
}
@TechReport{Ten00,
Title = {Translation of {UML} Class Diagrams into Diagrams of Transformation Specifications},
Author = {Tenzer, J.},
Institution = {TU Berlin},
Year = {2000},
Month = {November},
Number = {2000/15}
}
@MastersThesis{Tro09,
Title = {Modeling Emergency Scenarios using Algebraic Higher Order Nets},
Author = {Trollmann, Frank},
School = {Technische Universit\"at Berlin},
Year = {2009},
Owner = {Claudia},
Timestamp = {2010.11.24},
Url = {http://www.user.tu-berlin.de/lieske/tfs/Diplomarbeiten/TFSdipl/09-FrankTrollmann.pdf}
}
@TechReport{Tsi01,
Title = {Semantic analysis and consistency checking of {UML} sequence diagrams},
Author = {Tsiolakis, A.},
Institution = {TU Berlin},
Year = {2001},
Number = {2001/06},
Url = {http://www.cs.tu-berlin.de/cs/ifb/Ahmed/RoteReihe/2001/AlikiTsiolakisTR2001-06.ps.gz}
}
@TechReport{Tsi00,
Title = {Consistency {A}nalysis of {UML} {C}lass and {S}equence {D}iagrams based on {A}ttributed {T}yped {G}raphs and their {T}ransformation},
Author = {Tsiolakis, A.},
Institution = {Technische Universit{\"at} Berlin, Department of Computer Science},
Year = {2000},
Month = {March},
Number = {2000/3}
}
@InProceedings{TE00,
Title = {{Consistency Analysis of UML Class and Sequence Diagrams using Attributed Graph Grammars}},
Author = {Tsiolakis, A. and Ehrig, H.},
Booktitle = {Proc. of Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation (GRATRA 2000)},
Year = {2000},
Editor = {Ehrig, H. and Taentzer, G.},
Organization = {Technical Report No. 2000-2, FB Informatik, TU Berlin},
Pages = {77--86}
}
@InProceedings{TE00a,
Title = {Consistency {A}nalysis between {UML} {C}lass and {S}equence {D}iagrams using {A}ttributed {G}raph {G}ammars},
Author = {Tsiolakis, A. and Ehrig, H.},
Booktitle = {Proc. GRATRA'2000 - Joint APPLIGRAPH and GETGRATS Workshop on Graph Transformation Systems},
Year = {2000},
Editor = {Ehrig, H. and Taentzer, G.},
Month = {March 25-27},
Pages = {77-86},
Publisher = {Technische Universit{\"a}t Berlin}
}
@InProceedings{UP08,
Title = {{Reconfigurable Open Algebraic High-Level Systems}},
Author = {Ullrich, C. and Padberg, J.},
Booktitle = {Proc. Third International Workshop on Petri Nets and Graph Transformations},
Year = {2008},
Editor = {Baldan, P. and K\"onig, B.},
Note = {To appear},
Publisher = eceasst,
Abstract = {In this paper reconfigurable open algebraic high-level (AHL) systems are introduced as an extension of AHL systems [PER95]. In addition to the integration of data structures open places and communicating transitions allow modelling reactive behavior as communication with their environment. Reconfigurable open AHL systems are defined that comprise rules and transformations of these nets. Formally they are an instance of weak adhesive HLR systems [EP06] and so yield the same results. Moreover, a case study is presented that demonstrates the practical need for reconfigurable open AHL systems. },
ISBN = {ISSN 1863-2122},
Keywords = {open Petri nets, reconfiguration, transformation, emergency scenarios},
Location = {Leicester, UK},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers08/UP08.pdf}
}
@InProceedings{Urb03c,
Title = {{Preserving Properties in System Redesign: Rule-Based Approach}},
Author = {Urb{\'a}{\v{s}}ek, M.},
Booktitle = {Post-Proceedings of the 16th International Workshop on Algebraic Development Techniques (WADT 2002)},
Year = {2003},
Editor = {Wirsing, M. and Pattinson, D. and Henicker, R.},
Publisher = Springer,
Series = lncs,
Abstract = { The paper deals with stepwise development of systems based on a rule-based approach. Modeling using this approach usually starts with a rough model of a system which is refined in further steps. This approach is based on rules and transformations as known from theory of HLR systems. Preservation of certain system properties during this process is of importance. In the context of Petri nets the developed property preserving rules and transformations restrict the variety of modeling possibilities to refinement of the system by additional details. We describe the possibility of building new property preserving rules from other ones which are suitable for redesign of system parts. },
ISSN = {ISBN: 3-540-20537-3},
Keywords = {Petri Nets, Rule-Based Refinement, Net Model Transformations, System Properties},
Url = {http://www.cs.tu-berlin.de/%7Eurbasek/papers/WADT02full.ps.gz}
}
@InProceedings{Urb02,
Title = {{Preserving Properties in System Redesign: Rule-Based Approach}},
Author = {Urb{\'a}{\v{s}}ek, M.},
Booktitle = {Proceedings of the 16th International Workshop on Algebraic Development Techniques (WADT 2002)},
Year = {2002},
Editor = {Wirsing, M. and Pattinson, D. and Henicker, R.},
Pages = {87-88},
Publisher = {LMU Munich},
Keywords = {Petri Nets, Rule-Based Refinement, Net Model Transformations, System Properties},
Url = {http://www.cs.tu-berlin.de/%7Eurbasek/papers/WADT02.ps.gz}
}
@TechReport{Urb02b,
Title = {{New Safety Property and Liveness Preserving Morphisms of P/T Systems}},
Author = {Urb{\'a}{\v{s}}ek, M.},
Institution = {Technical University Berlin},
Year = {2002},
Number = {2002-14},
Keywords = {Petri Nets, Rule-Based Refinement, Net Model Transformations, Liveness, Safety Properties},
Url = {http://www.cs.tu-berlin.de/%7Eurbasek/papers/TR2002_14.ps.gz}
}
@InProceedings{UP02,
Title = {Preserving Liveness with Rule-Based Refinement of Place/Transition Systems},
Author = {Urb{\'a}{\v{s}}ek, M. and Padberg, J.},
Booktitle = {Proc. IDPT 2002: Sixth World Conference on Integrated Design and Process Technology, CD-ROM},
Year = {2002},
Editor = {Society for Design and Process Science (SDPS)},
Pages = {10},
Url = {http://www.cs.tu-berlin.de/%7Eurbasek/papers/IDPT02.ps.gz}
}
@InProceedings{Urb03d,
Title = {{Modeling Petri Net Based Systems by Net Transformations: New Developments}},
Author = {Urb\'a\v{s}ek, M.},
Booktitle = {Proceedings of the Workshop on Uniform Approaches to Graphical Specification Techniques (UniGra03)},
Year = {2003},
Editor = {Ehrig, H. and Bardohl, R.},
Publisher = {Elsevier, ENTCS 82, No.7},
Abstract = {Net transformations are used as powerful techniques for manipulation of Petri net based models. They allow arbitrary modification of a given net, including the change of given net class. This paper presents a summary of results in the area of net transformations as developed at the Technical University Berlin. There are several new results discussed in this paper and demonstrated by simple examples.},
Keywords = {Petri Nets, rule-based refinement, transformation},
Url = {http://www.elsevier.com/gej-ng/31/29/23/133/48/show/Products/notes/index.htt#003}
}
@PhdThesis{Urb03,
Title = {{C}ategorical {N}et {T}ransformations for {P}etri {Net} {T}echnology},
Author = {Urb\'a\v{s}ek, M.},
School = {Technische Universit\"at Berlin},
Year = {2003},
Abstract = {Petri net transformations are used as powerful techniques for manipulation of system models based on Petri nets. They allow arbitrary modification of a given net. Two kinds of transformations are distinguished, namely net model and net class transformations. Both kinds of transformations are formaly defined and a lot of important results are available, e.g. compatibility of transformations with each other, compatibility with horizontal structuring, preservation of structural and system properties. Net transformations provide a framework for modelling of Petri net based systems for several classes of Petri nets. This author presents the main ideas of net transformations as developed at the Technical University Berlin. There are motivation, role, informal description, formal background, and examples of Petri net transformations presented. },
Keywords = {Petri Nets, Net Transformations, Category Theory}
}
@Article{Urb03a,
Title = {{Net Transformations for Petri Net Technology}},
Author = {Urbasek, M.},
Journal = BEATCS,
Year = {2003},
Month = {June},
Pages = {77--94},
Volume = {80},
ISSN = {ISSN 0252-9742},
Keywords = {Petri Nets, Net Transformations}
}
@InProceedings{VVE+06,
Title = {{Termination Analysis of Model Transformations by Petri Nets }},
Author = {Varr\'o, D. and Varr\'o-Gyapay, S. and Ehrig, H. and Prange, U. and Taentzer, G.},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Year = {2006},
Address = {Natal, Brazil},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Month = {September},
Pages = {260--274},
Publisher = Springer,
Series = lncs,
Volume = {4178},
Abstract = {Despite the increasing relevance of model transformation techniques in model-driven software development, research is mainly conducted to the specification and the automation of such transformations. However, since the transformations themselves may also contain conceptual flaws, it is essential to formally analyze them prior to executing them on user models. In the current paper, we focus on a central validation problem of trusted model transformations, namely, termination and propose a Petri net based analysis method that provides a sufficient criterion for the termination problem of model transformations captured by graph transformation systems. },
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2},
Keywords = {graph transformation approach, SPO rewriting, DPO rewriting, Sesqui Pushout},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/VVE+06.pdf}
}
@PhdThesis{Wag97,
Title = {A Formal Object Specification Technique Using Rule-Based Transformation of Partial Algebras},
Author = {Wagner, A.},
School = {TU Berlin},
Year = {1997}
}
@TechReport{Wag97a,
Title = {A Telephone's System Specification using the Object Specification Technique (OST)},
Author = {Wagner, A.},
Institution = {TU Berlin},
Year = {1997}
}
@InProceedings{Wag95,
Title = {On the expressive power of algebraic graph grammars with application conditions},
Author = {Wagner, A.},
Booktitle = {Int.\ Joint Conf.\ on Theory and Practice of Software Development (TAPSOFT`95)},
Year = {1995},
Publisher = Springer,
Series = lncs,
Volume = {915}
}
@TechReport{Wag94,
Title = {On the expressive power of graph grammars with application conditions},
Author = {Wagner, A.},
Institution = {TU Berlin},
Year = {1994},
Number = {27}
}
@MastersThesis{Wag93,
Title = {{Vergleich von High-Level-Replacement-Systemen basierend auf dem Double- bzw.\ Single-Pushout-Ansatz}},
Author = {Wagner, A.},
School = FB13,
Year = {1993}
}
@MastersThesis{Wag92,
Title = {{Vergleich algebraischer Graphgrammatiken im Single- und im Double-Pushout-Ansatz}},
Author = {Wagner, A.},
School = FB13,
Year = {1992},
Type = {studienarbeit}
}
@Article{WG96,
Title = {Defining Operational Behavior of Object Specifications by Attributed Graph Transformations},
Author = {Wagner, A. and Gogolla, M.},
Journal = {Fundamenta Informaticae},
Year = {1996},
Month = {June},
Number = {3,4},
Pages = {407 - 431},
Volume = {26}
}
@Article{WE87,
Title = {Canonical Constraints for Parameterized Data Types},
Author = {Wagner, E.G. and Ehrig, H.},
Journal = TCS,
Year = {1987},
Pages = {323--351},
Volume = {30}
}
@MastersThesis{War10,
Title = {Entwicklung eines visuellen Editors fï¿½r Anwendungsbedingungen und amalgamierte Regeln zur Flexibilisierung von EMFModelltransformationen},
Author = {Angeline Warning},
School = {Technische Universitï¿½t Berlin},
Year = {2010},
Type = {Diplomarbeit (Master Thesis)},
Owner = {Claudia},
Url = {http://www.user.tu-berlin.de/lieske/tfs/Diplomarbeiten/TFSdipl/10-AngelineWarning.pdf}
}
@InProceedings{WE88,
Title = {Specification of Concurrently Executable Modules and Distributed Modular Systems},
Author = {H. Weber and H. Ehrig},
Booktitle = {Proc.\ IEEE Workshop on Future Trends of Distr.\ Comp.\ Systems in the 1990s, Hongkong},
Year = {1988},
Pages = {202--215},
Publisher = {IEEE}
}
@Article{WE86,
Title = {Specification of Modular Systems},
Author = {H. Weber and H. Ehrig},
Journal = {IEEE Transactions on Software Engineering},
Year = {1986},
Number = {7},
Pages = {784--798},
Volume = {SE-12}
}
@TechReport{WE85,
Title = {Specification of Modular Systems},
Author = {Weber, H. and Ehrig, H.},
Institution = {Abt. Informatik, Univ. Dortmund},
Year = {1985},
Address = {Dortmund},
Number = {198},
Type = {Research Report}
}
@Misc{WRE98,
Title = {{Concept, Theoretical Foundation, and Validation of an Application Oriented Petri Net Technology}},
Author = {Weber, H. and Reisig, W. and Ehrig, H.},
HowPublished = {Proposal for continuation of a ``Forschergruppe'' to the German Research Council (DFG)},
Note = {(Accepted as a DFG-project from April 1999 to March 2002)},
Year = {1998}
}
@Misc{WRE98dt,
Title = {{K}onzeption, theoretische {F}undierung und {V}alidierung einer anwendungsbezogenen {P}etrinetz-{T}echnologie},
Author = {Weber, H. and Reisig, W. and Ehrig, H.},
HowPublished = {Fortsetzungsantrag f\"ur eine Forschergruppe an die DFG},
Note = {(akzeptiert als DFG-Projekt von April 1999 bis M\"arz 2002)},
Year = {1998}
}
@Misc{WRE95,
Title = {{Concept, Theoretical Foundation, and Validation of an Application Oriented Petri Net Technology}},
Author = {Weber, H. and Reisig, W. and Ehrig, H.},
HowPublished = {Proposal for a ``Forschergruppe'' to the German Research Council (DFG)},
Note = {(Accepted as a DFG-project from April 1996 to March 1999)},
Year = {1995}
}
@Misc{WRE95dt,
Title = {{K}onzeption, theoretische {F}undierung und {V}alidierung einer anwendungsbezogenen {P}etrinetz-{T}echnologie},
Author = {Weber, H. and Reisig, W. and Ehrig, H.},
HowPublished = {Antrag f\"ur eine Forschergruppe an die DFG},
Note = {(akzeptiert als DFG-Projekt von April 1996 bis M\"arz 1999)},
Year = {1995}
}
@Article{WSP01,
Title = {{Evolutionary Development of Business Process Centered Architectures Using Component Technologies}},
Author = {Weber, H. and S{\"u}nb{\"u}l, A. and Padberg, J.},
Journal = {Journal on Integrated Design and Process Technology},
Year = {2001},
Number = {3},
Pages = {13-24},
Volume = {5},
Keywords = {Business Process, Architecture Development, Component Technology},
Url = {http://www.cs.tu-berlin.de/%7Epadberg/Publications/Year2001/wsp-journal.pdf}
}
@InProceedings{WSP00,
Title = {{Simultaneous Modelling of Information and Communication Infrastructures and Business Processes Through Evolutionary Development of Business Process Driven Architectures Using Component Technologies}},
Author = {Weber, H. and S{\"u}nb{\"u}l, A. and Padberg, J.},
Booktitle = {Proc. of World Conference on Integrated Design and Process Technology (IDPT 2000)},
Year = {2000},
Organization = {Society for Process Technology}
}
@MastersThesis{Wei01,
Title = {{Konzeption und Implementierung eines Generators f\"ur Simulationsumgebungen}},
Author = {Weinhold, I.},
School = {Technische Universit\"at Berlin, FB Informatik},
Year = {2001}
}
@MastersThesis{Wei01a,
Title = {{Concepts and Implementation of a Generator for Simulation Environments (in German)}},
Author = {Weinhold, I.},
School = {TU Berlin},
Year = {2001}
}
@MastersThesis{Weis05,
Title = {{Konzeption und Implementierung einer Entwicklungsumgebung f\"ur visuelle Sprachen}},
Author = {Weiss, Eduard},
School = {Technische Universit{\"a}t Berlin, Fak. Elektrotechnik/Informatik},
Year = {2005}
}
@MastersThesis{Win05,
Title = {{Spezifikation von Visual OCL: Eine Visualisierung der Object Constraint Language}},
Author = {Winkelmann, J.},
School = FB13,
Year = {2005},
Type = {Master's thesis}
}
@Article{WTE+06,
Title = {{Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars}},
Author = {Winkelmann, J. and Taentzer, G. and Ehrig, K. and K\"uster, J.},
Journal = {ENTCS},
Year = {2008},
Pages = {159-170},
Volume = {211},
Abstract = {The meta modeling approach to syntax definition of visual modeling techniques has gained wide acceptance, especially by using it for the definition of UML. Based on class structures and well-formedness rules, which could be formalized by OCL, the abstract syntax of visual modeling techniques is defined in a declarative way. Since meta-modeling is non-constructive, it does not provide a systematic way available to generate all possible meta model instances. But for example, when developing model transformations, it is desirable to have a large set of valid instances at hand to perform large-scale testing. In our approach, an instance-generating graph grammar is automatically created from a given meta model. This graph grammar ensures correct typing and cardinality constraints. To satisfy also the given OCL constraints, well-formedness checks have to be done in addition. As a first step, a restricted form of OCL constraints can be translated to graph constraints which are to be checked during the instance generation process.},
Booktitle = {Proc. GT-VMT'06},
Editor = {Varro, D. and Bruni, R.},
ISBN = {ISSN:1571-0661},
Keywords = {graph transformation, UML, OCL, graph constraints, meta model, instance generation},
Location = {Vienna, Austria},
Owner = {Claudia},
Publisher = {Elsevier Science},
Series = entcs,
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers06/WTE+06.pdf}
}
@InProceedings{Wol95b,
Title = {Institutional Frames},
Author = {Wolter, U.},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1995},
Editor = {E. Astesiano and G. Reggio and A. Tarlecki},
Organization = {10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S. Margherita Italy, May/June 1994, Selected papers},
Pages = {469--482},
Publisher = Springer,
Series = lncs,
Volume = {906}
}
@InProceedings{Wol99,
Title = {A coalgebraic introduction to {C}{S}{P}},
Author = {Wolter, U.},
Booktitle = {2nd Workshop on Coalgebraic Methods in Computer Science (CMCS'99), Amsterdam, The Netherlands, Proceedings},
Year = {1999},
Editor = {Jacobs, B. and Rutten, J.},
Pages = {77-96},
Publisher = {Elsevier Science},
Series = {volume 19 of ENTCS}
}
@InProceedings{Wol00,
Title = {On {C}orelations, {C}okernels, and {C}oequations},
Author = {Wolter, U.},
Booktitle = {Third Workshop on Coalgebraic Methods in Computer Science (CMCS'2000), Berlin, Germany, Proceedings},
Year = {2000},
Editor = {Reichel, H.},
Publisher = {Elsevier Science},
Series = {ENTCS}
}
@Article{Wol99b,
Title = {{CSP}, {P}artial {A}utomata, and {C}oalgebras},
Author = {Wolter, U.},
Journal = {TCS},
Year = {2000}
}
@InProceedings{Wol95a,
Title = {Higher Order Partial Algebras in View of the Semantics of Functional Languages},
Author = {Wolter, U.},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1995},
Organization = {11th Workshop on Specification of Abstract Data Types, Oslo, Norway, September 1995},
Publisher = Springer,
Series = lncs,
Abstract = {We propose a new approach to algebraic semantics of functional languages based on higher-order partial algebras and conditional existence equations. After dicussing more generally the relation ships between certain features of functional languages and special algebraic concepts and techniques the paper presents the theoretical basis of our approach. The main result concerns the existence of higher-order partial algebras freely generated by a set of variables and a set of existence equations. This result ensures the existence of free functor semantics in our approach.}
}
@InProceedings{Wol94a,
Title = {Institutional Frames},
Author = {Wolter, Uwe},
Booktitle = {Recent Trends in Data Type Specification},
Year = {1994},
Organization = {10th Workshop on Specification of Abstract Data Types, Genova, Italy, May 1994},
Publisher = {Springer-Verlag}
}
@TechReport{Wol93b,
Title = {{Ableitungskalk\"ule und operationale Semantik f\"ur algebraische Spezifikationen mit bedingten Gleichungen -- Totale Algebren --}},
Author = {Wolter, U.},
Institution = {TU Berlin, FB Informatik},
Year = {1993},
Month = {January},
Number = {Bericht-Nr. 93--01}
}
@Article{Wol90,
Title = {An {A}lgebraic {A}pproach to {D}eduction in {E}quational {P}artial {H}orn {T}heories},
Author = {Wolter, U.},
Journal = {J. Inf. Process. Cybern. EIK},
Year = {1990},
Number = {2},
Pages = {85--128},
Volume = {27}
}
@TechReport{WDC+94,
Title = {How to {C}ope with the {S}pectrum of {S}{\sc pectrum}},
Author = {Wolter, U. and Didrich, K. and Cornelius, F. and Klar, M. and Wess{"a}ly, R. and Ehrig, H.},
Institution = {TU Berlin, FB Informatik},
Year = {1994},
Number = {Bericht-Nr. 94-22},
Key = {,}
}
@InCollection{WDC+95,
Title = {How to {C}ope with the {S}pectrum of {S}{\sc pectrum}},
Author = {Wolter, U. and Didrich, K. and Cornelius, F. and Klar, M. and Wess{\"a}ly, R. and Ehrig, H.},
Booktitle = {{KORSO}: Methods, Languages, and Tools for the Construction of Correct Software},
Publisher = Springer,
Year = {1995},
Editor = {Broy, M. and J{\"a}hnichen, S.},
Note = {A preliminary version appeared as Tech. Report 94-22, Technische Universit{\"a}t Berlin, FB Informatik, 1994},
Pages = {173-189},
Series = lncs,
Volume = {009}
}
@TechReport{WDCKWE94,
Title = {How to {C}ope with the {S}pectrum of {\sc Spectrum}},
Author = {Wolter, U. and Didrich, K. and Cornelius, F. and Klar, M. and Wess{\"a}ly, R. and Ehrig, H.},
Institution = TUB,
Year = {1994},
Number = {94-22}
}
@TechReport{WKWC94,
Title = {{Four Institutions -- A Unified Presentation of Logical Systems for Specification}},
Author = {Wolter, U. and Klar, M. and Wess{\"a}ly, R. and Cornelius, F.},
Institution = {TU Berlin, Fachbereich Informatik},
Year = {1994},
Number = {Bericht-Nr. 94-24}
}
@InProceedings{WL92,
Title = {Beyond Conditional Equations - Quasi-initial Semantics for Parametric Algebraic Specifications},
Author = {Wolter, U. and L{\"o}we, M.},
Booktitle = {CAAP'92 -- 17th Colloquium on Trees in Algebra and Programming, Rennes, France, Proceedings},
Year = {1992},
Editor = {J.--C. Raoult},
Month = {February},
Pages = {342--361},
Publisher = Springer,
Series = lncs,
Volume = {581}
}
@InProceedings{WM97,
Title = {Shedding {N}ew {L}ight in the {W}orld of {L}ogical {S}ystems},
Author = {Wolter, U. and Martini, A.},
Booktitle = {Category Theory and Computer Science, 7th International Conference, CTCS'97},
Year = {1997},
Editor = {Moggi, E. and Rosolini, G.},
Pages = {159--176},
Publisher = Springer,
Series = lncs,
Volume = {1290}
}
@PhdThesis{Wol98,
Title = {Colimit Library for Graph Transformations and Algebraic Development Techniques},
Author = {Dietmar Wolz},
School = FB13,
Year = {1998}
}
@Unpublished{Wol97,
Title = {{Colimit Computations for Graph Structures and Algebraic Specification Languages}},
Author = {Wolz, D.},
Note = {PhD Thesis, TU Berlin, FB Informatik},
Year = {1997}
}
@InProceedings{Wol95,
Title = {{T}ool {D}esign for {S}tructuring {M}echanisms for {A}lgebraic {S}pecification {L}anguages with {I}nitial {S}emantics},
Author = {Wolz, D.},
Booktitle = {Recent Trends in Data Type Specifications, Proc. of the 11th Int. Workshop on the Specification of Abstract Data Types, Oslo},
Year = {1995},
Publisher = Springer,
Series = lncs,
Volume = {1130},
Key = {Wolz95}
}
@InProceedings{Wol92,
Title = {A Tool for checking {ADT} completeness and consistency},
Author = {D. Wolz},
Booktitle = {Proc.\ of the third LOTOSPHERE workshop, Pisa},
Year = {1992}
}
@TechReport{Wol91a,
Title = {Data Type Evaluator: User Manual},
Author = {D. Wolz},
Institution = {LOTOSPHERE},
Year = {1991},
Number = {Lo/\-WP2/\-T2.2/\-TUB/\-N0008}
}
@TechReport{Wol91b,
Title = {Data Type Report Generator: User Manual},
Author = {D. Wolz},
Institution = {LOTOSPHERE},
Year = {1991},
Number = {Lo/\-WP2/\-T2.2/\-TUB/\-N0012/\-V2}
}
@InProceedings{Wol91c,
Title = {Design of a Compiler for Lazy Pattern Driven Narrowing},
Author = {D. Wolz},
Booktitle = {Proc.\ of the 7th International Workshop on the Specification of Abstract Data Types},
Year = {1991},
Publisher = Springer,
Series = lncs,
Volume = {534}
}
@TechReport{Wol91d,
Title = {Data type report generator: Detailed Design Document},
Author = {D. Wolz},
Institution = {LOTOSPHERE},
Year = {1991},
Number = {Lo/WP2/T2.2/TUB/N00014}
}
@TechReport{Wol90a,
Title = {Data Type Evaluator: Detailed Design Document},
Author = {D. Wolz},
Institution = {LOTOSPHERE},
Year = {1990},
Number = {Lo/WP2/T2.2/TUB/N0007/V2}
}
@InProceedings{WB89,
Title = {Compilation of {LOTOS} Data Type Specifications},
Author = {D. Wolz and P. Boehm},
Booktitle = {Proc.\ of the IFIP TC6-WG 6.1, 9th International Symposium on Protocol Specification, Testing and Verification},
Year = {1989},
Editor = {E. Brinksma and G. Scollo and C.A. Vissers}
}
@Proceedings{BEPR06,
Title = {{Proc. Workshop on Petri Nets and Graph Transformations (PNGT 2006), Satellite Event of ICGT 2006, Natal, Brazil, September 2006}},
Year = {2006},
Editor = {Baldan, P. and Ehrig, H. and Padberg, J. and Rozenberg, G.},
Publisher = {Electronic Communications of the EASST},
Volume = {2},
ISSN = {ISSN 1863-2122},
Url = {http://www.easst.org/eceasst}
}
@Proceedings{BE03a,
Title = {Proc. Workshop on Uniform Approaches to Graphical Process Specification Techniques (UNIGRA)},
Year = {2003},
Address = {Warsaw, Poland},
Editor = {Bardohl, R. and Ehrig, H.},
Publisher = {Elsevier},
Series = entcs,
Volume = {82 (7)}
}
@Proceedings{BE04,
Title = {{Proc. UNIGRA 2003}},
Year = {2003},
Editor = {Bardohl, R. and Ehrig, H.},
Publisher = entcs,
Volume = {82/7}
}
@Book{BEKS02,
Title = {Formal and Natural Computing: Essays dedicated to Grzegorz Rozenberg},
Editor = {Brauer, W. and Ehrig, H. and Karhum\"aki, J and Salomaa, A.},
Publisher = Springer,
Year = {2002},
Note = {ISBN 3-540-43190-X},
Series = lncs,
Volume = {2300}
}
@Proceedings{CER79,
Title = {{Graph Grammars and their Application to Computer Science and Biology}},
Year = {1979},
Editor = {Claus, V. and Ehrig, H. and Rozenberg(eds.), G.},
Publisher = Springer,
Series = lncs,
Volume = {73}
}
@Proceedings{CEKR02,
Title = {{Proc. 1st Int. Conference on Graph Transformation (ICGT'02)}},
Year = {2002},
Editor = {Corradini, A. and Ehrig, H. and Kreowski, H-J and Rozenberg, G.},
Publisher = Springer,
Series = lncs,
Volume = {2505}
}
@Proceedings{CEM+06,
Title = {{Proc. 3rd International Conference on Graph Transformations (ICGT 2006), Natal, Brazil, September 2006}},
Year = {2006},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Publisher = Springer,
Series = lncs,
Volume = {4178},
ISSN = {ISSN 0302-9743, ISBN 3-540-38870-2}
}
@Proceedings{CEER96,
Title = {Graph Grammars and Their Application to Computer ScienceGraph Grammars and Their Application to Computer Science},
Year = {1996},
Editor = {Cuny, J. and Ehrig, H. and Engels, G. and Rozenberg, G.},
Publisher = Springer,
Series = lncs,
Volume = {1073},
Booktitle = {5th Int.\ Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94}
}
@Book{ECR79,
Title = {1st Int.\ Workshop on Graph Grammars and their Application to Computer Science and Biology},
Editor = {Ehrig, H. and Claus, V. and Rozenberg, G.},
Publisher = Springer,
Year = {1979},
Series = lncs,
Volume = {1073}
}
@Book{EDD+04,
Title = {Integration of Software Specification Techniques for Applications in Engineering: Priority Program SoftSpez of the German Research Foundation (DFG), Final Report},
Editor = {H. Ehrig and W. Damm and J. Desel and M. Gro\ss{}e-Rhode and W. Reif and E. Schnieder and E. Westk\"amper},
Publisher = Springer,
Year = {2004},
Number = {3147},
Series = lncs,
ISBN = {ISSN 0302-9743, ISBN 3-540-23135-8},
Keywords = {Software Specification, Engineering, Formal Integration}
}
@Proceedings{EEKR00,
Title = {6th Int.\ Workshop on Theory and Application of GraphTransformation (TAGT'98)},
Year = {2000},
Editor = {Ehrig, H. and Engels, G. and Kreowski, {H.-J.} and Rozenberg, G.},
Publisher = Springer
}
@Book{EEKR99,
Title = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages and Tools},
Editor = {Ehrig, H. and Engels, G. and Kreowski, H.-J. and Rozenberg, G.},
Publisher = {World Scientific},
Year = {1999}
}
@Proceedings{EEPR04,
Title = {{Proc. 2nd International Conference on Graph Transformations (ICGT 2004), Rome, Italy, September/October 2004}},
Year = {2004},
Editor = {Ehrig, H. and Engels, G. and Parisi-Presicce, F. and Rozenberg, G.},
Publisher = Springer,
Series = lncs,
Volume = {3256},
ISSN = {ISSN 0302-9743, ISBN 3-540-23207-9}
}
@Proceedings{EGO00b,
Title = {{INT}: Integration of Specification Techniques with Applications in Enginering},
Year = {2000},
Editor = {Ehrig, H. and {Gro{\ss}e--Rhode}, M. and Orejas, F.},
Publisher = {TU Berlin}
}
@Book{UnPN01,
Title = {{Advances in Petri Nets: Unifying Petri Nets}},
Editor = {Ehrig, H. and Juh{\'a}s, G. and Padberg, J. and Rozenberg, G.},
Publisher = Springer,
Year = {2001},
Series = lncs,
Volume = {2128},
Key = {UnPN01},
Url = {http://link.springer.de/link/service/series/0558/tocs/t2128.htm}
}
@Proceedings{EKP02,
Title = {{Proc. Int. Conf. on Integrated Design and Process Technology (IDPT'02), Pasadena, USA}},
Year = {2002},
Editor = {Ehrig, H. and Kr\"amer, B. J. and Ertas, A.},
Publisher = {Society of Process Technology}
}
@Book{EKMR99b,
Title = {{Handbook of Graph Grammars and Computing by Graph Transformation. Vol 3: Concurrency, Parallelism and Distribution}},
Editor = {Ehrig, H. and Kreowski, H.-J. and Montanari, U. and Rozenberg, G.},
Publisher = {World Scientific},
Year = {1999},
Key = {EKMR99b}
}
@Proceedings{EKR91,
Title = {{4th International Workshop on Graph Grammars and Their Application to Computer Science}},
Year = {1991},
Editor = {Ehrig, H. and Kreowski, H.-J. and Rozenberg, G.},
Publisher = Springer,
Series = lncs,
Volume = {532}
}
@Book{ENR83,
Title = {Graph Grammars and their Application to Computer Science and Biology},
Editor = {Ehrig, H. and Nagl, M. and Rozenberg, G.},
Publisher = Springer,
Year = {1983},
Series = lncs,
Volume = {153}
}
@Proceedings{ENRR87,
Title = {3rd Int.\ Workshop on Graph Grammars and their Application to Computer Science},
Year = {1987},
Editor = {Ehrig, H. and Nagl, M. and Rozenberg, G. and Rosenfeld, A.},
Publisher = Springer,
Series = lncs,
Volume = {291}
}
@Book{EP02,
Title = {{Component-Based System Development}},
Editor = {Ehrig, H. and Padberg, J.},
Publisher = {SPDS},
Year = {2003},
Month = {June},
Note = {ISSN 1092-0617},
Series = {Journal of Integrated Design and Process Science},
Volume = {82 (7)}
}
@Proceedings{EPE01,
Title = UNIGRA01,
Year = {2001},
Editor = {Ehrig, H. and Padberg, J. and Ermel, C.},
Series = entcs,
Volume = {44, (4)},
Url = {http://www.elsevier.nl/gej-ng/31/29/23/73/28/show/Products/notes/index.htt}
}
@Book{PNTVol02,
Title = {{Advances in Petri Nets: Petri Net Technology for Communication Based Systems}},
Editor = {Ehrig, H. and Reisig, W. and Rozenberg, G. and Weber, H.},
Publisher = Springer,
Year = {2003},
Series = lncs,
Volume = {2472},
ISSN = {ISSN 0302-9743, ISBN 3-540-20538-1},
Key = {PNTVol03}
}
@Proceedings{ET00,
Title = {{Proc. of Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation (GRATRA 2000)}},
Year = {2000},
Editor = {Ehrig, H. and Taentzer, G.},
Month = {April},
Organization = {Technical Report No. 2000-2, FB Informatik, TU Berlin}
}
@Proceedings{KO96,
Title = {{Kick-Off-Workshop der {DFG-F}orschergruppe \textsc{Petri\-netz-Tech\-no\-lo\-gie}, Berlin}},
Year = {1996},
Editor = {{Ehrig, Hartmut and Reisig, Wolfgang and Weber, Herbert}},
Month = {July},
Note = {Informatik {B}ericht {Nr. 73}},
Organization = {Humboldt-{U}niversit{\"a}t zu {B}erlin},
Key = {{ERW96}}
}
@Proceedings{KT05,
Title = {Proc. International Workshop on Graph and Model Transformation (GraMoT'05)},
Year = {2005},
Address = {Tallinn, Estonia},
Editor = {Karsai, G. and Taentzer, G.},
Publisher = {Elsevier Science},
Series = entcs,
Volume = {152}
}
@Book{KMO+05,
Title = {{Formal Methods in Software and Systems Modeling: Essays Dedicated to Hartmut Ehrig on the Occasion of His 60th Birthday}},
Editor = {Kreowski, H.-J. and Montanari, U. and Orejas, F. and Rozenberg, G. and Taentzer, G.},
Publisher = Springer,
Year = {2005},
Series = lncs,
Volume = {3393},
ISBN = {ISSN 0302-9743},
Key = {KMO+05}
}
@Proceedings{MST04b,
Title = {Workshop on Graph-Based Tools},
Year = {2004},
Editor = {Mens, T. and Sch\"urr, A. and Taentzer, G.},
Publisher = {Science Direct},
Series = entcs,
Volume = {127/1},
Abstract = {Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various application domains. In all these domains, tools are developed that store, retrieve, manipulate and display graphs. It is the purpose of this workshop to summarize the state of the art of graph-based tool development, bring together developers of graph-based tools in different application fields and to encourage new tool development cooperations. },
ISBN = {ISBN 1571-0661},
Keywords = {Graph-based tools, tool development, graph transformation},
Url = {http://www.user.tu-berlin.de/lieske/tfs/publikationen/Papers04/MST04.pdf}
}
@Proceedings{MST02,
Title = {Workshop on Graph-Based Tools},
Year = {2002},
Editor = {Mens, T. and Sch\"urr, A. and Taentzer, G.},
Publisher = {Science Direct},
Series = entcs,
Volume = {72/2},
ISBN = {ISBN 1571-0661}
}
@Book{PRS01,
Title = {{Current Trends in Theoretical Computer Science: Entering the 21st Century}},
Editor = {Paun, G. and Rozenberg, G. and Salomaa, A.},
Publisher = {World Scientific, Singapore etc.},
Year = {2001}
}
@Proceedings{PEGS10,
Title = {Proceedings of {ACCAT} 2008 and 2009},
Year = {2010},
Editor = {Pfalzgraf, J. and Ehrig, H. and Golas, U. and Soboll, T.},
Series = {Journal of Symbolic Computation},
Doi = {http://dx.doi.org/10.1016/j.jsc.2010.09.005},
ISBN = {ISSN 0747-7171}
}
@Proceedings{Coll01,
Title = {2nd Int.\ Colloquium on Petri Net Technologies for Modelling Communication Based Systems},
Year = {2001},
Address = {Berlin, Germany},
Editor = {Weber, H. and Ehrig, H. and Reisig, W.},
Month = {Sept.},
Organization = {Researcher Group Petri Net Technology},
Publisher = {Fraunhofer Gesellschaft ISST},
Key = {Coll01}
}
@Proceedings{Coll99,
Title = {{Int.\ Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Part {II}: The \"< Petri Net Baukasten\">}},
Year = {1999},
Editor = {Weber, H. and Ehrig, H. and Reisig, W.},
Month = oct,
Organization = {Fraunhofer Gesellschaft ISST},
Key = {Coll99}
}
@Manual{AGG,
Title = {{AGG}},
Note = {\url{http://www.tfs.tu-berlin.de/agg}},
Organization = {TFS-Group, TU Berlin},
Year = {2014},
Key = {AGG}
}
@Misc{Henshin,
Title = {{EMF Henshin}},
Note = {{\url{http://www.eclipse.org/modeling/emft/henshin/}}},
Year = {2011},
Key = {Henshin}
}
@Manual{EMT,
Title = {{EMF Tiger}},
Note = {\url{http://www.user.tu-berlin.de/lieske/tfs/emftrans}},
Organization = {TFS-Group, TU Berlin},
Year = {2009},
Key = {EMT}
}
@Manual{GenGED,
Title = {{GenGED Homepage}},
Note = {\url{http://tfs.tu-berlin.de/genged}},
Organization = {TFS-Group, TU Berlin},
Year = {2005},
Key = {GenGED}
}
@Misc{DEMON91,
Title = {Reports of the {ESPRIT} Basic Research Action {DEMON}},
Year = {1991},
Key = {DEM91}
}