Person: Barbara König

DBLP: K=ouml=nig:Barbara

Facilitated 3 volumes:

Ed

Ed

Ed

Contributed to:

2015

2014

2013

2012

2012

2012

2012

2011

2011

2010

2010

2010

2008

2008

2008

2007

2006

2008

2006

2006

2006

2005

2004

2004

2003

2003

2002

2002

2017

Wrote 39 papers:

ICGT-2015-Bruggink0NZ #graph #graph transformation #proving #termination #using

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (HJSB, BK, DN, HZ), pp. 52–68.

RTA-TLCA-2014-ZantemaKB #termination

Termination of Cycle Rewriting (HZ, BK, HJSB), pp. 476–490.

GT-VMT-2013-KupperKB #category theory

Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories (SK, BK, HJSB).

FoSSaCS-2012-AdamekBHKMS #algebra

A Coalgebraic Perspective on Minimization and Determinization (JA, FB, MH, BK, SM, AS), pp. 58–73.

FoSSaCS-2012-HulsbuschK #bisimulation

Deriving Bisimulation Congruences for Conditional Reactive Systems (MH, BK), pp. 361–375.

GT-VMT-2012-BrugginkHK #automaton #graph #towards

Towards Alternating Automata for Graph Languages (HJSB, MH, BK).

ICGT-2012-BlumeBEK #automaton #graph #implementation #invariant #performance

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (CB, HJSB, DE, BK), pp. 264–278.

ICGT-2012-KonigS #graph transformation

Well-Structured Graph Transformation Systems with Negative Application Conditions (BK, JS), pp. 81–95.

RTA-2012-BertrandDKSS #decidability #graph transformation #on the #reachability

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems (NB, GD, BK, AS, JS), pp. 101–116.

GT-VMT-2011-BlumeBFK

Treewidth, Pathwidth and Cospan Decompositions (CB, HJSB, MF, BK).

GCM-2010-HeumullerJKS11 #category theory

Construction of Pushout Complements in the Category of Hypergraphs (MH, SJ, BK, JS).

GT-VMT-2010-BlumeBK #graph #invariant

Recognizable Graph Languages for Checking Invariants (CB, HJSB, BK).

GT-VMT-2010-HermannCEK #analysis #equivalence #graph #performance #permutation #petri net

Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).

ICGT-2010-BaldanBCKS #graph grammar #on the

On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars (PB, AB, AC, BK, SS), pp. 91–106.

ICGT-2010-KonigE #graph transformation #specification #verification

Verification of Graph Transformation Systems with Context-Free Specifications (BK, JE), pp. 107–122.

IFM-2010-HulsbuschKRSSW #comparison #model transformation #semantics

Showing Full Semantics Preservation in Model Transformation — A Comparison of Techniques (MH, BK, AR, MS, CS, HW), pp. 183–198.

CAV-2008-JoshiK #graph transformation #theorem #verification

Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems (SJ, BK), pp. 214–226.

FoSSaCS-2008-RangelKE #bisimulation

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (GR, BK, HE), pp. 413–427.

ICGT-2008-BaldanCEK #composition #nondeterminism #petri net #process

Open Petri Nets: Non-deterministic Processes and Compositionality (PB, AC, HE, BK), pp. 257–273.

ICGT-2008-BrugginkK #graph #on the

On the Recognizability of Arrow and Graph Languages (HJSB, BK), pp. 336–350.

ICGT-2008-KonigK #graph transformation #towards #verification

Towards the Verification of Attributed Graph Transformation Systems (BK, VK), pp. 305–320.

ICGT-2008-RangelLKEB #behaviour #refactoring #using

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts (GR, LL, BK, HE, PB), pp. 242–256.

GT-VMT-2007-RangelKE #approach #bisimulation #verification

Bisimulation Verification for the DPO Approach with Borrowed (GR, BK, HE).

FoSSaCS-2006-BaldanCHKS #process #term rewriting

Processes for Adhesive Rewriting Systems (PB, AC, TH, BK, PS), pp. 202–216.

FoSSaCS-2006-BaldanHK #distributed #petri net

Distributed Unfolding of Petri Nets (PB, SH, BK), pp. 126–141.

GT-VMT-2006-KonigK08 #analysis #graph transformation

Augur 2 — A New Version of a Tool for the Analysis of Graph Transformation Systems (BK, VK), pp. 201–210.

ICGT-2006-BaldanEK #composition

Composition and Decomposition of DPO Transformations with Borrowed Context (PB, HE, BK), pp. 153–167.

ICGT-2006-BonchiGK #bisimulation #encoding #process #visual notation

Process Bisimulation Via a Graphical Encoding (FB, FG, BK), pp. 168–183.

ICGT-2006-CorradiniHHK #category theory

Sesqui-Pushout Rewriting (AC, TH, FH, BK), pp. 30–45.

LICS-2006-BonchiKM #semantics

Saturated Semantics for Reactive Systems (FB, BK, UM), pp. 69–80.

TACAS-2006-KonigK #abstraction #analysis #graph transformation #refinement

Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems (BK, VK), pp. 197–211.

DLT-2005-GruberHKK #automaton #on the

On Timed Automata with Discrete Time — Structural and Language Theoretical Characterization (HG, MH, AK, BK), pp. 272–283.

FoSSaCS-2004-EhrigK #approach #bisimulation #graph grammar

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting (HE, BK), pp. 151–166.

ICGT-2004-BaldanKS #code generation #generative #graph transformation #testing

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems (PB, BK, IS), pp. 194–209.

DLT-2003-HolzerK #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.

SAS-2003-BaldanKK #abstraction #graph transformation #logic

A Logic for Analyzing Abstractions of Graph Transformation Systems (PB, BK, BK), pp. 255–272.

DLT-2002-HolzerK02a #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.

ICGT-2002-BaldanK #approximate #behaviour #graph transformation

Approximating the Behaviour of Graph Transformation Systems (PB, BK), pp. 14–29.

QAPL-2017-KoenigKM #analysis #named

PAWS: A Tool for the Analysis of Weighted Systems (BK, SK, CM), pp. 75–91.