Undecidability of the emptiness problem for weak models of distributed computing

DOI10.1016/J.TCS.2026.115757MaRDI QIDQ6851449zbMATH OpenFDO

Authors Flavio T. Principato, Javier Esparza, Philipp Czerner

Publication date 27 February 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115757

zbMATH Keywords

distributed automataemptiness problemundecidability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of computing (68Qxx)

Cites work

• Beeping a maximal independent set
• Computation in networks of passively mobile finite-state sensors
• Computation with finite stochastic chemical reaction networks
• Decision Power of Weak Asynchronous Models of Distributed Computing
• Deploying wireless networks with beeps
• Emptiness problems for distributed automata
• Stone age distributed computing
• Weak models of distributed computing, with connections to modal logic

This page was built for publication: Undecidability of the emptiness problem for weak models of distributed computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851449)