Live briefing
Everything about Hartmut Ehrig
German computer scientist (1944 - 2016)
Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Hartmut EhrigA 5-minute orientation
- Pick up a classic book: Graph TransformationsThe most-reprinted book on the subject
- Go sideways: Grzegorz RozenbergA closely related topic
- Go sideways: Hans-Jörg KreowskiA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Graph TransformationsGrzegorz Rozenberg, Arend Rensink · 2004
Fundamentals of Algebraic Specification 1Hartmut Ehrig · 1985
Fundamentals of algebraic specification 2Hartmut Ehrig, Bernd Mahr · 1990
Graph grammars and their application to computer scienceHartmut Ehrig, Grzegorz Rozenberg · 1991
Graph and Model TransformationHartmut Ehrig, Claudia Ermel · 2015
Handbook of Graph Grammars and Computing by Graph Transformations Vol. 3Hartmut Ehrig · 1999
Formal Methods in Software and Systems ModelingUgo Montanari, Fernando Orejas · 2005
Graph TransformationRachid Echahed, Mark Minas · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Grzegorz Rozenberg Grzegorz Rozenberg (born 14 March 1942, Warsaw) is a Polish and Dutch computer scientist. His primary research areas are natural computing, formal language…
- Hans-Jörg Kreowski Hans-Jörg Kreowski (born 10 August 1949) is a professor for computer science at the University of Bremen in North West Germany. His primary research area…
- Double pushout graph rewriting In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced…
- Trace theory In mathematics and computer science, trace theory aims to provide a concrete mathematical underpinning for the study of concurrent computation and process…
- Bigraph A bigraph can be modelled as the superposition of a graph (the link graph) and a set of trees (the place graph). Each node of the bigraph is part of a…
- Graph rewriting In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically…
- Petri Net Markup Language Petri Net Markup Language (PNML) is an interchange format aimed at enabling Petri net tools to exchange Petri net models. PNML is an XML-based syntax for…
- Dines Bjørner Dines Bjørner (born 4 October 1937) is a Danish computer scientist. He specializes in research into domain engineering, requirements engineering and formal…