Weakly synchronous systems with three machines are Turing powerful

DOI10.1007/978-3-031-45286-4_3MaRDI QIDQ6623012

Davide Ferre', Nicolas Nisse, Cinzia Di Giusto, Etienne Lozes

Publication date: 23 October 2024

zbMATH Keywords

distributed systemstreewidthmessage-passing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On deciding synchronizability for asynchronously communicating systems
• A partial k-arboretum of graphs with bounded treewidth
• Automated verification of automata communicating via FIFO and bag buffers
• Reversal-Bounded Counter Machines Revisited
• On Communicating Finite-State Machines
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Synchronous, asynchronous, and causally ordered communication
• Context-Bounded Analysis of Concurrent Queue Systems
• Reachability Analysis of Communicating Pushdown Systems
• On the completeness of verifying message passing programs under bounded asynchrony

This page was built for publication: Weakly synchronous systems with three machines are Turing powerful