@inproceedings{https___doi.org_10.4230_lipics.concur.2022.28,
    doi = {10.4230/LIPICS.CONCUR.2022.28},
    url = {https://drops.dagstuhl.de/opus/volltexte/2022/17091/},
    author = {Adsul, Bharat and Gastin, Paul and Sarkar, Saptarshi and Weil, Pascal},
    keywords = {Mazurkiewicz traces, propositional dynamic logic, regular trace languages, asynchronous automata, cascade product, Krohn Rhodes theorem, Theory of computation → Concurrency, Theory of computation → Modal and temporal logics, Theory of computation → Algebraic language theory},
    language = {en},
    title = {Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    year = {2022},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2023-11-24 8:16:14 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.concur.2022.28, doi = {10.4230/LIPICS.CONCUR.2022.28}, url = {https://drops.dagstuhl.de/opus/volltexte/2022/17091/}, author = {Adsul, Bharat and Gastin, Paul and Sarkar, Saptarshi and Weil, Pascal}, keywords = {Mazurkiewicz traces, propositional dynamic logic, regular trace languages, asynchronous automata, cascade product, Krohn Rhodes theorem, Theory of computation → Concurrency, Theory of computation → Modal and temporal logics, Theory of computation → Algebraic language theory}, language = {en}, title = {Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year = {2022}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2023-11-24 8:16:14 +0100} }