Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Sesqui-Pushout Rewriting

- A. Corradini, T. Heindel, F. Hermann, B. König
- Computer Science
- ICGT
- 17 September 2006

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… Expand

Tools and Algorithms for the Construction and Analysis of Systems

- C. Flanagan, B. König
- Computer Science
- Lecture Notes in Computer Science
- 24 March 2012

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts

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

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) approach… Expand

A Static Analysis Technique for Graph Transformation Systems

- P. Baldan, A. Corradini, B. König
- Computer Science
- CONCUR
- 20 August 2001

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 finite… Expand

A Coalgebraic Perspective on Minimization and Determinization

- J. Adámek, F. Bonchi, Mathias Hülsbusch, B. König, S. Milius, A. Silva
- Computer Science
- FoSSaCS
- 24 March 2012

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 to… Expand

Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems

- B. König, V. Kozyura
- Computer Science
- TACAS
- 25 March 2006

Graph transformation systems are a general specification language for systems with dynamically changing topologies, such as mobile and distributed systems. We propose a counterexample-guided… Expand

Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems

- B. König, V. Kozyura
- Computer Science
- Electron. Notes Theor. Comput. Sci.
- 1 April 2008

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 by… Expand

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 backward… Expand