Parameterized analysis of reconfigurable broadcast networks

DOI10.1007/978-3-030-99253-8_4arXiv2201.10432MaRDI QIDQ6181923

Chana Weil-Kennedy, A. R. Balasubramanian, Lucie Guillou

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.10432

zbMATH Keywords

broadcast networksasynchronous shared-memory systemsalmost-sure coverabilityparameterized reachability

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The computational power of population protocols
• The complexity of verifying population protocols
• Computation in networks of passively mobile finite-state sensors
• Liveness in broadcast networks
• Parameterized Verification of Ad Hoc Networks
• Reachability in Networks of Register Protocols under Stochastic Schedulers
• Verification of Immediate Observation Population Protocols
• Flatness and Complexity of Immediate Observation Petri Nets
• Playing with Probabilities in Reconfigurable Broadcast Networks

This page was built for publication: Parameterized analysis of reconfigurable broadcast networks