@inproceedings{https___doi.org_10.4230_lipics.mfcs.2023.43,
    doi = {10.4230/lipics.mfcs.2023.43},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.43},
    author = {Earnshaw, Matthew and Sobociński, Paweł},
    keywords = {symmetric monoidal categories, Mazurkiewicz traces, asynchronous automata, Theory of computation → Concurrency, Theory of computation → Formal languages and automata theory, Theory of computation → Categorical semantics},
    language = {en},
    title = {String Diagrammatic Trace Theory},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2023},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-4-18 18:10:23 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.mfcs.2023.43, doi = {10.4230/lipics.mfcs.2023.43}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.43}, author = {Earnshaw, Matthew and Sobociński, Paweł}, keywords = {symmetric monoidal categories, Mazurkiewicz traces, asynchronous automata, Theory of computation → Concurrency, Theory of computation → Formal languages and automata theory, Theory of computation → Categorical semantics}, language = {en}, title = {String Diagrammatic Trace Theory}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2023}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-4-18 18:10:23 +0100} }