Description and verification of mobile processes with graph rewriting techniques. - Barbara König 001 (1998)

Generating Type Systems for Process Graphs. - Barbara König 001 (CONCUR, 1999)

A Graph Rewriting Semantics for the Polyadic Calculus. - Barbara König 001 (ICALP Satellite Workshops, 2000)

A Static Analysis Technique for Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (CONCUR, 2001)

Observational Equivalence for Synchronized Graph Rewriting with Mobility. - Barbara König 001; Ugo Montanari (TACS, 2001)

Approximating the Behaviour of Graph Transformation Systems. - Paolo Baldan; Barbara König 001 (ICGT, 2002)

Inequational Deduction as Term Graph Rewriting. - Andrea Corradini 001; Fabio Gadducci; Wolfram Kahl; Barbara König 001 (TERMGRAPH, 2002)

Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems. - Barbara König 001 (Math. Struct. Comput. Sci., 2002)

On Deterministic Finite Automata and Syntactic Monoid Size, Continued. - Markus Holzer 001; Barbara König 001 (Developments in Language Theory, 2003)

A Logic for Analyzing Abstractions of Graph Transformation Systems. - Paolo Baldan; Barbara König 001; Bernhard König (SAS, 2003)

Verifying a Behavioural Logic for Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Bernhard König (COMETA, 2003)

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (CONCUR, 2004)

Summary 2: Graph Grammar Verification through Abstraction. - Paolo Baldan; Barbara König 001; Arend Rensink (Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004)

04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. - Barbara König 001; Ugo Montanari; Philippa Gardner (Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004)

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. - Hartmut Ehrig; Barbara König 001 (FoSSaCS, 2004)

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems. - Paolo Baldan; Barbara König 001; Ingo Stürmer (ICGT, 2004)

Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory). - Markus Holzer 001; Barbara König 001 (Bull. EATCS, 2004)

On deterministic finite automata and syntactic monoid size. - Markus Holzer 001; Barbara König 001 (Theor. Comput. Sci., 2004)

Analysis and verification of systems with dynamically evolving structure (Analyse und Verifikation von Systemen mit dynamischen Strukturveränderungen) - Barbara König 001 (2004)

On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. - Hermann Gruber; Markus Holzer 001; Astrid Kiehn; Barbara König 001 (Developments in Language Theory, 2005)

A general framework for types in graph rewriting. - Barbara König 001 (Acta Informatica, 2005)

Augur - A Tool for the Analysis of Graph Transformation Systems. - Barbara König 001; Vitali Kozioura (Bull. EATCS, 2005)

Analysing input/output-capabilities of mobile processes with a generic type system. - Barbara König 001 (J. Log. Algebraic Methods Program., 2005)

Processes for Adhesive Rewriting Systems. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (FoSSaCS, 2006)

Distributed Unfolding of Petri Nets. - Paolo Baldan; Stefan Haar; Barbara König 001 (FoSSaCS, 2006)

Composition and Decomposition of DPO Transformations with Borrowed Context. - Paolo Baldan; Hartmut Ehrig; Barbara König 001 (ICGT, 2006)

Process Bisimulation Via a Graphical Encoding. - Filippo Bonchi; Fabio Gadducci; Barbara König 001 (ICGT, 2006)

Sesqui-Pushout Rewriting. - Andrea Corradini 001; Tobias Heindel; Frank Hermann 001; Barbara König 001 (ICGT, 2006)

Saturated Semantics for Reactive Systems. - Filippo Bonchi; Barbara König 001; Ugo Montanari (LICS, 2006)

Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. - Barbara König 001; Vitali Kozioura (TACAS, 2006)

A Temporal Graph Logic for Verification of Graph Transformation Systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Alberto Lluch-Lafuente (WADT, 2006)

Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs. - Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006)

Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems. - Barbara König 001; Vitali Kozioura (GT-VMT@ETAPS, 2006)

Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. - Hartmut Ehrig; Barbara König 001 (Math. Struct. Comput. Sci., 2006)

Deriving Bisimulation Congruences with Borrowed Contexts. - Barbara König 001 (CALCO, 2007)

Bisimulation Verification for the DPO Approach with Borrowed. - Guilherme Rangel; Barbara König 001; Hartmut Ehrig (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2007)

Preface. - Barbara König 001; Arend Rensink; Reiko Heckel (GT-VC@CONCUR, 2007)

Incremental construction of coverability graphs. - Barbara König 001; Vitali Kozioura (Inf. Process. Lett., 2007)

Unfolding Graph Transformation Systems: Theory and Applications to Verification. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (Concurrency, Graphs and Models, 2008)

Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. - Salil Joshi 002; Barbara König 001 (CAV, 2008)

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions. - Guilherme Rangel; Barbara König 001; Hartmut Ehrig (FoSSaCS, 2008)

Open Petri Nets: Non-deterministic Processes and Compositionality. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Barbara König 001 (ICGT, 2008)

Workshop on Petri Nets and Graph Transformations. - Paolo Baldan; Barbara König 001 (ICGT, 2008)

On the Recognizability of Arrow and Graph Languages. - H. J. Sander Bruggink; Barbara König 001 (ICGT, 2008)

Towards the Verification of Attributed Graph Transformation Systems. - Barbara König 001; Vitali Kozioura (ICGT, 2008)

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts. - Guilherme Rangel; Leen Lambers; Barbara König 001; Hartmut Ehrig; Paolo Baldan (ICGT, 2008)

Preface. - Paolo Baldan; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008)

A framework for the verification of infinite-state graph transformation systems. - Paolo Baldan; Andrea Corradini 001; Barbara König 001 (Inf. Comput., 2008)

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets. - Paolo Baldan; Andrea Corradini 001; Hartmut Ehrig; Reiko Heckel; Barbara König 001 (Log. Methods Comput. Sci., 2008)

McMillan's Complete Prefix for Contextual Nets. - Paolo Baldan; Andrea Corradini 001; Barbara König 001; Stefan Schwoon (Trans. Petri Nets Other Model. Concurr., 2008)

Unfolding Grammars in Adhesive Categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (CALCO, 2009)

Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation. - Hartmut Ehrig; Claudia Ermel; Frank Hermann 001; Barbara König 001 (Bull. EATCS, 2009)

Synthesising CCS bisimulation using graph rewriting. - Filippo Bonchi; Fabio Gadducci; Barbara König 001 (Inf. Comput., 2009)

On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars. - Paolo Baldan; Alessandro Bruni; Andrea Corradini 001; Barbara König 001; Stefan Schwoon (ICGT, 2010)

Verification of Graph Transformation Systems with Context-Free Specifications. - Barbara König 001; Javier Esparza (ICGT, 2010)

A Logic on Subobjects and Recognizability. - H. J. Sander Bruggink; Barbara König 001 (IFIP TCS, 2010)

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques. - Mathias Hülsbusch; Barbara König 001; Arend Rensink; Maria Semenyak; Christian Soltenborn; Heike Wehrheim (IFM, 2010)

Recognizable Graph Languages for Checking Invariants. - Christoph Blume; H. J. Sander Bruggink; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets. - Frank Hermann 001; Andrea Corradini 001; Hartmut Ehrig; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Specification and Verification of Model Transformations. - Frank Hermann 001; Mathias Hülsbusch; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Unfolding-based diagnosis of systems with an evolving topology. - Paolo Baldan; Thomas Chatain; Stefan Haar; Barbara König 001 (Inf. Comput., 2010)

Conditional Reactive Systems. - H. J. Sander Bruggink; Raphaël Cauderlier; Mathias Hülsbusch; Barbara König 001 (FSTTCS, 2011)

Treewidth, Pathwidth and Cospan Decompositions. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Construction of Pushout Complements in the Category of Hypergraphs. - Marvin Heumüller; Salil Joshi 002; Barbara König 001; Jan Stückrath (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

A lattice-theoretical perspective on adhesive categories. - Paolo Baldan; Filippo Bonchi; Andrea Corradini 001; Tobias Heindel; Barbara König 001 (J. Symb. Comput., 2011)

Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory. - Henning Kerstan; Barbara König 001 (CONCUR, 2012)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Deriving Bisimulation Congruences for Conditional Reactive Systems. - Mathias Hülsbusch; Barbara König 001 (FoSSaCS, 2012)

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. - Christoph Blume; H. J. Sander Bruggink; Dominik Engelke; Barbara König 001 (ICGT, 2012)

Well-Structured Graph Transformation Systems with Negative Application Conditions. - Barbara König 001; Jan Stückrath (ICGT, 2012)

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. - Nathalie Bertrand 001; Giorgio Delzanno; Barbara König 001; Arnaud Sangnier; Jan Stückrath (RTA, 2012)

Structured Operational Semantics for Graph Rewriting. - Andrei Dorman; Tobias Heindel; Barbara König 001 (Sci. Ann. Comput. Sci., 2012)

Towards Alternating Automata for Graph Languages. - H. J. Sander Bruggink; Mathias Hülsbusch; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Conditions in Reactive Systems and in Graph Rewriting. - Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

Efficient unfolding of contextual Petri nets. - Paolo Baldan; Alessandro Bruni; Andrea Corradini 001; Barbara König 001; César Rodríguez; Stefan Schwoon (Theor. Comput. Sci., 2012)

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems. - Henning Kerstan; Barbara König 001 (Log. Methods Comput. Sci., 2013)

Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories. - Sebastian Küpper; Barbara König 001; H. J. Sander Bruggink (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013)

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (J. Vis. Lang. Comput., 2013)

Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions. - Henning Kerstan; Barbara König 001; Bram Westerbaan (CMCS, 2014)

A General Framework for Well-Structured Graph Transformation Systems. - Barbara König 001; Jan Stückrath (CONCUR, 2014)

Behavioral Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (FSTTCS, 2014)

Termination Analysis for Graph Transformation Systems. - H. J. Sander Bruggink; Barbara König 001; Hans Zantema (IFIP TCS, 2014)

Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata. - Barbara König 001; Sebastian Küpper (IFIP TCS, 2014)

Termination of Cycle Rewriting. - Hans Zantema; Barbara König 001; H. J. Sander Bruggink (RTA-TLCA, 2014)

Processes and unfoldings: concurrent computations in adhesive categories. - Paolo Baldan; Andrea Corradini 001; Tobias Heindel; Barbara König 001; Pawel Sobocinski 001 (Math. Struct. Comput. Sci., 2014)

Developments in automated verification techniques. - Cormac Flanagan; Barbara König 001 (Int. J. Softw. Tools Technol. Transf., 2014)

Towards Trace Metrics via Functor Lifting. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (CALCO, 2015)

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings. - H. J. Sander Bruggink; Barbara König 001; Dennis Nolte; Hans Zantema (ICGT, 2015)

Verification of Evolving Graph Structures (Dagstuhl Seminar 15451). - Parosh Aziz Abdulla; Fabio Gadducci; Barbara König 001; Viktor Vafeiadis (Dagstuhl Reports, 2015)

Robustness and closure properties of recognizable languages in adhesive categories. - H. J. Sander Bruggink; Barbara König 001; Sebastian Küpper (Sci. Comput. Program., 2015)

A coalgebraic treatment of conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001 (CoRR, 2016)

Extracting the Main Path of Historic Events from Wikipedia. - Benjamin Cabrera; Barbara König 001 (ENIC, 2017)

Up-To Techniques for Weighted Systems. - Filippo Bonchi; Barbara König 001; Sebastian Küpper (TACAS (1), 2017)

PAWS: A Tool for the Analysis of Weighted Systems. - Barbara König 001; Sebastian Küpper; Christina Mika (QAPL@ETAPS, 2017)

Up-To Techniques for Weighted Systems (Extended Version). - Filippo Bonchi; Barbara König 001; Sebastian Küpper (CoRR, 2017)

Bisimulation Games on Coalgebras. - Barbara König 001; Christina Mika (CoRR, 2017)

Well-structured graph transformation systems. - Barbara König 001; Jan Stückrath (Inf. Comput., 2017)

A Tutorial on Graph Transformation. - Barbara König 001; Dennis Nolte; Julia Padberg; Arend Rensink (Graph Transformation, Specifications, and Nets, 2018)

Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks. - Benjamin Cabrera; Tobias Heindel; Reiko Heckel; Barbara König 001 (CONCUR, 2018)

(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras. - Barbara König 001; Christina Mika-Michalski (CONCUR, 2018)

A van Benthem Theorem for Fuzzy Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (LICS, 2018)

A van Benthem Theorem for Quantitative Probabilistic Modal Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (CoRR, 2018)

Coalgebraic Behavioral Metrics. - Paolo Baldan; Filippo Bonchi; Henning Kerstan; Barbara König 001 (Log. Methods Comput. Sci., 2018)

A coalgebraic treatment of conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001; Thorsten Wißmann (Log. Methods Comput. Sci., 2018)

Recognizable languages of arrows and cospans. - H. J. Sander Bruggink; Barbara König 001 (Math. Struct. Comput. Sci., 2018)

A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata. - Barbara König 001; Sebastian Küpper (Soft Comput., 2018)

Rewriting Abstract Structures: Materialization Explained Categorically. - Andrea Corradini 001; Tobias Heindel; Barbara König 001; Dennis Nolte; Arend Rensink (FoSSaCS, 2019)

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic. - Paul Wild; Lutz Schröder; Dirk Pattinson; Barbara König 001 (IJCAI, 2019)

Preface. - Barbara König 001 (MFPS, 2019)

CoReS: A tool for computing core graphs via SAT/SMT solvers. - Barbara König 001; Maxime Nederkorn; Dennis Nolte (J. Log. Algebraic Methods Program., 2019)

Specifying graph languages with type graphs. - Andrea Corradini 001; Barbara König 001; Dennis Nolte (J. Log. Algebraic Methods Program., 2019)

Fixpoint games on continuous lattices. - Paolo Baldan; Barbara König 001; Christina Mika-Michalski; Tommaso Padoan (Proc. ACM Program. Lang., 2019)

Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas. - Barbara König 001; Christina Mika-Michalski; Lutz Schröder (CMCS, 2020)

Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations. - Paolo Baldan; Barbara König 001; Tommaso Padoan (CONCUR, 2020)

Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks. - Rebecca Bernemann; Benjamin Cabrera; Reiko Heckel; Barbara König 001 (FSTTCS, 2020)

A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java. - H. J. Sander Bruggink; Barbara König 001; Marleen Matjeka; Dennis Nolte; Lara Stoltenow (ICGT, 2020)

Conditional transition systems with upgrades. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Alexandra Silva 001 (Sci. Comput. Program., 2020)

Coalgebraic modal logic and games for coalgebras with side effects. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Christina Mika-Michalski (CoRR, 2021)

Predicate and Relation Liftings for Coalgebras with Side Effects: An Application in Coalgebraic Modal Logic. - Harsh Beohar; Barbara König 001; Sebastian Küpper; Christina Mika-Michalski (CMCS, 2022)

Graded Monads and Behavioural Equivalence Games. - Chase Ford; Stefan Milius; Lutz Schröder; Harsh Beohar; Barbara König 001 (LICS, 2022)

Lifecycle-Based View on Cyber-Physical System Models Using Extended Hidden Markov Models. - Matthias Schaffeld; Rebecca Bernemann; Torben Weis; Barbara König 001; Viktor Matkovic (MEMOCODE, 2022)

Probabilistic Systems with Hidden State and Unobservable Transitions. - Rebecca Bernemann; Barbara König 001; Matthias Schaffeld; Torben Weis (CoRR, 2022)

Conditional Bisimilarity for Reactive Systems. - Mathias Hülsbusch; Barbara König 001; Sebastian Küpper; Lara Stoltenow (Log. Methods Comput. Sci., 2022)

Stochastic Decision Petri Nets. - Florian Wittbold; Rebecca Bernemann; Reiko Heckel; Tobias Heindel; Barbara König 001 (Petri Nets, 2023)

A Lattice-Theoretical View of Strategy Iteration. - Paolo Baldan; Richard Eggert; Barbara König 001; Tommaso Padoan (CSL, 2023)

Hennessy-Milner Theorems via Galois Connections. - Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing (CSL, 2023)

Interpretable Anomaly Detection via Discrete Optimization. - Simon Lutz; Florian Wittbold; Simon Dierl; Benedikt Böing; Falk Howar; Barbara König 001; Emmanuel Müller; Daniel Neider (CoRR, 2023)

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras. - Jonas Forster; Lutz Schröder; Paul Wild; Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing (CoRR, 2023)

Fixpoint Theory - Upside Down. - Paolo Baldan; Richard Eggert; Barbara König 001; Tommaso Padoan (Log. Methods Comput. Sci., 2023)

Up-to techniques for behavioural metrics via fibrations. - Filippo Bonchi; Barbara König 001; Daniela Petrisan (Math. Struct. Comput. Sci., 2023)

Hidden Markov Models with Unobservable Transitions. - Rebecca Bernemann; Barbara König 001; Matthias Schaffeld; Torben Weis (Taming the Infinities of Concurrency, 2024)

Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques. - Keri D'Angelo; Sebastian Gurke; Johanna Maria Kirss; Barbara König 001; Matina Najafi; Wojciech Rozowski; Paul Wild (CONCUR, 2024)

Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions. - Lara Stoltenow; Barbara König 001; Sven Schneider 001; Andrea Corradini 001; Leen Lambers; Fernando Orejas (CONCUR, 2024)

Approximating Fixpoints of Approximated Functions (Invited Talk). - Barbara König 001 (CSL, 2024)

Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach. - Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing; Jonas Forster; Lutz Schröder; Paul Wild (STACS, 2024)

Behavioural Metrics and Quantitative Logics (Dagstuhl Seminar 24432). - Barbara König 001; Radu Mardare; Prakash Panangaden; Jurriaan Rot; Florence Clerc (Dagstuhl Reports, 2024)

Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms. - Paolo Baldan; Barbara König 001; Tommaso Padoan (Inf. Comput., 2024)

Approximating Fixpoints of Approximated Functions. - Paolo Baldan; Sebastian Gurke; Barbara König 001; Tommaso Padoan; Florian Wittbold (CAV (2), 2025)

Quantitative Graded Semantics and Spectra of Behavioural Metrics. - Jonas Forster; Lutz Schröder; Paul Wild; Harsh Beohar; Sebastian Gurke; Barbara König 001; Karla Messing (CSL, 2025)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems. - Barbara König 001; Arend Rensink; Lara Stoltenow; Fabian Urrigshardt (ICGT, 2025)

Unsupervised Automata Learning via Discrete Optimization. - Simon Lutz; Daniil Kaminskyi; Florian Wittbold; Simon Dierl; Falk Howar; Barbara König 001; Emmanuel Müller; Daniel Neider (JELIA (1), 2025)

A Monoidal View on Fixpoint Checks. - Paolo Baldan; Richard Eggert; Barbara König 001; Timo Matt; Tommaso Padoan (Log. Methods Comput. Sci., 2025)

Computing Approximated Fixpoints via Dampened Mann Iteration. - Paolo Baldan; Sebastian Gurke; Barbara König 001; Tommaso Padoan; Florian Wittbold (CoRR, 2025)

Counterexample-Guided Abstraction Refinement for Generalized Graph Transformation Systems (Full Version). - Barbara König 001; Arend Rensink; Lara Stoltenow; Fabian Urrigshardt (CoRR, 2025)