| 2026 | CONCUR | Threshold-Based Behavioural Distances. | Jonas Forster, Lutz Schrder, Paul Wild, Barbara Knig, Pedro Nora |
| 2026 | FOSSACS | Generalized Kantorovich-Rubinstein Duality beyond Hausdorff and Kantorovich. | Paul Wild, Lutz Schrder, Karla Messing, Barbara Knig, Jonas Forster |
| 2026 | ICALP | Witnesses for Fixpoint Games on Lattices. | Barbara Knig, Karla Messing |
| 2026 | TACAS | Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games. | Paolo Baldan, Sebastian Gurke, Barbara Knig, Florian Wittbold |
| 2025 | CAV | Approximating Fixpoints of Approximated Functions. | Paolo Baldan, Sebastian Gurke, Barbara Knig, Tommaso Padoan, Florian Wittbold |
| 2025 | CSL | Quantitative Graded Semantics and Spectra of Behavioural Metrics. | Jonas Forster, Lutz Schrder, Paul Wild, Harsh Beohar, Sebastian Gurke, Barbara Knig, Karla Messing |
| 2025 | JELIA | Unsupervised Automata Learning via Discrete Optimization. | Simon Lutz, Daniil Kaminskyi, Florian Wittbold, Simon Dierl, Falk Howar, Barbara Knig, Emmanuel Mller, Daniel Neider |
| 2024 | CONCUR | Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques. | Keri D'Angelo, Sebastian Gurke, Johanna Maria Kirss, Barbara Knig, Matina Najafi, Wojciech Rozowski, Paul Wild |
| 2024 | CONCUR | Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. | Lara Stoltenow, Barbara Knig, Sven Schneider, Andrea Corradini, Leen Lambers, Fernando Orejas |
| 2024 | CSL | Approximating Fixpoints of Approximated Functions (Invited Talk). | Barbara Knig |
| 2024 | STACS | Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. | Harsh Beohar, Sebastian Gurke, Barbara Knig, Karla Messing, Jonas Forster, Lutz Schrder, Paul Wild |
| 2023 | CSL | A Lattice-Theoretical View of Strategy Iteration. | Paolo Baldan, Richard Eggert, Barbara Knig, Tommaso Padoan |
| 2023 | CSL | Hennessy-Milner Theorems via Galois Connections. | Harsh Beohar, Sebastian Gurke, Barbara Knig, Karla Messing |
| 2022 | LICS | Graded Monads and Behavioural Equivalence Games. | Chase Ford, Stefan Milius, Lutz Schrder, Harsh Beohar, Barbara Knig |
| 2022 | MEMOCODE | Lifecycle-Based View on Cyber-Physical System Models Using Extended Hidden Markov Models. | Matthias Schaffeld, Rebecca Bernemann, Torben Weis, Barbara Knig, Viktor Matkovic |
| 2021 | FOSSACS | Fixpoint Theory - Upside Down. | Paolo Baldan, Richard Eggert, Barbara Knig, Tommaso Padoan |
| 2020 | CONCUR | Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. | Paolo Baldan, Barbara Knig, Tommaso Padoan |
| 2020 | FSCD | Conditional Bisimilarity for Reactive Systems. | Mathias Hlsbusch, Barbara Knig, Sebastian Kpper, Lara Stoltenow |
| 2019 | FOSSACS | Rewriting Abstract Structures: Materialization Explained Categorically. | Andrea Corradini, Tobias Heindel, Barbara Knig, Dennis Nolte, Arend Rensink |
| 2019 | IJCAI | A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. | Paul Wild, Lutz Schrder, Dirk Pattinson, Barbara Knig |
| 2018 | CONCUR | Up-To Techniques for Behavioural Metrics via Fibrations. | Filippo Bonchi, Barbara Knig, Daniela Petrisan |
| 2018 | CONCUR | Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. | Benjamin Cabrera, Tobias Heindel, Reiko Heckel, Barbara Knig |
| 2018 | CONCUR | (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. | Barbara Knig, Christina Mika-Michalski |
| 2018 | LICS | A van Benthem Theorem for Fuzzy Modal Logic. | Paul Wild, Lutz Schrder, Dirk Pattinson, Barbara Knig |
| 2017 | TACAS | Up-To Techniques for Weighted Systems. | Filippo Bonchi, Barbara Knig, Sebastian Kpper |
| 2017 | TASE | Conditional transition systems with upgrades. | Harsh Beohar, Barbara Knig, Sebastian Kpper, Alexandra Silva |
| 2015 | CALCO | Towards Trace Metrics via Functor Lifting. | Paolo Baldan, Filippo Bonchi, Henning Kerstan, Barbara Knig |
| 2014 | CONCUR | A General Framework for Well-Structured Graph Transformation Systems. | Barbara Knig, Jan Stckrath |
| 2012 | CONCUR | Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. | Henning Kerstan, Barbara Knig |
| 2012 | FOSSACS | A Coalgebraic Perspective on Minimization and Determinization. | Jir Admek, Filippo Bonchi, Mathias Hlsbusch, Barbara Knig, Stefan Milius, Alexandra Silva |
| 2012 | FOSSACS | Deriving Bisimulation Congruences for Conditional Reactive Systems. | Mathias Hlsbusch, Barbara Knig |
| 2010 | IFM | Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. | Mathias Hlsbusch, Barbara Knig, Arend Rensink, Maria Semenyak, Christian Soltenborn, Heike Wehrheim |
| 2009 | CALCO | Unfolding Grammars in Adhesive Categories. | Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara Knig, Pawel Sobocinski |
| 2008 | CAV | Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. | Salil Joshi, Barbara Knig |
| 2008 | CONCUR | Unfolding-Based Diagnosis of Systems with an Evolving Topology. | Paolo Baldan, Thomas Chatain, Stefan Haar, Barbara Knig |
| 2008 | FOSSACS | Deriving Bisimulation Congruences in the Presence of Negative Application Conditions. | Guilherme Rangel, Barbara Knig, Hartmut Ehrig |
| 2007 | CALCO | Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets. | Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Barbara Knig |
| 2007 | CALCO | Deriving Bisimulation Congruences with Borrowed Contexts. | Barbara Knig |
| 2006 | FOSSACS | Processes for Adhesive Rewriting Systems. | Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara Knig, Pawel Sobocinski |
| 2006 | FOSSACS | Distributed Unfolding of Petri Nets. | Paolo Baldan, Stefan Haar, Barbara Knig |
| 2006 | LICS | Saturated Semantics for Reactive Systems. | Filippo Bonchi, Barbara Knig, Ugo Montanari |
| 2006 | TACAS | Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. | Barbara Knig, Vitali Kozioura |
| 2005 | DLT | On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. | Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara Knig |
| 2004 | CONCUR | Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. | Paolo Baldan, Andrea Corradini, Barbara Knig |
| 2004 | FOSSACS | Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. | Hartmut Ehrig, Barbara Knig |
| 2003 | DLT | On Deterministic Finite Automata and Syntactic Monoid Size, Continued. | Markus Holzer, Barbara Knig |
| 2003 | SAS | A Logic for Analyzing Abstractions of Graph Transformation Systems. | Paolo Baldan, Barbara Knig, Bernhard Knig |
| 2002 | DLT | On Deterministic Finite Automata and Syntactic Monoid Size. | Markus Holzer, Barbara Knig |
| 2001 | CONCUR | A Static Analysis Technique for Graph Transformation Systems. | Paolo Baldan, Andrea Corradini, Barbara Knig |
| 2000 | ICALP | Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System. | Barbara Knig |
| 2000 | ICALP | A Graph Rewriting Semantics for the Polyadic Calculus. | Barbara Knig |
| 1999 | CONCUR | Generating Type Systems for Process Graphs. | Barbara Knig |