Barbara König

According to our database1, Barbara König
  • authored at least 110 papers between 1998 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

Bisimulation Games on Coalgebras.
CoRR, 2017

Specifying Graph Languages with Type Graphs.
CoRR, 2017

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

Conditional Transition Systems with Upgrades.
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

Specifying Graph Languages with Type Graphs.
Proceedings of the Graph Transformation - 10th International 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.
CoRR, 2015

Towards Trace Metrics via Functor Lifting.
CoRR, 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.
STTT, 2014

Processes and unfoldings: concurrent computations in adhesive categories.
Mathematical Structures in Computer Science, 2014

A General Framework for Well-Structured Graph Transformation Systems.
CoRR, 2014

Behavioral Metrics via Functor Lifting.
CoRR, 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.
ECEASST, 2013

Coalgebraic Trace Semantics for Continuous Probabilistic Transition Systems.
Logical Methods in Computer Science, 2013

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

Conditions in Reactive Systems and in Graph Rewriting.
ECEASST, 2012

Towards Alternating Automata for Graph Languages.
ECEASST, 2012

Structured Operational Semantics for Graph Rewriting.
Sci. Ann. Comp. 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.
ECEASST, 2011

Treewidth, Pathwidth and Cospan Decompositions.
ECEASST, 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.
ECEASST, 2010

Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets.
ECEASST, 2010

Recognizable Graph Languages for Checking Invariants.
ECEASST, 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.
Bulletin of the 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 and Other Models of Concurrency, 2008

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
Logical Methods in Computer Science, 2008

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

Preface.
Electr. Notes Theor. Comput. Sci., 2008

Augur 2 - A New Version of a Tool for the Analysis of Graph Transformation Systems.
Electr. Notes Theor. Comput. Sci., 2008

Preface.
ECEASST, 2008

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets
CoRR, 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

Unfolding-Based Diagnosis of Systems with an Evolving Topology.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 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.
Electr. Notes Theor. Comput. Sci., 2007

Inequational Deduction as Term Graph Rewriting.
Electr. Notes Theor. Comput. Sci., 2007

Bisimulation Verification for the DPO Approach with Borrowed.
ECEASST, 2007

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

Bisimilarity and Behaviour-Preserving Reconfigurations of Open Petri Nets.
Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts.
Mathematical Structures in Computer Science, 2006

Preface.
Electr. Notes Theor. Comput. Sci., 2006

Graph transformation systems, Petri nets and Semilinear Sets: Checking for the Absence of Forbidden Paths in Graphs.
ECEASST, 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 Via 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. Algebr. Program., 2005

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

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

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

2004
On deterministic finite automata and syntactic monoid size.
Theor. Comput. Sci., 2004

Verifying a Behavioural Logic for Graph Transformation Systems.
Electr. Notes 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).
Bulletin of the 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
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.
Mathematical Structures in Computer Science, 2002

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

On Deterministic Finite Automata and Syntactic Monoid Size.
Proceedings of the Developments in Language Theory, 6th 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.
ICALP Satellite Workshops, 2000

Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

A General Framework for Types in Graph Rewriting.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 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...