Todd Schmid ; Victoria Noquez ; Lawrence S. Moss - Fractals from Regular Behaviours

lmcs:12992 - Logical Methods in Computer Science, June 19, 2025, Volume 21, Issue 2 - https://doi.org/10.46298/lmcs-21(2:25)2025
Fractals from Regular BehavioursArticle

Authors: Todd Schmid ; Victoria Noquez ; Lawrence S. Moss

We forge connections between the theory of fractal sets obtained as attractors of iterated function systems and process calculi. To this end, we reinterpret Milner's expressions for processes as contraction operators on a complete metric space. When the space is, for example, the plane, the denotations of fixed point terms correspond to familiar fractal sets. We give a sound and complete axiomatization of fractal equivalence, the congruence on terms consisting of pairs that construct identical self-similar sets in all interpretations. We further make connections to labelled Markov chains and to invariant measures. In all of this work, we use important results from process calculi. For example, we use Rabinovich's completeness theorem for trace equivalence in our own completeness theorem. In addition to our results, we also raise many questions related to both fractals and process calculi.


Volume: Volume 21, Issue 2
Secondary volumes: Selected Papers of the 10th Conference on Algebra and Coalgebra in Computer Science (CALCO 2023)
Published on: June 19, 2025
Imported on: February 3, 2024
Keywords: Logic in Computer Science, Formal Languages and Automata Theory

Consultation statistics

This page has been seen 1072 times.
This article's PDF has been downloaded 358 times.