Barbara König

Orcid: 0000-0002-4193-2889

Affiliations:
  • University of Duisburg-Essen, Department of Computer Science and Applied Cognitive Science, Germany


According to our database1, Barbara König authored at least 137 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms.
Inf. Comput., 2024

Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Approximating Fixpoints of Approximated Functions (Invited Talk).
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

Coinductive Techniques for Checking Satisfiability of Generalized Nested Conditions.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Behavioural Metrics: Compositionality of the Kantorovich Lifting and an Application to Up-To Techniques.
Proceedings of the 35th International Conference on Concurrency Theory, 2024

Hidden Markov Models with Unobservable Transitions.
Proceedings of the Taming the Infinities of Concurrency, 2024

2023
Up-to techniques for behavioural metrics via fibrations.
Math. Struct. Comput. Sci., 2023

Fixpoint Theory - Upside Down.
Log. Methods Comput. Sci., 2023

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras.
CoRR, 2023

Interpretable Anomaly Detection via Discrete Optimization.
CoRR, 2023

A Monoidal View on Fixpoint Checks.
Proceedings of the Graph Transformation - 16th International Conference, 2023

Hennessy-Milner Theorems via Galois Connections.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

A Lattice-Theoretical View of Strategy Iteration.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Stochastic Decision Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2023

2022
Conditional Bisimilarity for Reactive Systems.
Log. Methods Comput. Sci., 2022

Probabilistic Systems with Hidden State and Unobservable Transitions.
CoRR, 2022

Lifecycle-Based View on Cyber-Physical System Models Using Extended Hidden Markov Models.
Proceedings of the 20th ACM-IEEE International Conference on Formal Methods and Models for System Design, 2022

Graded Monads and Behavioural Equivalence Games.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Predicate and Relation Liftings for Coalgebras with Side Effects: An Application in Coalgebraic Modal Logic.
Proceedings of the Coalgebraic Methods in Computer Science, 2022

2021
Coalgebraic modal logic and games for coalgebras with side effects.
CoRR, 2021

2020
Conditional transition systems with upgrades.
Sci. Comput. Program., 2020

A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java.
Proceedings of the Graph Transformation - 13th International Conference, 2020

Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Abstraction, Up-To Techniques and Games for Systems of Fixpoint Equations.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

Explaining Non-bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019
Fixpoint games on continuous lattices.
Proc. ACM Program. Lang., 2019

Specifying graph languages with type graphs.
J. Log. Algebraic Methods Program., 2019

CoReS: A tool for computing core graphs via SAT/SMT solvers.
J. Log. Algebraic Methods Program., 2019

Preface.
Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

A Modal Characterization Theorem for a Probabilistic Fuzzy Description Logic.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Rewriting Abstract Structures: Materialization Explained Categorically.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata.
Soft Comput., 2018

Recognizable languages of arrows and cospans.
Math. Struct. Comput. Sci., 2018

A coalgebraic treatment of conditional transition systems with upgrades.
Log. Methods Comput. Sci., 2018

Coalgebraic Behavioral Metrics.
Log. Methods Comput. Sci., 2018

A van Benthem Theorem for Quantitative Probabilistic Modal Logic.
CoRR, 2018

A van Benthem Theorem for Fuzzy Modal Logic.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

A Tutorial on Graph Transformation.
Proceedings of the Graph Transformation, Specifications, and Nets, 2018

2017
Well-structured graph transformation systems.
Inf. Comput., 2017

Bisimulation Games on Coalgebras.
CoRR, 2017

Up-To Techniques for Weighted Systems (Extended Version).
CoRR, 2017

PAWS: A Tool for the Analysis of Weighted Systems.
Proceedings of the Proceedings 15th Workshop on Quantitative Aspects of Programming Languages and Systems, 2017

Up-To Techniques for Weighted Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Extracting the Main Path of Historic Events from Wikipedia.
Proceedings of the Network Intelligence Meets User Centered Social Media Networks [4th European Network Intelligence Conference, 2017

2016
A coalgebraic treatment of conditional transition systems with upgrades.
CoRR, 2016

2015
Robustness and closure properties of recognizable languages in adhesive categories.
Sci. Comput. Program., 2015

Verification of Evolving Graph Structures (Dagstuhl Seminar 15451).
Dagstuhl Reports, 2015

Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings.
Proceedings of the Graph Transformation - 8th International Conference, 2015

Towards Trace Metrics via Functor Lifting.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Developments in automated verification techniques.
Int. J. Softw. Tools Technol. Transf., 2014

Processes and unfoldings: concurrent computations in adhesive categories.
Math. Struct. Comput. Sci., 2014

Termination of Cycle Rewriting.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata.
Proceedings of the Theoretical Computer Science, 2014

Termination Analysis for Graph Transformation Systems.
Proceedings of the Theoretical Computer Science, 2014

Behavioral Metrics via Functor Lifting.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

A General Framework for Well-Structured Graph Transformation Systems.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions.
Proceedings of the Coalgebraic Methods in Computer Science, 2014

2013
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.
J. Vis. Lang. Comput., 2013

Concatenation and other Closure Properties of Recognizable Languages in Adhesive Categories.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2013

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems.
Log. Methods Comput. Sci., 2013

2012
Efficient unfolding of contextual Petri nets.
Theor. Comput. Sci., 2012

Conditions in Reactive Systems and in Graph Rewriting.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012

Towards Alternating Automata for Graph Languages.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012

Structured Operational Semantics for Graph Rewriting.
Sci. Ann. Comput. Sci., 2012

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.
Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Well-Structured Graph Transformation Systems with Negative Application Conditions.
Proceedings of the Graph Transformations - 6th International Conference, 2012

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking.
Proceedings of the Graph Transformations - 6th International Conference, 2012

Deriving Bisimulation Congruences for Conditional Reactive Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Coalgebraic Perspective on Minimization and Determinization.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
A lattice-theoretical perspective on adhesive categories.
J. Symb. Comput., 2011

Construction of Pushout Complements in the Category of Hypergraphs.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

Treewidth, Pathwidth and Cospan Decompositions.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

Conditional Reactive Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Unfolding-based diagnosis of systems with an evolving topology.
Inf. Comput., 2010

Specification and Verification of Model Transformations.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Recognizable Graph Languages for Checking Invariants.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques.
Proceedings of the Integrated Formal Methods - 8th International Conference, 2010

A Logic on Subobjects and Recognizability.
Proceedings of the Theoretical Computer Science, 2010

Verification of Graph Transformation Systems with Context-Free Specifications.
Proceedings of the Graph Transformations - 5th International Conference, 2010

On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars.
Proceedings of the Graph Transformations - 5th International Conference, 2010

2009
Synthesising CCS bisimulation using graph rewriting.
Inf. Comput., 2009

Behaviour Simulation and Equivalence of Systems Modelled by Graph Transformation.
Bull. EATCS, 2009

Unfolding Grammars in Adhesive Categories.
Proceedings of the Algebra and Coalgebra in Computer Science, 2009

2008
McMillan's Complete Prefix for Contextual Nets.
Trans. Petri Nets Other Model. Concurr., 2008

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
Log. Methods Comput. Sci., 2008

A framework for the verification of infinite-state graph transformation systems.
Inf. Comput., 2008

Preface.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2008

Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Towards the Verification of Attributed Graph Transformation Systems.
Proceedings of the Graph Transformations, 4th International Conference, 2008

On the Recognizability of Arrow and Graph Languages.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Workshop on Petri Nets and Graph Transformations.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Open Petri Nets: Non-deterministic Processes and Compositionality.
Proceedings of the Graph Transformations, 4th International Conference, 2008

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems.
Proceedings of the Computer Aided Verification, 20th International Conference, 2008

Unfolding Graph Transformation Systems: Theory and Applications to Verification.
Proceedings of the Concurrency, 2008

2007
Incremental construction of coverability graphs.
Inf. Process. Lett., 2007

Preface.
Proceedings of the Third Workshop on Graph Transformation for Concurrency and Verification, 2007

Bisimulation Verification for the DPO Approach with Borrowed.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2007

Deriving Bisimulation Congruences with Borrowed Contexts.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts.
Math. Struct. Comput. Sci., 2006

Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems.
Proceedings of the Fifth International Workshop on Graph Transformation and Visual Modeling Techniques, 2006

Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2006

A Temporal Graph Logic for Verification of Graph Transformation Systems.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2006

Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Saturated Semantics for Reactive Systems.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Sesqui-Pushout Rewriting.
Proceedings of the Graph Transformations, Third International Conference, 2006

Process Bisimulation <i>Via</i> a Graphical Encoding.
Proceedings of the Graph Transformations, Third International Conference, 2006

Composition and Decomposition of DPO Transformations with Borrowed Context.
Proceedings of the Graph Transformations, Third International Conference, 2006

Distributed Unfolding of Petri Nets.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

Processes for Adhesive Rewriting Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005
Analysing input/output-capabilities of mobile processes with a generic type system.
J. Log. Algebraic Methods Program., 2005

Augur - A Tool for the Analysis of Graph Transformation Systems.
Bull. EATCS, 2005

A general framework for types in graph rewriting.
Acta Informatica, 2005

On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Analysis and verification of systems with dynamically evolving structure (Analyse und Verifikation von Systemen mit dynamischen Strukturveränderungen)
, 2004

On deterministic finite automata and syntactic monoid size.
Theor. Comput. Sci., 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).
Bull. EATCS, 2004

Generating Test Cases for Code Generators by Unfolding Graph Transformation Systems.
Proceedings of the Graph Transformations, Second International Conference, 2004

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

04241 Abstracts Collection - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

Summary 2: Graph Grammar Verification through Abstraction.
Proceedings of the Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, 2004

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Verifying a Behavioural Logic for Graph Transformation Systems.
Proceedings of the Workshop of the COMETA Project on Computational Metamodels, 2003

A Logic for Analyzing Abstractions of Graph Transformation Systems.
Proceedings of the Static Analysis, 10th International Symposium, 2003

On Deterministic Finite Automata and Syntactic Monoid Size, Continued.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Hypergraph Construction and its Application to the Static Analysis of Concurrent Systems.
Math. Struct. Comput. Sci., 2002

Inequational Deduction as Term Graph Rewriting.
Proceedings of the First International Workshop on Term Graph Rewriting, 2002

Approximating the Behaviour of Graph Transformation Systems.
Proceedings of the Graph Transformation, First International Conference, 2002

2001
Observational Equivalence for Synchronized Graph Rewriting with Mobility.
Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

A Static Analysis Technique for Graph Transformation Systems.
Proceedings of the CONCUR 2001, 2001

2000
A Graph Rewriting Semantics for the Polyadic Calculus.
Proceedings of the ICALP Workshops 2000, 2000

1999
Generating Type Systems for Process Graphs.
Proceedings of the CONCUR '99: Concurrency Theory, 1999

1998
Description and verification of mobile processes with graph rewriting techniques.
PhD thesis, 1998


  Loading...