2023 |
|
Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan. Fixpoint theory – upside down. Logical Methods in Computer Science, 19(2:15), June 2023. Selected Papers of the 24th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2022). |
|
|
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. |
|
|
Florian Wittbold, Rebecca Bernemann, Reiko Heckel, Tobias Heindel, and Barbara König. Stochastic Decision Petri Nets, 2023. arXiv:2303.13344. |
|
|
Simon Lutz, Florian Wittbold, Simon Dierl, Benedikt Böing, Falk Howar, Barbara König, Emmanuel Müller, and Daniel Neider. Interpretable anomaly detection via discrete optimization, 2023. arXiv:2303.14111. |
|
|
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. |
|
|
Filippo Bonchi, Barbara König, and Daniela Petri san. Up-to techniques for behavioural metrics via fibrations. Mathematical Structures in Computer Science, 2023. to appear. |
|
|
Paolo Baldan, Richard Eggert, Barbara König, Timo Matt, and Tommaso Padoan. A monoidal view on fixpoint checks, 2023. arXiv:2305.02957. |
|
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, 2022. arXiv:2203.15467. |
|
|
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. |
|
|
Rebecca Bernemann, Barbara König, Matthias Schaffeld, and Torben Weis. Probabilistic systems with hidden state and unobservable transitions, 2022. arXiv:2205.13871. |
|
|
Harsh Beohar, Sebastian Gurke, Barbara König, and Karla Messing. Hennessy-Milner theorems via Galois connections, 2022. arXiv:2207.05407. |
|
|
Paolo Baldan, Richard Eggert, Barbara König, and Tommaso Padoan. A lattice-theoretical view of strategy iteration, 2022. arXiv:2207.09872. |
|
|
Mathias Hülsbusch, Barbara König, Sebastian Küpper, and Lars Stoltenow. Conditional bisimilarity for reactive systems. Logical Methods in Computer Science, 18(1), 2022. Selected Papers of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). |
|
|
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. |
|
|
Jean Goubault-Larrecq and Barbara König, editors. Selected Papers of the 23rd International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2020), Logical Methods in Computer Science, 2022. Special Issue. |
|
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. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Christina Mika-Michalski. Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic, 2021. arXiv:2110.09911. |
|
2020 |
|
Barbara König, Rainer Leisten, and Jan Stückrath. Permutation flow shop scheduling: Variability of completion time differences – NP-completeness. International Journal of Operational Research, 39(4), 2020. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Alexandra Silva. Conditional transition systems with upgrades. Science of Computer Programming, 186, 2020. |
|
|
Paolo Baldan, Barbara König, and Tommaso Padoan. Abstraction, up-to techniques and games for systems of fixpoint equations, 2020. arXiv:2003.08877. |
|
|
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. |
|
|
Mathias Hülsbusch, Barbara König, Sebastian Küpper, and Lars Stoltenow. Conditional bisimilarity for reactive systems, 2020. arXiv:2004.11792. |
|
|
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. |
|
|
Jean Goubault-Larrecq and Barbara König, editors. Foundations of Software Science and Computation Structures (FOSSACS 2020). Springer, 2020. LNCS/ARCoSS 12077. |
|
|
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. |
|
|
Filippo Bonchi and Barbara König, editors. Selected Papers of the 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017), Logical Methods in Computer Science, 2020. Special Issue. |
|
|
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 |
|
Paolo Baldan, Barbara König, Christina Mika-Michalski, and Tommaso Padoan. Fixpoint games on continuous lattices. PACMPL (Proc. of POPL '19), 3:26:1–26:29, 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. |
|
|
Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, and Arend Rensink. Rewriting abstract structures: Materialization explained categorically, 2019. arXiv:1902.04809. |
|
|
Andrea Corradini, Barbara König, and Dennis Nolte. Specifying graph languages with type graphs. Journal of Logical and Algebraic Methods in Programming, 104:176–200, 2019. |
|
|
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. |
|
|
Barbara König, Maxime Nederkorn, and Dennis Nolte. CoReS: A tool for computing core graphs via SAT/SMT solvers. Journal of Logical and Algebraic Methods in Programming, 109, 2019. |
|
|
Barbara König, editor. Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXV), volume 347 of ENTCS. Elsevier, 2019. |
|
2018 |
|
H.J. Sander Bruggink and Barbara König. Recognizable languages of arrows and cospans. Mathematical Structures in Computer Science, 28(8):1290–1332, 2018. |
|
|
Barbara König and Sebastian Küpper. A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata. Soft Computing, 22(4), 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. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, and Thorsten Wißmann. A coalgebraic treatment of conditional transition systems with upgrades. Logical Methods in Computer Science, 14(1), 2018. Special Festschrift Issue in Honor of Jiri Adámek. |
|
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Coalgebraic behavioral metrics. Logical Methods in Computer Science, 14(3), 2018. Selected Papers of the 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). |
|
|
Paul Wild, Lutz Schröder, Dirk Pattinson, and Barbara König. A van Benthem theorem for fuzzy modal logic, 2018. arXiv:1802.00478. |
|
|
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. |
|
|
B. König and C. Mika-Michalski. (Metric) bisimulation games and real-valued modal logics for coalgebras, 2018. arXiv:1705.10165. |
|
|
F. Bonchi, B. König, and D. Petri san. Up-to techniques for behavioural metrics via fibrations, 2018. arXiv:1806.11064. |
|
|
B. Cabrera, T. Heindel, R. Heckel, and B. König. Updating probabilistic knowledge on Condition/Event nets using Bayesian networks, 2018. arXiv:1807.02566. |
|
|
Paul Wild, Lutz Schröder, Dirk Pattinson, and Barbara König. A van Benthem theorem for quantitative probabilistic modal logic, 2018. arXiv:1810.04722. |
|
|
Paolo Baldan, Barbara König, Christina Mika-Michalski, and Tommaso Padoan. Fixpoint games on continuous lattices, 2018. arXiv:1810.11404. |
|
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. |
|
|
Jan Stückrath and Barbara König. A general framework for well-structured graph transformation systems. Information and Computation, 252:79–94, 2017. |
|
|
Filippo Bonchi, Barbara König, and Sebastian Küpper. Up-to techniques for weighted systems (extended version), 2017. arXiv:1701.05001. |
|
|
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. |
|
|
Andrea Corradini, Barbara König, and Dennis Nolte. Specifying graph languages with type graphs, 2017. arXiv:1704.05263. |
|
|
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. |
|
|
Davide Di Ruscio and Barbara König, editors. STAF 2017 Doctoral Symposium, volume 1955 of CEUR Workshop Proceedings, 2017. |
|
|
Filippo Bonchi and Barbara König, editors. Algebra and Coalgebra in Computer Science (CALCO 2017), volume 72. LIPIcs, 2017. |
|
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Coalgebraic behavioral metrics, 2017. arXiv:1712.07511. |
|
|
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 |
|
Henning Kerstan. Coalgebraic Behavior Analysis – From Qualitative to Quantitative Analyses. PhD thesis, Universität Duisburg-Essen, Fakultät für Ingenieurwissenschaften, Abteilung für Informatik und Angewandte Kognitionswissenschaft, may 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. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, and Alexandra Silva. A coalgebraic treatment of conditional transition systems with upgrades, 2016. arXiv:1612.05002. |
|
|
Harsh Beohar, Barbara König, Sebastian Küpper, Alexandra Silva, and Thorsten Wißmann. A coalgebraic treatment of conditional transition systems with upgrades, 2016. arXiv:1612.05002. |
|
|
Barbara König and Sebastian Küpper. A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata. Soft Computing, pages 1–18, 2016. |
|
|
Jan Stückrath. Verification of well-structured graph transformation systems. PhD thesis, Universität Duisburg-Essen, 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. |
|
|
Harsh Beohar, Mahsa Varshosaz, and Mohammad Reza Mousavi. Basic behavioral models for software product lines: Expressiveness and testing pre-orders. Science of Computer Programming, 2015. In press. |
|
|
Bnjamin Cabrera. Numerical schemes for calculating the discrete wasserstein distance. Master's thesis, University of Bonn, Germany, 2015. |
|
|
H.J. Sander Bruggink, Barbara König, and Sebastian Küpper. Robustness and closure properties of recognizable languages in adhesive categories. Science of Computer Programming, 104:71–98, 2015. |
|
|
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. |
|
|
H.J. Sander Bruggink, Barbara König, Dennis Nolte, and Hans Zantema. Proving termination of graph transformation systems using weighted type graphs over semirings, 2015. arXiv:1505.01695. |
|
|
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König. Towards trace metrics via functor lifting, 2015. arXiv:1505.08105. |
|
|
Parosh Aziz Abdulla, Fabio Gadducci, Barbara König, and Viktor Vafeiadis. Verification of Evolving Graph Structures (Dagstuhl Seminar 15451). Dagstuhl Reports, 5(11), 2015. |
|
|
H. J. Sander Bruggink, Barbara König, and Sebastian Küpper. Robustness and closure properties of recognizable languages in adhesive categories. Sci. Comput. Program., 104:71–98, 2015. |
|
|
Christine Mika. Ein generisches Werkzeug für Sprachäquivalenz bei gewichteten Automaten. Master's thesis, Universität Duisburg-Essen, 2015. |
|
|
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. Two logical characterizations for input-output conformance. In Preproceedings of EXPRESS/SOS'14 (Short paper), July 2014. |
|
|
Harsh Beohar and Pieter Cuijpers. Avoiding diamonds in desynchronisation. Science of Computer Programming, 91, Part A(0):45 – 69, 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. |
|
|
Christoph Blume. Graph automata and their application to the verification of dynamic systems. PhD thesis, University of Duisburg-Essen, 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. |
|
|
H.J. Sander Bruggink, Barbara König, and Hans Zantema. Termination analysis for graph transformation systems. Technical report, University of Duisburg-Essen, 2014. |
|
|
Benjamin Cabrera. On approximation complexity of counting matchings in hypergraphs, 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. |
|
|
Cormac Flanagan and Barbara König. Developments in automated verification techniques. International Journal on Software Tools for Technology Transfer, 16(2), 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 Jan Stückrath. A general framework for well-structured graph transformation systems, 2014. arXiv:1406.4782. |
|
|
Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Paweł Sobociński. Processes and unfoldings: Concurrent computations in adhesive categories. Mathematical Structures in Computer Science, 24(4), 2014. |
|
|
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. |
|
|
Holger Giese and Barbara König, editors. Graph Transformation (ICGT 2014). Springer, 2014. LNCS 8571. |
|
|
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. |
|
|
Jan Stückrath and Benjamin Weyers. Lattice-extended coloured petri net rewriting for adaptable user interface models. Technical Report 2014-01, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 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. |
|
|
Giorgio Delzanno and Jan Stückrath. Parameterized verification of graph transformation systems with whole neighbourhood operations, 2014. arXiv:1407.4394. |
|
2013 |
|
Henning Kerstan and Barbara König. Coalgebraic trace semantics for continuous probabilistic transition systems. Logical Methods in Computer Science, 9 [4:16](834), dec 2013. |
|
|
Harsh Beohar. Refinement of communication and states in models of embedded systems. PhD thesis, Department of Mathematics and Computer Science, Eindhoven university of technology, January 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. |
|
|
Benjamin Cabrera. Wang-landau algorithmus, 2013. |
|
|
Henning Kerstan and Barbara König. Coalgebraic trace semantics for continuous probabilistic transition systems, 2013. arXiv:1310.7417. |
|
|
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. |
|
|
Christoph Blume, H.J. Sander Bruggink, Martin Friedrich, and Barbara König. Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. Journal of Visual Languages & Computing, 24(3):192–206, 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. |
|
|
Henning Kerstan and Barbara König. Coalgebraic trace semantics for probabilistic transition systems based on measure theory. Technical Report 2012-02, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, jun 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. |
|
|
Andrei Dorman, Tobias Heindel, and Barbara König. Structured operational semantics for graph rewriting. Scientific Annals of Computer Science, XXII(1):105–145, 2012. |
|
|
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. |
|
|
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. Technical Report DISI-TR-11-04, Dipartimento di Informatica e Scienze dell'Informazione, Università di Genova, 2012. |
|
|
Cormac Flanagan and Barbara König, editors. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2012). Springer, 2012. LNCS/ARCoSS 7214. |
|
|
Salil Joshi and Barbara König. Applying the graph minor theorem to the verification of graph transformation systems. Technical Report 2012-01, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 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. |
|
|
Paolo Baldan, Alessandro Bruni, Andrea Corradini, Barbara König, César Rodriguez, and Stefan Schwoon. Efficient unfolding of contextual Petri nets. Theoretical Computer Science, 449:2–22, 2012. |
|
|
Barbara König and Jan Stückrath. Well-structured graph transformation systems with negative application conditions. Technical Report 2012-03, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 2012. |
|
|
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. |
|
|
Cormac Flanagan and Barbara König, editors. Selected Papers of the Conference ``Tools and Algorithms for the Construction and Analysis of Systems'': TACAS 2012, Logical Methods in Computer Science, 2012. Special Issue. |
|
|
Sebastian Küpper. Abschlusseigenschaften für graph-sprachen mit anwendungen auf terminierungsanalyse. Master's thesis, Universität Duisburg-Essen, 2012. |
|
|
Dennis Nolte. Automatische Verifikation von Bisimulationsäquivalenzen in Graphtransformationssystemen. Master's thesis, Universität Duisburg-Essen, 2012. |
|
2011 |
|
Henning Kerstan. Trace semantics for probabilistic transition systems – a coalgebraic approach. Diplomarbeit, Universität Duisburg-Essen, sep 2011. |
|
|
Harsh Beohar and Pieter Cuijpers. Desynchronizability of (partial) synchronous closed loop systems. Scientific Annals of Computer Science, 21:5–38, 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. |
|
|
Paolo Baldan, Filippo Bonchi, Andrea Corradini, Tobias Heindel, and Barbara König. A lattice-theoretical perspective on adhesive categories. Journal of Symbolic Computation, 46:222–245, 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. |
|
|
Joost-Pieter Katoen and Barbara König, editors. CONCUR 2011 – Concurrency Theory. Springer, 2011. LNCS/ARCoSS 6901. |
|
|
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. |
|
|
Joost-Pieter Katoen and Barbara König, editors. Selected Papers of the ``22nd International Conference on Concurrency Theory'' CONCUR 2011, Logical Methods in Computer Science, 2011. Special Issue. |
|
|
Sebastian Küpper. Matchings und totale dominanz. Master's thesis, Universität Duisburg-Essen, 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. |
|
|
Paolo Baldan, Thomas Chatain, Stefan Haar, and Barbara König. Unfolding-based diagnosis of systems with an evolving topology. Information and Computation, 208:1169–1192, 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. |
|
|
Mathias Hülsbusch, Barbara König, Arend Rensink, Maria Semenyak, Christian Soltenborn, and Heike Wehrheim. Full semantics preservation in model transformation – a comparison of proof techniques. Technical Report TR-CTIT-10-09, Centre for Telematics and Information Technology, University of Twente, 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. |
|
|
Sebastian Küpper. Algorithmen für baum- und pfadzerlegungen von graphen, 2010. |
|
|
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. |
|
|
Jan Stückrath. Inkrementelle Interaktionsmodellierung mit farbigen Petri-Netzen - Formale Beschreibung und Implementierung. Master's thesis, Universität Duisburg-Essen, März 2010. |
|
2009 |
|
Hartmut Ehrig, Claudia Ermel, Frank Hermann, and Barbara König. Behaviour simulation and equivalence of systems modelled by graph transformation. EATCS Bulletin, 97:117–125, February 2009. Appeared in The Formal Specification Column. |
|
|
Filippo Bonchi, Fabio Gadducci, and Barbara König. Synthesising CCS bisimulation using graph rewriting. Information and Computation, 207:14–40, 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. |
|
|
Barbara König and Vitaly Kozyura. Case study: Verification of a leader election protocol using Augur, 2009. Solution for the GraBaTs '09 tool contest. |
|
2008 |
|
Christoph Blume. Graphsprachen für die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master's thesis, Universität Duisburg-Essen, Nov. 2008. |
|
|
Paolo Baldan, Thomas Chatain, Stefan Haar, and Barbara König. Unfolding-based diagnosis of systems with an evolving topology. Technical Report 2008-2, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, July 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. |
|
|
Guilherme Rangel, Barbara König, and Hartmut Ehrig. Deriving bisimulation congruences in the presence of negative application conditions. Technical Report 2008-1, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, February 2008. |
|
|
H.J. Sander Bruggink. Equivalence of reductions in higher-order rewriting. PhD thesis, Utrecht University, 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. |
|
|
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. Technical Report 2008-03, Universität Duisburg-Essen, 2008. |
|
|
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. |
|
|
Paolo Baldan, Andrea Corradini, Barbara König, and Stefan Schwoon. McMillan's complete prefix for contextual nets. LNCS Transactions on Petri Nets and Other Models of Concurrency (ToPNoC), 5100:199–220, 2008. |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. A framework for the verification of infinite-state graph transformation systems. Information and Computation, 206:869–907, 2008. |
|
|
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. |
|
|
H.J. Sander Bruggink and Barbara König. On the recognizability of arrow and graph languages. Technical Report 2008-03, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, 2008. |
|
|
Barbara König, Arend Rensink, and Reiko Heckel, editors. Proc. of GT-VC '07 (Graph Transformation for Verification and Concurrency), volume 213.1 of ENTCS. Elsevier, 2008. |
|
|
Guilherme Rangel, Leen Lambers, Barbara König, Hartmut Ehrig, and Paolo Baldan. Behavior preservation in model refactoring using DPO transformations with borrowed contexts. Technical Report 12/08, Technische Universität Berlin, 2008. |
|
|
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. |
|
|
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, and Barbara König. Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. Logical Methods in Computer Science, 4(4:3), 2008. |
|
|
Paolo Baldan and Barbara König, editors. Proc. of PNGT '08 (Petri Nets and Graph Transformation), volume 14 of Electronic Communications of the EASST, 2008. |
|
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. |
|
|
Arend Rensink, Reiko Heckel, and Barbara König, editors. Proc. of GT-VC '06 (Graph Transformation for Verification and Concurrency), volume 175.4 of ENTCS. 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. |
|
|
Barbara König and Vitali Kozioura. Incremental construction of coverability graphs. Information Processing Letters, 103(5):203–209, 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 |
|
Paolo Baldan, Hartmut Ehrig, and Barbara König. Composition and decomposition of DPO transformations with borrowed context. Technical Report 2006-1, Abteilung für Informatik und Angewandte Kognitionswissenschaft, Universität Duisburg-Essen, October 2006. |
|
|
Filippo Bonchi, Fabio Gadducci, and Barbara König. Process bisimulation via a graphical encoding. Technical Report TR-06-07, Department of Computer Science, University of Pisa, July 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. |
|
|
H.J. Sander Bruggink. A proof of finite family developments for higher-order rewriting using a prefix property. Technical Report 245, Utrecht University, 2006. |
|
|
Reiko Heckel, Barbara König, and Arend Rensink, editors. Proc. of GT-VC '05 (Graph Transformation for Verification and Concurrency), volume 154.2 of ENTCS. Elsevier, 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. |
|
|
Paolo Baldan, Stefan Haar, and Barbara König. Distributed unfolding of Petri nets. Technical Report CS-2006-1, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2006. |
|
|
Barbara König and Vitali Kozioura. Counterexample-guided abstraction refinement for the analysis of graph transformation systems. Technical Report 01/2006, Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, 2006. |
|
|
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science, 16(6):1133–1163, 2006. |
|
|
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. |
|
|
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel, and Barbara König. Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. Technical Report CS-2006-9, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2006. |
|
2005 |
|
Barbara König and Vitali Kozioura. Augur—a tool for the analysis of graph transformation systems. EATCS Bulletin, 87:125–137, November 2005. Appeared in The Formal Specification Column. |
|
|
Barbara König. Analysing input/output-capabilities of mobile processes with a generic type system. Journal of Logic and Algebraic Programming, 63(1):35–58, 2005. |
|
|
Barbara König, Ugo Montanari, and Philippa Gardner, editors. Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005. |
|
|
Paolo Baldan, Barbara König, and Arend Rensink. Graph grammar verification through abstraction. In Abstracts Collection – Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems, Dagstuhl Seminar Proceedings 04241, 2005. |
|
|
Barbara König. A general framework for types in graph rewriting. Acta Informatica, 42(4-5):349–388, 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 |
|
Barbara König. Analysis and verification of systems with dynamically evolving structures. Habilitation thesis, Universität Stuttgart, December 2004. |
|
|
Markus Holzer and Barbara König. Regular languages, sizes of syntactic monoids, graph colouring, state complexity results, and how these topics are related to each other. EATCS Bulletin, 83:139–155, June 2004. Appeared in The Formal Language Theory Column. |
|
|
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. |
|
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. Theoretical Computer Science, 327:319–347, 2004. |
|
|
Hartmut Ehrig and Barbara König. Deriving bisimulation congruences in the DPO approach to graph rewriting. Technical Report 01/2004, Universität Stuttgart, 2004. |
|
|
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. |
|
|
Paolo Baldan, Andrea Corradini, and Barbara König. An unfolding-based approach for the verification of finite-state graph grammars. Technical Report CS-2004-10, Dipartimento di Informatica, Università Ca' Foscari di Venezia, 2004. |
|
|
Fernando Luís Dotti, Barbara König, Osmar Marchi dos Santos, and Leila Ribeiro. A case study: Verifying a mutual exclusion protocol with process creation using graph transformation systems. Technical Report 08/2004, Universität Stuttgart, 2004. |
|
|
Herrman Gruber, Markus Holzer, Astrid Kiehn, and Barbara König. On timed automata with discrete time—structural and language theoretical characterization. In 14. Theorietag der GI-Fachgruppe 0.1.5 ``Automaten und Formale Sprachen''. Universität Potsdam, 2004. |
|
2003 |
|
Wilfried Brauer, Markus Holzer, Barbara König, and Stefan Schwoon. The theory of finite-state adventures. EATCS Bulletin, 79:230–237, February 2003. |
|
|
H.J. Sander Bruggink. Residuals in higher-order rewriting. In Proceedings of RTA '03. Springer, 2003. |
|
|
H.J. Sander Bruggink. Residuals in higher-order rewriting. Technical Report 221, Utrecht University, 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 |
|
Markus Holzer and Barbara König. On deterministic finite automata and syntactic monoid size. In R. Mazala, L. Staiger, and R. Winter, editors, 12. Theorietag der GI-Fachgruppe 0.1.5 ``Automaten und Formale Sprachen'' mit dem Workshop Berechenbarkeit und Komplexität in der Analyse, pages 29–31. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, Halle, Germany, September 2002. |
|
|
Barbara König. Hypergraph construction and its application to the static analysis of concurrent systems. Mathematical Structures in Computer Science, 12:149–175, 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 |
|
H.J. Sander Bruggink. Discourse representation by hypergraphs. Master's thesis, Utrecht University, 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. Hypergraph construction and its application to the compositional modelling of concurrency (extended version). Technical Report TUM-I0003, Technische Universität München, 2000. |
|
|
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. Analysing input/output-capabilities of mobile processes with a generic type system (extended version). Technical Report TUM-I0009, Technische Universität München, 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. |
|
|
Barbara König. A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universität München, 2000. |
|
1999 |
|
Barbara König. Description and verification of mobile processes with graph rewriting techniques. PhD thesis, Technische Universität München, 1999. |
|
|
Barbara König. Generating type systems for process graphs. In Proc. of CONCUR '99, pages 352–367. Springer-Verlag, 1999. LNCS 1664. |
|
1995 |
|
Barbara König. Heuristiken zur Ein-Depot-Tourenplanung. Master's thesis, Technische Universität München, 1995. (in German). |
|
