• Publications
  • Influence
Sesqui-Pushout Rewriting
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 ofExpand
  • 111
  • 13
Tools and Algorithms for the Construction and Analysis of Systems
  • 78
  • 7
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
  • H. Ehrig, B. König
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1 December 2006
Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to address this problem in the DPO (double-pushout)Expand
  • 78
  • 6
On Deterministic Finite Automata and Syntactic Monoid Size
  • 44
  • 6
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
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) approachExpand
  • 97
  • 5
A Static Analysis Technique for Graph Transformation Systems
In this paper we introduce a static analysis technique for graph transformation systems. We present an algorithm which, given a graph transformation system and a start graph, produces a finiteExpand
  • 103
  • 5
A Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebraic view on systems toExpand
  • 48
  • 4
Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
Graph transformation systems are a general specification language for systems with dynamically changing topologies, such as mobile and distributed systems. We propose a counterexample-guidedExpand
  • 84
  • 4
Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems
We describe the design and the present state of the verification tool Augur 2 which is currently being developed. It is based on Augur 1, a tool which can analyze graph transformation systems byExpand
  • 79
  • 3
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem via a backwardExpand
  • 43
  • 3