Barbara König

From MaRDI portal
Person:443727

Available identifiers

zbMath Open konig.barbaraMaRDI QIDQ443727

List of research outcomes





PublicationDate of PublicationType
Graded monads and behavioural equivalence games2024-12-06Paper
Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms2024-12-03Paper
A lattice-theoretical view of strategy iteration2024-09-25Paper
Hennessy-Milner theorems via Galois connections2024-09-25Paper
Up-to techniques for behavioural metrics via fibrations2024-03-05Paper
A monoidal view on fixpoint checks2024-01-12Paper
Stochastic decision Petri nets2023-11-16Paper
Fixpoint Theory -- Upside Down2023-08-26Paper
Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic2022-12-07Paper
A Flexible and Easy-to-Use Library for the Rapid Development of Graph Tools in Java2022-09-01Paper
https://portal.mardi4nfdi.de/entity/Q50892902022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50284602022-02-09Paper
Fixpoint theory -- upside down2021-10-18Paper
Up-To Techniques for Behavioural Metrics via Fibrations2021-08-04Paper
(Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras2021-08-04Paper
Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks2021-08-04Paper
Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas2021-02-22Paper
A van Benthem Theorem for Fuzzy Modal Logic2021-01-20Paper
Up-To Techniques for Weighted Systems2020-08-05Paper
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems2020-05-27Paper
Rewriting abstract structures: materialization explained categorically2020-01-28Paper
CoReS: a tool for computing core graphs via SAT/SMT solvers2019-11-28Paper
Specifying graph languages with type graphs2019-11-22Paper
Specifying graph languages with type graphs2019-06-20Paper
https://portal.mardi4nfdi.de/entity/Q46211592019-02-08Paper
A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata2018-10-22Paper
https://portal.mardi4nfdi.de/entity/Q46838622018-09-26Paper
Recognizable languages of arrows and cospans2018-09-05Paper
CoReS: a tool for computing core graphs via SAT/SMT solvers2018-08-24Paper
https://portal.mardi4nfdi.de/entity/Q46376882018-04-25Paper
A tutorial on graph transformation2018-04-04Paper
Towards Trace Metrics via Functor Lifting2017-07-11Paper
Behavioral Metrics via Functor Lifting2017-04-25Paper
Well-structured graph transformation systems2016-12-22Paper
Processes and unfoldings: concurrent computations in adhesive categories2016-07-26Paper
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings2015-09-22Paper
Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions2015-09-11Paper
A General Framework for Well-Structured Graph Transformation Systems2014-09-15Paper
Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata2014-09-15Paper
Termination Analysis for Graph Transformation Systems2014-09-15Paper
Termination of Cycle Rewriting2014-07-24Paper
Coalgebraic trace semantics for continuous probabilistic transition systems2014-01-08Paper
Verifying a behavioural logic for graph transformation systems2013-09-11Paper
Well-Structured Graph Transformation Systems with Negative Application Conditions2012-10-02Paper
Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking2012-10-02Paper
Coalgebraic Trace Semantics for Probabilistic Transition Systems Based on Measure Theory2012-09-25Paper
Conditional reactive systems2012-08-31Paper
Efficient unfolding of contextual Petri nets2012-08-13Paper
A Coalgebraic Perspective on Minimization and Determinization2012-06-22Paper
Deriving Bisimulation Congruences for Conditional Reactive Systems2012-06-22Paper
Unfolding Grammars in Adhesive Categories2012-06-01Paper
A lattice-theoretical perspective on adhesive categories2011-03-14Paper
A Logic on Subobjects and Recognizability2010-10-27Paper
Unfolding-based diagnosis of systems with an evolving topology2010-10-07Paper
Verification of Graph Transformation Systems with Context-Free Specifications2010-10-04Paper
On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars2010-10-04Paper
Incremental construction of coverability graphs2010-03-24Paper
https://portal.mardi4nfdi.de/entity/Q33960032009-09-15Paper
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets2009-04-29Paper
Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets2009-03-10Paper
Deriving Bisimulation Congruences with Borrowed Contexts2009-03-10Paper
Synthesising CCS bisimulation using graph rewriting2009-03-02Paper
McMillan’s Complete Prefix for Contextual Nets2009-02-03Paper
Sesqui-Pushout Rewriting2008-11-27Paper
Process Bisimulation Via a Graphical Encoding2008-11-27Paper
Composition and Decomposition of DPO Transformations with Borrowed Context2008-11-27Paper
Unfolding-Based Diagnosis of Systems with an Evolving Topology2008-11-25Paper
Towards the Verification of Attributed Graph Transformation Systems2008-11-20Paper
Open Petri Nets: Non-deterministic Processes and Compositionality2008-11-20Paper
On the Recognizability of Arrow and Graph Languages2008-11-20Paper
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts2008-11-20Paper
Workshop on Petri Nets and Graph Transformations2008-11-20Paper
A framework for the verification of infinite-state graph transformation systems2008-08-14Paper
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems2008-07-15Paper
Unfolding Graph Transformation Systems: Theory and Applications to Verification2008-06-19Paper
Deriving Bisimulation Congruences in the Presence of Negative Application Conditions2008-04-11Paper
Foundations of Software Science and Computation Structures2007-09-28Paper
A Temporal Graph Logic for Verification of Graph Transformation Systems2007-09-10Paper
Graph Transformations2007-06-21Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-05-02Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Foundations of Software Science and Computation Structures2007-05-02Paper
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts2007-02-07Paper
Developments in Language Theory2006-06-23Paper
A general framework for types in graph rewriting2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57144382006-01-02Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
Analysing input/output-capabilities of mobile processes with a generic type system2005-04-18Paper
On deterministic finite automata and syntactic monoid size2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48134022004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q44724602004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44520752004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44387622003-12-10Paper
https://portal.mardi4nfdi.de/entity/Q44121172003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q47918462003-02-03Paper
Hypergraph construction and its application to the static analysis of concurrent systems2002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q27541602001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q42700691999-11-10Paper

Research outcomes over time

This page was built for person: Barbara König