Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent

DOI10.4204/eptcs.346.2MaRDI QIDQ6649512

Chana Weil-Kennedy, A. R. Balasubramanian

Publication date: 6 December 2024

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• The computational power of population protocols
• Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems
• Computation in networks of passively mobile finite-state sensors
• Parameterized Verification of Asynchronous Shared-Memory Systems
• Parameterized Verification of Ad Hoc Networks
• Reachability in Networks of Register Protocols under Stochastic Schedulers
• Verification of Immediate Observation Population Protocols
• Parameterized Verification of Broadcast Networks of Register Automata
• Safety of Parametrized Asynchronous Shared-Memory Systems is Almost Always Decidable
• Playing with Probabilities in Reconfigurable Broadcast Networks
• Complexity of Liveness in Parameterized Systems
• Model checking parameterized asynchronous shared-memory systems
• Fine-grained complexity of safety verification
• Parameterized Analysis of Immediate Observation Petri Nets

This page was built for publication: Reconfigurable broadcast networks and asynchronous shared-memory systems are equivalent