Document Open Access Logo

A Complete Diagrammatic Calculus for Automata Simulation

Authors Thibaut Antoine , Robin Piedeleu , Alexandra Silva , Fabio Zanasi

PDF

File

Thumbnail PDF
PDF
LIPIcs.CSL.2025.27.pdf
  • Filesize: 0.87 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation
Keywords
  • finite-state automata
  • simulation
  • string diagrams
  • axiomatisation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We give a sound and complete (in)equational theory for simulation of finite state automata. Our approach uses a string diagrammatic calculus to represent automata and a functorial semantics to capture simulation in a compositional way. Interestingly, in contrast to other approaches based on regular expressions, fixpoints are a derived notion in our calculus and the resulting axiomatisation is finitary.

Cite As Get BibTex

Thibaut Antoine, Robin Piedeleu, Alexandra Silva, and Fabio Zanasi. A Complete Diagrammatic Calculus for Automata Simulation. In 33rd EACSL Annual Conference on Computer Science Logic (CSL 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 326, pp. 27:1-27:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.CSL.2025.27

Author Details

Thibaut Antoine
  • ENS Rennes, France
Robin Piedeleu
  • University College London, UK
Alexandra Silva
  • Cornell University, Ithaca, NY, USA
Fabio Zanasi
  • University College London, UK

Funding

Fabio Zanasi acknowledges support from epsrc EP/V002376/1, miur P2022HXNSC (prin 2022 pnrr - Next Generation EU), and aria Safeguarded AI TA1.1 grant n.8777242. The other authors acknowledge support from ERC grant Autoprobe (no. 101002697), ARIA Safeguarded AI program, and epsrc Standard Grant CLeVer (EP/S028641/1).

Acknowledgements

Fabio Zanasi conducted part of this research while affiliated with the University of Bologna, Italy.

References

  1. John Baez, Brandon Coya, and Franciscus Rebro. Props in network theory. Theory and Applications of Categories, 33(25):727-783, 2018. Google Scholar
  2. Christel Baier and Joost-Pieter Katoen. Principles of model checking. MIT press, 2008. Google Scholar
  3. Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński, and Fabio Zanasi. Rewriting modulo symmetric monoidal structure. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2016. Google Scholar
  4. Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński, and Fabio Zanasi. Rewriting with Frobenius. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pages 165-174, 2018. Google Scholar
  5. Filippo Bonchi, Paweł Sobociński, and Fabio Zanasi. Deconstructing Lawvere with distributive laws. Journal of logical and algebraic methods in programming, 95:128-146, 2018. URL: https://doi.org/10.1016/J.JLAMP.2017.12.002.
  6. Aurelio Carboni and RFC Walters. Cartesian bicategories I. Journal of pure and applied algebra, 49(1-2):11-32, 1987. Google Scholar
  7. Brandon Coya and Brendan Fong. Corelations are the prop for extraspecial commutative frobenius monoids. Theory and Applications of Categories, 32(11):380-395, 2017. Google Scholar
  8. Brendan Fong and David I Spivak. An invitation to applied category theory: seven sketches in compositionality. Cambridge University Press, 2019. Google Scholar
  9. Ulrik Frendrup and Jesper Nyholm Jensen. A complete axiomatization of simulation for regular CCS expressions. BRICS, Department of Computer Science, Univ., 2001. Google Scholar
  10. CAR Hoare, Bernhard Möller, Georg Struth, and Ian Wehrman. Concurrent Kleene algebra. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR), pages 399-414. Springer, 2009. Google Scholar
  11. Martin Hyland and Andrea Schalk. Glueing and orthogonality for models of linear logic. Theoretical Computer Science, 294(1-2):183-231, 2003. URL: https://doi.org/10.1016/S0304-3975(01)00241-9.
  12. Gregory M Kelly and Miguel L Laplaza. Coherence for compact closed categories. Journal of Pure and Applied Algebra, 19:193-213, 1980. Google Scholar
  13. Stephen C Kleene. Representation of events in nerve nets and finite automata. Technical report, RAND PROJECT AIR FORCE SANTA MONICA CA, 1951. Google Scholar
  14. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, 1994. URL: https://doi.org/10.1006/INCO.1994.1037.
  15. Dexter Kozen. Kleene algebra with tests. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(3):427-443, 1997. URL: https://doi.org/10.1145/256167.256195.
  16. Stephen Lack. Composing PROPs. Theory and Application of Categories, 13(9):147-163, 2004. Google Scholar
  17. F William Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences of the United States of America, 50(5):869, 1963. Google Scholar
  18. Robin Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28(3):439-466, 1984. URL: https://doi.org/10.1016/0022-0000(84)90023-0.
  19. Andrew M Moshier. Coherence for categories of posets with applications. Topology, Algebra and Categories in Logic (TACL), page 214, 2015. Google Scholar
  20. Robin Piedeleu and Fabio Zanasi. A finite axiomatisation of finite-state automata using string diagrams. Logical Methods in Computer Science, 19, 2023. URL: https://doi.org/10.46298/LMCS-19(1:13)2023.
  21. Robin Piedeleu and Fabio Zanasi. An introduction to string diagrams for computer scientists. arXiv preprint arXiv:2305.08768, 2023. URL: https://doi.org/10.48550/arXiv.2305.08768.
  22. Valentin N Redko. On defining relations for the algebra of regular events. Ukrainskii Matematicheskii Zhurnal, 16:120-126, 1964. Google Scholar
  23. Steffen Smolka, Nate Foster, Justin Hsu, Tobias Kappé, Dexter Kozen, and Alexandra Silva. Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. Proceedings of the 47th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 4:1-28, 2020. URL: https://doi.org/10.1145/3371129.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact