direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

E

Basic Results for Two Types of High-Level Replacement Systems

Ehrig, H., Habel, A. and Parisi-Presicce, F.

Proc. GETGRATS Closing Workshop, 12. 2002

Link zur Publikation Download Bibtex Eintrag

Concurrent Transformation of Relational Structures

Ehrig, H., Habel, A. and Rosen, B.

, 13-50. 1986

Download Bibtex Eintrag


ACT ONE. An Algebraic Specification Language Based on Initial Algebra and Free Functor Semantics.

Ehrig, H. and Hansen, H.

Proc. of the 10th National Summer School "Appl. of Math. in Eng." Varna. University of Varna. 1984

Download Bibtex Eintrag


Algebraic Approaches to Graph Transformation II: Single Pushout Approach and Comparison with Double Pushout Approach

Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A. and Corradini, A.

Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations. World Scientific, 247–312. 1997

Download Bibtex Eintrag

Algebraic Approaches to Graph Transformation II: Single Pushout Approach and Comparison with Double Pushout Approach

Ehrig, H., Heckel, R., Korff, M., Löwe, M., Ribeiro, L., Wagner, A. and Corradini, A.

The Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, 247-312. 1996

Download Bibtex Eintrag

Construction and Characterization of Double-Pullback Graph Transitions

Ehrig, H., Heckel, R., Llabres, M. and Orejas, F.

Proc.\ 6th Int. Workshop on Theory and Applications of Graph Transformation (TAGT'98), 308–315. 1998

Download Bibtex Eintrag

Basic Properties of Double-Pullback Graph Transitions

Ehrig, H., Heckel, R., Llabres, M. and Orejas, F.

1999

Download Bibtex Eintrag

Basic Properties of Double-Pullback Graph Transitions

Ehrig, H., Heckel, R., Llabres, M., Orejas, F. and Padberg, J.

1999

Download Bibtex Eintrag

Basic Properties of Double Pullback Graph Transitions

Ehrig, H., Heckel, R., Llabres, M., Orejas, F. and Padberg, J.

1999

Download Bibtex Eintrag

Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information

Ehrig, H., Heckel, R., Llabres, M., Orejas, F., Padberg, J. and Rozenberg, G.

Proc. Theory and Application of Graph Transformations (TAGT'98). SPRINGER, 85–102. 2000

Download Bibtex Eintrag

Synchronization of Views and Loose Semantics of Typed Graph Productions

Ehrig, H., Heckel, R., Padberg, J., Taentzer, G., Wolter, U., Corradini, A. and Engels, G.

Report on the Dagstuhl-Seminar 9637 \emphGraph Transformations in Computer Science 1996

Download Bibtex Eintrag

Graph Transformations and Other Rule-Based Formalisms with Incomplete Information

Ehrig, H., Heckel, R., Rozenberg, G. and Padberg, J.

Proc. Sixth International Workshop on Theory and Application of Graph Transformations (TAGT'98). Universität Paderborn, 268–278. 1998

Download Bibtex Eintrag



Completeness and Correctness of Model Transformations based on Triple Graph Grammars with Negative Application Conditions

Ehrig, H., Hermann, F. and Sartorius, C.

Proc. Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'09). European Association of Software Science and Technology. 2009

Link zur Publikation Download Bibtex Eintrag


Propagation of Constraints along Model Transformations Based on Triple Graph Grammars

Ehrig, H., Hermann, F., Schölzel, H. and Brandt, C.

Proceedings of the International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT'11). European Association of Software Science and Technology. 2011

Link zur Publikation Download Bibtex Eintrag

Propagation of constraints along model transformations using triple graph grammars and borrowed context

Ehrig, H., Hermann, F., Schölzel, H. and Brandt, C.

Visual Languages and Computing, 365-388. 2013

Download Bibtex Eintrag

The Construct PRO of Projection Spaces: Its Internal Structure

Ehrig, H. and Herrlich, H.

Categorical Methods in Computer Science. SPRINGER, 286–293. 1989

Download Bibtex Eintrag

A Graph Theoretical Model for Multi-Pass Parsing

Ehrig, H., Hoffmann, B. and Schmiedicke, I. R.

Proc. Workshop on Graph-Theoretical Concepts in Computer Science, Linz. Hanser Verlag, 19–31. 1981

Download Bibtex Eintrag

Composition and Independence of High-Level Net Processes

Ehrig, H., Hoffmann, K., Gabriel, K. and Padberg, J.

Proc. Workshop on Formal Methods for Wireless Systems (FMWS'08). Elsevier Science. 2009

Link zur Publikation Download Bibtex Eintrag

Transformations of Petri Nets

Ehrig, H., Hoffmann, K. and Padberg, J.

Proceedings of the School of SegraVis Research Training Network on Foundations of Visual Modelling Techniques (FoVMT 2004). Elsevier Science, 151–172. 2006

Link zur Publikation Download Bibtex Eintrag

High-Level Net Processes

Ehrig, H., Hoffmann, K., Padberg, J., Baldan, P. and Heckel, R.

Formal and Natural Computing. SPRINGER, 191 - 219. 2002

Download Bibtex Eintrag

Petri Net Transformations

Ehrig, H., Hoffmann, K., Padberg, J., Ermel, C., Prange, U., Biermann, E. and Modica, T.

Petri Net Theory and Applications. I-Tech Education and Publication, 1–16. 2008

Link zur Publikation Download Bibtex Eintrag

Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems

Ehrig, H., Hoffmann, K., Padberg, J., Prange, U. and Ermel, C.

Proc. of 28th International Conference on Application and Theory of Petri Nets and Other Models of Concurrency. Springer, 104–123. 2007

Link zur Publikation Download Bibtex Eintrag


Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Language

Ehrig, H., Jimenez, R. M. and Orejas, F.

Proc.\ TAPSOFT '93, Paris. SPRINGER, 16–30. 1993

Download Bibtex Eintrag

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting with Borrowed Contexts

Ehrig, H. and König, B.

Mathematical Structures in Computer Science, 1133–1163. 2006

Download Bibtex Eintrag

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe