2009 |
56 | EE | Filippo Bonchi,
Fabio Gadducci,
Barbara König:
Synthesising CCS bisimulation using graph rewriting.
Inf. Comput. 207(1): 14-40 (2009) |
2008 |
55 | EE | Salil Joshi,
Barbara König:
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems.
CAV 2008: 214-226 |
54 | EE | Paolo Baldan,
Thomas Chatain,
Stefan Haar,
Barbara König:
Unfolding-Based Diagnosis of Systems with an Evolving Topology.
CONCUR 2008: 203-217 |
53 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König:
Unfolding Graph Transformation Systems: Theory and Applications to Verification.
Concurrency, Graphs and Models 2008: 16-36 |
52 | EE | Guilherme Rangel,
Barbara König,
Hartmut Ehrig:
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions.
FoSSaCS 2008: 413-427 |
51 | EE | Guilherme Rangel,
Leen Lambers,
Barbara König,
Hartmut Ehrig,
Paolo Baldan:
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts.
ICGT 2008: 242-256 |
50 | EE | Paolo Baldan,
Andrea Corradini,
Hartmut Ehrig,
Barbara König:
Open Petri Nets: Non-deterministic Processes and Compositionality.
ICGT 2008: 257-273 |
49 | EE | Barbara König,
Vitali Kozioura:
Towards the Verification of Attributed Graph Transformation Systems.
ICGT 2008: 305-320 |
48 | EE | Harrie Jan Sander Bruggink,
Barbara König:
On the Recognizability of Arrow and Graph Languages.
ICGT 2008: 336-350 |
47 | EE | Paolo Baldan,
Barbara König:
Workshop on Petri Nets and Graph Transformations.
ICGT 2008: 467-469 |
46 | EE | Paolo Baldan,
Andrea Corradini,
Hartmut Ehrig,
Reiko Heckel,
Barbara König:
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
CoRR abs/0809.4115: (2008) |
45 | EE | Barbara König,
Vitali Kozioura:
Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems.
Electr. Notes Theor. Comput. Sci. 211: 201-210 (2008) |
44 | EE | Barbara König,
Arend Rensink,
Reiko Heckel:
Preface.
Electr. Notes Theor. Comput. Sci. 213(1): 1-2 (2008) |
43 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König:
A framework for the verification of infinite-state graph transformation systems.
Inf. Comput. 206(7): 869-907 (2008) |
42 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König,
Stefan Schwoon:
McMillan's Complete Prefix for Contextual Nets.
T. Petri Nets and Other Models of Concurrency 1: 199-220 (2008) |
2007 |
41 | EE | Paolo Baldan,
Andrea Corradini,
Hartmut Ehrig,
Reiko Heckel,
Barbara König:
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
CALCO 2007: 126-142 |
40 | EE | Barbara König:
Deriving Bisimulation Congruences with Borrowed Contexts.
CALCO 2007: 36-39 |
39 | EE | Guilherme Rangel,
Barbara König,
Hartmut Ehrig:
Bisimulation Verification for the DPO Approach with Borrowed.
ECEASST 6: (2007) |
38 | EE | Arend Rensink,
Reiko Heckel,
Barbara König:
Preface.
Electr. Notes Theor. Comput. Sci. 175(4): 1-2 (2007) |
37 | EE | Andrea Corradini,
Fabio Gadducci,
Wolfram Kahl,
Barbara König:
Inequational Deduction as Term Graph Rewriting.
Electr. Notes Theor. Comput. Sci. 72(1): 31-44 (2007) |
36 | EE | Barbara König,
Vitali Kozioura:
Incremental construction of coverability graphs.
Inf. Process. Lett. 103(5): 203-209 (2007) |
2006 |
35 | EE | Paolo Baldan,
Stefan Haar,
Barbara König:
Distributed Unfolding of Petri Nets.
FoSSaCS 2006: 126-141 |
34 | EE | Paolo Baldan,
Andrea Corradini,
Tobias Heindel,
Barbara König,
Pawel Sobocinski:
Processes for Adhesive Rewriting Systems.
FoSSaCS 2006: 202-216 |
33 | EE | Paolo Baldan,
Hartmut Ehrig,
Barbara König:
Composition and Decomposition of DPO Transformations with Borrowed Context.
ICGT 2006: 153-167 |
32 | EE | Filippo Bonchi,
Fabio Gadducci,
Barbara König:
Process Bisimulation Via a Graphical Encoding.
ICGT 2006: 168-183 |
31 | EE | Andrea Corradini,
Tobias Heindel,
Frank Hermann,
Barbara König:
Sesqui-Pushout Rewriting.
ICGT 2006: 30-45 |
30 | EE | Filippo Bonchi,
Barbara König,
Ugo Montanari:
Saturated Semantics for Reactive Systems.
LICS 2006: 69-80 |
29 | EE | Barbara König,
Vitali Kozioura:
Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems.
TACAS 2006: 197-211 |
28 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König,
Alberto Lluch-Lafuente:
A Temporal Graph Logic for Verification of Graph Transformation Systems.
WADT 2006: 1-20 |
27 | EE | Barbara König:
Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs.
ECEASST 2: (2006) |
26 | EE | Arend Rensink,
Reiko Heckel,
Barbara König:
Preface.
Electr. Notes Theor. Comput. Sci. 154(2): 1-5 (2006) |
25 | EE | Hartmut Ehrig,
Barbara König:
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts.
Mathematical Structures in Computer Science 16(6): 1133-1163 (2006) |
2005 |
24 | | Barbara König,
Ugo Montanari,
Philippa Gardner:
Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 6.-11. June 2004
IBFI, Schloss Dagstuhl, Germany 2005 |
23 | EE | Hermann Gruber,
Markus Holzer,
Astrid Kiehn,
Barbara König:
On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization.
Developments in Language Theory 2005: 272-283 |
22 | EE | Barbara König:
A general framework for types in graph rewriting.
Acta Inf. 42(4-5): 349-388 (2005) |
21 | | Barbara König,
Vitali Kozioura:
Augur - A Tool for the Analysis of Graph Transformation Systems.
Bulletin of the EATCS 87: 126-137 (2005) |
20 | EE | Barbara König:
Analysing input/output-capabilities of mobile processes with a generic type system.
J. Log. Algebr. Program. 63(1): 35-58 (2005) |
2004 |
19 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König:
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach.
CONCUR 2004: 83-98 |
18 | EE | Hartmut Ehrig,
Barbara König:
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting.
FoSSaCS 2004: 151-166 |
17 | EE | Barbara König,
Ugo Montanari,
Philippa Gardner:
04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems.
Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 |
16 | EE | Paolo Baldan,
Barbara König,
Arend Rensink:
Summary 2: Graph Grammar Verification through Abstraction.
Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 |
15 | EE | Paolo Baldan,
Barbara König,
Ingo Stürmer:
Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems.
ICGT 2004: 194-209 |
14 | | Markus Holzer,
Barbara König:
Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory).
Bulletin of the EATCS 83: 139-155 (2004) |
13 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König,
Bernhard König:
Verifying a Behavioural Logic for Graph Transformation Systems.
Electr. Notes Theor. Comput. Sci. 104: 5-24 (2004) |
12 | EE | Markus Holzer,
Barbara König:
On deterministic finite automata and syntactic monoid size.
Theor. Comput. Sci. 327(3): 319-347 (2004) |
2003 |
11 | EE | Markus Holzer,
Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size, Continued.
Developments in Language Theory 2003: 349-360 |
10 | EE | Paolo Baldan,
Barbara König,
Bernhard König:
A Logic for Analyzing Abstractions of Graph Transformation Systems.
SAS 2003: 255-272 |
2002 |
9 | EE | Markus Holzer,
Barbara König:
On Deterministic Finite Automata and Syntactic Monoid Size.
Developments in Language Theory 2002: 258-269 |
8 | EE | Paolo Baldan,
Barbara König:
Approximating the Behaviour of Graph Transformation Systems.
ICGT 2002: 14-29 |
7 | | Barbara König:
Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems.
Mathematical Structures in Computer Science 12(2): 149-175 (2002) |
2001 |
6 | EE | Paolo Baldan,
Andrea Corradini,
Barbara König:
A Static Analysis Technique for Graph Transformation Systems.
CONCUR 2001: 381-395 |
5 | EE | Barbara König,
Ugo Montanari:
Observational Equivalence for Synchronized Graph Rewriting with Mobility.
TACS 2001: 145-164 |
2000 |
4 | EE | Barbara König:
A General Framework for Types in Graph Rewriting.
FSTTCS 2000: 373-384 |
3 | EE | Barbara König:
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System.
ICALP 2000: 403-414 |
2 | | Barbara König:
A Graph Rewriting Semantics for the Polyadic Calculus.
ICALP Satellite Workshops 2000: 451-458 |
1999 |
1 | EE | Barbara König:
Generating Type Systems for Process Graphs.
CONCUR 1999: 352-367 |