Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Barbara König
2010 – today
- 2013
[j35]Sebastian Küpper, Barbara König, Harrie Jan Sander Bruggink: Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories. ECEASST 58 (2013)- [j34]Christoph Blume, Harrie Jan Sander Bruggink, Martin Friedrich, Barbara König: Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. J. Vis. Lang. Comput. 24(3): 192-206 (2013)
- 2012
- [j33]Andrei Dorman, Tobias Heindel, Barbara König: Structured Operational Semantics for Graph Rewriting. Sci. Ann. Comp. Sci. 22(1): 105-145 (2012)
- [j32]Harrie Jan Sander Bruggink, Mathias Hülsbusch, Barbara König: Towards Alternating Automata for Graph Languages. ECEASST 47 (2012)
- [j31]
- [j30]Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodríguez, Stefan Schwoon: Efficient unfolding of contextual Petri nets. Theor. Comput. Sci. 449: 2-22 (2012)
- [c47]Henning Kerstan, Barbara König: Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. CONCUR 2012: 410-424
- [c46]Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva: A Coalgebraic Perspective on Minimization and Determinization. FoSSaCS 2012: 58-73
- [c45]Mathias Hülsbusch, Barbara König: Deriving Bisimulation Congruences for Conditional Reactive Systems. FoSSaCS 2012: 361-375
- [c44]Barbara König, Jan Stückrath: Well-Structured Graph Transformation Systems with Negative Application Conditions. ICGT 2012: 81-95
- [c43]Christoph Blume, Harrie Jan Sander Bruggink, Dominik Engelke, Barbara König: Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. ICGT 2012: 264-278
- [c42]Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath: On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. RTA 2012: 101-116
- [e3]Cormac Flanagan, Barbara König (Eds.): Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference, TACAS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Lecture Notes in Computer Science 7214, Springer 2012, ISBN 978-3-642-28755-8
- 2011
- [j29]Marvin Heumüller, Salil Joshi, Barbara König, Jan Stückrath: Construction of Pushout Complements in the Category of Hypergraphs. ECEASST 39 (2011)
- [j28]Christoph Blume, Harrie Jan Sander Bruggink, Martin Friedrich, Barbara König: Treewidth, Pathwidth and Cospan Decompositions. ECEASST 41 (2011)
- [j27]Paolo Baldan, Filippo Bonchi, Andrea Corradini, Tobias Heindel, Barbara König: A lattice-theoretical perspective on adhesive categories. J. Symb. Comput. 46(3): 222-245 (2011)
- [c41]Harrie Jan Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König: Conditional Reactive Systems. FSTTCS 2011: 191-203
- [e2]Joost-Pieter Katoen, Barbara König (Eds.): CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings. Lecture Notes in Computer Science 6901, Springer 2011, ISBN 978-3-642-23216-9
- 2010
- [j26]Christoph Blume, Harrie Jan Sander Bruggink, Barbara König: Recognizable Graph Languages for Checking Invariants. ECEASST 29 (2010)
- [j25]Frank Hermann, Andrea Corradini, Hartmut Ehrig, Barbara König: Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets. ECEASST 29 (2010)
- [j24]Frank Hermann, Mathias Hülsbusch, Barbara König: Specification and Verification of Model Transformations. ECEASST 30 (2010)
- [j23]Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König: Unfolding-based diagnosis of systems with an evolving topology. Inf. Comput. 208(10): 1169-1192 (2010)
- [c40]Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, Stefan Schwoon: On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. ICGT 2010: 91-106
- [c39]Barbara König, Javier Esparza: Verification of Graph Transformation Systems with Context-Free Specifications. ICGT 2010: 107-122
- [c38]Harrie Jan Sander Bruggink, Barbara König: A Logic on Subobjects and Recognizability. IFIP TCS 2010: 197-212
- [c37]Mathias Hülsbusch, Barbara König, Arend Rensink, Maria Semenyak, Christian Soltenborn, Heike Wehrheim: Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. IFM 2010: 183-198
2000 – 2009
- 2009
- [j22]Hartmut Ehrig, Claudia Ermel, Frank Hermann, Barbara König: Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation. Bulletin of the EATCS 97: 117-125 (2009)
- [j21]Filippo Bonchi, Fabio Gadducci, Barbara König: Synthesising CCS bisimulation using graph rewriting. Inf. Comput. 207(1): 14-40 (2009)
- [c36]Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski: Unfolding Grammars in Adhesive Categories. CALCO 2009: 350-366
- 2008
- [j20]
- [j19]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)
- [j18]Barbara König, Arend Rensink, Reiko Heckel: Preface. Electr. Notes Theor. Comput. Sci. 213(1): 1-2 (2008)
- [j17]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)
- [j16]Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Barbara König: Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets. Logical Methods in Computer Science 4(4) (2008)
- [j15]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)
- [c35]Paolo Baldan, Andrea Corradini, Barbara König: Unfolding Graph Transformation Systems: Theory and Applications to Verification. Concurrency, Graphs and Models 2008: 16-36
- [c34]Salil Joshi, Barbara König: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. CAV 2008: 214-226
- [c33]Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara König: Unfolding-Based Diagnosis of Systems with an Evolving Topology. CONCUR 2008: 203-217
- [c32]Guilherme Rangel, Barbara König, Hartmut Ehrig: Deriving Bisimulation Congruences in the Presence of Negative Application Conditions. FoSSaCS 2008: 413-427
- [c31]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
- [c30]Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Barbara König: Open Petri Nets: Non-deterministic Processes and Compositionality. ICGT 2008: 257-273
- [c29]Barbara König, Vitali Kozioura: Towards the Verification of Attributed Graph Transformation Systems. ICGT 2008: 305-320
- [c28]Harrie Jan Sander Bruggink, Barbara König: On the Recognizability of Arrow and Graph Languages. ICGT 2008: 336-350
- [c27]
- [i1]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)
- 2007
- [j14]Guilherme Rangel, Barbara König, Hartmut Ehrig: Bisimulation Verification for the DPO Approach with Borrowed. ECEASST 6 (2007)
- [j13]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)
- [j12]Arend Rensink, Reiko Heckel, Barbara König: Preface. Electr. Notes Theor. Comput. Sci. 175(4): 1-2 (2007)
- [j11]Barbara König, Vitali Kozioura: Incremental construction of coverability graphs. Inf. Process. Lett. 103(5): 203-209 (2007)
- [c26]
- [c25]Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Barbara König: Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets. CALCO 2007: 126-142
- 2006
- [j10]Barbara König: Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs. ECEASST 2 (2006)
- [j9]Arend Rensink, Reiko Heckel, Barbara König: Preface. Electr. Notes Theor. Comput. Sci. 154(2): 1-5 (2006)
- [j8]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)
- [c24]Paolo Baldan, Stefan Haar, Barbara König: Distributed Unfolding of Petri Nets. FoSSaCS 2006: 126-141
- [c23]Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, Pawel Sobocinski: Processes for Adhesive Rewriting Systems. FoSSaCS 2006: 202-216
- [c22]Andrea Corradini, Tobias Heindel, Frank Hermann, Barbara König: Sesqui-Pushout Rewriting. ICGT 2006: 30-45
- [c21]Paolo Baldan, Hartmut Ehrig, Barbara König: Composition and Decomposition of DPO Transformations with Borrowed Context. ICGT 2006: 153-167
- [c20]Filippo Bonchi, Fabio Gadducci, Barbara König: Process Bisimulation Via a Graphical Encoding. ICGT 2006: 168-183
- [c19]Filippo Bonchi, Barbara König, Ugo Montanari: Saturated Semantics for Reactive Systems. LICS 2006: 69-80
- [c18]Barbara König, Vitali Kozioura: Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. TACAS 2006: 197-211
- [c17]Paolo Baldan, Andrea Corradini, Barbara König, Alberto Lluch-Lafuente: A Temporal Graph Logic for Verification of Graph Transformation Systems. WADT 2006: 1-20
- 2005
- [j7]
- [j6]Barbara König, Vitali Kozioura: Augur - A Tool for the Analysis of Graph Transformation Systems. Bulletin of the EATCS 87: 126-137 (2005)
- [j5]Barbara König: Analysing input/output-capabilities of mobile processes with a generic type system. J. Log. Algebr. Program. 63(1): 35-58 (2005)
- [c16]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
- [e1]Barbara König, Ugo Montanari, Philippa Gardner (Eds.): Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 6.-11. June 2004. Dagstuhl Seminar Proceedings 04241, IBFI, Schloss Dagstuhl, Germany 2005
- 2004
- [j4]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)
- [j3]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)
- [j2]Markus Holzer, Barbara König: On deterministic finite automata and syntactic monoid size. Theor. Comput. Sci. 327(3): 319-347 (2004)
- [c15]Paolo Baldan, Andrea Corradini, Barbara König: Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. CONCUR 2004: 83-98
- [c14]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
- [c13]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
- [c12]Hartmut Ehrig, Barbara König: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. FoSSaCS 2004: 151-166
- [c11]Paolo Baldan, Barbara König, Ingo Stürmer: Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems. ICGT 2004: 194-209
- 2003
- [c10]Markus Holzer, Barbara König: On Deterministic Finite Automata and Syntactic Monoid Size, Continued. Developments in Language Theory 2003: 349-360
- [c9]Paolo Baldan, Barbara König, Bernhard König: A Logic for Analyzing Abstractions of Graph Transformation Systems. SAS 2003: 255-272
- 2002
- [j1]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)
- [c8]Markus Holzer, Barbara König: On Deterministic Finite Automata and Syntactic Monoid Size. Developments in Language Theory 2002: 258-269
- [c7]Paolo Baldan, Barbara König: Approximating the Behaviour of Graph Transformation Systems. ICGT 2002: 14-29
- 2001
- [c6]Paolo Baldan, Andrea Corradini, Barbara König: A Static Analysis Technique for Graph Transformation Systems. CONCUR 2001: 381-395
- [c5]Barbara König, Ugo Montanari: Observational Equivalence for Synchronized Graph Rewriting with Mobility. TACS 2001: 145-164
- 2000
- [c4]
- [c3]Barbara König: Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System. ICALP 2000: 403-414
- [c2]Barbara König: A Graph Rewriting Semantics for the Polyadic Calculus. ICALP Satellite Workshops 2000: 451-458
1990 – 1999
- 1999
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team