2023 |
|
Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan. A lattice-theoretical view of strategy iteration. In Proc. of CSL '23, volume 252 of LIPIcs, pages 7:1–7:19. Schloss Dagstuhl – Leibniz Center for Informatics, 2023. |
|
|
Harsh Beohar, Sebastian Gurke, Barbara König, and Karla Messing. Hennessy-Milner theorems via Galois connections. In Proc. of CSL '23, volume 252 of LIPIcs, pages 12:1–12:18. Schloss Dagstuhl – Leibniz Center for Informatics, 2023. |
|
|
Florian Wittbold, Rebecca Bernemann, Reiko Heckel, Tobias Heindel, and Barbara König. Stochastic Decision Petri Nets. In Proc. of Petri Nets '23 (Application and Theory of Petri Nets and Concurrency), pages 264–285. Springer, 2023. LNCS 13929. |
|
|
Paolo Baldan, Richard Eggert, Barbara König, Timo Matt, and Tommaso Padoan. A monoidal view on fixpoint checks. In Proc. of ICGT '23, pages 3–21. Springer, 2023. LNCS 13961. |
|
2022 |
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Christina Mika-Michalski. Predicate and relation liftings and modal logics for coalgebras with side effects. In Proc. of CMCS '22. to appear, 2022. |
|
|
Chase Ford, Stefan Milius, Lutz Schröder, Barbara König, and Harsh Beohar. Graded monads and behavioural equivalence games. In CMCS Short Contributions '22, 2022. |
|
|
Harsh Beohar, Chase Ford, Barbara König, Stefan Milius, and Lutz Schröder. Graded monads and behavioural equivalence games. In Proc. of LICS '22. IEEE, 2022. |
|
|
Matthias Schaffeld, Rebecca Bernemann, Torben Weis, Barbara König, and Viktor Matkovic. Lifecycle-based view on cyber-physical system models using extended hidden Markov models (work-in-progress paper). In Proc. of MEMOCODE '22. IEEE eXpress, 2022. to appear. |
|
2021 |
|
Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan. Fixpoint theory – upside down. In Proc. of FOSSACS '21, pages 62–81. Springer, 2021. LNCS/ARCoSS 12650. |
|
2020 |
|
Barbara König, Christina Mika-Michalski, and Lutz Schröder. Explaining non-bisimilarity in a coalgebraic approach: Games and distinguishing formulas. In Proc. of CMCS '20, pages 133–154. Springer, 2020. LNCS 12094. |
|
|
Mathias Hülsbusch, Barbara König, Sebastian Küpper, and Lars Stoltenow. Conditional bisimilarity for reactive systems. In Proc. of FSCD '20, volume 167 of LIPIcs, pages 10:1–10:19. Schloss Dagstuhl – Leibniz Center for Informatics, 2020. |
|
|
H.J. Sander Bruggink, Barbara König, Marleen Matjeka, Dennis Nolte, and Lars Stoltenow. A flexible and easy-to-use library for the rapid development of graph tools in Java (tool presentation paper). In Proc. of ICGT '20, pages 297–306, 2020. LNCS 12150. |
|
|
Paolo Baldan, Barbara König, and Tommaso Padoan. Abstraction, up-to techniques and games for systems of fixpoint equations. In Proc. of CONCUR '20, volume 171 of LIPIcs, pages 25:1–25:20. Schloss Dagstuhl – Leibniz Center for Informatics, 2020. |
|
|
Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König. Uncertainty reasoning for probabilistic Petri nets via Bayesian networks. In Proc. of FSTTCS '20, volume 182 of LIPIcs, pages 38:1–38:17. Schloss Dagstuhl – Leibniz Center for Informatics, 2020. |
|
2019 |
|
Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, and Arend Rensink. Rewriting abstract structures: Materialization explained categorically. In Proc. of FOSSACS '19, pages 169–188. Springer, 2019. LNCS/ARCoSS 11425. |
|
|
Paul Wild, Lutz Schröder, Dirk Pattinson, and Barbara König. A modal characterization theorem for probabilistic fuzzy modal logic. In Proc. of IJCAI '19, pages 1900–1906. ijcai.org, 2019. |
|
|
Richard Eggert and Barbara König. Computing coalgebraic behavioural metrics on-the-fly. In CALCO Early Ideas '19, 2019. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Christina Mika-Michalski. Coalgebraic games in kleisli categories. In CALCO Early Ideas '19, 2019. |
|
2018 |
|
Barbara König, Dennis Nolte, Julia Padberg, and Arend Rensink. A tutorial on graph transformation. In R. Heckel and G. Taentzer, editors, Graph Transformation, Specifications, and Nets – In Memory of Hartmut Ehrig, pages 1–22. Springer, 2018. LNCS 10800. |
|
|
Paul Wild, Lutz Schröder, Dirk Pattinson, and Barbara König. A van Benthem theorem for fuzzy modal logic. In Proc. of LICS '18, pages 909–918. ACM, 2018. |
|
|
Barbara König, Maxime Nederkorn, and Dennis Nolte. CoReS: A tool for computing core graphs via SAT/SMT solvers (tool presentation paper). In Proc. of ICGT '18, pages 37–42. Springer, 2018. LNCS 10887. |
|
|
Barbara König and Christina Mika-Michalski. (Metric) bisimulation games and real-valued modal logics for coalgebras. In Proc. of CONCUR '18, volume 118 of LIPIcs, pages 37:1–37:17. Schloss Dagstuhl – Leibniz Center for Informatics, 2018. |
|
|
Filippo Bonchi, Barbara König, and Daniela Petri san. Up-to techniques for behavioural metrics via fibrations. In Proc. of CONCUR '18, volume 118 of LIPIcs, pages 17:1–17:17. Schloss Dagstuhl – Leibniz Center for Informatics, 2018. |
|
|
Benjamin Cabrera, Tobias Heindel, Reiko Heckel, and Barbara König. Updating probabilistic knowledge on Condition/Event nets using Bayesian networks. In Proc. of CONCUR '18, volume 118 of LIPIcs, pages 27:1–27:17. Schloss Dagstuhl – Leibniz Center for Informatics, 2018. |
|
2017 |
|
Benjamin Cabrera, Laura Steinert, and Björn Ross. Grawitas: a grammar-based wikipedia talk page parser. In Proceedings of the Software Demonstrations of the 15th Conference of the European Chapter of the Association for Computational Linguistics, pages 21–24. Association for Computational Linguistics, 2017. |
|
|
Filippo Bonchi, Barbara König, and Sebastian Küpper. Up-to techniques for weighted systems. In Proc. of TACAS '17, Part I, pages 535–552. Springer, 2017. LNCS 10205. |
|
|
Andrea Corradini, Barbara König, and Dennis Nolte. Specifying graph languages with type graphs. In Proc. of ICGT '17 (International Conference on Graph Transformation), pages 73–89. Springer, 2017. LNCS 10373. |
|
|
Barbara König and Christina Mika. Bisimulation games on coalgebras. In CALCO Early Ideas '17, 2017. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Alexandra Silva. Conditional transition system with upgrades. In Proc. of TASE '17 (Theoretical Aspects of Software Engineering). IEEE Xplore, 2017. |
|
|
Benjamin Cabrera and Barbara König. Extracting the main path of historic events from Wikipedia. In Proc. of ENIC '17 (European Network Intelligence Conference), Lecture Notes in Social Networks, pages 65–81. Springer, 2017. |
|
|
Harsh Beohar and Sebastian Küpper. On path-based coalgebras and weak notions of bisimulation. In Proc. of CALCO '17, 2017. to appear. |
|
|
Barbara König, Sebastian Küpper, and Christina Mika. Paws: A tool for the analysis of weighted systems. In Proc. of QAPL '17 (International Workshop on Quantitative Aspects of Programming Languages and Systems), 2017. to appear. |
|
|
B. König and C. Mika. Bisimulation games on coalgebras. In CALCO Early Ideas '17, 2017. |
|
|
B. König, C. Mika, and S. Küpper. Paws: A tool for the analysis of weighted systems. In Proc. of QAPL '17 (International Workshop on Quantitative Aspects of Programming Languages and Systems), volume 250 of EPTCS, 2017. |
|
|
Dennis Nolte. Analysis and abstraction of graph transformation systems via type graphs. In Proc. of ICGT '17 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Springer, 2017. |
|
2016 |
|
Benjamin Cabrera. Towards using subpattern distributions in social network analysis. In Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), ASONAM '16, 2016. |
|
|
Björn Ross, Michael Rist, Guillermo Carbonell, Benjamin Cabrera, Nils Kurowsky, and Michael Wojatzki. Measuring the reliability of hate speech annotations: The case of the european refugee crisis. In Proceedings of KONVENS 2016, NLP4CMC workshop, 2016. |
|
|
Hans Zantema, Dennis Nolte, and Barbara König. Termination of term graph rewriting. In Proc. of WST '16 (Workshop on Termination), 2016. |
|
2015 |
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Towards trace metrics via functor lifting. In Lawrence S. Moss and Paweł Sobociński, editors, 6th Conference on Algebra and Coalgebra in Computer Science (CALCO'15), volume 35 of Leibniz International Proceedings in Informatics (LIPIcs), pages 35–49. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, oct 2015. |
|
|
Harsh Beohar and Pieter Cuijpers. Open maps in concrete categories and branching bisimulation for prefix orders. In Mathematical Foundations of Programming Semantics, Nijmegen, May 2015. ENTCS. In press. |
|
|
Harsh Beohar and Mohammad Mousavi. A Pre-congruence Format for XY-simulations. In The 6th International Conference on Fundamentals of Software Engineering, LNCS, Tehran, Iran, March 2015. Springer Verlag. |
|
|
H.J. Sander Bruggink, Barbara König, Dennis Nolte, and Hans Zantema. Proving termination of graph transformation systems using weighted type graphs over semirings. In Proc. of ICGT '15 (International Conference on Graph Transformation), pages 52–68. Springer, 2015. LNCS 9151. |
|
|
Jan Stückrath. Uncover: Using coverability analysis for verifying graph transformation systems. In Francesco Parisi-Presicce and Bernhard Westfechtel, editors, Proceedings of ICGT 2015, volume 9151 of LNCS, pages 266–274. Springer, 2015. |
|
2014 |
|
Harsh Beohar and Mohammad Mousavi. Spinal test suites for software product lines. In Proceedings of the 9th Workshop on Model Based Testing (MBT'2014), EPTCS, pages 44–55, 2014. |
|
|
Harsh Beohar and Mohammad Mousavi. Input-output conformance testing based on featured transition systems. In Proceedings of the 29th ACM Symposium of Applied Computing: Software Verification and Testing Track. ACM, 2014. |
|
|
H.J. Sander Bruggink. Towards process mining with graph transformation systems. In Proceedings of ICGT 2014, 2014. |
|
|
H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. In Proceedings of IFIP-TCS 2014, 2014. |
|
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Behavioral Metrics via Functor Lifting. In Venkatesh Raman and S. P. Suresh, editors, 34th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2014), volume 29 of Leibniz International Proceedings in Informatics (LIPIcs), pages 403–415. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2014. |
|
|
Henning Kerstan, Barbara König, and Bram Westerbaan. Lifting adjunctions to coalgebras to (Re)Discover automata constructions. In Marcello M. Bonsangue, editor, Coalgebraic Methods in Computer Science, volume 8446 of Lecture Notes in Computer Science, pages 168–188. Springer Berlin Heidelberg, 2014. |
|
|
Hans Zantema, H.J. Sander Bruggink, and Barbara König. Termination of cycle rewriting. In Proc. of RTA-TLCA '14, pages 476–490. Springer, 2014. LNCS 8560. |
|
|
Barbara König and Jan Stückrath. A general framework for well-structured graph transformation systems. In Proc. of CONCUR '14, pages 467–481. Springer, 2014. LNCS/ARCoSS 8704. |
|
|
Barbara König and Sebastian Küpper. Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In Proc. of TCS '14, IFIP AICT, pages 311–325. Springer, 2014. LNCS 8705. |
|
|
Barbara König and Sebastian Küpper. Generic partition refinement algorithms for coalgebras and an instantiation to weighted automata. In Proc. of TCS '14, IFIP AICT, pages 311–325. Springer, 2014. LNCS 8705. |
|
|
Jan Stückrath and Benjamin Weyers. Lattice-extended coloured petri net rewriting for adaptable user interface models. In Proc. of GTVMT 2014, 2014. |
|
|
Giorgio Delzanno and Jan Stückrath. Parameterized verification of graph transformation systems with whole neighbourhood operations. In Joël Ouaknine, Igor Potapov, and James Worrell, editors, RP'14, volume 8762 of LNCS, pages 72–84. Springer, 2014. |
|
2013 |
|
Harsh Beohar and Pieter Cuijpers. Avoiding diamonds in desynchronization. In Corina Păsăreanu and Gwen Salaün, editors, Formal Aspects of Component Software, volume 7684 of LNCS, pages 36–54. Springer Berlin Heidelberg, 2013. |
|
|
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties of recognizable languages in adhesive categories. In Proc. of GT-VMT '13 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 58 of Electronic Communications of the EASST, 2013. |
|
|
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Concatenation and other closure properties of recognizable languages in adhesive categories. In Proc. of GT-VMT '13 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 58 of Electronic Communications of the EASST, 2013. |
|
2012 |
|
Henning Kerstan and Barbara König. Coalgebraic trace semantics for probabilistic transition systems based on measure theory. In Maciej Koutny and Irek Ulidowski, editors, CONCUR 2012 – Concurrency Theory, volume 7454 of Lecture Notes in Computer Science, pages 410–424. Springer Berlin Heidelberg, sep 2012. |
|
|
H.J. Sander Bruggink, Mathias Hülsbusch, and Barbara König. Towards alternating automata for graph languages. In Proceedings of GT-VMT 2012, Electronic Communications of the EASST, 2012. |
|
|
Jiri Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, and Alexandra Silva. A coalgebraic perspective on minimization and determinization. In Proc. of FOSSACS '12, pages 58–73. Springer, 2012. LNCS/ARCoSS 7213. |
|
|
Mathias Hülsbusch and Barbara König. Deriving bisimulation congruences for conditional reactive systems. In Proc. of FOSSACS '12, pages 361–375. Springer, 2012. LNCS/ARCoSS 7213. |
|
|
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, and Jan Stückrath. On the decidability status of reachability and coverability in graph transformation systems. In Proc. of RTA '12, volume 15 of LIPIcs, pages 101–116. Schloss Dagstuhl – Leibniz Center for Informatics, 2012. |
|
|
Christoph Blume, Sander Bruggink H., J., Dominik Engelke, and Barbara König. Efficient symbolic implementation of graph automata with applications to invariant checking. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 264–278. Springer, 2012. LNCS 7562. |
|
|
Barbara König and Jan Stückrath. Well-structured graph transformation systems with negative application conditions. In Proc. of ICGT '12 (International Conference on Graph Transformation), pages 89–95. Springer, 2012. LNCS 7562. |
|
|
Barbara König. Conditions in reactive systems and in graph rewriting. In Proc. of PNGT '12 (Workshop on Petri Nets, Graph Transformation and other Concurrency Formalisms), volume 51 of Electronic Communications of the EASST, 2012. |
|
2011 |
|
Damian Nadales, Bert van Beek, Harsh Beohar, Pieter Cuijpers, and Jasper Fonteijn. The hierarchical compositional interchange format. In Proceedings of the 9th international conference on Formal Methods for Components and Objects, FMCO'10, pages 316–335, Berlin, Heidelberg, 2011. Springer-Verlag. |
|
|
H.J. Sander Bruggink and Mathias Hülsbusch. Decidability and expressiveness of finitely representable recognizable graph languages. In Proceedigs of GT-VMT 2011, Electronic Communications of the EASST, 2011. |
|
|
Marvin Heumüller, Salil Joshi Barbara König, and Jan Stückrath>. Construction of pushout complements in the category of hypergraphs. In Proc. of GCM '10 (Workshop on Graph Computation Models), volume 39 of Electronic Communications of the EASST, 2011. |
|
|
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions. In Proc. of GT-VMT '11 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 41 of Electronic Communications of the EASST, 2011. |
|
|
H.J. Sander Bruggink, Raphaël Cauderlier, Barbara König, and Mathias Hülsbusch. Conditional reactive systems. In Proc. of FSTTCS '11, volume 13 of LIPIcs. Schloss Dagstuhl – Leibniz Center for Informatics, 2011. |
|
|
Marvin Heumüller, Salil Joshi, Barbara König, and Jan Stückrath. Construction of pushout complements in the category of hypergraphs. In Selected Revised Papers from the Third International Workshop on Graph Computation Models (GCM 2010), volume 39 of Electronic Communications of the EASST, 2011. |
|
2010 |
|
Harsh Beohar and Pieter Cuijpers. A theory of desynchronisable closed loop systems. In Proceedings of 3rd Interaction and Concurrency Experience (ICE'10), volume 38 of EPTCS, pages 99–114, 2010. |
|
|
Harsh Beohar, Damian Nadales, Bert van Beek, and Pieter Cuijpers. Hierarchical states in the compositional interchange format. In Luca Aceto and Pawel Sobocinski, editors, Proceedings of the 7th Workshop on Structural Operational Semantics, volume 32 of EPTCS, pages 42–56, 2010. |
|
|
Christoph Blume, H.J. Sander Bruggink, and Barbara König. Recognizable graph languages for checking invariants. In Proc. of GT-VMT '10 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 29 of Electronic Communications of the EASST, 2010. |
|
|
Christoph Blume. Recognizable graph languages for the verification of dynamic systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Springer, 2010. |
|
|
Christoph Blume. Efficient implementation of automaton functors for the verification of graph transformation systems. In Proc. of ICGT '10 (International Conference on Graph Transformation), Proc. of the Doctoral Symposium. Electronic Communications of the EASST, 2010. |
|
|
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proceedings of IFIP-TCS '10, 2010. |
|
|
Frank Hermann, Andrea Corradini, Hartmut Ehrig, and Barbara König. Efficient analysis of permutation equivalence of graph derivations based on Petri nets. In Proc. of GT-VMT '10 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 29 of Electronic Communications of the EASST, 2010. |
|
|
H.J. Sander Bruggink and Barbara König. A logic on subobjects and recognizability. In Proc. of TCS '10, volume 323 of IFIP AICT, pages 197–212. Springer, 2010. |
|
|
Barbara König and Javier Esparza. Verification of graph transformation systems with context-free specifications. In Proc. of ICGT '10 (International Conference on Graph Transformation), pages 107–122. Springer, 2010. LNCS 6372. |
|
|
Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, and Stefan Schwoon. On the computation of McMillan's complete prefix for contextual nets and graph grammars. In Proc. of ICGT '10 (International Conference on Graph Transformation), pages 91–106. Springer, 2010. LNCS 6372. |
|
|
Frank Hermann, Mathias Hülsbusch, and Barbara König. Specification and verification of model transformations. In Proc. of GraMoT '10 (International Colloquium on Graph and Model Transformation on the Occasion of Hartmut Ehrig's 65th birthday), volume 30 of Electronic Communications of the EASST, 2010. |
|
|
Mathias Hülsbusch, Barbara König, Arend Rensink, Maria Semenyak, Christian Soltenborn, and Heike Wehrheim. Showing full semantics preservation in model transformation – a comparison of techniques. In Proc. of iFM '10 (Integrated Formal Methods), pages 183–198. Springer, 2010. LNCS 6396. |
|
|
Marvin Heumüller, Salil Joshi, Barbara König, and Jan Stückrath. Construction of pushout complements in the category of hypergraphs. In Proc. of GCM '10 (Workshop on Graph Computation Models), 2010. |
|
2009 |
|
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Paweł Sobociński. Unfolding grammars in adhesive categories. In Proc. of CALCO '09 (Algebra and Coalgebra in Computer Science), pages 350–366. Springer, 2009. LNCS 5728. |
|
2008 |
|
Paolo Baldan, Filippo Bonchi, Tobias Heindel, and Barbara König. Irreducible objects and lattice homomorphisms in adhesive categories. In Jochen Pfalzgraf, editor, Proc. of ACCAT '08 (Workshop on Applied and Computational Category Theory), March 2008. |
|
|
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08. Springer, 2008. LNCS. |
|
|
Barbara König and Vitali Kozioura. Augur 2—a new version of a tool for the analysis of graph transformation systems. In Proc. of GT-VMT '06 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 211 of ENTCS, pages 201–210. Elsevier, 2008. |
|
|
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Deriving bisimulation congruences in the presence of negative application conditions. In Proc. of FOSSACS '08, pages 413–427. Springer, 2008. LNCS 4962. |
|
|
Salil Joshi and Barbara König. Applying the graph minor theorem to the verification of graph transformation systems. In Proc. of CAV '08, pages 214–226. Springer, 2008. LNCS 5123. |
|
|
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 336–350. Springer, 2008. LNCS 5214. |
|
|
Barbara König and Vitali Kozioura. Towards the verification of attributed graph transformation systems. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 305–320. Springer, 2008. LNCS 5214. |
|
|
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, and Barbara König. Open Petri nets: Non-deterministic processes and compositionality. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 257–273. Springer, 2008. LNCS 5214. |
|
|
Guilherme Rangel, Leen Lambers, Barbara König, Hartmut Ehrig, and Paolo Baldan. Behavior preservation in model refactoring using DPO transformations with borrowed contexts. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 242–256. Springer, 2008. LNCS 5214. |
|
|
Paolo Baldan, Thomas Chatain, Stefan Haar, and Barbara König. Unfolding-based diagnosis of systems with an evolving topology. In Proc. of CONCUR '08, pages 203–217. Springer, 2008. LNCS 5201. |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. Unfolding graph transformation systems: Theory and applications to verification. In Pierpaolo Degano, Rocco De Nicola, and José Meseguer, editors, Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, pages 16–36. Springer, 2008. LNCS 5065. |
|
|
Paolo Baldan and Barbara König. Workshop on Petri Nets and Graph Transformations. In Proc. of ICGT '08 (International Conference on Graph Transformation), pages 467–469. Springer, 2008. LNCS 5214. |
|
2007 |
|
H.J. Sander Bruggink. Towards a systematic method for proving termination of graph transformation systems. In Proceedings of GT-VC '07, 2007. |
|
|
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, and Barbara König. Inequational deduction as term graph rewriting. In Proc. of TERMGRAPH '02 (International Workshop on Term Graph Rewriting), volume 72.1 of ENTCS, pages 31–44. Elsevier, 2007. |
|
|
Barbara König. Graph transformation systems, Petri nets and semilinear sets: Checking for the absence of forbidden paths in graphs. In Proc. of PNGT '06 (Workshop on Petri Nets and Graph Transformation), volume 2 of Electronic Communications of the EASST, 2007. |
|
|
Paolo Baldan, Andrea Corradini, Barbara König, and Alberto Lluch Lafuente. A temporal graph logic for verification of graph transformation systems. In Proc. of WADT '06 (Workshop on Algebraic Development Techniques), pages 1–20. Springer, 2007. LNCS 4409. |
|
|
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Bisimulation verification for the DPO approach with borrowed contexts. In Proc. of GT-VMT '07 (Workshop on Graph Transformation and Visual Modeling Techniques), volume 6 of Electronic Communications of the EASST, 2007. |
|
|
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, and Barbara König. Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 126–142. Springer, 2007. LNCS 4624. |
|
|
Paolo Baldan, Andrea Corradini, Barbara König, and Stefan Schwoon. McMillan's complete prefix for contextual nets. In Proc. of UFO '07 (Workshop on unfolding and partial order techniques), 2007. |
|
|
Barbara König. Deriving bisimulation congruences with borrowed contexts (invited talk). In Proc. of CALCO '07 (Algebra and Coalgebra in Computer Science), pages 36–39. Springer, 2007. LNCS 4624. |
|
2006 |
|
H.J. Sander Bruggink. A proof of finite family developments for higher-order rewriting using a prefix property. In Proceedings of RTA '06. Springer, 2006. |
|
|
Paolo Baldan, Stefan Haar, and Barbara König. Distributed unfolding of Petri nets. In Proc. of FOSSACS '06, pages 126–141. Springer, 2006. LNCS 3921. |
|
|
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Paweł Sobociński. Processes for adhesive rewriting systems. In Proc. of FOSSACS '06, pages 202–216. Springer, 2006. LNCS 3921. |
|
|
Barbara König and Vitali Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. In Proc. of TACAS '06, pages 197–211. Springer, 2006. LNCS 3920. |
|
|
Filippo Bonchi, Barbara König, and Ugo Montanari. Saturated semantics for reactive systems. In Proc. of LICS '06, pages 69–80. IEEE, 2006. |
|
|
Paolo Baldan, Hartmut Ehrig, and Barbara König. Composition and decomposition of DPO transformations with borrowed context. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 153–167. Springer, 2006. LNCS 4178. |
|
|
Andrea Corradini, Tobias Heindel, Frank Hermann, and Barbara König. Sesqui-pushout rewriting. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 30–45. Springer, 2006. LNCS 4178. |
|
|
Filippo Bonchi, Fabio Gadducci, and Barbara König. Process bisimulation via a graphical encoding. In Proc. of ICGT '06 (International Conference on Graph Transformation), pages 168–183. Springer, 2006. LNCS 4178. |
|
2005 |
|
Hermann Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In Proc. of DLT '05 (Developments in Language Theory), pages 272–283. Springer, 2005. LNCS 3572. |
|
|
Paolo Baldan, Andrea Corradini, Javier Esparza, Tobias Heindel, Barbara König, and Vitali Kozioura. Verifying red-black trees. In Proc. of COSMICAH '05, 2005. Proceedings available as report RR-05-04 (Queen Mary, University of London). |
|
2004 |
|
Paolo Baldan, Andrea Corradini, Barbara König, and Bernhard König. Verifying a behavioural logic for graph transformation systems. In Proc. of COMETA '03, volume 104 of ENTCS, pages 5–24. Elsevier, 2004. |
|
|
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. In Proc. of FOSSACS '04, pages 151–166. Springer, 2004. LNCS 2987. |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. Verifying finite-state graph grammars: an unfolding-based approach. In Proc. of CONCUR '04, pages 83–98. Springer-Verlag, 2004. LNCS 3170. |
|
|
Paolo Baldan, Barbara König, and Ingo Stürmer. Generating test cases for code generators by unfolding graph transformation systems. In Proc. of ICGT '04 (International Conference on Graph Transformation), pages 194–209. Springer-Verlag, 2004. LNCS 3256. |
|
2003 |
|
H.J. Sander Bruggink. Residuals in higher-order rewriting. In Proceedings of RTA '03. Springer, 2003. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. In Proc. of DLT '02 (Developments in Language Theory), pages 258–269. Springer-Verlag, 2003. LNCS 2450. |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. Unfolding-based verification for graph transformation systems. In Proc. of UniGra '03: Uniform Approaches to Graphical Specification Techniques (Warsaw), 2003. |
|
|
Paolo Baldan, Barbara König, and Bernhard König. A logic for analyzing abstractions of graph transformation systems. In Proc. of SAS '03 (International Static Analysis Symposium), pages 255–272. Springer-Verlag, 2003. LNCS 2694. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size, continued. In Proc. of DLT '03 (Developments in Language Theory), pages 349–360. Springer-Verlag, 2003. LNCS 2710. |
|
2002 |
|
Paolo Baldan, Andrea Corradini, and Barbara König. Static analysis of distributed systems with mobility specified by graph grammars—a case study. In H. Ehrig, B. Krämer, and A. Ertas, editors, Proc. of IDPT '02 (Sixth International Conference on Integrated Design & Process Technology). Society for Design and Process Science, 2002. |
|
|
Paolo Baldan and Barbara König. Approximating the behaviour of graph transformation systems. In Proc. of ICGT '02 (International Conference on Graph Transformation), pages 14–29. Springer-Verlag, 2002. LNCS 2505. |
|
2001 |
|
Paolo Baldan, Andrea Corradini, and Barbara König. A static analysis technique for graph transformation systems. In Proc. of CONCUR '01, pages 381–395. Springer-Verlag, 2001. LNCS 2154. |
|
|
Barbara König and Ugo Montanari. Observational equivalence for synchronized graph rewriting with mobility. In Proc. of TACS '01, pages 145–164. Springer-Verlag, 2001. LNCS 2215. |
|
2000 |
|
Barbara König. Hypergraph construction and its application to the compositional modelling of concurrency. In Proc. of GRATRA 2000: Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems, 2000. |
|
|
Barbara König. Analysing input/output-capabilities of mobile processes with a generic type system. In Proc. of ICALP '00, pages 403–414. Springer-Verlag, 2000. LNCS 1853. |
|
|
Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Proc. of GT-VMT '00 (Workshop on Graph Transformation and Visual Modeling Techniques), pages 451–458. Carleton Scientific, 2000. |
|
|
Barbara König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, pages 373–384. Springer-Verlag, 2000. LNCS 1974. |
|
1999 |
|
Barbara König. Generating type systems for process graphs. In Proc. of CONCUR '99, pages 352–367. Springer-Verlag, 1999. LNCS 1664. |
|
