Mario Román

Home

❯

notes

❯

pieces

❯

Symmetric Monoidal Automata

Symmetric Monoidal Automata

Apr 29, 20251 min read

monoidal-automata

  • Article (pdf).
  • Functional morphisms of probabilistic automata are bisimulations.
  • simulation equivalence does not imply bisimulation
  • arbitrary morphisms do not imply bisimulation

Graph View

Backlinks

  • bisimulation in string diagrams
  • quotients and relations

Mario Román, CC-BY-SA. Built with Quartz © 2025.

  • GitHub
  • ArXiv
  • OrcID