Descriptive complexity for distributed computing with circuits
Lists
Only you see this
Abstract
We consider distributed algorithms in the realistic scenario where distributed message passing is operated via circuits. We show that within this setting, modal substitution calculus MSC captures the expressive power of circuits. The translations between circuits and MSC-programs are linear in both directions. Furthermore, we show that the colouring algorithm based on Cole-Vishkin can be specified via logarithmic size programs.
BibTeX
@article{ahvonen2023descriptive,
author = {Veeti Ahvonen and Damian Heiman and Lauri Hella and Antti Kuusisto},
title = {{Descriptive complexity for distributed computing with circuits}},
journal = {J. Log. Comput.},
year = {2023},
}| Formula size game and model checking for modal substitution calculus | arXiv · 2025 |
| Graded modal logic and counting message passing automata | arXiv · 2024 |
| Brief Announcement: Distributed Derandomization Revisited | Disc · 2023 |
| A knowledge-based analysis of global function computation | Distributed Comput · 2010 |
| L-Recursion and a new Logic for Logarithmic Space | arXiv · 2012 |
| Stone Age Distributed Computing | arXiv · 2012 |