EUVIMEDEUVIMED entdecken
Crossref

A Critical Pair Enumeration Algorithm for String Diagram Rewriting

Anna Matsui, Innocent Obi, Guillaume Sabbagh, Leo Torres, Diana Kessler, Juan F. Meleiro, Koko Muroya

Electronic Proceedings in Theoretical Computer Science · 10.03.2026 · 442 · 91-105

DOI: 10.4204/eptcs.442.7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 10.03.2026. Verfasst von Anna Matsui und 6 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. Bonchi et al. showed validity of critical pair analysis for rewriting on string diagrams in symmetric monoidal categories. This work aims at automation of critical pair analysis for string diagram rewriting, and develops an algorithm that implements the core part of critical pair analysis. The algorithm enumerates all critical pairs of a given left-connected string diagram rewriting system, and it can be realised by concrete manipulation of hypergraphs. We prove correctness and exhaustiveness of the algorithm, for string diagrams in symmetric monoidal categories without a Frobenius structure.

Zitieren

APA

Matsui, A., Obi, I., Sabbagh, G., Torres, L., Kessler, D., Meleiro, J. F., & Muroya, K. (2026). A Critical Pair Enumeration Algorithm for String Diagram Rewriting. Electronic Proceedings in Theoretical Computer Science, 442, 91-105. https://doi.org/10.4204/eptcs.442.7

Vancouver

Matsui A, Obi I, Sabbagh G, Torres L, Kessler D, Meleiro JF, et al. A Critical Pair Enumeration Algorithm for String Diagram Rewriting. Electronic Proceedings in Theoretical Computer Science. 2026;442:91-105. doi:10.4204/eptcs.442.7

BibTeX
@article{Matsui2026,
  author = {Matsui, Anna and Obi, Innocent and Sabbagh, Guillaume and Torres, Leo and Kessler, Diana and Meleiro, Juan F. and Muroya, Koko},
  title = {A Critical Pair Enumeration Algorithm for String Diagram Rewriting},
  journal = {Electronic Proceedings in Theoretical Computer Science},
  year = {2026},
  volume = {442},
  pages = {91--105},
  doi = {10.4204/eptcs.442.7}
}
Kostenlos starten →